UPM Institutional Repository

Shortcoming, problems and analytical comparison for flooding-based search techniques in unstructured P2P networks.


Citation

Barjini, Hassan and Othman, Mohamed and Ibrahim, Hamidah and Udzir, Nur Izura (2011) Shortcoming, problems and analytical comparison for flooding-based search techniques in unstructured P2P networks. Peer-to-Peer Networking and Applications, 5 (1). pp. 1-13. ISSN 1936-6442; ESSN: 1936-6450

Abstract

Peer-to-Peer networks attracted a significant amount of interest because of their capacity for resource sharing and content distribution. Content distribution applications allow personal computers to function in a coordinated manner as a distributed storage medium by contributing, searching, and obtaining digital content. Searching in unstructured P2P networks is an important problem, which has received considerable research attention. Acceptable searching techniques must provide large coverage rate, low traffic load, and optimum latency. This paper reviews flooding-based search techniques in unstructured P2P networks. It then analytically compares their coverage rate, and traffic overloads. Our simulation experiments have validated analytical results.


Download File

[img]
Preview
PDF (Abstract)
Shortcoming.pdf

Download (84kB) | Preview

Additional Metadata

Item Type: Article
Divisions: Faculty of Computer Science and Information Technology
DOI Number: https://doi.org/10.1007/s12083-011-0101-y
Publisher: Springer
Keywords: Peer-to-peer networks; Searching; Flooding-based.
Depositing User: Mohamad Jefri Mohamed Fauzi
Date Deposited: 28 Nov 2013 04:47
Last Modified: 27 Aug 2015 03:14
Altmetrics: http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1007/s12083-011-0101-y
URI: http://psasir.upm.edu.my/id/eprint/18457
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item