Minimum Diameter Application Layer Multicast Tree Algorithm

2006 ◽  
Author(s):  
Yanhua Wu ◽  
Yunze Cai ◽  
Jinjie Huang ◽  
Xiaoming Xu
Keyword(s):  
Multicast Tree ◽  
Application Layer Multicast ◽  
Application Layer ◽  
Minimum Diameter ◽  
Tree Algorithm

Application Layer Multicast Based Services on Hierarchical Peer to Peer Architecture

2019 ◽  
Vol 892 ◽  
pp. 64-71
Author(s):  
Mourad Amad ◽  
Abdelmalek Boudries ◽  
Lyes Badis
Keyword(s):  
Peer To Peer ◽  
Multicast Tree ◽  
Second Step ◽  
Application Layer Multicast ◽  
Core Network ◽  
Application Layer ◽  
Construction Algorithm ◽  
Tree Construction ◽  
Proposed Model ◽  
Multicast Services

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.

A Dynamic Model of Hierarchical Application Layer Multicast Tree Node Failure Epidemic

2013 ◽  
Vol 321-324 ◽  
pp. 2780-2784
Author(s):  
Hua Sheng Chen ◽  
Yong Qi ◽  
Wei Hua Li
Keyword(s):  
Dynamic Model ◽  
Failure Detection ◽  
Multicast Tree ◽  
Application Layer Multicast ◽  
Application Layer ◽  
Node Failure ◽  
Performance Simulation ◽  
Detection Scheme ◽  
Tree Node ◽  
Interval Value

Failure Detection periodically detects node validity to maintain application layer network stability. The detection cycle interval value is a key parameter for detection scheme performance; there have been few studies on models of analyzing cycle interval value affecting the scheme. We propose a dynamic model of hierarchical application layer multicast tree node failure epidemic SIRS (NFE-SIRS). The NFE-SIRS analyzes statistical node failure in hierarchical application layer multicast tree structure, and models relationship between cycle interval value and detection scheme repair behavior, finally obtains the expected cycle interval value to improve detection scheme performance. Simulation shows that, the NFE-SIRS can dramatically improve detection scheme performance compared with common fixed cycle interval detection scheme.

Sign in / Sign up

Export Citation Format

Share Document