Throughput-competitive on-line routing

  • Authors:

  • B. Awerbuch;Y. Azar;S. Plotkin

  • Affiliations:

  • Lab. for Comput. Sci., MIT, Cambridge, MA, USA;-;-

  • Venue:
  • SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

We develop a framework that allows us to address the issues of admission control and routing in high-speed networks under the restriction that once a call is admitted and routed, it has to proceed to completion and no reroutings are allowed. The "no rerouting" restriction appears in all the proposals for future high-speed networks and stems from current hardware limitations, in particular the fact that the bandwidth-delay product of the newly developed optical communication links far exceeds the buffer capacity of the network. In case the goal is to maximize the throughput, our framework yields an on-line O(log nT)-competitive strategy, where n is the number of nodes in the network and T is the maximum call duration. In other words, our strategy results in throughput that is within O(log nT) factor of the highest possible throughput achievable by an omniscient algorithm that knows all of the requests in advance. Moreover, we show that no on-line strategy can achieve a better competitive ratio. Our framework leads to competitive strategies applicable in several more general settings. Extensions include assigning each connection an associated "profit" that represents the importance of this connection, and addressing the issue of call-establishment costs.