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

Vasil Hnatyshin, Adarshpal S. Sethi

Research output: Contribution to journalArticle

1 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)525-547
Number of pages23
JournalComputer Networks
Volume48
Issue number4
DOIs
StatePublished - Jul 15 2005

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this