SW-Uinta: a small-world P2P overlay network

Authors:
Jie Xu;Hai Jin
Affiliations:
Services Computing Technology and System Lab., Cluster and Grid Computing Lab and School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China;Services Computing Technology and System Lab., Cluster and Grid Computing Lab and School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China
Venue:
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
Year:
2007

Citing 8
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Deconstructing the Kazaa Network

WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
The Small-World Phenomenon: An Algorithmic Perspective

The Small-World Phenomenon: An Algorithmic Perspective
How to model an internetwork

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Uinta: a P2P routing algorithm based on the user’s interest and the network topology

IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Tapestry: a resilient global-scale overlay for service deployment

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a new structured P2P overlay network, named SW-Uinta, where employs a non-deterministic caching strategy that allows for polylogarithmic search time while having only a constant cache size. Compared with deterministic caching strategies proposed by previous P2P systems, the non-deterministic caching strategy can reduce communication overhead for maintaining the routing cache table. Cache entries in the peer can be updated by subsequent queries rather than only by running stabilization periodically. A novel cache replacement scheme is used to improve lookup performance. We compare the performance of our system with that of other structured P2P networks such as Chord and Uinta. It shows that the SW-Uinta protocol can achieve improved object lookup performance and reduce maintenance cost compared with some other protocols.