Competitive dynamic bandwidth allocation

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 am costly operations in today’s networks. Our model assumes that sessions join the network with a certain delay requirement ratherthan 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]  J. Walrand,et al.  RCBR: A Simple and Efficient Service for Multiple Time-Scale Traffic , 1995 .

[2]  Amos Fiat,et al.  On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.

[3]  Yuval Rabani,et al.  On-line admission control and circuit routing for high performance computing and communication , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[4]  Yishay Mansour,et al.  Dynamic bandwidth allocation policies , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[5]  David Tse,et al.  RCBR: a simple and efficient service for multiple time-scale traffic , 1995, SIGCOMM '95.

[6]  Moti Yung,et al.  Efficient on-line call control algorithms , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[7]  Raphael Rom,et al.  Analysis of one-way reservation algorithms , 1995, J. High Speed Networks.

[8]  Juan A. Garay,et al.  Call preemption in communication networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[9]  Ran Canetti,et al.  Bandwidth allocation with preemption , 1995, STOC '95.

[10]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[11]  Srinivasan Keshav,et al.  An empirical evaluation of virtual circuit holding times in IP-over-ATM networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[12]  Amos Fiat,et al.  Competitive non-preemptive call control , 1994, SODA '94.

[13]  Carsten Lund,et al.  IP over connection-oriented networks and distributional paging , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.