A Lazy Data Request Approach for On-Demand Data Broadcasting

Authors:
Weigang Ni;Qiu Fang;Susan V. Vrbsky
Affiliations:
-;-;-
Venue:
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Year:
2003

Citing 0
Cited 4

A Dynamic Hybrid Scheduling Algorithm with Clients' Departure for Impatient Clients in Heterogeneous Environments

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
A New Hybrid Scheduling Framework for Asymmetric Wireless Environments with Request Repetition

WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
On-line balanced k-channel data allocation with hybrid schedule per channel

Proceedings of the 6th international conference on Mobile data management
Editorial: Profit-based scheduling and channel allocation for multi-item requests in real-time on-demand data broadcast systems

Data & Knowledge Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Broadcasting is the widely accepted approach to disseminate information in a wireless environment and can be mainly categorized as push-based or pull-based (ondemand) approaches. One of the advantages of on-demand data broadcast is that it decreases the data access time since only the requested data are broadcast. Currently the majority of the research work focuses on how to reduce the data access time. In this paper we study the messages saving issue in on-demand broadcast environments and present a lazy demand request strategy, called LDR. Our experiment results indicate that the LDR approach not onlysignificantly reduces the number of messages sent, but it can also reduce the average data access time of clients. In some cases the LDR reduces the average number of request messages by up to 50% and decreases the average access time by 20%.