Citation
Barjini, Hassan and Othman, Mohamed and Ibrahim, Hamidah and Udzir, Nur Izura
(2012)
Analytical studies and experimental examines for flooding-based search algorithms.
In:
Information Computing and Applications.
Lecture Notes in Computer Science
(7473).
Springer, Berlin Heidelberg, pp. 299-306.
ISBN 9783642340628; EISBN: 9783642340628
Abstract
Flooding search has no knowledge about network topology and files distribution, thus it offers an attractive method for file discovery in dynamic and evolving networks. Although flooding can achieve high coverage but it produces exponentially redundant messages in each hop. To improve this searching scheme and reduce redundant messages, there are many flooding-based search algorithms in literature. This pa- per provided analytical study for flooding and flooding-based algorithms. The analytical results provided the best hop threshold point for the optimum growth rate coverage and redundant messages from flooding and flooding-based algorithms. The simulation experiments validated analytical results.
Download File
Full text not available from this repository.
|
Additional Metadata
| Item Type: | Book Section |
|---|---|
| Divisions: | Faculty of Computer Science and Information Technology |
| DOI Number: | https://doi.org/10.1007/978-3-642-34062-8_39 |
| Publisher: | Springer |
| Keywords: | Peer-to-peer; Flooding-based searching; Redundant messages |
| Depositing User: | Nurul Ainie Mokhtar |
| Date Deposited: | 19 Jan 2016 04:43 |
| Last Modified: | 19 Jan 2016 04:44 |
| Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1007/978-3-642-34062-8_39 |
| URI: | http://psasir.upm.edu.my/id/eprint/26097 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |