P-Grid: A Self-Organizing Access Structure for P2P Information Systems

Aberer, Karl

doi:10.1007/3-540-44751-2_15

Cited by 399 publications

(385 citation statements)

References 6 publications

Supporting

Mentioning

380

Contrasting

Unclassified

Order By: Relevance

“…The availability of efficient algorithms depends mostly on the ability to build a spanning tree on the overlay. A tree-based system such as P-Grid [9] offers a natural support for broadcast. Others such as Chord [10], Tapestry [11] or Kademlia [12], can be seen as k-ary trees.…”

Section: Related Workmentioning

confidence: 99%

An Optimal Broadcast Algorithm for Content-Addressable Networks

Henrio

Huet

Rochas

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Structured peer-to-peer networks are powerful underlying structures for communication and storage systems in large-scale setting. In the context of the Content-Addressable Network (CAN), this paper addresses the following challenge: how to perform an efficient broadcast while the local view of the network is restricted to a set of neighbours? In existing approaches, either the broadcast is inefficient (there are duplicated messages) or it requires to maintain a particular structure among neighbours, e.g. a spanning tree. We define a new broadcast primitive for CAN that sends a minimum number of messages while covering the whole network, without any global knowledge. Currently, no other algorithm achieves those two goals in the context of CAN. In this sense, the contribution we propose in this paper is threefold. First, we provide an algorithm that sends exactly one message per recipient without building a global view of the network. Second, we prove the absence of duplicated messages and the coverage of the whole network when using this algorithm. Finally, we show the practical benefits of the algorithm throughout experiments.

show abstract

Section: Related Workmentioning

confidence: 99%

An Optimal Broadcast Algorithm for Content-Addressable Networks

Henrio

Huet

Rochas

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…They use logical ring structures to divide the address space up amongst the peers, and they use some notion of routing tables, finger tables, or neighbor lists to keep connections to a number of other peers in the overlay network, which resembles some similarity with the secondary connections in our approach [2,[4][5][6]. In the case of Chord [2], e.g., each peer maintains a so called finger table that consists of references to the peer opposite to itself in the ring, to the peer a quarter rotation ahead, to the peer an eighth rotation ahead, and so on.…”

Section: Related Workmentioning

confidence: 99%

“…For file sharing applications, e.g., the pre-dominant operation is the retrieval of a (key, value) pair for a given key. Many peer-to-peer infrastructures, such as distributed hash tables [2][3][4][5][6], are optimized for exactly this retrieval operation.…”

Section: Introductionmentioning

confidence: 99%

A Ring Infrastructure for Neighbor-Centric Peer-to-Peer Applications

Haase

Tóth

Wäsch

2007

Network-Based Information Systems

View full text Add to dashboard Cite

Abstract. We propose a peer-to-peer system that supports distributed virtual world applications. For these applications, the connections between directly neighboring peers are of the utmost importance. To minimize wide area network traffic and average latency, peers that belong to the same subnet, are grouped together, and these groups are interconnected via wide area connections. To build up and maintain this optimized peer-to-peer structure, we developed a set of protocols that efficiently handle the joining and leaving of peers as well as failure situations. Peers are aranged in the logical ring structure using a two-step discovery and join procedure. The first step uses broadcast messages to discover peers in a local subnet, followed by a local join. If no peer answers in the local subnet, a remote join is performed. With the implemented recovery procedures, our peer-to-peer system can survive multi-node failures in a local subnet as well as the failure of an entire subnet.

show abstract

“…The approach presented in this paper uses the P-Grid [9] distributed hash table (DHT). We assume that the reader is familiar with the general concepts of DHTs and will thus only address the specific and relevant properties of P-Grid.…”

Section: The P-grid Overlaymentioning

confidence: 99%

“…Our clustering algorithm is based on the spring relaxation technique used for example in peerto-peer systems for virtual coordinate systems [7] and for path optimization in stream-based overlays [8] to find minimal energy configurations. In our case, we try to find the minimal configuration for variables stored on nodes organized in an P-Grid [9] overlay network. P-Grid provides us a distributed index of the Bayesian network and efficient lookup mechanisms.…”

Section: Introductionmentioning

confidence: 99%

Efficient Peer-to-Peer Belief Propagation

Schmidt

Aberer

2006

On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper, we will present an efficient approach for distributed inference. We use belief propagation's message-passing algorithm on top of a DHT storing a Bayesian network. Nodes in the DHT run a variant of the spring relaxation algorithm to redistribute the Bayesian network among them. Thereafter correlated data is stored close to each other reducing the message cost for inference. We simulated our approach in Matlab and show the message reduction and the achieved load balance for random, tree-shaped, and scale-free Bayesian networks of different sizes. As possible application, we envision a distributed software knowledge base maintaining encountered software bugs under users' system configurations together with possible solutions for other users having similar problems. Users would not only be able to repair their system but also to foresee possible problems if they would install software updates or new applications.

show abstract

P-Grid: A Self-Organizing Access Structure for P2P Information Systems

Cited by 399 publications

References 6 publications

An Optimal Broadcast Algorithm for Content-Addressable Networks

An Optimal Broadcast Algorithm for Content-Addressable Networks

A Ring Infrastructure for Neighbor-Centric Peer-to-Peer Applications

Efficient Peer-to-Peer Belief Propagation

Contact Info

Product

Resources

About