Competitive dynamic bandwidth allocation
Amotz Bar-Noy, Yishay Mansour, Baruch Schieber · 1998
We propose a realistic theoretical model for dynamic bandwidth allocation. Our model takes into account the two classical quality of service parameters: 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. 1 Introduction The phenomenal proliferation of communication networks during the recent years is due to both growth in the number of users and inflation in their bandwidth demand. Although the available bandwidth is increasing dramatically, it is still one of the bottleneck resources in communication networks. Sharing this resource efficiently is ...