Caching strategies for push-based broadcast considering consecutive data accesses with think-time

Authors:
Wataru Uchida;Takahiro Hara;Shojiro Nishio
Affiliations:
Network Laboratories, NTT DoCoMo Inc., Kanagawa, Japan;Dept. of Multimedia Eng., Grad. Sch. of Information Science and Tech., Osaka Univ., Osaka, Japan;Dept. of Multimedia Eng., Grad. Sch. of Information Science and Tech., Osaka Univ., Osaka, Japan
Venue:
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Year:
2005

Citing 10
Cited 0

Broadcast disks: data management for asymmetric communication environments

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Scheduling data broadcast in asymmetric communication environments

Wireless Networks
R × W: a scheduling approach for large-scale on-demand data broadcast

IEEE/ACM Transactions on Networking (TON)
SAIU: an efficient cache replacement policy for wireless on-demand broadcasts

Proceedings of the ninth international conference on Information and knowledge management
A new hybrid broadcast scheduling algorithm for asymmetric communication systems: push and pull data based on optimal cut-off point

MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
A new hybrid broadcast scheduling algorithm for asymmetric communication systems: push and pull data based on optimal cut-off point

MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Scheduling and caching strategies for correlated data in push-based information systems

ACM SIGAPP Applied Computing Review
Prefetching from Broadcast Disks

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Fido: A Cache That Learns to Fetch

VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Integrated document caching and prefetching in storage hierarchies based on Markov-chain predictions

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, there has been increasing interest in research on push-based information systems that deliver data by broadcast in both wired and wireless environments. This paper proposes new caching strategies to reduce the response time of data access by assuming an environment where clients consecutively issue access requests for multiple data items with think time. The proposed strategies take into account each client's access characteristics, such as correlation among data items and think-time between a data access and the next access request, and reduce the average response time by caching data items with long expected response time. Moreover, we evaluate the effectiveness of the proposed strategies by simulation experiments.