Consider n stations sharing a single communication channel. Each station has a buffer of length one. If the arrival rate of station i is r//i then 1 minus PI //i(1 minus r//i) is shown to be an upper bound (over all policies) on the throughput of the channel. Moreover, an optimal policy always exists and is stationary and periodic. The throughput of two policies, the Random-Control policy and the Golden-Ratio policy, are analyzed for a finite and infinite number of stations. The latter is shown to approach a limit which is within at least 98. 4% of the upper bound.
|Title of host publication||Unknown Host Publication Title|
|Number of pages||15|
|State||Published - 1 Dec 1984|
ASJC Scopus subject areas
- Engineering (all)