Stationary ergodic Jackson networks
results and counter-examples
Our rough guess is there are 6,750 words in this book.
At a pace averaging 250 words per minute, this book will take 0 hours and 27 minutes to read. With a half hour per day, this will take 1 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Foss, Serguei. - Contributor
- Mairesse, Jean. - Contributor
- Hewlett-Packard Laboratories. - Contributor
Publication
1996 - Hewlett Packard, Bristol [England, England
Language
English
Word Count
6,750 words, Guess
Page Count
27 pages
Identifiers
- OCLC Control Number46345269
- Open LibraryOL17613330M
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."
Series Statement
- [Technical report] / HP Laboratories Bristol. Basic Research Institute in the Mathematical Sciences -- HPL-BRIMS-96-11.
- BRIMS technical report -- HPL-BRIMS-96-11.
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!