Published June 2004
| public
Book Section - Chapter
Scheduling for Efficient Data Broadcast over Two Channels
- Creators
- Foltz, Kevin
- Xu, Lihao
-
Bruck, Jehoshua
Chicago
Abstract
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 [1]. 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 [3]. 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.
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.Additional details
- Eprint ID
- 25388
- DOI
- 10.1109/ISIT.2004.1365147
- Resolver ID
- CaltechAUTHORS:20110921-122835869
- Caltech Lee Center for Advanced Networking
- NSF
- ANI-0322615
- NSF
- ANI-0322475
- Created
-
2011-09-23Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 8178578