Abstract
It is shown that if a queueing network is stable with fluid arrival processes, then it is also stable for deterministically constrained bursty arrival processes of the same or smaller long-term rate.
| Original language | English (US) |
|---|---|
| Number of pages | 1 |
| State | Published - 1995 |
| Event | Proceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can Duration: Sep 17 1995 → Sep 22 1995 |
Other
| Other | Proceedings of the 1995 IEEE International Symposium on Information Theory |
|---|---|
| City | Whistler, BC, Can |
| Period | 9/17/95 → 9/22/95 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics