This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A. Thomasian, IBM Thomas J. Watson Research Center
This paper deals with the analysis of large-scale closed queueing network (QN) models which are used for the performance analysis of computer communication networks (CCN's). The computer systems are interconnected by a wide-area network. Users accessing local/remote computers are affected by the contention (queueing delays) at the computer systems and the communication subnet. The computational cost of analyzing such models increases exponentially with the number of user classes (chains), even when the QN is tractable (product-form). In fact, the submodels of the integrated model are generally not product-form, e.g., due to blocking at computer systems (multiprogramming level constraints) and in the communication subnet (window flow control constraints). Two approximate solution methods are proposed in this paper to analyze the integrated QN model. Both methods use decomposition and iterative techniques to exploit the structure of the QN model such that computational cost is proportional to the number of chains. The accuracy of the solution methods is validated against each other and simulation. The model is used to study the effect that channel capacity assignments, window sizes for congestion control, and routing have on system performance.
Index Terms:
window flow control, Approximate solution, decomposition and iteration, distributed processing, large scale queueing network model, memory constrained multiprogrammed computer system
Citation:
A. Thomasian, P.F. Bay, "Integrated Performance Models for Distributed Processing in Computer Communication Networks," IEEE Transactions on Software Engineering, vol. 11, no. 10, pp. 1203-1216, Oct. 1985, doi:10.1109/TSE.1985.231868
Usage of this product signifies your acceptance of the Terms of Use.