Competitive dynamic bandwidth allocation

Amotz Bar-Noy; Yishay Mansour; Baruch Schieber

doi:10.1145/277697.277704

Competitive dynamic bandwidth allocation

Amotz Bar-Noy, Yishay Mansour, Baruch Schieber

Research output: Contribution to conference › Paper › peer-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 language	English (US)
Pages	31-40
Number of pages	10
DOIs	https://doi.org/10.1145/277697.277704
State	Published - 1998
Externally published	Yes
Event	Proceedings of the 1998 17th Annual ACM Symposium on Principles of Distributed Computing - Puerto Vallarta, Mexico Duration: Jun 28 1998 → Jul 2 1998

Conference

Conference	Proceedings of the 1998 17th Annual ACM Symposium on Principles of Distributed Computing
City	Puerto Vallarta, Mexico
Period	6/28/98 → 7/2/98

All Science Journal Classification (ASJC) codes

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1145/277697.277704

Cite this

@conference{aa009394edc445ce90fd34c030533a63,

title = "Competitive dynamic bandwidth allocation",

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.",

author = "Amotz Bar-Noy and Yishay Mansour and Baruch Schieber",

year = "1998",

doi = "10.1145/277697.277704",

language = "English (US)",

pages = "31--40",

note = "Proceedings of the 1998 17th Annual ACM Symposium on Principles of Distributed Computing ; Conference date: 28-06-1998 Through 02-07-1998",

}

TY - CONF

T1 - Competitive dynamic bandwidth allocation

AU - Bar-Noy, Amotz

AU - Mansour, Yishay

AU - Schieber, Baruch

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0031642502&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031642502&partnerID=8YFLogxK

U2 - 10.1145/277697.277704

DO - 10.1145/277697.277704

M3 - Paper

AN - SCOPUS:0031642502

SP - 31

EP - 40

T2 - Proceedings of the 1998 17th Annual ACM Symposium on Principles of Distributed Computing

Y2 - 28 June 1998 through 2 July 1998

ER -

Competitive dynamic bandwidth allocation

Abstract

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this