By Topic

Packet delay under the golden ratio weighted TDM policy in a multiple-access channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

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)

Consider n transmission stations sharing a single communication channel. Packets arrive at the stations according tonindependent renewal processes, possibly with different rates. The transmitters are assumed to be able to store an unlimited number of packets in their buffers. The stations transmit packets during time slots allocated to them according to a given {em conflict-free distributed protocol.} The cost criterion according to which protocols are evaluated is the long-run weighted average buffer occupancies. (The average waiting time is a special case of such a weighting.) A lower bound to the cost criterion under time division multiplexing (TDM) protocols is given, and the costs of two protocols are analyzed. The first protocol is the {em random-control} policy, and the second is the {em golden ratio} policy which is shown to achieve a cost close to the lower bound for realistic parameters.

Published in:

Information Theory, IEEE Transactions on  (Volume:33 ,  Issue: 3 )