Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Scheduling on-demand broadcasts: new metrics and algorithms
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Query optimization for broadcast database
Data & Knowledge Engineering
R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
The content and access dynamics of a busy Web site: findings and implications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A near optimal algorithm for generating broadcast programs on multiple channels
Proceedings of the tenth international conference on Information and knowledge management
Effective Data Placement for Wireless Broadcast
Distributed and Parallel Databases
Efficient Data Allocation over Multiple Channels at Broadcast Servers
IEEE Transactions on Computers
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
Optimizing Index Allocation for Sequential Data Broadcasting in Wireless Mobile Computing
IEEE Transactions on Knowledge and Data Engineering
Data Staging for On-Demand Broadcast
Proceedings of the 27th International Conference on Very Large Data Bases
Disseminating Updates on Broadcast Disks
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
QEM: A Scheduling Method for Wireless Broadcast Data
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
A Parallel Hill Climbing Algorithm for Pushing Dependent Data in Clients-Providers-Servers Systems
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Optimal Index and Data Allocation in Multiple Broadcast Channels
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Broadcast data allocation for efficient access of multiple data items in mobile environments
Mobile Networks and Applications
Dependent Data Broadcasting for Unordered Queries in a Multiple Channel Mobile Environment
IEEE Transactions on Knowledge and Data Engineering
On Exploring Channel Allocation in the Diverse Data Broadcasting Environment
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
TOSA: a near-optimal scheduling algorithm for multi-channel data broadcast
Proceedings of the 6th international conference on Mobile data management
Data scheduling for multi-item and transactional requests in on-demand broadcast
Proceedings of the 6th international conference on Mobile data management
Scheduling dependent items in data broadcasting environments
Proceedings of the 2006 ACM symposium on Applied computing
| Hi-index | 0.00 |
In recent years, data broadcasting becomes a promising technique to design a mobile information system with power conservation, high scalability and high bandwidth utilization. In many applications, the query issued by a mobile client corresponds to multiple items which should be accessed in a sequential order. In this paper, we study the scheduling approach in such a sequential data broadcasting environment. Explicitly, we propose a general framework referred to as MULS (standing for MUlti-Level Service) for an information system. There are two primary stages in MULS: on-line scheduling and optimization procedure. In the first stage, we propose an On- Line Scheduling algorithm (denoted by OLS) to allocate the data items into multiple channels. As for the second stage, we devise an optimization procedure SCI, standing for Sampling with Controlled Iteration, to enhance the quality of broadcast programs generated by algorithm OLS. Procedure SCI is able to strike a compromise between effectiveness and efficiency by tuning the control parameters. According to the experimental results, we show that algorithm OLS with procedure SCI outperforms the approaches in prior works prominently in both effectiveness (i.e., the average access time of mobile users) and efficiency (i.e., the complexity of the scheduling algorithm). Therefore, by cooperating algorithm OLS with procedure SCI, the proposed MULS framework is able to generate broadcast programs with flexibility of providing different service qualities under different requirements of effectiveness and efficiency: in the dynamic environment in which the access patterns and information contents change rapidly, the parameters used in SCI will perform online scheduling with satisfactory service quality. As for the static environment in which the query profile and the database are updated infrequently, larger values of parameters are helpful to generate an optimized broadcast program, indicating the advantageous feature of MULS.