Efficient periodic scheduling by trees

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2002, Pages 791-800

  Bar Noy, Amotz ^a   Dreizin, Vladimir ^b   Patt Shamir, Boaz ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Bluetooth; Broadcast disks; Fair scheduling; Periodic schedules; Push systems

Indexed keywords

ALGORITHMS; BROADCASTING; COMPUTATIONAL COMPLEXITY; FREQUENCY DOMAIN ANALYSIS; HEURISTIC METHODS; OPTIMIZATION; QUALITY OF SERVICE; SCHEDULING; TIME DOMAIN ANALYSIS; TREES (MATHEMATICS);

BLUETOOTH NETWORKS; FAIR SCHEDULING; HEURISTIC ALGORITHMS; PERIODIC SCHEDULING; PUSH SYSTEMS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0036346358     PISSN: 0743166X     EISSN: None     Source Type: Journal    
DOI: 10.1109/INFCOM.2002.1019325     Document Type: Article

References (21)

1. Broadcast disks: Data management for asymmetric communications environment
2. The scheduling of maintenance service
3. The design and analysis of computer algorithms
4. The design of teletext broadcast cycles
5. On the optimality of cyclic transmission in teletext systems
6. Minimizing service and operation costs of periodic scheduling
7. A time-space tradeoff for sorting on a general sequential model of computation
8. Nearly optimal perfectly-periodic schedules
9. Broadcast disks with polynomial cost functions
10. Bluetooth technical specifications, version 1.1
11. Web caching and zipf distributions: Evidence and implications
12. Efficient periodic scheduling by trees
13. A method for the construction of minimum redundancy codes
14. Polinomial-time approximation scheme for data broadcast
15. On indexed data broadcast
16. Broadcast scheduling for information distribution
17. The chairman assignment problem
18. Data broadcast: On-line and off-line algorithms
19. Log time algorithms for scheduling single and multiple channel data broadcast
20. On a periodic maintenance problem
21. Human behaviour and the principle of least effort