An approximation method for sojourn time distributions in telecommunication networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationICC 1998 - 1998 IEEE International Conference on Communications
Subtitle of host publicationNew Century Communications, Conference Record; Affiliated with SUPERCOMM 1998
Pages1473-1477
Number of pages5
DOIs
StatePublished - 1998
Externally publishedYes
Event1998 IEEE International Conference on Communications: New Century Communications, ICC 1998 - Affiliated with SUPERCOMM 1998 - Atlanta, GA, United States
Duration: 7 Jun 199811 Jun 1998

Publication series

NameInternational Conference on Communications - Proceedings
Volume3

Conference

Conference1998 IEEE International Conference on Communications: New Century Communications, ICC 1998 - Affiliated with SUPERCOMM 1998
Country/TerritoryUnited States
CityAtlanta, GA
Period7/06/9811/06/98

Fingerprint

Dive into the research topics of 'An approximation method for sojourn time distributions in telecommunication networks'. Together they form a unique fingerprint.

Cite this