A near optimal algorithm for generating broadcast programs on multiple channels

Authors:
Chih-Hao Hsu;Guanling Lee;Arbee L. P. Chen
Affiliations:
National Tsing Hua University, Hsinchu, Taiwan 300, R.O.C.;National Tsing Hua University, Hsinchu, Taiwan 300, R.O.C.;National Tsing Hua University, Hsinchu, Taiwan 300, R.O.C.
Venue:
Proceedings of the tenth international conference on Information and knowledge management
Year:
2001

Citing 14
Cited 10

The datacycle architecture for very high throughput database systems

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Data management for mobile computing

ACM SIGMOD Record
Database system issues in nomadic computing

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Quickly generating billion-record synthetic databases

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
Batch scheduling for demand-driven servers in wireless enviroments

Information Sciences: an International Journal
Scheduling data broadcast in asymmetric communication environments

Wireless Networks
Efficient algorithms for scheduling data broadcast

Wireless Networks
Dynamic generation of data broadcasting programs for a broadcast disk array in a mobile computing environment

Proceedings of the ninth international conference on Information and knowledge management
Data Management for Mobile Computing

Data Management for Mobile Computing
Prefetching from Broadcast Disks

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Disseminating Updates on Broadcast Disks

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Multi-Level Multi-Channel Air Cache Designs for Broadcasting in a Mobile Environment

ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Optimal Index and Data Allocation in Multiple Broadcast Channels

ICDE '00 Proceedings of the 16th International Conference on Data Engineering

Data Allocation on Wireless Broadcast Channels for Efficient Query Processing

IEEE Transactions on Computers
Efficient data access to multi-channel broadcast programs

CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Broadcast program generation for webcasting

Data & Knowledge Engineering
An Efficient Algorithm for Near Optimal Data Allocation on Multiple Broadcast Channels

Distributed and Parallel Databases
Scheduling dependent items in data broadcasting environments

Proceedings of the 2006 ACM symposium on Applied computing
SOM: Dynamic Push-Pull Channel Allocation Framework for Mobile Data Broadcasting

IEEE Transactions on Mobile Computing
Efficient index and data allocation for wireless broadcast services

Data & Knowledge Engineering
MULS: A General Framework of Providing Multilevel Service Quality in Sequential Data Broadcasting

IEEE Transactions on Knowledge and Data Engineering
On optimal scheduling for time-constrained services in multi-channel data dissemination systems

Information Systems
Near-optimal data allocation over multiple broadcast channels

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

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.