Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-19T08:40:50.610Z Has data issue: false hasContentIssue false
  • English
  • Français

A family of bounds for the transient behavior of a Jackson network

Published online by Cambridge University Press:  14 July 2016

William A. Massey
William A. Massey*
Affiliation:
AT&T Bell Laboratories
*
∗Postal address: AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

Using operator methods, we derive a family of stochastic bounds for the Jackson network. For its transient joint queue-length distribution, we can stochastically bound it above by various networks that decouple into smaller independent Jackson networks. Each bound is determined by a distinct partitioning of the index set for the nodes. Except for the trivial cases, none of these bounds can be extended to a sample path ordering between it and the original network. Finally, we can partially order the bounds themselves whenever one partition of the index set is the refinement of another. These results suggest new types of partial orders for stochastic processes that are not equivalent to sample-path orderings.

Keywords

TENSOR REPRESENTATIONSTOCHASTIC ORDERING
Type
Short Communications
Information
Journal of Applied Probability , Volume 23 , Issue 2 , June 1986 , pp. 543 - 549
Copyright
Copyright © Applied Probability Trust 1986 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Goodman, J. B. and Massey, W. A. (1984) The non-ergodic Jackson network. J. Appl. Prob. 21, 860–869.Google Scholar
[2] Jackson, J. R. (1957) Networks of waiting lines. Operat. Res. 5, 518–521.Google Scholar
[3] Kamae, T., Krengel, V. and O'brien, G. L. (1977) Stochastic inequalities on partially ordered spaces. Ann. Prob. 5, 899–912.Google Scholar
[4] Massey, W. A. (1984) An operator analytic approach to the Jackson network. J. Appl. Prob. 21, 379–393.Google Scholar
[5] Massey, W. A. (1985) Stochastic inequalities for Markov processes on partially ordered spaces. Math. Operat. Res. To appear.Google Scholar
[6] Tsoucas, P. and Walrand, J. (1984) A note on stochastic bounds for queueing networks. Adv. Appl. Prob. 16, 926–928.Google Scholar