Don Towsley
Abstract
A model of a closed queuing network within which customer routing between queues may depend on the state of the network is presented. The routing functions allowed may be rational functions of the queue lengths of various downstream queues which reside within special subnetworks called p-subnetworks. If a network with no state-dependent routing has a product-form joint equilibrium distribution of the queue lengths, then the introduction of these routing functions will preserve the product form of the equilibrium distribution. An example to illustrate the applicability of the model to the problem of analyzing a load balancing strategy is presented. It is also indicated how the parametric analysis of a network with routing functions can be simplified through the analysis of a simpler “equivalent” network.
- 1 AGNEW, C E On quadratic adapuve routing algorithms Comm. ACM 19, 1 (Jan 1976), 18-22 Google Scholar
- 2 BARBOUR, A D Network of queues and the method of stages Adv Appl Prob 8 (1976), 584-591Google Scholar
- 3 BASKETT, F, CHANDY, K M., MUNTZ, R R, AND PALACIOS-GOMEZ, F Open, closed, and mixed networks of queues with different classes of customers J ACM 22, 2 (Apr 1975), 248-260 Google Scholar
- 4 BUZEN, J P Computational algorithms for closed queuing networks with exponential servers Comm A CM 16, 9 (Sept 1973), 527-531 Google Scholar
- 5 CItANDY, KM The analysis and solutions for general queuing networks Proc Sixth Annual Princeton Conference on Inform Sol., Princeton, N J, 1972, pp 224-228.Google Scholar
- 6 CHANDY, K.M, HERZOG, U, AND Woo, L Parametric analysis of queuing network models IBM J Res Devel 19, 1 (Jan 1975), 43-49Google Scholar
- 7 CHANDY, K M, HOWARD, J H. JR., AND TOWSLE~, D F Product form and local balance m queuing networks. J ACM 24, 2 (Apr 1977), 250-263 Google Scholar
- 8 CHow, Y, AND KOHLER, W H Models for dynamic load balancing m a heterogeneous multiple processor system IEEE Trans Comptr C.28, 5 (May 1979), 354-361Google Scholar
- 9 FLATTO, L Two parallel queues with equal servicing rates IBM Res Rep RC 5916, IBM Thomas J Watson Res. Ctr, Yorktown Heights, N Y, March 1976.Google Scholar
- 10 FULTZ, G.L. AdapUve routing techniques for message swRchmg computer-commumcatton networks Eng Rep UCLA-Eng-7252, School of Engineering and Apphed Science, U of Cahforma at Los Angeles, Los Angeles, Cahf, July 1972Google Scholar
- 11 GALLAOER, R G A mimmum delay routing algorithm using distributed computation IEEE Trans Comm COM-25, 1 (Jan 1977), 73-84Google Scholar
- 12 HOKSTAD, P ApproxLmaUons for the M/G/M Queue Oper. Res 26, 3 (1978), 510-523.Google Scholar
- 13 KELLY, F P Network of queues. Adv. Appl. Prob 8 (1976), 584--591Google Scholar
- 14 KINGM&N, J.F.C. Markov populatton processes. J Appl. Prob. 6 (1969), 1-18.Google Scholar
- 15 KLEINROCK, LQueuing Systems, Vol i Wtley Intersctenee, New York, 1975 Google Scholar
- 16 PrI-I~L, B. Closed exponenttal networks of queues wtth blocking the Jackson-type stationary distributton and its asymptottc analysts IBM Res. Rep. RC 6176, IBM Thomas J Watson Res Ctr, Yorktown Hmghts, N.Y., Aug. 1976.Google Scholar
- 17 TOWSLEY, D.F.Local balance models of computer systems. Tech. Pep TR-60, Dept. of Comptr. Set, U of Texas, Austm, Texas, 1975. Google Scholar
- 18 WHITTLE, P.Nonlinear mtgratlon processes, lnternat Statzst. Inst Bull. 42, Bk 1 (1969), 642--647.Google Scholar
- 19 WHITTLE, P. Equdibnum distribution for an open mlgratton process. J AppL Prob. 5 (1968), 567-571Google Scholar
Index Terms
- Queuing Network Models with State-Dependent Routing
Recommendations
State-dependent M/G/1 queueing systems
We consider a state-dependent $$M_{n}$$Mn/$$G_{n}$$Gn/1 queueing system with both finite and infinite buffer sizes. We allow the arrival rate of customers to depend on the number of people in the system. Service times are also state dependent and ...
Analyzing state-dependent arrival in GI/BMSP/1/∞ queues
We consider an infinite-buffer single-server queue with renewal input. The service to the queueing system is provided in batches of random size, according to a batch Markovian service process (BMSP). The queue length distribution of the number of ...
Two-Class Priority Queueing System with State-Dependent Arrivals
In this paper, we present a performance analysis of a 2-dimensional preemptive priority queueing system with state-dependent arrivals. Using a Markovian formulation we first compute the steady state distribution for the queue length of both classes. ...
Comments