Foltz, Kevin and Xu, Lihao and Bruck, Jehoshua (2004) Scheduling for Efficient Data Broadcast over Two Channels. In: 2004 IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ, p. 113. ISBN 0-7803-8280-3 http://resolver.caltech.edu/CaltechAUTHORS:20110921-122835869
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:20110921-122835869
As wireless computer networks grow more popular, we are faced with the problem of providing scalable, high-bandwidth service to a growing number of users. In the wireless domain, “data push” promises to provide superior performance for many applications . The broadcast domain that is typical of wireless communication is very effective in distributing information to large audiences. Work has been done to schedule data broadcast from a server to many clients using the broadcast disk model . However, little of it has looked at methods for more than one channel. We examine a simple two-channel broadcast model and present some interesting scheduling results for this model.
|Item Type:||Book Section|
|Additional Information:||© 2004 IEEE. Issue Date: 27 June-2 July 2004; Date of Current Version: 10 January 2005. This work was in part supported by the Lee Center for Advanced Networking and NSF grants ANI-0322615 and ANI-0322475.|
|Other Numbering System:|
|Official Citation:||Foltz, K.; Xu, L.; Bruck, J.; , "Scheduling for efficient data broadcast over two channels," Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on , vol., no., pp. 113, 27 June-2 July 2004 doi: 10.1109/ISIT.2004.1365147|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Jason Perez|
|Deposited On:||23 Sep 2011 14:35|
|Last Modified:||23 Aug 2016 10:05|
Repository Staff Only: item control page