Foltz, Kevin and Bruck, Jehoshua (2001) Time Division is Better Than Frequency Division for Periodic Internet Broadcast of Dynamic Data. In: 2001 IEEE International Symposium on Information Theory. IEEE , Piscataway, N.J., p. 158. ISBN 0-7803-7123-2 http://resolver.caltech.edu/CaltechAUTHORS:20111117-083940997
Full text is not posted in this repository. Consult Related URLs below.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20111117-083940997
We consider two ways to send items over a broadcast channel and compare them using the metric of expected waiting time. The first is frequency division, where each item is broadcast on its own subchannel of lower bandwidth. We find the optimal allocation of bandwidth to the subchannels for this method. Then we look at time division, where items are sent sequentially on a single full-bandwidth channel. We show that for any frequency division broadcast schedule, we can find a better time division schedule. Thus time division is better than frequency division.
|Item Type:||Book Section|
|Additional Information:||© 2001 IEEE. Date of Current Version: 07 August 2002. This research was partially supported by the Lee Center for Advanced Networking at Caltech.|
|Other Numbering System:|
|Official Citation:||Foltz, K.; Bruck, J.; , "Time division is better than frequency division for periodic Internet broadcast of dynamic data," Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on , vol., no., pp.158, 2001 doi: 10.1109/ISIT.2001.936021 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=936021&isnumber=20241|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Ruth Sustaita|
|Deposited On:||17 Nov 2011 19:33|
|Last Modified:||23 Aug 2016 10:07|
Repository Staff Only: item control page