Competitive Routing of Virtual Circuits with Unknown Duration
- 31 May 2001
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 62 (3) , 385-397
- https://doi.org/10.1006/jcss.1999.1662
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Efficient on-line call control algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Throughput-competitive on-line routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The Competitiveness of On-Line AssignmentsJournal of Algorithms, 1995
- Online load balancing of temporary tasksPublished by Springer Nature ,1993
- On-line load balancing with applications to machine scheduling and virtual circuit routingPublished by Association for Computing Machinery (ACM) ,1993
- New algorithms for an ancient scheduling problemPublished by Association for Computing Machinery (ACM) ,1992
- Call preemption in communication networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- On-line load balancingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- An optimal algorithm for on-line bipartite matchingPublished by Association for Computing Machinery (ACM) ,1990
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966