Abstract
Broadcasting has been proved to be an efficient means of disseminating data in wireless communication environments (such as Satellite, mobile phone networks; other typical broadcast networks are Videotext systems). Recent works provide strong evidence that correlation-based broadcast can significantly improve the average service time of broadcast systems. Most of the research on data broadcasting was done under the assumption that user requests are for a single item at a time and are independent of each other. However in many real world applications, such as web servers, dependencies exist among the data items, for instance: web pages on a server usually share a lot of items such as logos, style sheets, title-bar... and all these components have to be downloaded together when any individual page is requested. Such web server could take advantage of the correlations between the components of the pages, to speed up the broadcast of popular web pages. This paper presents a theoretical analysis of data dependencies and provides a polynomial time 4-approximation as well as theoretical proofs that our correlation-based approach can improve by an arbitrary factor the performances of the system. To our knowledge, our solutions are the first provably efficient algorithms to deal with dependencies involving more than two data items.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Acharya, S.: Broadcast Disks: Dissemination-based Management for Assymmetric Communication Environments. PhD thesis, Brown University (May 1998)
Ammar, M.H., Wong, J.W.: The design of teletext broadcast cycles. Performance Evaluation 5(4), 235–242 (1985)
Anily, S., Glass, C.A., Hassin, R.: The scheduling of maintenance service (1995)
Bansal, N., Charikar, M., Khanna, S., Naor, J.S.: Approximation the average response time in broadcast scheduling. In: Proc. of ACM-SIAM SODA (2005)
Bar-Noy, A., Bhatia, R., Naor, J.S., Schieber, B.: Minimizing service and operation costs of periodic scheduling. Math. of Op. Research 27(3), 518–544 (2002)
Bar-Noy, A., Naor, J.S., Schieber, B.: Pushing dependent data in clientsproviders- servers systems. Wireless Networks 9, 421–430 (2003)
Bar-Noy, A., Nisgav, A., Patt-Shamir, B.: Nearly optimal perfectly-periodic schedules. In: Proc. of ACM PODC 2001, pp. 107–116 (2001)
Bar-Noy, A., Shilo, Y.: Optimal broadcasting of two files over an asymmetric channel. J. Parallel Distrib. Comput. 60(4), 474–493 (2000)
Brakerski, Z., Dreizin, V., Patt-Shamir, B.: Dispatching in perfectly-periodic schedules. J. Algorithms 49(2), 219–239 (2003)
Cai, K., Lin, H., Chen, C.: Correlation-based data broadcasting in wireless networks. In: Jackson, M., Nelson, D., Stirk, S. (eds.) BNCOD 2005. LNCS, vol. 3567, pp. 111–119. Springer, Heidelberg (2005)
Edmonds, J., Pruhs, K.: Multicast pull scheduling: When fairness is fine. Algorithmica 36(3), 315–330 (2003)
Feller, W.: An Introduction to Probability Theory, 3rd edn., vol. I. John Wiley & Sons, Chichester (1968)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1988)
Huang, J.-L., Chen, M.-S.: Broadcast program generation for unordered queries with data replication. In: Proc. of the ACM SAC, March 2003, pp. 866–870 (2003)
Huang, J.-L., Chen, M.-S.: Dependent data broadcasting for unordered queries in a multiple channel mobile environment. IEEE Trans. on Knowledge and Data Engineering 16(9), 1143–1156 (2004)
Kenyon, C., Schabanel, N.: The data broadcast problem with non-uniform transmission time. Algorithmica 35, 147–175 (2002)
Kenyon, C., Schabanel, N., Young, N.: Polynomial-time approximation scheme for data broadcast. In: Proc. of ACM STOC, pp. 659–666 (2000)
Ovalle-Martínez, F.J., González, J.S., Stojmenović, I.: A parallel hill climbing algorithm for pushing dependent data in clients-providers-servers systems. Mobile Network and Applications 9, 257–264 (2004)
Schabanel, N.: The data broadcast problem with preemption. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 181–192. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dey, S., Schabanel, N. (2006). Customized Newspaper Broadcast: Data Broadcast with Dependencies. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_35
Download citation
DOI: https://doi.org/10.1007/11682462_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32755-4
Online ISBN: 978-3-540-32756-1
eBook Packages: Computer ScienceComputer Science (R0)