TY - GEN
T1 - Competitive dynamic bandwidth allocation
AU - Bar-Noy, Amotz
AU - Mansour, Yishay
AU - Schieber, Baruch
PY - 1998/6/1
Y1 - 1998/6/1
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 - https://www.scopus.com/pages/publications/0031642502
UR - https://www.scopus.com/pages/publications/0031642502#tab=citedBy
U2 - 10.1145/277697.277704
DO - 10.1145/277697.277704
M3 - Conference contribution
AN - SCOPUS:0031642502
SN - 9780897919777
T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
SP - 31
EP - 40
BT - PODC 1998
PB - ACM
T2 - 17th Annual ACM Symposium on Principles of Distributed Computing, PODC 1998
Y2 - 28 June 1998 through 2 July 1998
ER -