| A near optimal algorithm for generating broadcast programs on multiple channels |
| Full text |
Pdf
(1.53 MB)
|
| Source
|
Conference on Information and Knowledge Management
archive
Proceedings of the tenth international conference on Information and knowledge management
table of contents
Atlanta, Georgia, USA
Session: Potpourri
table of contents
Pages: 303 - 309
Year of Publication: 2001
ISBN:1-58113-436-3
|
|
Authors
|
|
Chih-Hao Hsu
|
National Tsing Hua University, Hsinchu, Taiwan 300, R.O.C.
|
|
Guanling Lee
|
National Tsing Hua University, Hsinchu, Taiwan 300, R.O.C.
|
|
Arbee L. P. Chen
|
National Tsing Hua University, Hsinchu, Taiwan 300, R.O.C.
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 6, Downloads (12 Months): 23, Citation Count: 8
|
|
|
ABSTRACT
In a wireless environment, the bandwidth of the channels and the energy of the portable devices are limited. Data broadcast has become an excellent method for efficient data dissemination. In this paper, the problem for generating a broadcast program of a set of data items with the associated access frequencies on multiple channels is explored. In our approach, an expected average access time of the broadcast data items is first derived. The broadcast program is then generated, which minimizes the expected average access time. Simulation is performed to compare the performance of our approach with two existing approaches. The result of the experiments shows that our approach outperforms others and is in fact close to the optimal.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
Swarup Acharya , Rafael Alonso , Michael Franklin , Stanley Zdonik, Broadcast disks: data management for asymmetric communication environments, Proceedings of the 1995 ACM SIGMOD international conference on Management of data, p.199-210, May 22-25, 1995, San Jose, California, United States
|
| |
2
|
S. Acharya, M. Franklin and S. Zdonik, "Disseminationbased Data Delivery Using Broadcast Disks", IEEE Personal Communications, 2(6), Dec. 1995.
|
| |
3
|
|
| |
4
|
|
 |
5
|
|
| |
6
|
T.F. Bowen, G. Gopal, G. Herman, T. Hickey, K.C. Lee, W.H. Mansfield, J. Raitz, and A. Weinrib. "The Datacycle Architecture". Communications of the ACM, pages 850-857, 1995.
|
 |
7
|
Jim Gray , Prakash Sundaresan , Susanne Englert , Ken Baclawski , Peter J. Weinberger, Quickly generating billion-record synthetic databases, Proceedings of the 1994 ACM SIGMOD international conference on Management of data, p.243-252, May 24-27, 1994, Minneapolis, Minnesota, United States
|
| |
8
|
A.R. Hurson, Y.C. Chehadeh and J. Hannan, "Object Organization on Parallel Broadcast Channels in a Global Information Sharing Environment," IEEE International Performance, Computing, and Communications Conference (IPCCC), February 2000.
|
 |
9
|
Gary Herman , K. C. Lee , Abel Weinrib, The datacycle architecture for very high throughput database systems, Proceedings of the 1987 ACM SIGMOD international conference on Management of data, p.97-103, May 27-29, 1987, San Francisco, California, United States
|
| |
10
|
|
 |
11
|
|
| |
12
|
|
 |
13
|
|
| |
14
|
|
| |
15
|
|
| |
16
|
N. Shivakumar and S. Venkatasubramanian, "Energy- Efftcient Indexing For Information Dissemination In Wireless Systems," ACM, Journal of Wireless and Nomadic Application, 1996.
|
| |
17
|
|
| |
18
|
|
| |
19
|
J.W. Wong. "Broadcast delivery", Proceeding of the IEEE, 76(12): 1566-1577, 1988.
|
|