scholarly journals Scalable Island Multicast for Peer-to-Peer Streaming

2007 ◽  
Vol 2007 ◽  
pp. 1-9 ◽  
Author(s):  
Xing Jin ◽  
Kan-Leung Cheng ◽  
S.-H. Gary Chan

Despite the fact that global multicast is still not possible in today's Internet, many local networks are already multicast-capable (the so-called multicast “islands”). However, most application-layer multicast (ALM) protocols for streaming have not taken advantage of the underlying IP multicast capability. As IP multicast is more efficient, it would be beneficial if ALM can take advantage of such capability in building overlay trees. In this paper, we propose a fully distributed protocol called scalable island multicast (SIM), which effectively integrates IP multicast and ALM. Hosts in SIM first form an overlay tree using a scalable protocol. They then detect IP multicast islands and employ IP multicast whenever possible. We study the key issues in the design, including overlay tree construction, island management, and system resilience. Through simulations on Internet-like topologies, we show that SIM achieves lower end-to-end delay, lower link stress, and lower resource usage than traditional ALM protocols.

2019 ◽  
Vol 892 ◽  
pp. 64-71
Author(s):  
Mourad Amad ◽  
Abdelmalek Boudries ◽  
Lyes Badis

Application Layer Multicast (ALM) is considered as an attractive approach for implementing wide area multicast services. In ALM, multicast functionality is implemented at the edge instead of the core network (routers). As opposed to network-layer multicast, application layer multicast requires no infrastructure support and can be easily deployed in the Internet. In this paper, we propose a new efficient and scalable model for optimizing application layer multicast using HPM architecture (HPM: A novel hierarchical Peer-to-Peer model for lookup acceleration with provision of physical proximity). This approach benefits from P2P properties and characteristics. In this contribution, we consider our optimized tree construction algorithm simultaneously for each ring of HPM. The global tree construction algorithm is composed of two steps. In the first step, we construct a sub-tree for each ring; the second step is to build a global tree using sub sets of adjacent rings in HPM architecture. The proposed model inherits from main P2P attributes such as: scalability, fault tolerance characterized HPM. Preliminarily performance evaluations show that results are globally satisfactory, the depth of the resulting multicast tree is optimized.


2010 ◽  
Vol 56 (3) ◽  
pp. 1957-1962 ◽  
Author(s):  
Zhou Su ◽  
Masato Oguro ◽  
Yohei Okada ◽  
Jiro Katto ◽  
Sakae Okubo

2013 ◽  
Vol 33 (12) ◽  
pp. 3389-3393
Author(s):  
Ye SHEN ◽  
Jing FENG ◽  
Min YIN ◽  
Weijun MA ◽  
Lei JIANG

Sign in / Sign up

Export Citation Format

Share Document