Intelligent congestion control for ABR service in ATM networks
ACM SIGCOMM Computer Communication Review
Rate-based congestion control for ATM networks
ACM SIGCOMM Computer Communication Review
The rate-based flow control framework for the available bit rate ATM service
IEEE Network: The Magazine of Global Internetworking
Explicit rate flow control for ABR services in ATM networks
IEEE/ACM Transactions on Networking (TON)
Towards a new methodology for estimating available bandwidth on network paths
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
On a novel methodology for estimating available bandwidth along network paths
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Performance of TCP over UBR in ATM with EPD and virtual queuing techniques
Computer Communications
| Hi-index | 0.00 |
Several algorithms have been proposed for the switch behavior for congestion control of Available Bit Rate (ABR) services. Schemes such as the Enhanced Proportional Rate Control Algorithm (EPRCA) and the Dynamic Max Rate Control Algorithm (DMRCA), which use the queue length as congestion indicator to make a simple approximation of the fair share converge to the actual fair share, have become popular, because they offer good performance and are simple to implement. In particular, with no VBR traffic in the network, DMRCA has been shown to achieve fairness in all situations, good buffer control, and robust performance. In this paper, first we show that the performance of these schemes may degrade when ABR traffic interacts with highly-bursty VBR traffic. If VBR traffic induces congestion in the network, the length of the ABR queue cannot serve as a reliable indicator of congestion caused by ABR traffic, and the schemes perform poorly, introducing considerable unfairness. Then, we propose a simple technique to solve these problems. The switch constructs the length of a virtual queue which is not affected by the instantaneous behavior of VBR traffic, and does not depend on how the two types of traffic are served in order to share the common link capacity; thus, it can serve as a reliable indicator of congestion. We use this technique in DMRCA with Virtual Queueing (DMRCA_VQ), and show that the new scheme achieves fair rate allocation to the ABR connections also in presence of highly-bursty VBR traffic. DMRCA_VQ maintains the low hardware complexity of DMRCA. The virtual queueing technique is a solution for the more general problem of separating rate allocation based on the queue length from scheduling of multiple queues for sharing a common resource.