Popularity adaptive search in hybrid P2P systems

Shi, Xiaobo; Han, Jinsong; Ni, Lionel M.

doi:10.1016/j.jpdc.2008.09.004

Cited by 12 publications

(2 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this study, I am interested in optimizing the search performance in Gnutella-like unstructured P2P networks. Existing orthogonal techniques in the literature for improving search performance in unstructured P2P networks include indexing (e.g., [5], [6], [7]), replications (e.g., [8], [9]), super peer architectures (e.g., [10], [11], [12], [13]), and overlay topologies (e.g., [14], [15]), among others. In this Paper, I primarily study the overlay topology formation technique for unstructured P2P networks, aiming to enhance search efficiency and effectiveness.…”

Section: Related Workmentioning

confidence: 99%

An Efficient Topology Search Mechanism for Unstructured PeerTo-Peer Networks

Vijayanandh¹,

Sivanesan²

2014

IOSRJCE

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

An Efficient Topology Search Mechanism for Unstructured PeerTo-Peer Networks

Vijayanandh¹,

Sivanesan²

2014

IOSRJCE

View full text Add to dashboard Cite

“…To reduce response time and bandwidth, approaches in [22,23] specify selection of a flooding or DHT based lookup based on the popularity of the content. It is computed using a global collection algorithm.…”

Section: Related Workmentioning

confidence: 99%

Adaptive lookup for unstructured peer-to-peer overlays

Haribabu

Reddy

Hota

et al. 2008

2008 3rd International Conference on Communication Systems Software and Middleware and Workshops (COMSWARE '08)

View full text Add to dashboard Cite

Scalability and efficient global search in unstructured peer-to-peer overlays have been extensively studied in the literature. The global search comes at the expense of local interactions between peers. Most of the unstructured peer-topeer overlays do not provide any performance guarantee. In this work we propose a novel Quality of Service enabled lookup for unstructured peer-to-peer overlays that will allow the user's query to traverse only those overlay links which satisfy the given constraints. Additionally, it also improves the scalability by judiciously using the overlay resources. Our approach selectively forwards the queries using QoS metrics like latency, bandwidth, and overlay link status so as to ensure improved performance in a scenario where the degree of peer joins and leaves are high. User is given only those results which can be downloaded with the given constraints. Also, the protocol aims at minimizing the message overhead over the overlay network.

show abstract