Routing and Admission Control in General Topology Networks with Poisson Arrivals
Open Access
- 1 May 1998
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 27 (2) , 236-258
- https://doi.org/10.1006/jagm.1997.0923
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Throughput-competitive on-line routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On-line admission control and circuit routing for high performance computing and communicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Competitive Routing of Virtual Circuits with Unknown DurationJournal of Computer and System Sciences, 2001
- Efficient On-Line Call Control AlgorithmsJournal of Algorithms, 1997
- Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flowsPublished by Association for Computing Machinery (ACM) ,1995
- An optimal on-line algorithm for metrical task systemJournal of the ACM, 1992
- Call preemption in communication networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Dynamic Routing in Fully Connected NetworksIMA Journal of Mathematical Control and Information, 1990
- Servicing and Real-Time Control of Networks With Dynamic RoutingBell System Technical Journal, 1981
- Design and Optimization of Networks With Dynamic RoutingBell System Technical Journal, 1981