CACC: A Cooperative Approachto Cache Consistency in WMNs

Cooperative caching is a desirable approach to achieve efficient data access in multi-hop wireless networks. Existing cooperative caching algorithms mostly focus on cache placement. Another key issue, cache consistency, has not been adequately addressed. In this paper, we propose CACC, a cooperative...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers Jg. 63; H. 4; S. 860 - 873
Hauptverfasser: Xu, Wenzheng, Wu, Weigang, Wu, Hejun, Cao, Jiannong, Lin, Xiaola
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.04.2014
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Ad hoc networks
Adaptation models
Algorithms
cache consistency
Caching
Computer simulation
Consistency
Cooperative caching
Cost engineering
Delay
Finite element method
Infrared radiation
invalidation report
Logic gates
Maintenance engineering
Messages
Networks
Servers
Wireless communication
wireless mesh network
Wireless networks
ISSN:0018-9340, 1557-9956
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Cooperative caching is a desirable approach to achieve efficient data access in multi-hop wireless networks. Existing cooperative caching algorithms mostly focus on cache placement. Another key issue, cache consistency, has not been adequately addressed. In this paper, we propose CACC, a cooperative approach to maintain cache consistency for wireless mesh networks. CACC combines push and pull by making use of the hierarchical architecture of mesh networks. The key contribution of CACC lies in two techniques that introduce cooperation among network nodes in delivering invalidation reports (IRs) so as to reduce communication cost and tolerate message losses. The first technique, IR integration, buffers and merges IRs at gateway nodes and periodically broadcasts them. The second technique, cooperative IR re-sending, lets intermediate nodes resend missed IR messages upon request. The interval of IR broadcast is optimized to achieve the optimal tradeoff between push and pull. We conduct numerical analysis to find optimal values for different scenarios. We also perform simulation to confirm our analysis results and compare with existing approaches. The results show that CACC can save message cost significantly (50-70 percent).
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2013.20