Efficient On-Line Call Control Algorithms

Journal of Algorithms

Volumn 23, Issue 1, 1997, Pages 180-194

  Garay, Juan A ^a   Gopal, Inder S ^a   Kutten, Shay ^a   Mansour, Yishay ^b   Yung, Moti ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000288898     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0821     Document Type: Article

References (14)

1. B. Awerbuch, Y. Azar, and S. Plotkin, Throughout competitive on-line routing, in "Proc. 34th IEEE Annual Symp. on Foundations of Computer Science (1993)," pp. 32-40, Palo Alto, CA, November 1993.
2. B. Awerbuch, Y. Azar, S. Plotkin and O. Waarts, Competitive routing of virtual circuits with unknown duration, in "Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms (1994)," pp. 321-327, Arlington, VA, January 1994.
3. B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosén, Competitive non-preemptive call control, in "Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms (1994)," pp. 312-320, Arlington, VA, January 1994.
4. B. Awerbuch, R. Gawlick, T. Leighton, and Y. Rabani, Online admission control and circuit routing for high performance computing and communication, in "Proc. 35th IEEE Annual Symp. on Foundations of Computer Science (1994)," pp. 412-423, Santa Fe, NM, November 1994.
5. Special Issue on Asynchronous Transfer Mode, Int. J. Digital Analog. Cabled Syst. 1 (1988).
6. A. Bar-Noy, R. Canetti, S. Kutten, Y. Mansour, and B. Schieber, Bandwidth allocation with preemption, in "Proc. 27th Annual ACM Symp. on the Theory of Computing (1995)," pp. 616-625, Las Vegas, NV, May 1995.
7. S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, and F. Wang, On the competitiveness of on-line real-time task scheduling, in "Proc. IEEE Real-Time Systems Symposium," pp. 106-115, 1991.
8. D. Clark, B. Davie, D. Farber, I. Gopal, B. Kadaba, W. Sincoskie, J. Smith, and D. Tennenhouse, An overview of the AURORA gigabit testbed, in "Proc. INFOCOM '92, Florence, Italy (1992)," pp. 569-581.
9. I. Cidon and I. Gopal, PARIS: An approach to integrated high-speed private networks Int. J. Digital Analog Cabled Syst. 1 (1988), 77-86.
10. M. Furst and A. Tomkins, Some lower bounds for call control algorithms, private communication.
11. J. A. Garay and I. S. Gopal, Call preemption in communication networks, in "Proc. INFOCOM '92, Florence, Italy (1992)," pp. 1043-1050.
12. S. Plotkin, Competitive routing of virtual circuits in ATM networks, IEEE J. Selected Areas in Communications, special issue on Advances in the Fundamentals of Networking (invited paper), pp. 1128-1136, August 1995. 〈http://theory.standford.edu/people/ plotkin/routing.html〉.
13. D. Sleator and R. Tarjan, Amortized efficiency of list update and paging rules, Commun. ACM 28 (1985), 202-208.
14. J. S. Turner, New directions in communications (or which way to the information age?), IEEE Commun. Mag. 24 (1986), 8-15.