A golden ratio control policy for a multiple-access channel

A. Itai, Z. Rosberg
1984 IEEE Transactions on Automatic Control  
Consider n stations sharing a single communications channel. Each station has a buffer of length one. If the arrival rate of station i is ri, then 1 -n,(lrr ) 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 -policy and the goldenratio pofiq, are analyzed for a finite and infinite number of stations. The latter is shown to approach a limit which
more » ... roach a limit which is within at least 98.4 percent of the upper bound.
doi:10.1109/tac.1984.1103619 fatcat:4migb7cxbzhw3nliev6secbhza