Competitive dynamic bandwidth allocation

Amotz Bar-Noy, Yishay Mansour, Baruch Schieber

Research output: Contribution to conferencePaperpeer-review

9 Scopus citations

Abstract

We propose a realistic theoretical model for dynamic bandwidth allocation. Our model lakes into account the two classical quality of service parameter: latency and utilization, together with a newly introduced parameter: number of bandwidth allocation changes, which are costly operations in today's networks. Our model assumes that sessions join the network with a certain delay requirement rather than a bandwidth requirement as assumed in previous models. In addition, the network has a certain utilization requirement. Given bounds on latency and utilization, we design online algorithms that minimize the number of bandwidth allocation changes.

Original languageEnglish (US)
Pages31-40
Number of pages10
StatePublished - Jan 1 1998
Externally publishedYes
EventProceedings of the 1998 17th Annual ACM Symposium on Principles of Distributed Computing - Puerto Vallarta, Mexico
Duration: Jun 28 1998Jul 2 1998

Conference

ConferenceProceedings of the 1998 17th Annual ACM Symposium on Principles of Distributed Computing
CityPuerto Vallarta, Mexico
Period6/28/987/2/98

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Competitive dynamic bandwidth allocation'. Together they form a unique fingerprint.

Cite this