Uinta: a P2P routing algorithm based on the user’s interest and the network topology

Authors:
Hai Jin;Jie Xu;Bin Zou;Hao Zhang
Affiliations:
Cluster and Grid Computing Lab School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China;Cluster and Grid Computing Lab School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China;School of Mathematics and Computer Science, Hubei University, Wuhan, China;Cluster and Grid Computing Lab School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China
Venue:
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Year:
2005

Citing 10
Cited 1

Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
OceanStore: an architecture for global-scale persistent storage

ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
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
Wide-area cooperative storage with CFS

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
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
Grapes: Topology-Based Hierarchical Virtual Network for Peer-to-Peer Lookup Services

ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
The impact of DHT routing geometry on resilience and proximity

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
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
Tapestry: a resilient global-scale overlay for service deployment

IEEE Journal on Selected Areas in Communications

SW-Uinta: a small-world P2P overlay network

NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Peer-to-peer (P2P) overlay networks, such as CAN, Chord, Pastry and Tapestry, lead to high latency and low efficiency because they are independent of underlying physical networks. A well-routed lookup path in an overlay network with a small number of logical hops can result in a long delay and excessive traffic due to undesirably long distances in some physical links. In these DHT-based P2P systems, each data item is associated with a key and the key/value pair is stored in the node to which the key maps, not considering the data semantic. In this paper, we propose an effective P2P routing algorithm, called Uinta, to adaptively construct a structured P2P overlay network. Uinta not only takes advantages of physical characteristics of the network, but also places data belonging to the same semantic into a cluster and employs a class cache scheme to reduce the lookup routing latency. Simulations make some comparisons between Chord and our Uinta algorithm all running on the GT-ITM transit stub topology. The results show Uinta routing algorithm significantly improves P2P system lookup performance.