Broadcast Disks with Polynomial Cost Functions

Wireless Networks

Volumn 10, Issue 2, 2004, Pages 157-168

  Bar Noy, Amotz ^a   Patt Shamir, Boaz ^b   Ziper, Igor ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Broadcast disks; Satellite networks; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BANDWIDTH; COMPUTER SIMULATION; COSTS; DATABASE SYSTEMS; MATHEMATICAL MODELS; POLYNOMIALS; RADIO BROADCASTING; SCHEDULING; TELECOMMUNICATION NETWORKS;

BROADCAST DISKS; GREEDY ALGORITHMS; SATELLITE NETWORKS;

SATELLITE COMMUNICATION SYSTEMS;

EID: 1042275392     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:WINE.0000013080.64575.c1     Document Type: Article

References (28)

1. S. Acharya, R. Alonso, M.J. Franklin and S. Zdonik, Broadcast disks: data management for asymmetric communications environment, in: Proc. of ACM SIGMOD Int. Conference on Management of Data (SIG-MOD'95), San Jose, CA (June 1995) pp. 199-210.
2. S. Acharya, M.J. Franklin and S. Zdonik, Dissemination-based data delivery using broadcast disks, IEEE Personal Communications 2(6) (1995) 50-60.
3. M.H. Ammar and J.W. Wong, The design of teletext broadcast cycles, Performance Evaluation 5(4) (1985) 235-242.
4. M.H. Ammar and J.W. Wong, On the optimality of cyclic transmission in teletext systems, IEEE Transactions on Communication 35(1) (1987) 68-73.
5. S. Anily and J. Bramel, Periodic scheduling with service constraints, Manuscript (1997).
6. S. Anily, C.A. Glass and R. Hassin, The scheduling of maintenance service, Discrete Applied Mathematics 82 (1998) 27-42.
7. S. Anily, C.A. Glass and R. Hassin, Scheduling maintenance service to three machines, Annals of Operation Research 86 (1999) 375-391.
8. A. Bar-Noy, R. Bhatia, J. Naor and B. Schieber, Minimizing service and operation costs of periodic scheduling, Mathematics of Operations Research 27(3) (August 2002) 518-544.
9. A. Bar-Noy and Y. Shilo, Optimal broadcasting of two files over an asymmetric channel, Journal of Parallel and Distributed Computing 60(4) (April 2000) 474-493.
10. L. Breslau, P. Cao, L. Fan, G. Phillips and S. Shenker, Web caching and Zipf-like distributions: evidence and implications, in: Proc. of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'99) (1999).
11. M.Y. Chan and F. Chin, Schedulers for larger classes of pinwheel instances, Algorithmica 9 (1993) 425-462.
12. M.Y. Chan and F. Chin, General schedulers for the pinwheel problem based on double-integer reduction, IEEE Transactions on Computers 41(6) (June 1992) 755-768.
13. C.A. Glass, Feasibility of scheduling lot sizes of three products on one machine, Management Science 38 (1992) 1482-1494.
14. C.A. Glass, Feasibility of scheduling lot sizes of two frequencies on one machine, European Journal of Operation Research 75 (1994) 354-364.
15. R. Hassin and N. Megiddo, Exact computation of optimal inventory policies over an unbounded horizon, Mathematics of Operations Research 16 (1991) 534-546.
16. M. Hofri and Z. Rosberg, Packet delay under the golden ratio weighted TDM policy in a multiple-access channel, IEEE Transactions on Information Theory 11-33 (1987) 341-349.
17. R. Holte, L. Rosier, I. Tulchinsky and D. Varvel, Pinwheel scheduling with two distinct numbers, Theoretical Computer Science 100 (1992) 105-135.
18. T. Imielinski, S. Viswanathan and B. Badrinath, Energy efficient indexing on air, in: Proc. of ACM SIGMOD International Conference on Management of Data (SIGMOD'94) (1994) pp. 25-36.
19. A. Itai and Z. Rosberg, A golden ratio control policy for a multiple-access channel, IEEE Transactions on Automatic Control 29 (1984) 712-718.
20. C. Kenyon and N. Schabanel, The data broadcast problem with non-uniform transmission times, in: Proc. of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99) (1999) pp. 547-556.
21. D.E. Knuth, The Art of Computer Programming, Vol. 1 (Addison-Wesley, Reading, MA, 1973).
22. Z. Rosberg, Cell multiplexing in ATM networks, IEEE Transactions on Networking 4 (February 1996) 112-122.
23. R. Roundy, 98%-effective integer-ratio lot-sizing for one-warehouse multi-retailer systems, Management Science 31 (1985) 1416-1430.
24. C.J. Su and L. Tassiulas, Broadcast Scheduling for Information Distribution, in: Proc. of the 16th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'97) (1997) pp. 109-117.
25. N. Vaidya and S. Hameed, Log time algorithms for scheduling single and multiple channel data broadcast, in: Proc. of the 3rd Annual ACM/IEEE International Conference on Mobile Computing and Networking (1997) pp. 90-99.
26. N. Vaidya and S. Hameed, Data broadcast scheduling: On-line and off-line algorithms, Technical report 96-017, Computer Science, Texas A&M University (July 1996).
27. W. Wei and C. Liu, On a periodic maintenance problem, Operations Research Letters 2 (1983) 90-93.
28. J.W. Wong, Broadcast delivery, Proceedings of IEEE (December 1988) 1566-1577.