K. C. Sevcik
- 1 BARBOUR, A D Networks of queues and the method of stages Adv AppL Prob 8, 3 (Sept 1976), 584-591Google Scholar
- 2 BARD, Y Some extensions to muluclass queuemg network analysis Proc 4th Int Symp Modelling and Performance Evaluation, Vienna, Ausma, 1979. Google Scholar
- 3 BASKETT, F, CHANDY, K M. MUNTZ, R R, AND PALACIOS, F G Open, closed, and mixed networks of queues with different classes of customers J ACM 22, 2 (April 1975), 248-260. Google Scholar
- 4 BURKE, P.J Proof of a conjecture on the mterarnval time distribution m an M/M/I queue with feedback IEEE Trans. Comput TC 24, 5 (May 1976), 575-576Google Scholar
- 5 BUZEN, J P, AND DENNING, P J Operational treatment of queueing distributions and mean value analysis Tech Rep, Computer Science Dep, Purdue Univ., Lafayette, lnd, Aug, 1979Google Scholar
- 6 CHANDY, K M, HOWARD, J H JR, AND TOWSLEY, D F Product form and local balance in queuemg networks J ACM 24, 2 (April 1977), 250-263 Google Scholar
- 7 CHANDY, K M In preparation.Google Scholar
- 8 CINLAR, E.Introduction to Stochastic Processes Prentice-Hall, Englewood Cliffs, N.J., 1975Google Scholar
- 9 COOPER, R B Introductlon to Queuemg Theory. MacMillan Publishing Co, New York, 1972Google Scholar
- 10 Cox, DR A use of complex probabilities in the theory of stochastic processes Proc. Cambridge Phd Soc. 51 (1955), 313-319Google Scholar
- 11 DISNEY, R L Random flow m queuemg networks" A review and crmque AIIE Trans. 7, 3 (Sept 1975) 268-288Google Scholar
- 12 DISNEY, R L, AND McNICKLE, D C The M/G/I queue with instantaneous Bernoulli feedback Tech Rep 77-4, Dep of Industrial and Operational Engineering, Umv of Michigan, Ann Arbor, Mich, Aprd 1977.Google Scholar
- 13 GORDON, W J, AND NEWELL, G F.Closed queuemg systems w~th exponential servers Oper Res 15 (1967), 254-265Google Scholar
- 14 JACKSON, J R Networks of waiting lines Oper Res 5 (1957), 518-521Google Scholar
- 15 JACKSON, J.R Jobshop-hke queuemg systems Manage Sct. 10, 1 (Oct 1963), 131-142Google Scholar
- 16 KELLY, F.P Networks of queues w~th customers of different classes J Appl Prob 12 (1975), 542- 554.Google Scholar
- 17 KELLY, F.P Networks of queues Adv AppL Prob 8, 2 (June 1976), 416-432Google Scholar
- 18 KOBAYASHI, H, AND REISER, M On generalization of job routing behavior in a queuelng network model Res Rep RC5252, IBM homas J. Watson Research Center, Yorktown Heights, N Y, Feb 1975Google Scholar
- 19 LAM, S.S Queuemg networks with population size constraints IBM J Res Devel 21, 4 (July 1977), 370-378Google Scholar
- 20 LAVENBERG, S S, AND REISER, M.Stattonary state probabdmes at arrival instants for dosed queuemg networks w~th muluple types of customers. Res Rep. RC7592, IBM Thomas J Watson Research Center, Yorktown Heights, N Y, April, 1979Google Scholar
- 21 LEMOINE, A J Networks of queues--a survey of equdtbnum results Manage Sci 24, 4 (Dec 1977), 464--481Google Scholar
- 22 MELAMED, B On Markov jump processes imbedded at jump epochs and thetr queuemg-theorettc apphcauons, Dep. of Industrial Engmeermg and Management Sctences, Northwestern Univ, Nov. 1978Google Scholar
- 23 MITRANI, I Nonpnorlty muluprogrammmg systems under heavy demand condmons--customer's viewpoint J ACM 19, 3 (July 1972), 445--452 Google Scholar
- 24 REISER, M, AND KOBAYASHI, H. Numertcal soluuon of semi-closed exponenual server queuemg networks. Proc 7th Asdomar Conf, Asdomar~ Cahf, 1973, pp 308-312.Google Scholar
- 25 REISER, M, AND LAVENBERG, S S Mean-value analysts of closed multtcham queuing networks. J ACM 27, 2 (AprlI 1980), 313-322 Google Scholar
- 26 REISER, M Mean-value analysis of queuelng networks. In Proc 4th lnt Syrup Modelhng and Performance Evaluatton, M Arato, E Gelenbe, and A Butnmenko, Eds., North-Holland Pubhshmg, Amsterdam, 1979 Google Scholar
Index Terms
- The Distribution of Queuing Network States at Input and Output Instants
Recommendations
Retrial queuing system with Markovian arrival flow and phase-type service time distribution
We consider a multi-server queuing system with retrial customers to model a call center. The flow of customers is described by a Markovian arrival process (MAP). The servers are identical and independent of each other. A customer's service time has a ...
A Single-Server Priority Queuing System with General Holding Times, Poisson Input, and Reverse-Order-of-Arrival Queuing Discipline
This paper gives an explicit formula for the waiting-time distribution in a single-server system with general holding times subject to a Poisson input from any number of priority classes. In the general case, where the holding-time distributions of the ...
On the Output of a GI/M/N Queuing System with Interrupted Poisson Input
We consider the output process of a GI/M/N queuing system with interrupted Poisson input. The interrupted Poisson input is frequently used to characterize alternate routed traffic and may be shown to be equivalent to a mixture of two exponential ...
Comments