Enhanced DHT-based P2P Architecture for Effective Resource Discovery and Management

Ghamri-Doudane, Samir; Agoulmine, Nazim

doi:10.1007/s10922-007-9067-8

Cited by 19 publications

(6 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The resource dynamicity means that any node/resource in the system can join, leave or fail at any time (i.e., dynamicity in terms of topology change as well as resource life-cycle) and also it can change its characteristics (i.e., dynamicity in resource conditions and availability) [308,309]. Thus, resource discovery performance must be evaluated using different configurations and dynamicity parameters (such as churn rate which is the percentage of nodes/resources in a given time frame that fails, leaves or joins the system) for the environment.…”

Section: Reliabilitymentioning

confidence: 99%

See 1 more Smart Citation

Resource discovery for distributed computing systems: A comprehensive survey

Zarrin

Aguiar

Barraca

2018

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Section: Reliabilitymentioning

confidence: 99%

“…In order to support keyword search in structured systems, there are some typical approaches such as Inverted Indices [309,337] and Bloom Filters [305]. The first method consists in the creation of inverted indices where, for each keyword k, the inverted index maintains the pageranks.…”

Section: Flexibilitymentioning

confidence: 99%

Resource discovery for distributed computing systems: A comprehensive survey

Zarrin

Aguiar

Barraca

2018

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

“…Refs. [16] and [17] both presented the resource discovery approaches to support multi-keyword queries, which forward the queries mainly based on the routing protocols of the original DHT networks such as Pastry and Chord. They are different from our strategy in that they are both implemented on top of DHT networks, rather than on the unstructured P2P networks.…”

Section: Related Workmentioning

confidence: 99%

A traffic-efficient message forwarding approach in unstructured P2P networks

Meng

Liu

2015

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

With more and more peer-to-peer (P2P) applications being utilized, the P2P traffic accounts for the majority in Internet, and thus leading to the network congestion problem. Reducing the redundant propagations of messages is an effective approach for solving such problem in unstructured P2P networks. In this paper, we first define a novel message structure which contains the information of message propagation path, and then three operations, including the inheritance, supplement and collection, on the message transmission paths are proposed, based on which a node could forward the message to the nodes who have not received the message yet purposefully by using the information of the past received messages and the characteristics of space and time of node activities, and thus eliminating the bandwidth consumption problem caused by the flooding-based message propagation approaches. The simulation results show that our strategy could effectively reduce the number of the redundant messages without lowering the message coverage ratio.

show abstract

“…Distributed search adopts a pure distributed mechanism to transfer messages, and uses the location-based service model to search by keywords. At present, the main approach is the Distributed Hash Table (DHT) technology [4].…”

Section: Distributed Structured Architecture and Its Basic Algorithmmentioning

confidence: 99%

“…(2) Global updating When ant k successfully finished a path P from source to destination, the pheromone between two neighboring node i and j in the path is updated by formula (4).…”

Section: Resource Search Based On Ant Colony Algorithmmentioning

confidence: 99%

Survey of search and optimization of P2P networks

Cai

2010

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

Being highly dynamic and casualness, P2P nodes can organize a special network by themselves, therefore the resource search in a P2P network is a complex problem. A reasonable and efficient resource search algorithm is not only the key to resource sharing for users, but also a critical stage to P2P technology development. Firstly, this paper introduces some basic resource search algorithms on P2P network architecture. Secondly, the paper discusses the advantages and disadvantages of these methods. Above all, the paper focuses on the combination of the P2P resource search with some intelligent optimization algorithms, which have succeeded in many fields. The combination shows a good prospect, although being still immature now.

show abstract

Enhanced DHT-based P2P Architecture for Effective Resource Discovery and Management

Cited by 19 publications

References 14 publications

Resource discovery for distributed computing systems: A comprehensive survey

Resource discovery for distributed computing systems: A comprehensive survey

A traffic-efficient message forwarding approach in unstructured P2P networks

Survey of search and optimization of P2P networks

Contact Info

Product

Resources

About