A review of new advances in resource discovery approaches in unstructured P2P networks

Sharifkhani, Fatemeh; Pakravan, Mohammad Reza

doi:10.1109/icacci.2013.6637283

Cited by 9 publications

(6 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These algorithms can be classified into two categories: Algorithms which use deterministic information of the network and algorithms which use probabilistic information of the network [42]. In the first category, each node creates an index of its information and propagates it throughout the network.…”

Section: Related Workmentioning

confidence: 99%

Bacterial foraging search in unstructured P2P networks

Sharifkhani

Pakravan

2014

2014 IEEE 27th Canadian Conference on Electrical and Computer Engineering (CCECE)

Self Cite

View full text Add to dashboard Cite

In this paper, a new search algorithm in heterogeneous hierarchical unstructured p2p networks is presented which takes into account heterogeneity of peers such as upload bandwidth, life time in the network and process capacity in its peer discovery policy as factors that influence download performance and user satisfaction. One advantage of this algorithm is that it can be performed in a completely unstructured network without imposing any change on network topology and file replication. However, it obviously decreases file download time as it is designed to discover broad-bandwidth nodes with a higher probability. This property results in a fair distribution of load over heterogeneous p2p network nodes since more capable peers are more likely to provide service. This algorithm is inspired by bacterial foraging strategy in which a bacterium climbs up the nutrient gradient.

show abstract

Section: Related Workmentioning

confidence: 99%

Bacterial foraging search in unstructured P2P networks

Sharifkhani

Pakravan

2014

2014 IEEE 27th Canadian Conference on Electrical and Computer Engineering (CCECE)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Many works propose its utilization in several application domains. Examples are information spreading in mobile ad-hoc environments [13,14,15], multicast [16], multiplayer online games and distributed virtual environments [10], multiresolution data representations for sensor networks [17], opportunistic networks [18,19], publishsubscribe systems [20,4,21], query processing over XML data [22], resource discovery [23,24,5,25,26], resource management in cloud computing and distributed systems [27,28], social networks [29], community detection [30], etc.…”

Section: Related Workmentioning

confidence: 99%

Highly intensive data dissemination in complex networks

D’Angelo

Ferretti

2017

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

This paper presents a study on data dissemination in unstructured Peer-to-Peer (P2P) network overlays. The absence of a structure in unstructured overlays eases the network management, at the cost of non-optimal mechanisms to spread messages in the network. Thus, dissemination schemes must be employed that allow covering a large portion of the network with a high probability (e.g. gossip based approaches). We identify principal metrics, provide a theoretical model and perform the assessment evaluation using a high performance simulator that is based on a parallel and distributed architecture. A main point of this study is that our simulation model considers implementation technical details, such as the use of caching and Time To Live (TTL) in message dissemination, that are usually neglected in simulations, due to the additional overhead they cause. Outcomes confirm that these technical details have an important influence on the performance of dissemination schemes and that the studied schemes are quite effective to spread information in P2P overlay networks, whatever their topology. Moreover, the practical usage of such dissemination mechanisms requires a fine tuning of many parameters, the choice between different network topologies and the assessment of behaviors such as free riding. All this can be done only using efficient simulation tools to support both the network design phase and, in some cases, at runtime.

show abstract

“…There are several surveys on resource discovery protocols in the current literature [3][4][5][6][7][8][9]. However, most of these works are limited, as they do not provide a comprehensive review of discovery approaches with respect to all key potential aspects of resource discovery in distributed systems.…”

Section: Introductionmentioning

confidence: 99%

“…However, most of these works are limited, as they do not provide a comprehensive review of discovery approaches with respect to all key potential aspects of resource discovery in distributed systems. For example, the works [3,4,6] only discuss discovery approaches for Grid systems while the works [5,[7][8][9][10] only investigate approaches for Peer-to-Peer (P2P) systems. Works such as [11][12][13] are much more limited in scope and dimension, and as such do not provide a complete view covering major aspects of discovery in distributed systems.…”

Section: Introductionmentioning

confidence: 99%