Stationary ergodic Jackson networks
Subtitle: results and counter-examples
By: François Baccelli, Serguei Foss, Jean Mairesse.
Contributors: Foss, Serguei.; Mairesse, Jean.; Hewlett-Packard Laboratories.
Series: [Technical report] / HP Laboratories Bristol. Basic Research Institute in the Mathematical Sciences -- HPL-BRIMS-96-11.; BRIMS technical report -- HPL-BRIMS-96-11.
Publisher: Hewlett Packard
Published: 1996
Place of publication: Bristol [England]
Language: eng
Number of pages: 27
Subjects: Ergodic theory; Computer networks; Packet switching (Data transmission)
Description: Abstract: "This paper gives a survey of recent results on generalized Jackson networks, where classical exponential or i.i.d. assumptions on services and routings are replaced by stationary and ergodic assumptions. We first show that the most basic features of the network may exhibit unexpected behaviour. Several probabilistic properties are then discussed, including a strong law of large numbers for the number of events in the stations, the existence, uniqueness and representation of stationary regimes for queue size and workload."
Notes: Cover title.

"March, 1996."

Includes bibliographical references.

Supported in part by a post-doctoral grant from INRIA.