An Evaluation of Scalable Application-Level Multicast Built Using Peer-To-Peer Overlays
نویسندگان
چکیده
Structured peer-to-peer overlay networks such as CAN, Chord, Pastry, and Tapestry can be used to implement Internet-scale application-level multicast. There are two general approaches to accomplishing this: tree building and flooding. This paper evaluates these two approaches using two different types of structured overlay: 1) overlays which use a form of generalized hypercube routing, e.g., Chord, Pastry and Tapestry, and 2) overlays which use a numerical distance metric to route through a Cartesian hyper-space, e.g., CAN. Pastry and CAN are chosen as the representatives of each type of overlay. To the best of our knowledge, this paper reports the first headto-head comparison of CAN-style versus Pastry-style overlay networks, using multicast communication workloads running on an identical simulation infrastructure. The two approaches to multicast are independent of overlay network choice, and we provide a comparison of flooding versus tree-based multicast on both overlays. Results show that the tree-based approach consistently outperforms the flooding approach. Finally, for treebased multicast, we show that Pastry provides better performance than CAN.
منابع مشابه
An Evaluation of Scalable Application-Level Multicast Built Using Peer-To-Peer Overlay Networks
Peer-to-peer overlay networks such as CAN, Chord, Pastry, and Tapestry can be used to implement Internet-scale application-level multicast. There are two general approaches to accomplishing this: tree building (used by Bayeux and Scribe); and flooding (used by CAN Multicast). This paper presents of an evaluation of these two approaches using CAN and Pastry as the underlying overlay networks. We...
متن کاملScalable Self-Organizing Overlays
Recent developments including peer-to-peer networks and application-level multicast have generated interest in overlays, and by extension in algorithms for automatically maintaining overlay structures. In this paper, we present a self-organizing protocol for forming and managing overlays that scales to at least tens of thousands of nodes. Previous algorithms target small scale overlays and do n...
متن کاملEvaluation and Comparison of Mvring and Tree Based Application Layer Multicast on Structured Peer-To-Peer Overlays
In structured peer-to-peer (p2p) networks such as CAN, Pastry, Chord and Tapestry, there are two general approaches of doing application layer multicast (ALM) i.e. tree building and flooding. In terms of latency, routing length and link stress, tree based ALM like Scribe on Pastry provides better performance than flooding based ALM like in CAN. In this paper, we propose Multiple-VirtualRings (M...
متن کاملMultipath Approach for Reliability in Query Network based Overlaid Multicasting
In Application layer multicast (ALM) also called Overlay Multicast, multicast-related functionalities are moved to end-hosts. The key advantages, overlays offers, are flexibility, adaptability and ease of deployment [1]. Application layer multicast builds a peer-to-peer (P2P) overlay multicast tree topology consisting of end-to-end unicast connections between end-hosts. End users self organize ...
متن کامل