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 language | American English |
|---|---|
| Pages (from-to) | 412-423 |
| Number of pages | 12 |
| Journal | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS |
| DOIs | |
| State | Published - 1994 |
| Externally published | Yes |
| Event | Proceedings of the 35th IEEE Annual Symposium on Foundations of Computer Science - Santa Fe, NM, USA Duration: 20 Nov 1994 → 22 Nov 1994 |
Bibliographical note
Funding Information:Johns Hopkins University, Baltimore, MD 212182694, and MIT Laboratory for Computer Science, Cambridge MA 02139. Email: baruchtDblaZe.a.jhu.edu. Supported by Air Force Contract AFOSR F49620-92-5-0125, ARPA/ Army contract DABT63-9SC-0038, NSF contract CCR-9114440, DARPA Contract N00014-92-5-1799, and a specid grant from IBM. tMIT Laboratory for Computer Science, Cambridge, MA 02139. Supported by ARPA/Army contract DABTSSC-0038. t Departmat of Mathematics and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139. This research waa supported in part by Air Force Contract AFOSR F49620-92-5-0125 and DARPA Contracts NOOO1491-J-1698 a d N00014-92-3-1799.
Funding Information:
Supported by Air Force Contract AFOSR F49620-92-J-0125, ARPA/Army contract DABT63-93-C-0038, NSF contract CCR-9114440, DARPA Contract N00014-92-J-1799, and a special grant from IBM. Supported by ARPA/Army contract DABT63-93-C-0038. This research was supported in part by Air Force Contract AFOSR F49620-92-J-0125 and DARPA Contracts N00014-91-J-1698 and N00014-92-J-1799. Supported by ARPA/Army contract DABT63-93-C-0038.
Funding Information:
5MIT Laboratory for Computer Science, Cambridge, MA 02139. Supported by ARPA/Army contract DABT63-93-C-0038.
Publisher Copyright:
© 1994 IEEE