Published September 2008
| Version Published
Journal Article
Open
Optimal Universal Schedules for Discrete Broadcast
-
1.
Open University of Israel
-
2.
Texas A&M University
-
3.
California Institute of Technology
Abstract
We study broadcast systems that distribute a series of data updates to a large number of passive clients. The updates are sent over a broadcast channel in the form of discrete packets. We assume that clients periodically access the channel to obtain the most recent update. Such scenarios arise in many practical applications, such as distribution of traffic information and market updates to mobile wireless devices.
Additional Information
© Copyright 2008 IEEE. Reprinted with permission. Manuscript received August 4, 2006; revised January 17, 2008. Published August 27, 2008 (projected). [Date Published in Issue: 2008-08-26]. The work of J. Bruck was supported in part by the Caltech Lee Center for Advanced Networking and by the National Science Foundation under Grants ANI-0322475 and CCF-0346991. Part of this work was performed while M. Langberg and A. Sprintson were Postdoctoral Scholars at the California Institute of Technology, Pasadena.Attached Files
Published - LANieeetit08.pdf
Files
LANieeetit08.pdf
Additional details
Identifiers
- Eprint ID
- 11793
- Resolver ID
- CaltechAUTHORS:LANieeetit08
Funding
- Lee Center for Advanced Networking ,Caltech
- National Science Foundation
- ANI-0322475
- National Science Foundation
- CCF-0346991
Dates
- Created
-
2008-09-29Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field