Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
ACM SIGCOMM Computer Communication Review
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
QLWFQ: A Queue Length Based Weighted Fair Queueing Algorithm in ATM Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Congestion-oriented shortest multipath routing
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
ATM traffic management with diversified loss and delay requirements
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
Efficient support for the client/server paradigm over heterogeneous 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
Carry-over round robin: a simple cell scheduling mechanism for 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 2
Traffic-controlled rate-monotonic priority scheduling of ATM cells
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
A congestion-avoidance scheme for LAN interconnection over high-speed networks
Computer Communications
Evolution of controls for the available bit rate service
IEEE Communications Magazine
Source behavior for ATM ABR traffic management: an explanation
IEEE Communications Magazine
IEEE Communications Magazine
| Hi-index | 0.24 |
When an ATM network is used as a backbone interconnection medium for a set of legacy low-speed LANs, a congestion control scheme is required to protect destination LANs from the risk of congestion that might be created when multiple users attempt to simultaneously communicate with the same LAN. In this paper, we present a novel congestion-control scheme in which the rate-based and bandwidth advertisement approaches inter-operate to efficiently manage and protect destination resources. In this scheme, each destination LAN is connected to source LANs through a tree-based virtual path (VP) layout that is rooted at the destination and has the source LANs as leaves. Under the rate-based framework, fractions (quotas) of the destination bandwidth are periodically computed on a hop-by-hop basis for each VP. Quotas are based on the estimated average load on each VP link. At source LANs, these quotas are used to regulate the instantaneous transmission rate into the ATM network. The bandwidth advertisement framework on the other hand works end-to-end. It uses the destination LAN buffer to regulate quota migration from low activity LANs to the high activity ones depending on the total buffer occupancy, as well as the individual buffer occupancy per source LAN at the destination. The scheme uses simple calculations, which makes it suitable for real time implementation. The performance of the scheme is evaluated through computer simulation under several network parameters and traffic patterns. Results show that a near zero packet loss probability at the destination is achieved while attaining high resource utilization. The results also demonstrate the fairness of the proposed scheme.