Peer Failures Research Articles

MULTI+: A robust and topology-aware peer-to-peer multicast service

TOPLUS is a lookup service for structured peer-to-peer networks that is based on the hierarchical grouping of peers according to network IP prefixes. In this paper, we present MULTI+, an application-level Multicast protocol for content distribution over a TOPLUS-based peer-to-peer (P2P) network. We use the characteristics of TOPLUS to design an overlay Multicast protocol that allows every peer to connect to an available peer that is close. MULTI+ trees also reduce the amount of redundant flows leaving and entering each network, making efficient usage of the bandwidth. We also study the resiliency of MULTI+ Multicast trees when massive failure or disconnection of peers occur. While the tree reconstruction introduces additional hops, the end-to-end latency increases very little. At the end we compare the trees constructed by MULTI+ with the trees constructed by Scribe, a well-known application-level Multicast system.

Towards Composition Management for Component-based Peer-to-Peer Architectures

Recent peer-to-peer architectures do not fulfill the idea of a service-oriented architecture to allow the flexible composition of services towards concrete applications. This can be justified by the absence of flexible notations for the composition of services that incorporate the dynamic nature exposed by peer-to-peer architectures. In this work, the peer-to-peer architecture DeEvolve is presented that provides novel ways for the composition of services including the handling of exceptions such as the failure of peers. The intention of this approach is to facilitate even less-skilled end-users to compose and to maintain service-oriented applications.

A hybrid architecture for cost-effective on-demand media streaming

We propose a new architecture for on-demand media streaming centered around the peer-to-peer (P2P) paradigm. The key idea of the architecture is that peers share some of their resources with the system. As peers contribute resources to the system, the overall system capacity increases and more clients can be served. The proposed architecture employs several novel techniques to: (1) use the often-underutilized peers’ resources, which makes the proposed architecture both deployable and cost-effective, (2) aggregate contributions from multiple peers to serve a requesting peer so that supplying peers are not overloaded, (3) make a good use of peer heterogeneity by assigning relatively more work to the powerful peers, and (4) organize peers in a network-aware fashion, such that nearby peers are grouped into a logical entity called a cluster. The network-aware peer organization is validated by statistics collected and analyzed from real Internet data. The main benefit of the network-aware peer organization is that it allows to develop efficient searching (to locate nearby suppliers) and dispersion (to disseminate new files into the system) algorithms. We present network-aware searching and dispersion algorithms that result in: (i) fast dissemination of new media files, (ii) reduction of the load on the underlying network, and (iii) better streaming service. We demonstrate the potential of the proposed architecture for a large-scale on-demand media streaming service through an extensive simulation study on large, Internet-like, topologies. Starting with a limited streaming capacity (hence, low cost), the simulation shows that the capacity rapidly increases and many clients can be served. This occurs for all studied arrival patterns, including constant rate arrivals, flash crowd arrivals, and Poisson arrivals. Furthermore, the simulation shows that a reasonable client-side initial buffering of 10–20 s is sufficient to ensure full quality playback even in the presence of peer failures.

A "cluster" based search scheme in peer-to-peer network.

This paper presents a "cluster" based search scheme in peer-to-peer network. The idea is based on the fact that data distribution in an information society has structured feature. We designed an algorithm to cluster peers that have similar interests. When receiving a query request, a peer will preferentially forward it to another peer which belongs to the same cluster and shares more similar interests. By this way search efficiency will be remarkably improved and at the same time good resilience against peer failure (the ability to withstand peer failure) is reserved.