Pushing Dependent Data in Clients–Providers–Servers Systems
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
In 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 better represents certain environments 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 de-randomizing the procedure that is based on selecting a random order. The resulting algorithm is a polynomial-time deterministic algorithm that finds an order with the same performance bounds as those of the random order.
- S. Acharya, R. Alonso, M.J. Franklin and S. Zdonik, Broadcast Disks: data management for asymmetric communications environment, in: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'95), San Jose, CA (1995) pp. 199–210.
- S. Acharya, M.J. Franklin and S. Zdonik, Dissemination-based data delivery using Broadcast Disks, IEEE Personal Communications 2(6) (1995) 50–60.
- M.H. Ammar and J.W. Wong, The design of Teletext broadcast cycles, Performance Evaluation 5(4) (1985) 235–242.
- M.H. Ammar and J.W. Wong, On the optimality of cyclic transmission in Teletext systems, IEEE Transactions on Communication COM-35(1) (1987) 68–73.
- A. Bar-Noy, R. Bhatia, J. Naor and B. Schieber, Minimizing service and operation costs of periodic scheduling, in: Proceedings of the 9th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA'98) (1998) pp. 11–20, to appear in Mathematics of Operations Research.
- A. Bar-Noy and Y. Shilo, Optimal broadcasting of two files over an asymmetric channel, in: Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM' 99) (1999) pp. 267–274.
- V. Gondhalekar, R. Jain and J. Werth, Scheduling on airdisks: efficient access to personalized information services via periodic wireless data broadcast, The University of Texas at Austin, Department of Computer Sciences, Technical Report TR-96-25 (October 1996).
- T. Imielinski, S. Viswanathan and B. Badrinath, Energy efficient indexing on air, in: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'94) (1994) pp. 25–36.
- C. Kenyon and N. Schabanel, The data broadcast problem with nonuniform transmission times, in: Proceedings of the 10th Annual ACMSIAM Symposium on Discrete Algorithms (SODA'99) (1999) pp. 547–556.
- S. Rao and A. Richa, New approximation techniques for some ordering problems, in: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'98) (1998) pp. 211–218.
- C.J. Su and L. Tassiulas, Broadcast scheduling for information distribution, in: Proceedings of the 16th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'97) (1997) pp. 109–117.
- N. Vaidya and S. Hameed, Log time algorithms for scheduling single and multiple channel data broadcast, in: Proceedings of the 3rd Annual ACM/IEEE International Conference on Mobile Computing and Networking (1997) pp. 90–99.
- Pushing Dependent Data in Clients–Providers–Servers Systems
Volume 9, Issue 5 , pp 421-430
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- broadcast disks
- Industry Sectors
- Author Affiliations
- 1. Computer and Information Science Department, Brooklyn College, 2900 Bedford Avenue, Brooklyn, NY, 11210, USA
- 2. Computer Science Department, Technion, Haifa, 32000, Israel
- 3. IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY, 10598, USA