Pull-based data broadcast with dependencies: Be fair to users, not to items

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 238-247

  Robert, Julien ^a   Schabanel, Nicolas ^a,b  

^a CNRS   (France)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

Correlation based; Multicast scheduling; Non clairvoyant scheduling; Pull based broadcast; Resource augmentation

Indexed keywords

BANDWIDTH; SCHEDULING; TELECOMMUNICATION INDUSTRY; TELEPHONE CIRCUITS; WIRELESS TELECOMMUNICATION SYSTEMS;

AVERAGE SERVICE TIME; BROADCAST PROTOCOLS; COMPETITIVE ALGORITHMS; DATA BROADCAST SYSTEMS; MOBILE PHONE NETWORKS; MULTICAST SCHEDULING; RESOURCE AUGMENTATION; WIRELESS COMMUNICATIONS;

ALGORITHMS;

EID: 84969269152     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. N. Bansal, M. Charikar, S. Khanna, and J. S. Naor. Approximating the average response time in broadcast scheduling. In Proc. of the 16th ACM-SIAM Symp. on Discrete Algorithms (SODA 2005), pages 344-353, 2005.
2. N. Bansal, D. Coppersmith, and M. Sviridenko. Improved approximation algorithms for broadcast scheduling. In Proc. of the An. ACM-SIAM Symp. on Discrete Algorithms (SODA 2006), pages 344-353, 2006.
3. A. Bar-Noy, J. S. Naor, and B. Schieber. Pushing dependent data in clients-providers-servers systems. Wireless Networks, 9:421-230, 2003.
4. A. Bar-Noy and Y. Shilo. Optimal broadcasting of two files over an asymmetric channel. J. Parallel Distrib. Comput., 60(4):474-493, 2000. (also published in the Proc. of INFOCOM 1999).
5. K. Cai, H. Lin, and C. Chen. Correlation-based data broadcasting in wireless networks. In LNCS Proc. of the 2nd British National Conf. on Databases (BNCOD 22), volume 3567, pages 111-119, Jul. 2005.
6. S. Dey and N. Schabanel. Customized newspaper broadcast: Data broadcast with dependencies. In Proc. of Lat. Am. Conf. on Theor. INformatic (Latin), pages 362-373, 2006.
7. J. Edmonds. Scheduling in the dark. In STOC, pages 179-188, 1999.
8. J. Edmonds and K. Pruhs. Multicast pull scheduling: When fairness is fine. Algorithmica, 36(3):315-330, 2003. (also published in Proc. of SODA 2002).
9. J. Edmonds and K. Pruhs. A maiden analysis of longest wait first. ACM Trans. Algorithms, 1(1):14-32, 2005.
10. T. Erlebach and A. Hall. NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. In Proc. of Symp. on Discrete Algorithms (SODA), pages 194-202, 2002.
11. R. Gandhi, S. Khuller, Y. A. Kim, and Y.-C. J. Wan. Algorithms for minimizing response time in broadcast scheduling. In Proc. of Conf. on Int. Prog. and Comb. Opt. (IPCO), pages 425-438, 2002.
12. J.-L. Huang and M.-S. Chen. Broadcast program generation for unordered queries with data replication. In Proc. of the ACM Symp. on Applied Computing (SAC 2003), pages 866-870, Mar. 2003.
13. J.-L. Huang and M.-S. Chen. Dependent data broadcasting for unordered queries in a multiple channel mobile environment. IEEE Trans. on Konwledge and Data Engineering, 16(9):1143-1156, Sep. 2004.
14. B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai. Scheduling broadcasts in wireless networks. In Proc. of European Symp. on Algorithms, pages 290-301, 2000.
15. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge university press, 1995.
16. A. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proc. of 17th Symp. on Fond. of Computer. Science (FOCS), pages 222-227, 1977.