Congestion control and traffic management in ATM networks: recent advances and a survey
Computer Networks and ISDN Systems
An efficient rate allocation algorithm for ATM networks providing max-min fairness
Proceedings of the IFIP Sixth International Conference on High Performance Networking VI
An Algorithm for Rate Allocation in a Packet-Switching Network With Feedback
An Algorithm for Rate Allocation in a Packet-Switching Network With Feedback
Time scale analysis of explicit rate allocation in ATM networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
The rate-based flow control framework for the available bit rate ATM service
IEEE Network: The Magazine of Global Internetworking
Phantom: a simple and effective flow control scheme
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Routing high-bandwidth traffic in max-min fair share networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
The Rate Mismatch Problem in Heterogeneous ABR Flow Control
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Experimental Evaluation of ATM Congestion Control Mechanisms
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Improvement of Traffic Load Measurement Mechanism of ATM Switches in Presence of VBR Traffic
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
A control theoretical approach to congestion control in packet networks
IEEE/ACM Transactions on Networking (TON)
Time scale analysis of explicit rate allocation in ATM networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Survey: Flow control in ATM networks: a survey
Computer Communications
| Hi-index | 0.00 |
One of the challenges for rate based congestion management for computer communication networks is that of scalability. This is true especially in the contezt of ATM, where reducing the amount of state maintained and the computation performed can have significant advantages in making switches fast as well as low-cost. In this paper we explore ways of achieving better scalability of explicit rate algorithms for maxmin fair rate allocation in the presence of a large number of flows/virtual connections. We seek ways to reduce complecity in both the amount of state that individual switches have to maintain, and the computation performed, by introducing the idea o diacrete source rates. We develop algorithms with O(k) complexity of the calculation of fair allocation ai the switch, where k is the number of distinct rates. We reduce the amount of state information to one bit per flow without performance degradation. We suggest a further approximation requiring only O(k) state infomation which performs quite well in our simulations, although it is shown to be vulnerable to certain conditions which may lead to somewhat lower link utilization.