Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Mean-Value Analysis of Closed Multichain Queuing Networks
Journal of the ACM (JACM)
On quadratic adaptive routing algorithms
Communications of the ACM
Computer Communications Network Design and Analysis
Computer Communications Network Design and Analysis
The Distribution of Queueing Network States at Input and Output Instants
Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance of Computer Systems
Modeling and analysis of flow controlled packet switching networks
SIGCOMM '81 Proceedings of the seventh symposium on Data communications
Presentation and major design aspects of the CYCLADES computer network
DATACOMM '73 Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design
A Tree Convolution Algorithm for Queueing Networks
A Tree Convolution Algorithm for Queueing Networks
The design of store-and-forward (s/f) networks for computer communications
The design of store-and-forward (s/f) networks for computer communications
Modelling and analysis of flow-controlled computer communication networks
Modelling and analysis of flow-controlled computer communication networks
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
Optimal routing in closed queuing networks
ACM Transactions on Computer Systems (TOCS)
A tree convolution algorithm for the solution of queueing networks
Communications of the ACM
| Hi-index | 0.02 |
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.