Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-24T06:27:25.073Z Has data issue: false hasContentIssue false
  • English
  • Français

A note on Norton's theorem for queuing networks

Published online by Cambridge University Press:  14 July 2016

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

Abstract

We propose a simple proof of Norton's theorem for multiclass quasireversible networks.

Keywords

QUASI-REVERSIBILITY
Type
Short Communications
Information
Journal of Applied Probability , Volume 20 , Issue 2 , June 1983 , pp. 442 - 444
Copyright
Copyright © Applied Probability Trust 1983 

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] Chandy, K. M., Herzog, U. and Woo, L. (1975) Parametric analysis of queueing networks. IBM J. Res. Devel. 19, 36–42.Google Scholar
[2] Kelly, F. P. (1979) Reversibility and Stochastic Networks. Wiley, New York.Google Scholar