Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Multichannel queueing systems with repeated calls under high intensity of repetition
Falin G. Journal of Information Processing and Cybernetics23 (1):37-47,1987.Type:Article
Date Reviewed: Oct 1 1987

This paper presents a study of the behavior of a repeated order queueing system under high-repetition intensity. In particular, a multichannel, fully- available system of type M / M / c / ∞( c channels with Poisson arrival rate &lgr; ) is modeled, taking into account the possibility of departure of some calls from the system due to failure to obtain service.

The method of study proposed is used to obtain asymptotic expansion of steady-state probabilities and main probabilistic characteristics as well as some estimations of remainders.

The type of problem addressed by the paper is a typical teletraffic theory problem. If an arriving primary call finds a free channel, it is serviced and then leaves the system. If all servers are engaged, the primary call produces a call source that, after some delays, produces repeated calls until a free line is found. Interarrival periods, retrial times, and service times are presumed to be mutually independent and negatively exponentially distributed with positive parameters &lgr;, &mgr;, and &ggr; = 1, respectively.

Reviewer:  F. L. Friedman Review #: CR111801
Bookmark and Share
 
Queueing Theory (D.4.8 ... )
 
 
Queueing Theory (G.m ... )
 
Would you recommend this review?
yes
no
Other reviews under "Queueing Theory": Date
Analysis of polling systems
Takagi H. (ed), MIT Press, Cambridge, MA, 1986. Type: Book (9789780262200578)
Oct 1 1987
Introduction to queueing networks
Gelenbe E., Pujolle G. (ed), Nelson J., John Wiley & Sons, Inc., New York, NY, 1987. Type: Book (9789780471904649)
Jan 1 1988
An analysis of an approximation algorithm for queueing networks
Eager D., Sevcik K. Performance Evaluation 4(4): 275-284, 1984. Type: Article
Sep 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy