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)
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
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
An Analysis of the Tree Convolution Algorithm
An Analysis of the Tree Convolution Algorithm
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
Modeling, analysis, and optimal routing of flow-controlled communication networks
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
PAM-a noniterative approximate solution method for closed multichain queueing networks
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Optimal routing in networks with flow-controlled virtual channels
Proceedings of the Computer Network Performance Symposium
Analysis of Queueing Network Models with population size constraints and delayed blocked customers
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
An extensive bibliography on computer networks
ACM SIGCOMM Computer Communication Review
| Hi-index | 0.00 |
Packet switching networks with flow controlled virtual channels are modeled by closed multi-chain queueing networks. The tree convolution algorithm for an exact analysis of such models is discussed. The algorithm is very efficient when routing chains have sparseness and locality properties that are typical of communication network models. The accuracy of an approximate model of equivalent open chains was investigated. An optimal routing criterion for adding a virtual channel (with a window size of one) to an existing network is explored.