Published January 10, 2005
| public
Book Section - Chapter
Open
Optimal universal schedules for discrete broadcast
Abstract
This paper investigates an efficient scheduling for sending dynamic data over lossless broadcast channels. A server transmits dynamic data periodically to a number of passive clients and thus the updated discrete packets are sent into a separate packet. The objective of this paper is to design universal schedules that minimize the time that passes between a client's request and the broadcast of a new item, independently of the client's behavior. From the results the optimal scheduling of high transmission rate for discrete broadcast data is obtained by considering adaptive clients.
Additional Information
© Copyright 2004 IEEE. Reprinted with permission. Posted online 10 January 2005 This work was supported in part by the Caltech Lee Center for Advanced Networking and by NSF grant ANI-0322475. We would like to thank Kevin Foltz for useful discussions.Files
LANisit04.pdf
Files
(71.7 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:341a55e9ffed3a26f0db1d44a54855ae
|
71.7 kB | Preview Download |
Additional details
- Eprint ID
- 2611
- Resolver ID
- CaltechAUTHORS:LANisit04
- Created
-
2006-04-12Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field