Deakin home > Deakin University Library > Deakin Research Online > Reducing cache lookup and publish overhead through locality awareness in P2P web caching

Reducing cache lookup and publish overhead through locality awareness in P2P web caching

Zhou, Wanlei and Casey, J. 2008, Reducing cache lookup and publish overhead through locality awareness in P2P web caching, in HPCC 2008 : Proceedings of the 10th IEEE International Conference on High Performance Computing and Communications, IEEE, Piscataway, N.J., pp. 296-303.

Attached Files (Some files may be inaccessible until you login with your Deakin Research Online credentials)
Name Description MIMEType Size Downloads

Title Reducing cache lookup and publish overhead through locality awareness in P2P web caching
Author(s) Zhou, Wanlei
Casey, J.
Conference name IEEE International Conference on High Performance Computing and Communications (10th : 2008 : Dalian, China)
Conference location Dalian, China
Conference dates 25-27 September 2008
Title of proceedings HPCC 2008 : Proceedings of the 10th IEEE International Conference on High Performance Computing and Communications
Editor(s) [Unknown]
Publication date 2008
Conference series International Conference on High Performance Computing and Communications
Start page 296
End page 303
Publisher IEEE
Place of publication Piscataway, N.J.
Keyword(s) peer-to-peer (P2P) computing
web caching
distributed hash table (DHT)
internet
information retrieval
Summary Peer-to-Peer (P2P) Web caching has been a hot research topic in recent years as it can create scalable and robust designs for decentralized Internet-scale applications. However, many P2P Web caching systems suffer expensive overheads such as lookup and publish messages, and lack of locality awareness. In this paper we present the development of a locality aware P2P cache system to overcome these limitations by using routing table locality, aggregation and soft state. The experiments show that our P2P cache system improves the performance of index operations through the reduction of the amount of information processed by nodes, the reduction of the number of index messages sent by nodes, and the improvement of the locality of cache pointers.
Notes This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
ISBN 9780769533520
Language eng
Field of Research 080606 Global Information Systems
HERDC Research category E1 Full written paper - refereed
Persistent URL http://hdl.handle.net/10536/DRO/DU:30018139

Document type: Conference Paper
Collection: School of Engineering and Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in Deakin Research Online is owned by the author, with all rights reserved.

Versions
Version Filter Type
Access Statistics: 353 Abstract Views, 40 File Downloads  -  Detailed Statistics
Created: Fri, 14 Aug 2009, 14:05:16 EST