DSpace Repository

Adaptive lookup for unstructured peer-to-peer overlays

Show simple item record

dc.contributor.author Haribabu, K
dc.date.accessioned 2023-01-03T10:02:11Z
dc.date.available 2023-01-03T10:02:11Z
dc.date.issued 2008
dc.identifier.uri https://ieeexplore.ieee.org/document/4554516
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8263
dc.description.abstract 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-to-peer 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 userpsilas 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. en_US
dc.language.iso en en_US
dc.publisher IEEE en_US
dc.subject Computer Science en_US
dc.subject Peer-to-peer en_US
dc.subject Overlays en_US
dc.subject Quality of service (QoS) en_US
dc.subject Lookup en_US
dc.title Adaptive lookup for unstructured peer-to-peer overlays en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account