Energy efficient indexing on air
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Log-time algorithms for scheduling single and multiple channel data broadcast
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Minimizing service and operation costs of periodic scheduling
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
New approximation techniques for some ordering problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The data broadcast problem with non-uniform transmission times
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Broadcast Scheduling for Information Distribution
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Windows scheduling problems for broadcast systems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Data Allocation on Wireless Broadcast Channels for Efficient Query Processing
IEEE Transactions on Computers
Broadcast data allocation for efficient access of multiple data items in mobile environments
Mobile Networks and Applications
Adaptive dissemination of dynamic information services in an extended data broadcast environment
Proceedings of the 2003 ACM symposium on Applied computing
The directed circular arrangement problem
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Circular arrangements and cyclic broadcast scheduling
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
An Efficient Algorithm for Near Optimal Data Allocation on Multiple Broadcast Channels
Distributed and Parallel Databases
Design and Performance Evaluation of Broadcast Algorithms for Time-Constrained Data Retrieval
IEEE Transactions on Knowledge and Data Engineering
Research in mobile database query optimization and processing
Mobile Information Systems
Towards realizable, low-cost broadcast systems for dynamic environments
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In a satellite and wireless networks and in advanced traffic information systems in which the up-link bandwidth is very limited, a server broadcasts data files in a round-robin manner. The data files are provided by different providers and are accessed by many clients. The providers are independent and therefore files may share information. The clients who access these files may have different patterns of access. Some clients may wish to access more than one file at a time in any order, some clients may access one file out of of several files, and some clients may wish to access a second file only after accessing another file. The goal of the server is to order the files in a way that minimizes the access time of the clients given some a-priori knowledge of their access patterns. This paper introduces a clients-providers-servers model that represents certain environments better than the traditional clients-servers model. Then, we show that a random order of the data files performs well independent of the specific access pattern. Our main technical contribution is showing how to de-randomize the randomized algorithm that is based on selecting a random order. The resulting algorithm is a polynomial time deterministic algorithm that finds an order that achieves the bounds of the random order.