Hostname: page-component-cd9895bd7-mkpzs Total loading time: 0 Render date: 2024-12-23T05:30:36.663Z Has data issue: false hasContentIssue false
  • English
  • Français

On the equivalence of flows in networks of queues

Published online by Cambridge University Press:  14 July 2016

J. Walrand
J. Walrand*
Affiliation:
Cornell University
*
∗Present address: Department of Electrical Engineering and Computer Sciences, Cory Hall, University of California, Berkeley, CA 94720, U.S.A.
Get access Rights & Permissions [Opens in a new window]

Abstract

Consider a network of queues in equilibrium. When are the flows observed on two given links of that network equivalent, i.e., when do they have the same law?

The verification of the equivalence of two such point processes is first reduced to an algebraic problem by a technique based on the filtering theory.

This method is then used to show that the arrival and departure processes at an M/M/1 node in a Jackson network are not always equivalent, thereby contradicting a conjecture made in [8]. An example where that equivalence holds is also given; it provides new results on the time reversibility of some familiar processes.

Keywords

M/M/1 QUEUENON-LINEAR FILTERINGREVERSIBILITYBIRTH AND DEATH PROCESSESPOINT PROCESSES
Type
Research Paper
Information
Journal of Applied Probability , Volume 19 , Issue 1 , March 1982 , pp. 195 - 203
Copyright
Copyright © Applied Probability Trust 1982 

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] Beutler, F. J. and Melamed, B. (1978) Decomposition and customer streams of feedback queueing networks in equilibrium. Operat. Res. 26, 1059–1072.Google Scholar
[2] Bremaud, P. (1978) Streams of a M/M/l feedback queue in statistical equilibrium. Z. Wahrscheinlichkeitsth. 45, 21–33.Google Scholar
[3] Burke, P. J. (1956) The output of a queueing system. Operat. Res. 4, 699–704.Google Scholar
[4] Burke, P. J. (1976) Proof of a conjecture on the interarrival-time distribution in an M/M/l queue with feedback. IEEE Trans. Communication COM-24, 575–576.Google Scholar
[5] Chung, K. L. (1967) Markov Chains with Stationary Transition Probabilities. Springer-Verlag, Berlin.Google Scholar
[6] Jacod, J. (1979) Calcul stochastique et problèmes de martingales. Lecture Notes in Mathematics 714, Springer-Verlag, New York.Google Scholar
[7] Kelly, F. P. (1976) Networks of queues. Adv. Appl. Prob. 8, 416–432.Google Scholar
[8] Labetoulle, J., Pujolle, G. and Soula, C. (1981) Distribution of the flows in a general Jackson network. Math. Operat. Res. CrossRefGoogle Scholar
[9] Lemoine, A. J. (1977) Network of queues — a survey of equilibrium analysis. Management Sci. 24, 464–481.Google Scholar
[10] Reich, E. (1957) Waiting times when queues are in tandem. Ann. Math. Statist. 28, 768–773.CrossRefGoogle Scholar
[11] Walrand, J. (1982) Filtering formulas and the ·/M/l queue in a quasireversible network. Stochastics. To appear.Google Scholar
[12] Walrand, J. and Varaiya, P. (1981) Flows in queueing networks: A martingale approach. Math. Operat. Res. 6, 387–404.Google Scholar