Polynomial-time approximation scheme for data broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Optimal broadcasting of two files over an asymmetric channel
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile computing and communications
Nearly optimal perfectly-periodic schedules
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
The Data Broadcast Problem with Preemption
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Minimizing Service and Operation Costs of Periodic Scheduling
Mathematics of Operations Research
Broadcast disks: dissemination-based data management for asymmetric communication environments
Broadcast disks: dissemination-based data management for asymmetric communication environments
Pushing dependent data in clients-providers-servers systems
Wireless Networks
Broadcast program generation for unordered queries with data replication
Proceedings of the 2003 ACM symposium on Applied computing
Dispatching in perfectly-periodic schedules
Journal of Algorithms
A parallel hill climbing algorithm for pushing dependent data in clients-providers-servers systems
Mobile Networks and Applications
Dependent Data Broadcasting for Unordered Queries in a Multiple Channel Mobile Environment
IEEE Transactions on Knowledge and Data Engineering
Approximating the average response time in broadcast scheduling
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Correlation-based data broadcasting in wireless networks
BNCOD'05 Proceedings of the 22nd British National conference on Databases: enterprise, Skills and Innovation
Pull-based data broadcast with dependencies: be fair to users, not to items
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
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.