By Topic

An approximation method for sojourn time distributions in telecommunication networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jae Uck You ; Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Seoul, South Korea ; Min Young Chung ; Dan Keun Sung

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

Published in:

Communications, 1998. ICC 98. Conference Record. 1998 IEEE International Conference on  (Volume:3 )

Date of Conference:

7-11 Jun 1998