Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11603771_27 | IWDC |
Keywords | Field | DocType |
data item,key map,overlay network,network topology,p2p system,uinta routing algorithm,p2p routing algorithm,p2p overlay network,uinta algorithm,data semantic,p2p system lookup performance,p2p | Virtual network,Pastry,Peer-to-peer,Computer science,Key-based routing,Cache,Network topology,Chord (music),Overlay network,Distributed computing | Conference |
Volume | ISSN | ISBN |
3741 | 0302-9743 | 3-540-30959-4 |
Citations | PageRank | References |
2 | 0.41 | 10 |
Authors | ||
4 | ||