Effect of virtual end systems for rate-based congestion control

✍ Scribed by Syugo Harada; Hiroshi Inai; Jiro Yamakita

• Publisher: John Wiley and Sons
• Year: 1999
• Tongue: English
• Weight: 889 KB
• Volume: 82
• Category: Article
• ISSN: 8756-6621
• DOI: 10.1002/(sici)1520-6424(199906)82:6<8::aid-ecja2>3.0.co;2-c

✦ Synopsis

In data transmission on a broadband network, such as an ATM network, rate-based congestion control is considered effective in preventing data loss caused by buffer overflow at a relay node and in achieving high throughput. Under this control, the sender node dynamically changes the transmission rate according to the network condition. However as the network grows, the delay for inquiry to the network condition increases so that it becomes hard to control congestion adequately. One of the solutions to that problem is to divide the network into several logical blocks and then to install virtual end systems at the block boundaries. When congestion control is carried out at each block, the delay for inquiry is decreased and the queue length of each node is kept low. As a result, cell discard caused by buffer overflow is reduced. In this paper, we build a queuing network model and then analyze it approximately to evaluate the effect of the virtual end systems. We investigate the influence of delay between the two ends and the locations of the virtual end systems in the network and then find some situations in which the virtual end systems do not work efficiently. The result shows that it is not sufficient simply to increase the number of virtual end systems and/or to consider their locations. The virtual end system should report its rate reduction to the sender node and should reduce its rate reduction ratio to serve more cells in its buffer.