Steady-state Probabilities For Some Queueing Systems: I

by Mahmoud Abdel Moaty Hussain .

Abstract: Two routing rules for a queuing system of two stations are considered as alternative models for modeling a queuing network. These routing rules allow customers to switch queues under certain server and other resource availability conditions, either external to the system upon arrival to the network, or internal to the system after arrival to a primary queue. Under the assumption of Poisson arrivals and exponentially distributed service times, these systems are analyzed using matrix-geometric techniques, yielding a non-trivial set of ergodicity conditions and the steady-state joint probability distribution for the number of customers at each station. An extensive numerical analysis is conducted, yielding some physical insight into these systems and related generalizations.

Key Words: Queues, Routing, Poisson, Exponential distribution, Steady-state

Mahmoud Abdel Moaty Hussain,

Editor: Di Lorenzo,

READING THE ARTICLE: You can read the article in portable document (.pdf) format (208747 bytes.)

NOTE: The content of this article is the intellectual property of the authors, who retains all rights to future publication.

This page has been accessed 2477 times since APRIL 9, 2008.

Return to the InterStat Home Page.