Foltz, Kevin and Bruck, Jehoshua (2002) Robustness of Time-Division Schedules for Internet Broadcast. In: 2002 IEEE International Symposium on Information Theory. IEEE , Piscataway, N.J. , p. 383. ISBN 0-7803-7501-7 http://resolver.caltech.edu/CaltechAUTHORS:20111102-132442999
Full text not available from this repository.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20111102-132442999
The model we consider consists of a server and many clients. The clients have a large incoming bandwidth and little or no outgoing bandwidth. The server repeatedly broadcasts information through the air to the clients. There are two information items with lengths l_1 and l_2, and demand probabilities p_1 and p_2. The demand probability of an item is simply the relative frequency of requests for that item by the clients, scaled such that the sum of the p_i's is 1. These items contain static data. This allows us to receive data out of order and use parts of different broadcasts to reassemble items. The metric we use to evaluate broadcast schedules is expected waiting time. This is the expected time a client must wait for an item, averaged over all items and clients, with weight p_i for item i.
|Item Type:||Book Section|
|Additional Information:||© 2002 IEEE. Date of Current Version: 26 February 2004. This work was partially supported by the Lee Center for Advanced Networking at Caltech.|
|Other Numbering System:|
|Official Citation:||Foltz, K.; Bruck, J.; , "Robustness of time-division schedules for Internet broadcast," Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on , vol., no., pp. 383, 2002 doi: 10.1109/ISIT.2002.1023655 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1023655&isnumber=21920|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Ruth Sustaita|
|Deposited On:||03 Nov 2011 02:37|
|Last Modified:||03 Nov 2011 02:37|
Repository Staff Only: item control page