Hierarchical Multicast Tree Algorithms for Application Layer Mesh Networks

Jia, Weijia; Tu, Wanqing; Wu, Jie

doi:10.1007/11534310_59

Cited by 7 publications

(7 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The system saturation points for DPM, DCXY, RCXYP, OCXYP, RCWP and OMTDG are about 20.5, 21.4, 23.5, 35, 36.0 and 38 packets/ms respectively. The new algorithms proposed in this paper achieve the maximum throughput [10]. It reveals that under the same condition, OMTDG obtains the best balance over the performance parameters, i.e., the less resource a system consumes, the higher the throughput and the shorter the end-to end delay under the weight traffic load.…”

Section: Numerical Resultsmentioning

confidence: 86%

Linear Optimal Hierarchical Multicast Tree Algorithms for P2P Database

Fan

Magoulès

et al. 2008

2008 the 4th International Conference on Mobile Ad-Hoc and Sensor Networks

View full text Add to dashboard Cite

For attained high data multicast efficiency for the P2P Database system，the paper proposes a set of novel multicast algorithms. In contrast with the current algorithms, the new algorithms firstly divide the group members into different clusters in terms of static delay distance, then find the central node in the clusters, calculate the space weight of every node, search the data quantity of every node, and find the maximal data quantity node. After obtaining the spatial weight vector and the data quantity weight vector, the algorithms try to find a new vector composed by linear combination of the spatial and data weight vectors. Then the algorithms build binary simple equations between them, seek linear modulus and generate a least weight path tree, namely multicast tree. The multicast tree is then constructed by using the new algorithms. Extended simulation results indicate that these new algorithms are more suitable for P2P Database compared with other well-known existing multicast solutions.

show abstract

Section: Numerical Resultsmentioning

confidence: 86%

Linear Optimal Hierarchical Multicast Tree Algorithms for P2P Database

Fan

Magoulès

et al. 2008

2008 the 4th International Conference on Mobile Ad-Hoc and Sensor Networks

View full text Add to dashboard Cite

show abstract

“…As a downside of this topology, there is a large number of connections that must be maintained, which grows exponentially with the number of OHs. However, the simplicity of the routing algorithms between OHs makes this topology a great candidate for using it as a leaf component in hierarchical topologies [16], [17]. EHs are the producers and consumers of data transferred by the overlay.…”

Section: Overlay Topology and Distribution Algorithmsmentioning

confidence: 99%

Resource usage prediction for application-layer multicast networks

Genge

Haller

2010

Proceedings of the 2010 IEEE 6th International Conference on Intelligent Computer Communication and Processing

View full text Add to dashboard Cite

Abstract-We propose a memory and CPU usage prediction model for application-layer multicast networks. The predicted values are used in the distribution of end-hosts to overlayhosts. Such a distribution enables us to limit the maximum resource consumption for a given node, leading to an efficient utilization of overlay-hosts and, finally, to an increased overall performance of the system. The model parameters are determined using training sets gathered from measuring resource consumption while distributing end-hosts to overlay-hosts. Both end-hosts and overlay-hosts are running on PlanetLab nodes, a testbed that provides researchers a real environment where nodes can become unreachable, network bandwidth can fluctuate and node processing capabilities can drop dramatically. Using the determined parameters, we show that our proposal can be used to estimate memory and CPU usage and to efficiently distribute end-hosts to overlay-hosts.

show abstract

“…The cluster formation guarantees that each cluster contains the closest group members in terms of static delay distance [ 19 ]. According to the results in [ 20 ], the scheme that assigns closed members into the same cluster will improve the scalability and efficiency of the multicast data transfers of the sensor grid.…”

Section: Algorithms For Game and Balance Multicast Architecturementioning

confidence: 99%

“…And we chose three multicast routing approaches for 2- D Sensor grid used for the performance testing and comparison: SPACE which just considers space factor; DATA which just considers data factor; and GBMASG which synthetically considers space and data factors. Moreover in multicast technology, for the space factor, there are several multicast routing algorithms, for example Double-Channel XY Multicast Wormhole Routing (DCXY) [ 20 ], Dual-Path Multicast Routing (DPM) [ 24 ], RCWP, OCXYP, RCXYP, etc. Among these approaches, the DCXYP is the most popular, the routing way just as our SPACE approach.…”

Section: Performance Evaluationmentioning

confidence: 99%

Game and Balance Multicast Architecture Algorithms for Sensor Grid

Fan

Magoulès

et al. 2009

Sensors

View full text Add to dashboard Cite

We propose a scheme to attain shorter multicast delay and higher efficiency in the data transfer of sensor grid. Our scheme, in one cluster, seeks the central node, calculates the space and the data weight vectors. Then we try to find a new vector composed by linear combination of the two old ones. We use the equal correlation coefficient between the new and old vectors to find the point of game and balance of the space and data factorsbuild a binary simple equation, seek linear parameters, and generate a least weight path tree. We handled the issue from a quantitative way instead of a qualitative way. Based on this idea, we considered the scheme from both the space and data factor, then we built the mathematic model, set up game and balance relationship and finally resolved the linear indexes, according to which we improved the transmission efficiency of sensor grid. Extended simulation results indicate that our scheme attains less average multicast delay and number of links used compared with other well-known existing schemes.

show abstract

Hierarchical Multicast Tree Algorithms for Application Layer Mesh Networks

Cited by 7 publications

References 13 publications

Linear Optimal Hierarchical Multicast Tree Algorithms for P2P Database

Linear Optimal Hierarchical Multicast Tree Algorithms for P2P Database

Resource usage prediction for application-layer multicast networks

Game and Balance Multicast Architecture Algorithms for Sensor Grid

Contact Info

Product

Resources

About