Pushing dependent data in clients-providers-servers systems

Wireless Networks

Volumn 9, Issue 5, 2003, Pages 421-430

  Bar Noy, Amotz ^a   Naor, Joseph Seffi ^b   Schieber, Baruch ^c  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Broadcast disks; Clients providers servers; De randomization; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BANDWIDTH; DATA COMMUNICATION SYSTEMS; PERFORMANCE; POLYNOMIALS; SCHEDULING; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC; THEOREM PROVING;

CLIENTS-PROVIDERS-SERVERS SYSTEMS; DE-RANDOMIZATION; POLYNOMIAL-TIME DETERMINISTIC ALGORITHM; UP-LINK BANDWIDTH;

CLIENT SERVER COMPUTER SYSTEMS;

EID: 0041473760     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1024632031440     Document Type: Article

References (12)

1. S. Acharya, R. Alonso, M.J. Franklin and S. Zdonik, Broadcast Disks: data management for asymmetric communications environment, in: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'95), San Jose, CA (1995) pp. 199-210.
2. S. Acharya, M.J. Franklin and S. Zdonik, Dissemination-based data delivery using Broadcast Disks, IEEE Personal Communications 2(6) (1995) 50-60.
3. M.H. Ammar and J.W. Wong, The design of Teletext broadcast cycles, Performance Evaluation 5(4) (1985) 235-242.
4. M.H. Ammar and J.W. Wong, On the optimality of cyclic transmission in Teletext systems, IEEE Transactions on Communication COM-35(1) (1987) 68-73.
5. A. Bar-Noy, R. Bhatia, J. Naor and B. Schieber, Minimizing service and operation costs of periodic scheduling. in: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'98) (1998) pp. 11-20, to appear in Mathematics of Operations Research.
6. A. Bar-Noy and Y. Shilo, Optimal broadcasting of two files over an asymmetric channel, in: Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'99) (1999) pp. 267-274.
7. V. Gondhalekar, R. Jain and J. Werth, Scheduling on airdisks: efficient access to personalized information services via periodic wireless data broadcast, The University of Texas at Austin, Department of Computer Sciences, Technical Report TR-96-25 (October 1996).
8. T. Imielinski, S. Viswanathan and B. Badrinath, Energy efficient indexing on air, in: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'94) (1994) pp. 25-36.
9. C. Kenyon and N. Schabanel, The data broadcast problem with non-uniform transmission times, in: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99) (1999) pp. 547-556.
10. S. Rao and A. Richa, New approximation techniques for some ordering problems, in: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'98) (1998) pp. 211-218.
11. C.J. Su and L. Tassiulas, Broadcast scheduling for information distribution, in: Proceedings of the 16th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'97) (1997) pp. 109-117.
12. N. Vaidya and S. Hameed, Log time algorithms for scheduling single and multiple channel data broadcast, in: Proceedings of the 3rd Annual ACM/IEEE International Conference on Mobile Computing and Networking (1997) pp. 90-99.