An approximation method for sojourn time distributions in telecommunication networks

We propose an approximation method for sojourn time distributions in telecommunication networks consisting of general queuing networks. The queuing network is of the open network type, and has n single server queuing systems with arbitrary interconnections. Customers may enter the network at any que...

Full description

Saved in:
Bibliographic Details
Published in1998 IEEE International Conference on Communications Vol. 3; pp. 1473 - 1477 vol.3
Main Authors Jae Uck You, Min Young Chung, Dan Keun Sung
Format Conference Proceeding
LanguageEnglish
Published IEEE 1998
Subjects
Analytical models
Approximation methods
Emulation
Intelligent networks
Network servers
Performance analysis
Performance evaluation
Queueing analysis
Telecommunication traffic
Traffic control
Online AccessGet full text

Cover

More Information
Summary:We propose an approximation method for sojourn time distributions in telecommunication networks consisting of general queuing networks. The queuing network is of the open network type, and has n single server queuing systems with arbitrary interconnections. Customers may enter the network at any queuing system. The interarrival times of the external arrival processes and the service times at the queuing systems are generally distributed. The analysis is based on the methods of decomposition, two-moment approximation, waiting time approximation and semi-Markov chain construction. All related processes are approximated by the first two moments only. Numerical results are compared with simulation ones in order to validate the proposed method.
ISBN:0780347889
9780780347885
DOI:10.1109/ICC.1998.683070