A Counter-Based Cache Invalidation Scheme for Mobile Environments with Stateless Servers

Chao Chin Wu, Jywe Fei Fang, Ping Chun Hung

Research output: Contribution to conferencePaper

3 Citations (Scopus)

Abstract

Although invalidation report (IR)-based cache management schemes can effectively reduce the wireless bandwidth requirement as well as minimize the energy consumption of portable equipments, they suffer from the long query latency and the poor bandwidth utilization. G. Cao has proposed several novel techniques to address these two problems by means of the updated invalidation report (UIR). One of his techniques is that the server broadcasts hot data items right after the IR and clients download the up-to-date data items into their local caches if they have invalid cache copies corresponding to the broadcasted data items. However, the Cao's scheme requires servers to maintain the cache states of all the clients inside its cell. It is not scalable because the high state maintenance overhead. Therefore, we propose a counter-based cache invalidation scheme in this paper where the server can identify hot data items without the need to maintain information about the cache states of clients.

Original languageEnglish
Pages623-626
Number of pages4
Publication statusPublished - 2003 Nov 7
Event2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) - Victoria, B.C., Canada
Duration: 2003 Aug 282003 Aug 30

Other

Other2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003)
CountryCanada
CityVictoria, B.C.
Period03-08-2803-08-30

Fingerprint

Servers
Portable equipment
Bandwidth
Energy utilization

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Networks and Communications

Cite this

Wu, C. C., Fang, J. F., & Hung, P. C. (2003). A Counter-Based Cache Invalidation Scheme for Mobile Environments with Stateless Servers. 623-626. Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada.
Wu, Chao Chin ; Fang, Jywe Fei ; Hung, Ping Chun. / A Counter-Based Cache Invalidation Scheme for Mobile Environments with Stateless Servers. Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada.4 p.
@conference{7cc316971d8e45448fbdfe120a779327,
title = "A Counter-Based Cache Invalidation Scheme for Mobile Environments with Stateless Servers",
abstract = "Although invalidation report (IR)-based cache management schemes can effectively reduce the wireless bandwidth requirement as well as minimize the energy consumption of portable equipments, they suffer from the long query latency and the poor bandwidth utilization. G. Cao has proposed several novel techniques to address these two problems by means of the updated invalidation report (UIR). One of his techniques is that the server broadcasts hot data items right after the IR and clients download the up-to-date data items into their local caches if they have invalid cache copies corresponding to the broadcasted data items. However, the Cao's scheme requires servers to maintain the cache states of all the clients inside its cell. It is not scalable because the high state maintenance overhead. Therefore, we propose a counter-based cache invalidation scheme in this paper where the server can identify hot data items without the need to maintain information about the cache states of clients.",
author = "Wu, {Chao Chin} and Fang, {Jywe Fei} and Hung, {Ping Chun}",
year = "2003",
month = "11",
day = "7",
language = "English",
pages = "623--626",
note = "2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) ; Conference date: 28-08-2003 Through 30-08-2003",

}

Wu, CC, Fang, JF & Hung, PC 2003, 'A Counter-Based Cache Invalidation Scheme for Mobile Environments with Stateless Servers', Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada, 03-08-28 - 03-08-30 pp. 623-626.

A Counter-Based Cache Invalidation Scheme for Mobile Environments with Stateless Servers. / Wu, Chao Chin; Fang, Jywe Fei; Hung, Ping Chun.

2003. 623-626 Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada.

Research output: Contribution to conferencePaper

TY - CONF

T1 - A Counter-Based Cache Invalidation Scheme for Mobile Environments with Stateless Servers

AU - Wu, Chao Chin

AU - Fang, Jywe Fei

AU - Hung, Ping Chun

PY - 2003/11/7

Y1 - 2003/11/7

N2 - Although invalidation report (IR)-based cache management schemes can effectively reduce the wireless bandwidth requirement as well as minimize the energy consumption of portable equipments, they suffer from the long query latency and the poor bandwidth utilization. G. Cao has proposed several novel techniques to address these two problems by means of the updated invalidation report (UIR). One of his techniques is that the server broadcasts hot data items right after the IR and clients download the up-to-date data items into their local caches if they have invalid cache copies corresponding to the broadcasted data items. However, the Cao's scheme requires servers to maintain the cache states of all the clients inside its cell. It is not scalable because the high state maintenance overhead. Therefore, we propose a counter-based cache invalidation scheme in this paper where the server can identify hot data items without the need to maintain information about the cache states of clients.

AB - Although invalidation report (IR)-based cache management schemes can effectively reduce the wireless bandwidth requirement as well as minimize the energy consumption of portable equipments, they suffer from the long query latency and the poor bandwidth utilization. G. Cao has proposed several novel techniques to address these two problems by means of the updated invalidation report (UIR). One of his techniques is that the server broadcasts hot data items right after the IR and clients download the up-to-date data items into their local caches if they have invalid cache copies corresponding to the broadcasted data items. However, the Cao's scheme requires servers to maintain the cache states of all the clients inside its cell. It is not scalable because the high state maintenance overhead. Therefore, we propose a counter-based cache invalidation scheme in this paper where the server can identify hot data items without the need to maintain information about the cache states of clients.

UR - http://www.scopus.com/inward/record.url?scp=0142138159&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0142138159&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0142138159

SP - 623

EP - 626

ER -

Wu CC, Fang JF, Hung PC. A Counter-Based Cache Invalidation Scheme for Mobile Environments with Stateless Servers. 2003. Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada.