Optimal routing in networks with flow-controlled virtual channels
- 1 April 1982
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 11 (1), 38-46
- https://doi.org/10.1145/1010631.801688
Abstract
Packet switching networks with flow-controlled virtual channels are naturally modeled as queueing networks with closed chains. Available network design and analysis techniques, however, are mostly based upon an open-chain queueing network model. In this paper, we first examine the traffic conditions under which an open-chain model accurately predicts the mean end-to-end delays of a closed-chain model having the same chain throughputs. We next consider the problem of optimally routing a small amount of incremental traffic corresponding to the addition of a new virtual channel (with a window size of one) to a network. We model the new virtual channel as a closed chain. Existing flows in the network are modeled as open chains. An optimal routing algorithm is then presented. The algorithm solves a constrained optimization problem that is a compromise between problems of unconstrained individual-optimization and unconstrained network-optimization.Keywords
This publication has 6 references indexed in Scilit:
- Modeling and analysis of flow controlled packet switching networksPublished by Association for Computing Machinery (ACM) ,1981
- Mean-Value Analysis of Closed Multichain Queuing NetworksJournal of the ACM, 1980
- On quadratic adaptive routing algorithmsCommunications of the ACM, 1976
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Presentation and major design aspects of the CYCLADES computer networkPublished by Association for Computing Machinery (ACM) ,1973
- A Proof for the Queuing Formula: L = λWOperations Research, 1961