摘要
在基于 Ａ Ｔ Ｍ Ｔ Ｃ Ｐ 技术实现 Ａ Ｂ Ｒ 中，一个信元的丢失会导致该信元所属分组破坏，致使该信元所属分组在网络中传输都变得无效，需要重传机制来确保传输正确性，分组多次重传浪费大量带宽，并进一步加剧网络拥塞状况。 Ａ Ｔ Ｍ Ｔ Ｃ Ｐ 只保证每个信元对网络访问的公平性，而忽略了 Ｔ Ｃ Ｐ 分组的公平性。本文提出了一种与分组长度无关的公平排队策略，提出以抛弃信元的代价为权值，来决定要抛弃的信元。它不仅能保证分组的公平性。
Abstract:In ABR service implemented by TCP over ATM, a cell loss can result in the corruption of the TCP packet the cell belongs to. So the transmission of this packet becomes useless, and the re transmission mechanism is needed to ensure this packet can reach its destination correctly. This will make a great deal of bandwidth wasted in the congestion condition. This paper presents a packet length dependent fair queuing strategy. This strategy calculates a 'weight' for verycell. The weight is on half of the wasted bandwidth if this cell is about to be discarded. So when congestion occur, the controller selects cell with least weight for discarding. This strategy can not only ensure the packet fairness, but also make the network utilization better.
出处
《数字通信》
1999年第3期3-5,22,共4页
Digital Communications and Networks
关键词
ATM
TCP
ABR
综合业务数字网
公平性
B-ISDN
asynchronous transfer mode
transmission control protocol
available bit rate
broadband integrated service digital network
fairness
network utilization
