Eecient On-line Call Control Algorithms

We study the problem of on-line call control, i.e., the problem of accepting or rejecting an incoming call without knowledge of future calls. The problem is part of the more general problem of bandwidth allocation and management. Intuition suggests that knowledge of future call arrivals can be crucial to the performance of the system. In this paper, however, we present deterministic on-line call control algorithms. We use competitive analysis to measure their performance, i.e. we compare them to their o -line, clairvoyant counterparts. We also prove the optimality of some of our algorithms. The model we consider in this paper is that of a line of nodes, and investigate a variety of cases concerning the value of the calls. The value is accrued only if the call terminates successfully; otherwise|if the call is rejected, or prematurely terminated|no value is gained. The performance of the algorithm is then measured by the cumulative value achieved, when given a sequence of calls. The variety of call value criteria that we study|constant; proportional to the length of the call's route; proportional to its holding time|captures the many natural cost assignments to network services. A preliminary version of this paper appeared in Proc. 2nd Israel Symp. on the Theory of Computing and Systems, Natanya, Israel, June 1993. IBM T.J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY 10598. Computer Science Department, Tel-Aviv University, Israel.

[1]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[2]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[3]  J. Turner,et al.  New directions in communications (or which way to the information age?) , 1986, IEEE Communications Magazine.

[4]  Israel Cidon,et al.  Paris: An approach to integrated high‐speed private networks , 1988 .

[5]  W. David Sincoskie,et al.  An overview of the AURORA gigabit testbed , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

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

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

[8]  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.

[9]  Yossi Azar,et al.  Competitive routing of virtual circuits with unknown duration , 1994, SODA '94.

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

[11]  Serge A. Plotkin Competitive Routing of Virtual Circuits in ATM Networks , 1995, IEEE J. Sel. Areas Commun..