Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-22T11:16:52.354Z Has data issue: false hasContentIssue false
  • English
  • Français

Jackson networks with unlimited supply of work

Part of: Computer system organization Operations research and management science Special processes

Published online by Cambridge University Press:  14 July 2016

Gideon Weiss
Gideon Weiss*
Affiliation:
The University of Haifa
*
∗Postal address: Department of Statistics, The University of Haifa, Mount Carmel, 31905, Israel. Email address: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We consider a Jackson network in which some of the nodes have an infinite supply of work: when all the customers queued at such a node have departed, the node will process a customer from this supply. Such nodes will be processing jobs all the time, so they will be fully utilized and experience a traffic intensity of 1. We calculate flow rates for such networks, obtain conditions for stability, and investigate the stationary distributions. Standard nodes in this network continue to have product-form distributions, while nodes with an infinite supply of work have geometric marginal distributions and Poisson inflows and outflows, but their joint distribution is not of product form.

Keywords

QueueJackson networkinfinite virtual buffer

MSC classification

Primary: 60K25: Queueing theory 90B22: Queues and service 68M20: Performance evaluation; queueing; scheduling 90B15: Network models, stochastic
Type
Short Communications
Information
Journal of Applied Probability , Volume 42 , Issue 3 , September 2005 , pp. 879 - 882
Copyright
© Applied Probability Trust 2005 

Footnotes

Supported in part by Israel Science Foundation grant number 249/02.

References

Adan, I. J. B. F. and Weiss, G. (2005). A two-node Jackson network with infinite supply of work. Prob. Eng. Inf. Sci. 19, 191–212.CrossRefGoogle Scholar
Adan, I. J. B. F. and Weiss, G. (2005). Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy. To appear in Queueing Systems Theory Appl.Google Scholar
Gans, N. and Zhou, Y. (2003). A call-routing problem with service-level constraints. Operat. Res. 51, 255–271.CrossRefGoogle Scholar
Goodman, J. B. and Massey, W. A. (1984). The non-ergodic Jackson network. J. Appl. Prob. 21, 860–869.CrossRefGoogle Scholar
Jackson, J. (1957). Networks of waiting lines. Operat. Res. 5, 518–521.Google Scholar
Levy, Y. and Yechiali, U. (1975). Utilization of idle time in an M/G/1 queueing system. Manag. Sci. 22, 202–211.CrossRefGoogle Scholar
Kelly, F. P. (1979). Reversibility and Stochastic Networks. John Wiley, New York.Google Scholar
Kopzon, A. and Weiss, G. (2002). A push–pull queueing system. Operat. Res. Lett. 30, 351–359.Google Scholar
Weiss, G. (2004). A fluid approach to the control of processing networks over a finite time horizon, using separated continuous linear programs, virtual infinite buffers and maximum pressure policies. Preprint, Department of Statistics, University of Haifa.Google Scholar
Weiss, G. (2004). Stability of a simple re-entrant line with infinite supply of work — the case of exponential processing times. J. Operat. Res. Soc. Japan 47, 304–313.Google Scholar