Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Balancing push and pull for data broadcast
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Broadcast scheduling for information distribution
Wireless Networks
Efficient algorithms for scheduling data broadcast
Wireless Networks
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
Scheduling data broadcast to “impatient” users
Proceedings of the 1st ACM international workshop on Data engineering for wireless and mobile access
The data broadcast problem with non-uniform transmission times
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
Optimal broadcasting of two files over an asymmetric channel
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile computing and communications
Proceedings of the ninth international conference on Information and knowledge management
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
A cost-efficient scheduling algorithm of on-demand broadcasts
Wireless Networks
A Lazy Data Request Approach for On-Demand Data Broadcasting
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Dynamic leveling: adaptive data broadcasting in a mobile computing environment
Mobile Networks and Applications
Pushing dependent data in clients-providers-servers systems
Wireless Networks
Adaptive realtime bandwidth allocation for wireless data delivery
Wireless Networks
Broadcast disks with polynomial cost functions
Wireless Networks
Performance aspects of data broadcast in wireless networks with user retrials
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Mobile Computing
Hi-index | 0.00 |
The ever-increasing popularity of web services, growing demand for wireless multimedia and introduction of new, feature-enhanced, hand-held devices has already given birth to a new set of data-centric applications. Providing such applications with enhanced data processing capability calls for an efficient scheduling and transmission technique. The goal of most scheduling strategy lies in reducing the average waiting time. However, in most practical systems the variation of waiting time often results in clientýs impatience, thus provoking the clients to send repeated requests for the particular data item(s). In this paper we have developed a new hybrid scheduling framework for heterogeneous, asymmetric environments, by exploring the advantages of broadcasting very popular (push) data and dissemination of less popular (pull) data. The data access probabilities and the cut-off point used to segregate push and pull sets are dynamically computed. Packet Fair Scheduling (PFS) and stretch-optimal scheduling principle is deployed to obtain the push and pull schedule respectively. The framework explicitly takes care of the repeated requests originating from the impatient clients and minimizes the overall expected access time by obtaining an optimal cut-off point. Extensive performance analysis and simulation experiments are performed to show the efficiency of the system in reducing the overall expected access time (delay).