By Topic

A golden ratio control policy for a multiple-access channel

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Itai, A. ; Technion-Israel Institute of Technology, Haifa, Israel ; Rosberg, Z.

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-\Pi _{i}(1- 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-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 percent of the upper bound.

Published in:

Automatic Control, IEEE Transactions on  (Volume:29 ,  Issue: 8 )