Affiliation:
1. Bell Laboratories, Murray Hill, NJ
Abstract
We show that for any
r
> 0, there is a network of First-In-First-Out servers and a fixed set of sessions such that:
—The network load is
r
with respect to the permanent sessions model with bounded arrivals.
—The network can be made unstable.
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献