拥塞控制是计算机网络中的关键问题，当资源需求超过可用容量时，资源就会发生拥塞。本章节主要讨论了数据网络中如帧中继和ATM网络的拥塞控制概念、原理和方法。讲解了当目的地缓冲区空间小于到达流量所需时导致的数据包丢失，以及当链路总流量超过带宽时链路拥塞的情况。拥塞控制的目标是保持数据包数量在不影响性能的水平之下，避免网络性能急剧下降。
第13章 数据网中的拥塞控制
南京大学计算机系 黄皓教授
2007年11月9日星期五
Chapter 13. Congestion in Data Networks
1. Concept of Congestion
2. Congestion Control
3. Congestion Control in Frame Relay Network
4. Congestion Control in ATM Network
南京大学计算机系讲义 2
1. Concept of Congestion
1. Concept of Congestion
If ，for any time interval ，the total sum of demands on a resource
is more than its available capacity，the resource is said to be
congested for that interval
ΣDemand > Available Resources
In computer networks，there are a large number of resources ，
such as buffers，link bandwidths，processor times，
servers，and so forth.
If，for a short interval ，the buffer space available at the
destination is less than that required for tile arriving traffic，packet
loss occurs.
Similarly，if the total traffic wanting to enter a link is more than its
bandwidth，the link is said to be congested.
南京大学计算机系讲义 4
1. Concept of Congestion
Congestion
Congestion
Number of packets transmitted through the network
approaches the packet handling capacity of the network
λ
L q ρ
μ λ −
Generally 80% utilization is critical
Congestion control
Keep number of packets below level at which performance
falls off dramatically
Data network is a network of queues
Finite queues mean data may be lost
南京大学计算机系讲义 5
1. Concept of Congestion
Queues at a Node
Input
Store
Input queueing
Move
Routing process Routing
Process
Output queueing
Transmit
南京大学计算机系讲义
扫一扫
1510
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
