The data broadcast problem with non-uniform transmission times

Algorithmica (New York)

Volumn 35, Issue 2, 2003, Pages 146-175

  Kenyon, Claire ^a   Schabanel, Nicolas ^b  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

Approximation algorithms; Data broadcasting; NP completeness; Randomized algorithms; Scheduling

Indexed keywords

APPROXIMATION THEORY; BROADCASTING; COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES; SCHEDULING;

DATA BROADCAST PROBLEM; MAINTENANCE SCHEDULING PROBLEM; MULTI-ITEM REPLENISHMENT PROBLEM;

ALGORITHMS;

EID: 0942279284     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-002-0990-5     Document Type: Article

References (23)

1. A. Acharya, M. Franklin, and S. Zdonik. Balancing push and pull for data broadcast. In Proc. of the ACM International Conf. on Management of Data (SIGMOD '97), Tuczon, AZ, pages 183-194, May 1997. Available at www.cs.brown.edu/research/ddg.
2. S. Acharya. Broadcast Disks: Dissemination-Based Management for Assymmetric Communication Environments. Ph.D. thesis, Brown University, May 1998. Available at www.bell-labs.com/~acharya.
3. S. Acharya, R. Alonso, M. J. Franklin, and S. Zdonik. Broadcast disks: data management for asymmetric communications environment. In Proc. of the ACM International Conf. Management of Data (SIGMOD '95), Santa Cruz, CA, pages 199-210, June 1995. Available at www.cs.brown.edu/research/ddg.
4. M. H. Ammar. Response time in a teletext system: an individual user's perspective. IEEE Trans. Comm., COM-35(11):1159-1170, 1987.
5. M. H. Ammar and J. W. Wong. The design of teletext broadcast cycles. Perform. Eval., 5(5):235-242, 1985.
6. M. H. Ammar and J. W. Wong. On the optimality of cyclic transmission in teletext systems. IEEE Trans. Comm., COM-35(11):1159-1170, 1987.
7. S. Anily, C. A. Glass, and R. Hassin. The scheduling of maintenance service. Discrete Appl. Math., 82:27-42, 1998.
8. A. Bar-Noy, R. Bhatia, J.(S.) Naor, and B. Schieber. Minimizing service and operation costs of periodic scheduling. In Proc. of the 9th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA '98), pages 11-20, 1998.
9. A. Bar-Noy, A. Nisgav, and B. Patt-Shamir. Nearly optimal perfectly periodic schedules. In Proc. of the ACM Symp. on Principles of Distributed Computing (PODC 2001), pages 107-116, 2001.
10. A. Bar-Noy and Y. Shilo. Optimal broadcasting of two files over an asymmetric channel. J. Parallel Distrib. Comput., 60(4):474-493, 2000.
11. A. Bestavros. Speculative data dissemination and service to reduce server load, network traffic and service time in distributed information systems. In Proc. of the 1996 International Conf. on Data Engineering (ICDE '96), pages 180-189, March 1996. Available at cs-www.bu.edu/~best.
12. J. Edmond and K. Pruhs. Broadcast scheduling: when fairness is fine. In Proc. of the 13th ACM-SIAM Symp. on Discrete Algorithms (SODA 2002), pages 421-432, Jan. 2002. Available at www.cs.pitt.edu/~kirk/papers.
13. W. Feller. An Introduction to Probability Theory, volume I, 3rd edition. Wiley, New York, 1968.
14. M. R. Garey and D. S. Johnson. Computers and Intractability, a Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
15. J. Gecsei. The Architecture of Videotex Systems. Prentice-Hall, Englewood Cliffs, NJ. 1983.
16. C. Kenyon and N. Schabanel. The data broadcast problem with non-uniform time. In Proc. of the 10th Symp. on Discrete Algorithms (SODA '99), pages 547-556, Jan. 1999. Available at www.ens-lyon.fr/~nschaban.
17. C. Kenyon and N. Schabanel, and N. Young. A polynomial-time approximation scheme for the data broadcast problem. In Proc. of the 32nd ACM Symp. on Theory of Computing (STOC 2000), pages 659-666, Portland, OR, May 2000, Available at www.ens-lyon.fr/~nschaban.
18. S. Khanna and S. Zhou. On indexed data broadcast. In Proc. of the 30th ACM Symp. on Theory of Computing (STOC 1998), pages 463-472, 1998.
19. N. Schabanel. Algorithmes d'approximation pour les télécommunications sans fils: Ordonnancement pour la dissémination de données et allocation statique de fréquences. Ph.D. Thesis no 00ENSL0145, LIP, ENS-Lyon, Jan. 2000. Available (in French) at www.ens-lyon.fr/~nschaban.
20. N. Schabanel. The data broadcast problem with preemption. In Proc. of the 17th International Symp. on Theoretical Computer Science (STACS 2000), pages 181-192, Feb. 2000. LNCS 1770. Springer-Verlag, Berlin. Available at www.ens-lyon.fr/~nschaban.
21. C.-J. Su and L. Tassiulas. Broadcast scheduling for information distribution. In Proc. of INFOCOM, pages 109-117, 1997.
22. N. Vaidya and S. Hameed. Efficient algorithms for scheduling single and multiple channel data broadcast. Tech. Report 97-002, Texas A&M University, Feb. 1997.
23. N. Vaidya and S. Hameed. Log time algorithms for scheduling single and multiple channel data broadcast. In Proc. of the 3rd ACM/IEEE Conf. on Mobile Computing and Networking (MOBICOM), pages 90-99, Sept. 1997.