A Topology Self-adaptation Mechanism for Efficient Resource Location (original) (raw)

DANTE: Self-Adaptable Unstructured Peer-to-Peer Networks

2008

Abstract—This paper faces the problem of searching in unstructured peer-to-peer (P2P) networks. It introduces a novel paradigm of self-organized dynamic overlays whose topology adapts to the traffic on the network. The proposed mechanism has been proved to drive the system to an optimal topology when the network is in very high or in very low conditions. In this paper we present DANTE, a P2P system that uses this adaptation mechanism along with random walks for resource location.

Self-adaptable overlays for unstructured peer-to-peer networks

2005

Abstract This paper faces the problem of searching in unstructured peer-to-peer (P2P) networks. It introduces a novel paradigm of self-organized dynamic overlays whose topology adapts to the particular traffic offered to the network. The proposed mechanism uses random walks for resource location and, under this assumption, can be proven to drive the system to an optimal configuration when the network is in very high or in very low load conditions.

Using Random Walks to Find Resources in Unstructured Self-Organized P2P Networks

2008

Abstract In this paper we present on-going work on the use of random walks as the basic mechanism to locate resources in Peer-to-Peer (P2P) systems. In this work we combine random walks with a self-organization of the overlay network, which dynamically adapts the topology of the network to the load of the system. We present the self-organization techniques we have proposed, and show by empirical evaluation that in fact they lead to topologies in which random walks perform very efficiently.

Imbuing unstructured P2P systems with non-intrusive topology awareness

2009 IEEE Ninth International Conference on Peer-to-Peer Computing, 2009

The random nature of unstructured P2P overlays imbues them with enhanced self-* properties. Most of the algorithms which make searching in unstructured P2P systems scalable, such as dynamic querying and 1-hop replication, rely on the random nature of the overlay to function efficiently. However, they do not take into account the structure of the underlying physical communications network, which is anything but random. Efforts to provide topology awareness to unstructured P2P systems often result to clustered graphs which affect negatively algorithms that rely on random overlays. In this paper, we propose ITA, an algorithm which creates a random overlay of randomly connected neighborhoods providing topology awareness to P2P systems, while at the same time has no negative effect on the self-* properties or the operation of the other P2P algorithms. Using extensive simulations, we demonstrate that ITA reduces communication latency by as much as 50% which is important for P2P users. Furthermore, it reduces by 20% the number of IP network messages which is critical for ISPs carrying the burden of transporting P2P traffic. Finally, ITA is shown to reduce significantly the load imposed on the routers of the IP network layer.

Dante: A self-adapting peer-to-peer system

2008

In this paper we introduce DANTE, an unstructured P2P system in which the topology of the underlying overlay network can be dynamically adapted to the system conditions. Such an adaption is performed by the peers in an autonomous manner. DANTE uses a simple search mechanism based on random walks that, combined with the topology adaptation, allows it to work in a very efficient way. We have evaluated how DANTE behaves in practice, showing that it successfully adapts to varying system load conditions.

LLR: A Construction Scheme of a Low-Diameter, Location-Aware, and Resilient P2P Network

2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing, 2006

Since a peer searches for its desired file in a P2P file sharing system, the structure of an overlay network determines the effectiveness of search. In this paper, based on the Barabási-Albert (BA) model, we propose a novel scheme (LLR) to construct a low-diameter and location-aware overlay network where peers can easily find physically-close file holders. LLR has a rewiring method to improve the structure of an overlay network and a recovery method to cope with disappearance of peers. Through several simulation experiments using real physical topologies, we found that LLR could construct an overlay network that had the higher reachability than BA and the higher correlation between physical and logical distances.

”P4L”: A Four Layers P2P Model for Optimizing Resources Discovery and Localization

Lecture Notes in Computer Science, 2006

Peer-to-Peer systems are based on the concept of resources localization and mutualization in dynamic context. In specific environment such as mobile networks, characterized by high variability and dynamicity of network conditions and performances, where nodes can join and leave the network dynamically, resources reliability and availability constitute a critical issue. To deal with this critical issue, we introduce a new concept and model called "P4L" (four layers Peer-to-Peer model) which define a novel P2P architecture, aims to improve: fault-tolerance, self-organization and scalability, with limited complexity while providing a rapid convergence for the lookup algorithm. The cost of "P4L" lookup is O(ln(ni)) where ni is the number of nodes on ring level i (with maximum of 256 nodes in each ring). "P4L" is efficiently adapted to the context where nodes join and leave dynamically and frequently. Each node maintains routing information of 2 * O(ln(n i)), where n i is the number of nodes on one ring. Thus "P4L" is well adapted for terminals with limited resources such as mobile terminals. "P4L" is based on ring topology with each ring connecting "neighbouring" nodes in terms of physical and logical position. When "P4L" is combined with broadcast mechanism, the lookup process is significantly improved. The proposed model is evaluated and compared with Chord protocol, an extension is proposed to support IPv6.

Locality and resource aware peer‐to‐peer overlay networks

Journal of the Chinese Institute of Engineers

Unstructured peer-to-peer (P2P) overlay architectures are attracting more and more attention. In order to solve the topology mismatch problem, many approaches take locality information into account when designing peer-to-peer overlay networks. In this paper, we not only exploit locality but also take resource types into consideration. Taking advantage of data replication, selective search, clustering, and interest groups, we can improve the search performance of unstructured P2P networks. Simulation results show that our algorithm is better than the mOverlay network in the number of messages per search while it maintains almost the same hit ratio and comes with competitive locality properties.

A p2p Network with inherent support for adaptation

2004

There has been a significant body of research conducted into various structured and unstructured overlay network protocols. Both paradigms have advantages for specific application domains and researchers are beginning to examine the benefits of using hybridized systems. We hypothesize that resource awareness and adaptation are essential to the efficient exploitation of the resources available on the diverse nodes which compose peer-to-peer networks. To support this, we propose a hybrid peer-topeer model which uses an unstructured decentralised network layered on top of a structured overlay to provide support for multiple levels of adaptation. This model will improve quality of service for traditional peer-to-peer systems and provide support for novel next generation peer-to-peer applications.