Results 1 - 10
of
18
Epidemic-style Management of Semantic Overlays for Content-Based Searching
- In EuroPar
, 2005
"... Abstract. A lot of recent research on content-based P2P searching for filesharing applications has focused on exploiting semantic relations between peers to facilitate searching. To the best of our knowledge, all methods proposed to date suggest reactive ways to seize peers ’ semantic relations. Tha ..."
Abstract
-
Cited by 87 (11 self)
- Add to MetaCart
(Show Context)
Abstract. A lot of recent research on content-based P2P searching for filesharing applications has focused on exploiting semantic relations between peers to facilitate searching. To the best of our knowledge, all methods proposed to date suggest reactive ways to seize peers ’ semantic relations. That is, they rely on the usage of the underlying search mechanism, and infer semantic relations based on the queries placed and the corresponding replies received. In this paper we follow a different approach, proposing a proactive method to build a semantic overlay. Our method is based on an epidemic protocol that clusters peers with similar content. It is worth noting that this peer clustering is done in a completely implicit way, that is, without requiring the user to specify his preferences or to characterize the content of files he shares. 1
Self-stabilizing structured ring topology p2p systems
"... We propose a self-stabilizing and modeless peer-topeer(P2P) network construction and maintenance protocol, called the Ring Network(RN) protocol. The RN protocol, when started on a network of peers that are in an arbitrary state, will cause the network to converge to a structured P2P system with a di ..."
Abstract
-
Cited by 36 (0 self)
- Add to MetaCart
(Show Context)
We propose a self-stabilizing and modeless peer-topeer(P2P) network construction and maintenance protocol, called the Ring Network(RN) protocol. The RN protocol, when started on a network of peers that are in an arbitrary state, will cause the network to converge to a structured P2P system with a directed ring topology, where peers are ordered according to their identifiers. Furthermore, the RN protocol maintains this structure in the face of peer joins and departures. The RN protocol is a distributed and asynchronous message-passing protocol, which fits well the autonomous behavior of peers in a P2P system. The RN protocol requires only the existence of a bootstrapping system which is weakly connected. Peers do not need to be informed of any global network state, nor do they need to assist in repairing the network topology when they leave. We provide a proof of the self-stabilizing nature of the protocol, and experimentally measure the average cost (in time and number of messages) to achieve convergence. 1.
On Gossip and populations
- in "16th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2009), Slovénie Piran
"... Gossip protocols are simple, robust and scalable and have been consistently applied to many (mostly wired) distributed systems. Nevertheless, most validation in this area has been empirical so far and there is a lack of a theoretical counterpart to characterize what can and cannot be computed with g ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
(Show Context)
Gossip protocols are simple, robust and scalable and have been consistently applied to many (mostly wired) distributed systems. Nevertheless, most validation in this area has been empirical so far and there is a lack of a theoretical counterpart to characterize what can and cannot be computed with gossip protocols. Population protocols, on the other hand, benefit from a sound theoretical framework but little empirical evaluation. In this paper, we establish a correlation between population and gossip-based protocols. We propose a classification of gossip-based protocols, based on the nature of the underlying peer sampling service. First, we show that the class of gossip protocols, where each node relies on an arbitrary sample, is equivalent to population protocols. Second, we show that gossip-based protocols, relying on a more powerful peer sampling service providing peers using a clearly identified set of other peers, are equivalent to community protocols, a modern variant of population protocols. Leveraging the resemblances between population and gossip protocols enables to provide a theoretical framework for distributed systems where global behaviors emerge from a set of local interactions, both in wired and wireless settings. The practical validations of gossip-protocols provide empirical evidence of quick convergence times of such algorithms and demonstrate their practical relevance. While existing results in each area can be immediately applied, this also leaves the space to transfer any new results, practical or theoretical, from one domain to the other. 1
1 Myconet: A Fungi-inspired Model for Superpeer-based Peer-to-Peer Overlay Topologies
"... Abstract—Unstructured peer-to-peer networks can be extremely flexible, but, because of size, complexity, and high variability in peers ’ capacity and reliability, it is a continuing challenge to build peer-to-peer systems that are resilient to failure and effectively manage their available resources ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
(Show Context)
Abstract—Unstructured peer-to-peer networks can be extremely flexible, but, because of size, complexity, and high variability in peers ’ capacity and reliability, it is a continuing challenge to build peer-to-peer systems that are resilient to failure and effectively manage their available resources. We have drawn inspiration from the sophisticated, robust, root-like structures of fungal hyphae to design Myconet, an approach to superpeer overlay construction, which models regular peers as biomass, and superpeers as hyphae that attract and concentrate bio-mass, while maintaining strong inter-connections with one another. Simulations of the Myconet peer-to-peer protocol show promising results in terms of network stabilization, response to catastrophic failure, capacity utilization, and proportion of peers to superpeers, when compared to other unstructured approaches. I.
GOSSIP: Gossip Over Storage Systems Is Practical
"... Gossip-based mechanisms are touted for their simplicity, limited resource usage, robustness to failures, and tunable system behavior. These qualities make gossiping an ideal mechanism for storage systems that are responsible for maintaining and updating data in a mist of failures and limited resourc ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
(Show Context)
Gossip-based mechanisms are touted for their simplicity, limited resource usage, robustness to failures, and tunable system behavior. These qualities make gossiping an ideal mechanism for storage systems that are responsible for maintaining and updating data in a mist of failures and limited resources (e.g., intermittent network connectivity, limited bandwidth, constrained communication range, or limited battery power). We focus on persistent storage systems that, unlike mere caches, are responsible for the durability and consistency of data. Examples of such systems may be encountered in many different environments, in particular: wide-area networks (limited bandwidth), wireless sensor networks (limited resources), and mobile ad hoc networks (intermittent connectivity). In this paper, we demonstrate the qualities of gossiping in these three respective environments. 1.
Building latency-aware overlay topologies with QuickPeer
- In ICAS/ICNS
, 2005
"... This work presents a gossip-based protocol, termed QuickPeer, which builds and maintains latency-aware overlay topologies. Such topologies are useful for several distributed applications, like distributed online gaming, context-aware P2P applications and QoS-aware publish/subscribe systems. The dist ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
(Show Context)
This work presents a gossip-based protocol, termed QuickPeer, which builds and maintains latency-aware overlay topologies. Such topologies are useful for several distributed applications, like distributed online gaming, context-aware P2P applications and QoS-aware publish/subscribe systems. The distinctive feature of QuickPeer is that it can manage large scale overlay topologies providing each host in the overlay with its closest or furthest neighbour, according to network distance (RTT), in few gossip rounds. We present experimental results that prove that QuickPeer is a scalable and robust solution for large-scale latency-aware overlay topology management. Keywords: Epidemic algorithms, Network-aware topology management, Virtual coordinates, Peer-to-Peer systems,
Code-Partitioning Gossip
"... Code-Partitioning Gossip (CPG) is a novel technique to facilitate implementation and analysis of gossip protocols. A gossip exchange is a pair-wise transaction between two nodes; a gossip system executes an endless sequence of exchanges between nodes chosen by a randomized procedure. Using CPG, the ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
(Show Context)
Code-Partitioning Gossip (CPG) is a novel technique to facilitate implementation and analysis of gossip protocols. A gossip exchange is a pair-wise transaction between two nodes; a gossip system executes an endless sequence of exchanges between nodes chosen by a randomized procedure. Using CPG, the effects of a gossip exchange are succinctly defined by a single function that atomically updates a pair of node states based on their previous values. This function is automatically partitioned via program slicing into executable code for the roles of gossip-initiator and gossiprecipient, and networking code is added automatically. CPG may have concrete benefits for protocol analysis and authoring composite gossip protocols.
Efficient and Flexible Search in Large Scale Distributed Systems
"... I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. Peer-to-peer (P2P) technology has triggered a wide range ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. Peer-to-peer (P2P) technology has triggered a wide range of distributed systems beyond simple file-sharing. Distributed XML databases, distributed computing, server-less web publishing and networked resource/service sharing are only a few to name. Despite of the diversity in applications, these systems share a common problem regarding searching and discovery of information. This commonality stems from the transitory nodes population and volatile information content in the participating nodes. In such dynamic environment, users are not expected to have the exact information about the available objects in the system. Rather queries are based on partial information, which requires the search mechanism to be flexible. On the other hand, to scale with network size the search mechanism is required to be bandwidth efficient. Since the advent of P2P technology experts from industry and academia have proposed
