Академический Документы
Профессиональный Документы
Культура Документы
Computer Networks
Congestion in IP networks
Unavoidable due to best-effort service model IP philosophy: decentralized control at end hosts
source
destination
IP network
4
Congestion is Unavoidable
Two packets arrive at the same time
The node can only transmit one and either buffer or drop the other
Load
Pricing
Dont drop packets for the high-bidders Requires a payment model
What does the end host see? What can the end host change?
9
10
Packet loss
Packet gets dropped along the way
Loss
Timeout
11
Congestion
When too much traffic is offered, congestion sets in and performance degrades sharply. 14
1.Monitor the system . detect when and where congestion occurs. 2.Pass information to where action can be taken. 3.Adjust system operation to correct the problem.
15
17
Jitter Control
18
Quality of Service
Requirements Techniques for Achieving Good Quality of Service Integrated Services Differentiated Services Label Switching and MPLS
19
Requirements
(a) A leaky bucket with water. (b) a leaky bucket with packets.
21
(a) Before.
(b) After.
22
Admission Control
(a) A network, (b) The multicast spanning tree for host 1. (c) The multicast spanning tree for host 2.
24
(a) Host 3 requests a channel to host 1. (b) Host 3 then requests a second channel, to host 2. (c) Host 5 requests a channel to host 1.
25
Assured Forwarding
Multiplicative decrease
On loss of packet, divide congestion window in half
Additive increase
On success for last window of data, increase linearly
28
halved t
29
Practical Details
Congestion window
Represented in bytes, not in packets (Why?) Packets have MSS (Maximum Segment Size) bytes
30
Congestion control
Keep a set of senders from overloading the network
Window
t
32
33
Src
D D
A A
D D
D A
D A A A
Dest
34
Why is it called slow-start? Because TCP originally had no congestion control mechanism. The source would just start by sending a whole receiver windows worth of data.
35
Slow-start restart: Go back to CWND of 1, but take advantage of knowing the previous value of CWND.
37
39
Possible solutions?
Routers detect cheating and drop excess packets? Peer pressure?
40
Queuing Mechanisms
Random Early Detection (RED) Explicit Congestion Notification (ECN)
41
42
43
44
Properties of RED
Drops packets before queue is full
In the hope of reducing the rates of some flows
45
47
48
Interactive applications
Telnet and rlogin Generate many small packets (e.g., keystrokes)
Algorithm
Wait if the amount of data is small
Smaller than Maximum Segment Size (MSS)
Influence on performance
Interactive applications: enables batching of bytes Bulk transfer: transmits in MSS-sized packets anyway
50
Piggybacking is appealing
Host B can send an ACK to host A as part of a data packet from B to A
51
Sequence number Acknowledgment HdrLen 0 Checksum Flags Advertised window Urgent pointer
Options (variable)
Data
52
Example of Piggybacking
A B
B has data to send
53
54
Delayed ACK
Delay sending an ACK
Upon receiving a packet, the host B sets a timer
Typically, 200 msec or 500 msec
55
Conclusions
Congestion is inevitable
Internet does not reserve resources in advance TCP actively tries to push the envelope
Fundamental tensions
Feedback from the network? Enforcement of TCP friendly behavior?
56