Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
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
Efficient indexing for broadcast based wireless systems
Mobile Networks and Applications - Special issue on mobile computing and system services
Joint broadcast scheduling and user's cache management for efficient information delivery
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Scheduling on-demand broadcasts: new metrics and algorithms
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A study on channel allocation for data dissemination in mobile computing environments
Mobile Networks and Applications - Special issue: resource management in mobile wireless communication networks
Client-server computing in mobile environments
ACM Computing Surveys (CSUR)
Indexing techniques for wireless data broadcast under data clustering and scheduling
Proceedings of the eighth international conference on Information and knowledge management
Proceedings of the ninth international conference on Information and knowledge management
SAIU: an efficient cache replacement policy for wireless on-demand broadcasts
Proceedings of the ninth international conference on Information and knowledge management
Introduction to algorithms
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
Mobile Computing and Databases-A Survey
IEEE Transactions on Knowledge and Data Engineering
An Optimal Cache Replacement Policy for Wireless Data Dissemination under Cache Consistency
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Adaptive Data Broadcast in Hybrid Networks
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Dynamic Data Delivery in Wireless Communication Environments
ER '98 Proceedings of the Workshops on Data Warehousing and Data Mining: Advances in Database Technologies
Allocation of Shared Data Based on Mobile User Movement
MDM '02 Proceedings of the Third International Conference on Mobile Data Management
Channel allocation methods for data dissemination in mobile computing environments
HPDC '97 Proceedings of the 6th IEEE International Symposium on High Performance Distributed Computing
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
Adaptive Data Delivery in Wireless Communication Environments
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Optimizing Index Allocation for Sequential Data Broadcasting in Wireless Mobile Computing
IEEE Transactions on Knowledge and Data Engineering
Dependent Data Broadcasting for Unordered Queries in a Multiple Channel Mobile Environment
IEEE Transactions on Knowledge and Data Engineering
A general model of hybrid data dissemination
Proceedings of the 6th international conference on Mobile data management
Hi-index | 0.00 |
We explore in this paper the problem of dynamic data and channel allocations with the number of communication channels and the number of data items given. It is noted that the combined use of broadcast and on-demand channels can utilize the bandwidth effectively for data dissemination in a mobile computing environment. We first derive the an-alytical models of the expected delays when the data are requested through the broadcast and on-demand channels. Then, we transform this problem into to a guided search problem. In light of the theoretical properties derived, we devise an algorithm based on binary interpolation search, referred to as algorithm BIS, to obtain solutions of high quality efficiently. In essence, algorithm BIS is guided to explore the solution space with higher likelihood to be the optimal first, thereby leading to an efficient and effective search. It is shown by our simulation results that the solution obtained by algorithm BIS is of very high quality and is in fact very close to the optimal one. Sensitivity analysis on several parameters, including the number of data items and the number of communication channels, is conducted.