Enhanced search in unstructured peer-to-peer overlay networks

Chittaranjan Hota, Vikram Nunia, Mario Di Francesco, Jukka K. Nurminen, Antti Ylä-Jääski

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

Abstract

Unstructured Peer-to-Peer (P2P) overlays are the most widely used topologies in P2P systems because of their simplicity and very limited control overhead. A P2P overlay specifies the logical connections among peers in a network. Such logical links define the order in which peers are queried in search for a specific resource. The most popular query routing algorithms are based on flooding, thus they do not scale well as each query generates a large amount of traffic. In this paper, we use heuristics to improve overlay search in an unstructured P2P file sharing system. The proposed heuristics effectively decide replica locations for popular resources based on the availability of computing and storage at a given peer, its neighborhood information, and the used routing strategy. Simulations performed over two different types of unstructured P2P network topologies (i.e., power law and random graphs) show significant improvements over plain flooding in terms of reduced network traffic and search time. © 2013 Springer-Verlag.
Original languageEnglish
Title of host publicationGrid and Pervasive Computing
Subtitle of host publication8th International Conference, GPC 2013 and Colocated Workshops
PublisherSpringer
Pages270-279
ISBN (Electronic)978-3-642-38027-3
ISBN (Print)978-3-642-38026-6
DOIs
Publication statusPublished - 2013
MoE publication typeA4 Article in a conference publication

Publication series

SeriesLecture Notes in Computer Science
Volume7861
ISSN0302-9743

Fingerprint

Overlay networks
Peer to peer networks
Topology
Routing algorithms
Availability

Keywords

  • Peer-to-peer
  • overlay networks
  • replication
  • search
  • unstructured

Cite this

Hota, C., Nunia, V., Di Francesco, M., Nurminen, J. K., & Ylä-Jääski, A. (2013). Enhanced search in unstructured peer-to-peer overlay networks. In Grid and Pervasive Computing: 8th International Conference, GPC 2013 and Colocated Workshops (pp. 270-279). Springer. Lecture Notes in Computer Science, Vol.. 7861 https://doi.org/10.1007/978-3-642-38027-3_29
Hota, Chittaranjan ; Nunia, Vikram ; Di Francesco, Mario ; Nurminen, Jukka K. ; Ylä-Jääski, Antti. / Enhanced search in unstructured peer-to-peer overlay networks. Grid and Pervasive Computing: 8th International Conference, GPC 2013 and Colocated Workshops. Springer, 2013. pp. 270-279 (Lecture Notes in Computer Science, Vol. 7861).
@inproceedings{bc9f0fd755a247b8b0ed12bc92128fb2,
title = "Enhanced search in unstructured peer-to-peer overlay networks",
abstract = "Unstructured Peer-to-Peer (P2P) overlays are the most widely used topologies in P2P systems because of their simplicity and very limited control overhead. A P2P overlay specifies the logical connections among peers in a network. Such logical links define the order in which peers are queried in search for a specific resource. The most popular query routing algorithms are based on flooding, thus they do not scale well as each query generates a large amount of traffic. In this paper, we use heuristics to improve overlay search in an unstructured P2P file sharing system. The proposed heuristics effectively decide replica locations for popular resources based on the availability of computing and storage at a given peer, its neighborhood information, and the used routing strategy. Simulations performed over two different types of unstructured P2P network topologies (i.e., power law and random graphs) show significant improvements over plain flooding in terms of reduced network traffic and search time. {\circledC} 2013 Springer-Verlag.",
keywords = "Peer-to-peer, overlay networks, replication, search, unstructured",
author = "Chittaranjan Hota and Vikram Nunia and {Di Francesco}, Mario and Nurminen, {Jukka K.} and Antti Yl{\"a}-J{\"a}{\"a}ski",
year = "2013",
doi = "10.1007/978-3-642-38027-3_29",
language = "English",
isbn = "978-3-642-38026-6",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "270--279",
booktitle = "Grid and Pervasive Computing",
address = "Germany",

}

Hota, C, Nunia, V, Di Francesco, M, Nurminen, JK & Ylä-Jääski, A 2013, Enhanced search in unstructured peer-to-peer overlay networks. in Grid and Pervasive Computing: 8th International Conference, GPC 2013 and Colocated Workshops. Springer, Lecture Notes in Computer Science, vol. 7861, pp. 270-279. https://doi.org/10.1007/978-3-642-38027-3_29

Enhanced search in unstructured peer-to-peer overlay networks. / Hota, Chittaranjan; Nunia, Vikram; Di Francesco, Mario; Nurminen, Jukka K.; Ylä-Jääski, Antti.

Grid and Pervasive Computing: 8th International Conference, GPC 2013 and Colocated Workshops. Springer, 2013. p. 270-279 (Lecture Notes in Computer Science, Vol. 7861).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

TY - GEN

T1 - Enhanced search in unstructured peer-to-peer overlay networks

AU - Hota, Chittaranjan

AU - Nunia, Vikram

AU - Di Francesco, Mario

AU - Nurminen, Jukka K.

AU - Ylä-Jääski, Antti

PY - 2013

Y1 - 2013

N2 - Unstructured Peer-to-Peer (P2P) overlays are the most widely used topologies in P2P systems because of their simplicity and very limited control overhead. A P2P overlay specifies the logical connections among peers in a network. Such logical links define the order in which peers are queried in search for a specific resource. The most popular query routing algorithms are based on flooding, thus they do not scale well as each query generates a large amount of traffic. In this paper, we use heuristics to improve overlay search in an unstructured P2P file sharing system. The proposed heuristics effectively decide replica locations for popular resources based on the availability of computing and storage at a given peer, its neighborhood information, and the used routing strategy. Simulations performed over two different types of unstructured P2P network topologies (i.e., power law and random graphs) show significant improvements over plain flooding in terms of reduced network traffic and search time. © 2013 Springer-Verlag.

AB - Unstructured Peer-to-Peer (P2P) overlays are the most widely used topologies in P2P systems because of their simplicity and very limited control overhead. A P2P overlay specifies the logical connections among peers in a network. Such logical links define the order in which peers are queried in search for a specific resource. The most popular query routing algorithms are based on flooding, thus they do not scale well as each query generates a large amount of traffic. In this paper, we use heuristics to improve overlay search in an unstructured P2P file sharing system. The proposed heuristics effectively decide replica locations for popular resources based on the availability of computing and storage at a given peer, its neighborhood information, and the used routing strategy. Simulations performed over two different types of unstructured P2P network topologies (i.e., power law and random graphs) show significant improvements over plain flooding in terms of reduced network traffic and search time. © 2013 Springer-Verlag.

KW - Peer-to-peer

KW - overlay networks

KW - replication

KW - search

KW - unstructured

U2 - 10.1007/978-3-642-38027-3_29

DO - 10.1007/978-3-642-38027-3_29

M3 - Conference article in proceedings

SN - 978-3-642-38026-6

T3 - Lecture Notes in Computer Science

SP - 270

EP - 279

BT - Grid and Pervasive Computing

PB - Springer

ER -

Hota C, Nunia V, Di Francesco M, Nurminen JK, Ylä-Jääski A. Enhanced search in unstructured peer-to-peer overlay networks. In Grid and Pervasive Computing: 8th International Conference, GPC 2013 and Colocated Workshops. Springer. 2013. p. 270-279. (Lecture Notes in Computer Science, Vol. 7861). https://doi.org/10.1007/978-3-642-38027-3_29