Group: P2P - with tag xxxx [7 articles]

Abstract

In this paper, we consider the problem of data dissemination from a source to multiple receivers over application-layer overlay networks, and seek to significantly improve end-to-end throughput of data dissemination sessions by constructing topologies of high quality. We propose oEvolve, a distributed algorithm that uses the strategy of progressively and adaptively evolving the overlay topology over time toward high-quality topologies, especially with respect to end-to-end throughput of data dissemination. To validate the effectiveness and efficiency of oEvolve, we present a fully ...

Abstract

Recently, there are many research interests in the peer-to-peer overlay architectures. Most widely used unstructured peer-to-peer (P2P) networks rely on central directory servers or massive message flooding, clearly not scalable. Distributed hash tables (DHT)-based structured overlay networks are expected to eliminate flooding and central servers, but can require many long haul messages deliveries. Thus, one important aspect of constructing an efficient overlay network is how to exploit network locality in the underlying network. In this paper, we propose a novel mechanism, ...

Abstract

Multicast avoids sending repeated packets over the same network links and thus offers the promise of supporting multimedia streaming over wide-area networks. Previously, two opposite multicast schemes - forward-path forwarding and reverse-path forwarding - have been proposed on top of structured peer-to-peer (p2p) overlay networks. This paper presents Borg, a new scalable application-level multicast system built on top of p2p overlay networks. Borg is a hybrid protocol that exploits the asymmetry in p2p routing and leverages the reverse-path multicast scheme for ...

Abstract

This paper presents the design, analysis and performance evaluation of VRing, a novel application-layer multicast (ALM) protocol that establishes a virtual ring as an overlay network among the multicast group members in a self-organizing and distributed manner. In order to reduce the routing delay of the ring overlay network, we propose to form a spare ring overlay structure that improves connectivity among group members. The design of the spare ring is justified by proposing, and analytically studying the performance of, a ...

Abstract

In this work, we consider a large-scale distributed network of servers and a problem of content distribution across it. We propose a novel algorithm, called FastReplica, for an efficient and reliable replication of large files in the Internet environment. There are a few basic ideas exploited in FastReplica. In order to replicate a large file among n nodes (n is in the range of 10-30 nodes), the original file is partitioned into n subfiles of equal size and each subfile is ...

Abstract

Self-organizing, structured peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry offer a novel platform for a variety of scalable and decentralized distributed applications. These systems provide efficient and fault-tolerant routing, object location, and load balancing within a self-organizing overlay network.One major problem with these systems is how to bootstrap them. How do you decide which overlay to join? How do you find a contact node in the overlay to join? How do you obtain the code that you should ...

Abstract

In tree-based multicast systems, a relatively small number of interior nodes carry the load of forwarding multicast messages. This works well when the interior nodes are highly-available, dedicated infrastructure routers but it poses a problem for application-level multicast in peer-to-peer systems. SplitStream addresses this problem by striping the content across a forest of interior-node-disjoint multicast trees that distributes the forwarding load among all participating peers. For example, it is possible to construct efficient SplitStream forests in which each peer contributes only ...