Cart (Loading....) | Create Account
Close category search window

The Limit Distribution of Queue Length of GI/G/1 Queuing Systems

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
$31 $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

2 Author(s)
Hailing Dong ; Sch. of Math. & Comput. Sci., Shenzhen Univ., Shenzhen, China ; Guochao Jiang

This paper investigates the queue length of GI/G/1 queueing systems, and obtains its limit distribution based on Markov skeleton processes, in particular, backward equations and limit distribution. The method of Markov skeleton processes is applied because this paper proves that the queue length of GI/G/1 queueing systems is a positive recurrent Doob skeleton process, which is a special case of Markov skeleton processes.

Published in:

Intelligent Systems and Applications (ISA), 2011 3rd International Workshop on

Date of Conference:

28-29 May 2011

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.