This document discusses congestion in computer networks. It defines congestion as occurring when there are too many sources sending too much data too fast for the network to handle, resulting in lost packets or long delays. It then examines three scenarios that can cause congestion and discusses the costs associated with it, such as wasted bandwidth from retransmitted packets and delays. The document also outlines two broad approaches to congestion control: end-to-end control where congestion is inferred from observed loss/delay, and network-assisted control where routers provide congestion feedback to end systems.
This document discusses congestion in computer networks. It defines congestion as occurring when there are too many sources sending too much data too fast for the network to handle, resulting in lost packets or long delays. It then examines three scenarios that can cause congestion and discusses the costs associated with it, such as wasted bandwidth from retransmitted packets and delays. The document also outlines two broad approaches to congestion control: end-to-end control where congestion is inferred from observed loss/delay, and network-assisted control where routers provide congestion feedback to end systems.
This document discusses congestion in computer networks. It defines congestion as occurring when there are too many sources sending too much data too fast for the network to handle, resulting in lost packets or long delays. It then examines three scenarios that can cause congestion and discusses the costs associated with it, such as wasted bandwidth from retransmitted packets and delays. The document also outlines two broad approaches to congestion control: end-to-end control where congestion is inferred from observed loss/delay, and network-assisted control where routers provide congestion feedback to end systems.
Congestion: informally: too many sources sending too much data too fast for network to handle different from flow control! lost packets (buffer overflow at routers) long delays (queueing in router buffers) a top-10 problem!
Transport Layer 3-2 Causes/costs of congestion: scenario 1 two senders, two receivers one router, infinite buffers no retransmission
large delays when congested maximum achievable throughput unlimited shared output link buffers Host A l in : original data Host B l out
Transport Layer 3-3 Causes/costs of congestion: scenario 2 one router, finite buffers sender retransmission of lost packet
finite shared output link buffers Host A l in : original data Host B l out
l' in : original data, plus retransmitted data Transport Layer 3-4 Causes/costs of congestion: scenario 2 costs of congestion: more work (retrans) for given goodput unneeded retransmissions: link carries multiple copies of pkt
R/2 R/2 l in l o u t
b. R/2 R/2 l in l o u t
a. R/2 R/2 l in l o u t
c. R/4 R/3 Transport Layer 3-5 Causes/costs of congestion: scenario 3 four senders multihop paths timeout/retransmit
finite shared output link buffers Host A l in : original data Host B l out
l' in : original data, plus retransmitted data Transport Layer 3-6 Causes/costs of congestion: scenario 3 Another cost of congestion: when packet dropped, any upstream transmission capacity used for that packet was wasted! H o s t A H o s t B l o u t
Transport Layer 3-7 Approaches towards congestion control End-end congestion control: no explicit feedback from network congestion inferred from end- system observed loss, delay approach taken by TCP Network-assisted congestion control: routers provide feedback to end systems single bit indicating congestion (SNA, DECbit, TCP/IP ECN, ATM) Two broad approaches towards congestion control: Network Layer 4-8 Network layer transport segment from sending to receiving host on sending side encapsulates segments into datagrams on rcving side, delivers segments to transport layer network layer protocols in every host, router Router examines header fields in all IP datagrams passing through it
network data link physical
network data link physical
network data link physical
network data link physical
network data link physical
network data link physical
network data link physical
network data link physical application transport network data link physical application transport network data link physical Network Layer 4-9 Key Network-Layer Functions forwarding: move packets from routers input to appropriate router output routing: determine route taken by packets from source to dest. Routing algorithms
analogy: routing: process of planning trip from source to dest forwarding: process of getting through single interchange
Network Layer 4-10 1 2 3 0111 value in arriving packets header routing algorithm local forwarding table header value output link 0100 0101 0111 1001 3 2 2 1 Interplay between routing and forwarding Network Layer 4-11 Network service model Q: What service model for channel transporting datagrams from sender to rcvr? Example services for individual datagrams: guaranteed delivery Guaranteed delivery with less than 40 msec delay Example services for a flow of datagrams: In-order datagram delivery Guaranteed minimum bandwidth to flow guaranteed maximum jitter Security service