Estimating aggregate resource reservation for dynamic, scalable, and fair distribution of bandwidth

Authors:
Vasil Hnatyshin;Adarshpal S. Sethi
Affiliations:
Department of Computer and Information Sciences, University of Delaware, Newark, DE 19716, USA;Department of Computer and Information Sciences, University of Delaware, Newark, DE 19716, USA
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2005

Citing 6
Cited 0

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
Stateless core: a scalable approach for quality of service in the internet

Stateless core: a scalable approach for quality of service in the internet

Quantified Score

Hi-index	0.00

Visualization

Abstract

The current best effort approach to Quality of Service in the Internet can no longer satisfy a diverse variety of customer service requirements, and that is why there is a need for alternative strategies. In order to solve this problem a number of service differentiation approaches have been proposed. Unfortunately, these schemes are often inadequate for providing proper service differentiation during periods of congestion. In this paper we introduce a new Bandwidth Distribution mechanism for supporting per-flow Quality of Service guarantees and for dealing with congestion. The Bandwidth Distribution scheme dynamically adjusts resource allocations at the network boundaries based on the network feedback. Within the Bandwidth Distribution framework we introduce a set of techniques for computing per-flow fair share. We evaluate these methods through simulation.