在傳輸資源有限，並且需求重疊性達到某種程度以上的無線環境中，特別需要廣播技術；所以，本研究歸納出廣播排程領域目前受到探討的領域維度，並參考在具有動態但單一資料項需求之特色的無線環境中，已被提出的排程方式，對於動態且集合型態資料項需求的無線環境，建立一種Wp

In this thesis, we study the broadcast scheduling algorithms in a dynamic environment with set-typed data requests. We sketch the dimensions of broadcasting paradigms and build a family of Wp

Chapter 1. Introduction 9
1.1 Background 9
1.2 Contributions 12
Chapter 2. Literature Review 14
2.1 Target dimensions 14
2.2 Static Scheduling for Single Item Data Requests 14
2.3 Static Scheduling for Set-typed Data Requests 16
2.3.1 QEM 16
2.3.2 CWT 19
2.4 Dynamic Scheduling for Single Item Data Requests 20
2.4.1 Generalization 20
2.4.2 R×W and LWF 22
Chapter 3. Dynamic Scheduling for Set-typed Data Requests 25
3.1 Foreword 25
3.2 Notations 25
3.3 LWFitem 26
3.4 Wp

[AAAI] American Association for Artificial Intelligence: George Kingsley Zipf (1902-1950) -> Zipf's Law, Retrieved May 31, 2002 from AAAI on the World Wide Web: http://www.aaai.org/AITopics/html/name.html
[AF98] D. Aksoy, M. Franklin, “Scheduling for large-scale on-demand data broadcasting,” Proc. IEEE INFOCOM Conf., pp. 651-659, 1998.
[AF99] D. Aksoy, M. Franklin, “RxW: A scheduling approach for large-scale on-demand data broadcast,” IEEE/ACM Trans. Networking, vol.7, no.6, pp. 846-860, December 1999.
[AFZ95a] S. Acharya, M. Franklin, and S. Zdonik, “Dissemination-based data delivery using broadcast disks,” IEEE Personal Communication, pp. 50-60, December 1995.
[AFZ95b] S. Acharya, R. Alonso, M. Franklin, and S. Zdonik, “Broadcast disks: data management for asymmetric communication environments,” Proc. ACM SIGMOD Intl. Conf. on Management of Data, pp. 199-210, San Jose, CA, May 1995.
[AFZ97] S. Acharya, M. Franklin, and S. Zdonik, “Balancing push and pull for data broadcast,” Proc. of ACM SIGMOD Intl. Conf. on Management of Data, pp. 183-194, May 1997
[AM98] S. Acharya, S. Muthukrishnan, “Scheduling on-demand broadcasts: new metrics and algorithms,” Proc. of ACM/IEEE Intl. Conf. on Mobile computing and networking, pp. 43-54, Oct. 1998
[AW85] M. H. Ammar, and J. W. Wong, “The design of teletext broadcast cycles,” Performance Evaluation, vol. 5, pp. 235-242, Dec. 1985.
[AW87] M. H. Ammar, and J. W. Wong, “On the optimality of cyclic transmissions in teletext systems,” IEEE Trans. Commun., vol. 35, pp. 68-73, Jan. 1987.
[BBN98] A. Bar-Noy, R. Bhatia, J. Naor, B. Schieber, “Minimizing service and operations cost of periodic scheduling,” Proc. ACM-SIAM Symposium on Discrete Algorithms, 1998.
[BPZ00] A. Bar-Noy, B. Patt-Shamir, I. Ziper, “Broadcast disks with polynomial cost functions,” Proc. of IEEE INFOCOM, vol.2, pp. 575–584, 2000.
[CK99] Y. D. Chung, and M.H. Kim, “QEM: A scheduling method for wireless broadcast data,” Proc. of the 6th Intl. DASFAA Conf., pp. 135-142, April 1999.
[DAW86] H. D. Dykeman, M. H. Ammar, and J. W. Wong, “Scheduling algorithms for videotex system under broadcast delivery,” Proceedings of ICC’86,
pp. 1847-1851, 1986.
[DR00] S. G. Dykes and K. A. Robbins, “Correcting the application of Zipf's Law to Web proxy caching,” SIGCOMM poster presentation, 2000.
[HCT01] S. -Y. Hwang, J. -K. Chiu, S. -C. Tsai, “Broadcasting shared results in a pull-based wireless environment”, unpublished manuscript.
[HV99] S. Hameed, N. H. Vaidya, “Efficient algorithms for scheduling data broadcast,” Wireless Network, vol.5, no.3, pp. 183-193, 1999.
[IV97] T. Imielinski, S. Viswanathan, and BR Badrinath, “Data on air: organization and access,” IEEE Transactions on Knowledge and Data Engineering, vol.9, no.3, pp. 353–372, 1997.
[JV99] S. Jiang, N. Vaidya, “Scheduling data broadcast to impatient users,” Proc. ACM International workshop on Data engineering for wireless and mobile access, pp. 52-59, 1999.
[K99] C.H. Ke, “Broadcast scheduling for multiple channels in wireless information systems,” Proc. National Computer Symposium, vol.3, pp. 525-532, 1999.
[KZ00] S. Khanna, S. Zhou, “On Indexed Data Broadcast,” Journal of Computer and System Sciences, vol. 60, pp. 575–591, 2000.
[L] J. T. Lin, Retrieved May 31, 2002 from NTHU on the World Wide Web: http://cimlab.ie.nthu.edu.tw/Simulation/csimt/csimt.html
[LC00] S. -C. Lo, Arbee L.P. Chen, “An adaptive access method for broadcast data under an error-prone mobile environment”, IEEE Transactions on Knowledge and Data Engineering, vol.12, no.4, July/August, 2000.
[LL96] W.C. Lee, D.L. Lee, “Using signature techniques for information filtering in wireless and mobile environments,” Distributed and Parallel Databases, vol.4, no.3, pp. 205–227, 1996.
[LS95] H.V. Leong, A. Si, “Data broadcasting strategies over multiple unreliable wireless channels,” Proc. 4th Intl. Conf. ACM Information and Knowledge Management, pp. 96-104, November 1995.
[S86] H. D. Schwetman, “CSIM: A C-based process oriented simulation
language,” Proc. Winter Simulation Conf., pp. 387–396, 1986.
[ST97] C.J. Su, L. Tassiulas, “Broadcast scheduling for information distribution,” Proc. IEEE INFOCOM Conf., vol.1, pp. 109-117, 1997.
[ST00] C.J. Su, L. Tassiulas, “Joint broadcast scheduling and user’s cache management for efficient information delivery,” Wireless Networks, vol.6, pp. 279-288, July 2000.
[WC01] Yiqiong Wu, Guohong Cao, “Stretch-optimal scheduling for on-demand data broadcasts,” Proc. Computer Communications and Networks, pp. 500 -504, 2001.
[Y00] Che-Nan Yang, “A Complementary Approach to Data Broadcasting in Mobile Information Systems.” Master Thesis, Dept. of Computer Science and Engineering, National Sun Yat-sen University, June 2000.