Explicit allocation of best-effort packet delivery service
IEEE/ACM Transactions on Networking (TON)
Understanding and improving TCP performance over networks with minimum rate guarantees
IEEE/ACM Transactions on Networking (TON)
Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
The ERICA switch algorithm for ABR traffic management in ATM networks
IEEE/ACM Transactions on Networking (TON)
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Stateless core: a scalable approach for quality of service in the internet
Stateless core: a scalable approach for quality of service in the internet
Dynamic bandwidth distribution techniques for scalable per-flow qos
Dynamic bandwidth distribution techniques for scalable per-flow qos
Estimating aggregate resource reservation for dynamic, scalable, and fair distribution of bandwidth
Computer Networks: The International Journal of Computer and Telecommunications Networking
Beyond best effort: router architectures for the differentiated services of tomorrow's Internet
IEEE Communications Magazine
General weighted fairness and its support in explicit rate switch algorithms
Computer Communications
On max-min fair congestion control for multicast ABR service in ATM
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Practical considerations for extending network layer models with OPNET modeler
MOAS'07 Proceedings of the 18th conference on Proceedings of the 18th IASTED International Conference: modelling and simulation
Practical considerations for extending network layer models with OPNET Modeler
MS '07 The 18th IASTED International Conference on Modelling and Simulation
Efficient transmission of rendering-related data using the NIProxy
EuroIMSA '08 Proceedings of the IASTED International Conference on Internet and Multimedia Systems and Applications
International Journal of Adaptive, Resilient and Autonomic Systems
| Hi-index | 0.00 |
The problem of fair distribution of available bandwidth among traffic flows or aggregates remains an essential issue in computer networks. This paper introduces a novel approach, called the Exact Bandwidth Distribution Scheme (X-BDS), for dynamic and fair distribution of available bandwidth among individual flows. In this approach, the edge routers keep per-flow information, while the core routers maintain the aggregate flow requirements.The X-BDS approach employs a distributed message exchange protocol for providing network feedback and for distributing aggregate flow requirements among the nodes in the network. Based on the obtained feedback, the edge routers employ the X-BDS resource management unit to dynamically distribute available bandwidth among individual flows. The X-BDS admission control and resource management units are responsible for fair resource allocation that supports minimum bandwidth guarantees of individual flows. This paper evaluates the Bandwidth Distribution Scheme through simulation and shows that the X-BDS is capable of supporting per-flow bandwidth guarantees in a dynamically changing network environment.