Analysis of complex queueing networks by decomposition
Methods
Traffic Engineering; Performance Evaluation
Keywords
RENEWAL PROCESS; QUEUEING NETWORK; OPEN QUEUEING NETWORK; G/G/1; EVALUATION; DECOMPOSITION
Abstract
IN THIS PAPER AN APPROXIMATE METHOD FOR THE ANALYSIS OF COMPLEXQUEUEING NETWORKS IS PROPOSED. THE QUEUEING NETWORK IS OF THE OPEN NETWORK TYPE HAVING N SINGLE SERVER QUEUEING STATIONS WITH ARBITRARY INTERCONNECTIONS. THERE IS ONLY ONE CLASS OF CUSTOMERS (CALLS) WHICH ARRIVE ACC. TO GENERAL EXOGENOUS ARRIVAL PROCESSES. THE SERVICE TIME OF THE QUEUEING STATIONS ARE GENERALLY DISTRIBUTED. THE ANALYSIS IS BASED ON THE METHOD OF DECOMPOSITION, WHER
Year
1976
Reference entry
Kühn, P.J. Analysis of complex queueing networks by decomposition
Proceedings of the 8th International Teletraffic Congress (ITC 8), Melbourne, November 1976, pp. 1-8