Analytical studies and experimental examines for flooding-based search algorithms
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 sch...
Saved in:
Main Authors: | Barjini, Hassan, Othman, Mohamed, Ibrahim, Hamidah, Udzir, Nur Izura |
---|---|
Other Authors: | Liu, Baoxiang |
Format: | Book Section |
Published: |
Springer
2012
|
Online Access: | http://psasir.upm.edu.my/id/eprint/26097/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Shortcoming, problems and analytical comparison for flooding-based search techniques in unstructured P2P networks.
by: Barjini, Hassan, et al.
Published: (2011) -
HybridFlood: minimizing the effects of redundant messages and maximizing search efficiency of unstructured peer-to-peer networks
by: Barjini, Hassan, et al.
Published: (2014) -
SmoothFlood: decreasing redundant messages and increasing search quality of service in peer-to-peer networks
by: Barjini, Hassan, et al.
Published: (2010) -
Hybridflood algorithms minimizing redundant messages and maximizing efficiency of search in unstructured P2P networks
by: Barjini, Hassan
Published: (2012) -
A framework for mobile web query searching using ontology domain
by: Hamzah, Rosliza, et al.
Published: (2008)