On-line admission control and circuit routing for high performance computing and communication

Baruch Awerbuch*, Rainer Gawlick, Tom Leighton, Yuval Rabani

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

78 Scopus citations

Abstract

This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit routing problems arise in numerous applications, including video-servers, real-time database servers, and the provision of permanent virtual channels in large-scale communications networks. The paper describes both upper and lower bounds on the competitive ratio of algorithms for admission control and virtual circuit routing in trees, arrays, and hypercubes (the networks most commonly used in conjunction with high performance computing and communication). Our results include optimal algorithms for admission control and virtual circuit routing in trees, as well as the first competitive algorithms for these problems on non-tree networks. A key result of our research is the development of on-line algorithms that substantially outperform the greedy-based approaches that are used in practice.

Original languageAmerican English
Pages (from-to)412-423
Number of pages12
JournalProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
DOIs
StatePublished - 1994
Externally publishedYes
EventProceedings of the 35th IEEE Annual Symposium on Foundations of Computer Science - Santa Fe, NM, USA
Duration: 20 Nov 199422 Nov 1994

Bibliographical note

Publisher Copyright:
© 1994 IEEE

Fingerprint

Dive into the research topics of 'On-line admission control and circuit routing for high performance computing and communication'. Together they form a unique fingerprint.

Cite this