Research on Multicast Routing Algorithm for P2P Overlay Network

2013 ◽  
Vol 347-350 ◽  
pp. 2293-2297
Author(s):  
Liang Bin Chen ◽  
Qiang Li ◽  
Xiang Feng
Keyword(s):  
Multicast Routing ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Multicast Tree ◽  
P2p Network ◽  
Utilization Rate ◽  
Main Task ◽  
Overlay Multicast ◽  
Research Directions ◽  
Multicast Routing Algorithm

Multicast routing is a critical problem in the P2P network. The main task for multicast routing is to establish a multicast tree with good performance, to satisfy the various qualities of service requirements, such as improving the streaming media service quality, and the utilization rate of cyber source. Many efficient overlay multicast routing algorithms are proposed to face the new challenge in current P2P network. This paper attempts to survey the current problems, the solutions for overlay multicast routing algorithms, and points out the further research directions.

Overlay multicast routing algorithm with minimum overlay cost

2009 ◽  
Vol 28 (10) ◽  
pp. 2569-2572
Author(s):  
Long-xin LIN ◽  
Jie ZHOU ◽  
Ling ZHANG ◽  
Zhao YE
Keyword(s):  
Multicast Routing ◽  
Routing Algorithm ◽  
Overlay Multicast ◽  
Multicast Routing Algorithm

A Multicast Routing Algorithm with Cost, Delay and Bandwidth Constraints

2013 ◽  
Vol 756-759 ◽  
pp. 1850-1854
Author(s):  
Yuan Chen Li ◽  
Guo Fang Kuang
Keyword(s):  
Communication Networks ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Multicast Tree ◽  
Routing Problem ◽  
Qos Parameters ◽  
The Cost ◽  
Multicast Routing Algorithm ◽  
Multiple Qos

Quality of service (QoS) generally assumes more than one QoS measure which implies that routing can be categorized as an instance of routing subject to multiple constraints: such as cost, delay, bandwidth, etc. The problem of constructing multicast trees is studied to meet the QoS requirements where it is necessary to provide bounded constraints among the source and all destinations while keeping the cost of the multicast tree low. So, a kind of source-destination QoS multicast routing problem is addressed about communication networks. The algorithm we presented takes bandwidth, delay and loss rate as premise, constructs routing selected function based on shortest path, modifies selected path according to the function above so as to fit multi-QoS parameters. Simulation results show that the algorithm has both lower delay and better performance and can be extended to cases of multiple QoS parameters conveniently.

Several Non-Rearranged Dynamic Multicast Routing Algorithms

2013 ◽  
Vol 397-400 ◽  
pp. 1107-1112
Author(s):  
Yin Fei Dai ◽  
Nian Feng Li
Keyword(s):  
Multicast Routing ◽  
Routing Algorithm ◽  
Performance Testing ◽  
Routing Algorithms ◽  
Delay Constraint ◽  
Advantages And Disadvantages ◽  
Routing Optimization ◽  
Dynamic Multicast ◽  
Multicast Routing Algorithm ◽  
Multicast Algorithms

In this paper, dynamic multicast routing and routing optimization criteria have been described.By comparing and analyzing the advantages and disadvantages of several non-rearranged dynamic multicast algorithms, the advantages of the non-rearranged dynamic multicast routing algorithm based on the delay constraint have been further confirmed and a conclusion has been drawn by performance testing.

A DISTRIBUTED DYNAMIC HEURISTIC FOR DELAY-CONSTRAINED LEAST-COST MULTICAST ROUTING

2000 ◽  
Vol 01 (04) ◽  
pp. 331-344 ◽  
Author(s):  
Zhengying Wang ◽  
Bingxin Shi ◽  
Wei Liu
Keyword(s):  
Group Membership ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Multicast Tree ◽  
Network Resources ◽  
End To End Delay ◽  
Dynamic Multicast ◽  
Simulation Results ◽  
Multicast Routing Algorithm ◽  
Multicast Algorithms

Many new distributed multimedia applications involve dynamic multiple participants, have stringent end-to-end delay requirement and consume large amount of network resources. In this paper, we propose a new distributed dynamic delay-constrained least-cost multicast routing algorithm (DDDCLCMR) to support these applications. DDDCLCMR scales well because the source of the multicast tree needs only limited computation or may even not be involved in the route computation. When group membership changes, the existing multicast tree is perturbed as little as possible. Simulation results show that DDDCLCMR performs very good in terms of delay and cost for both, static and dynamic multicast groups, when compared to the best multicast algorithms known.

A Kind of Load Balance Multicast Routing Algorithm Based on Distributed Computation and Centralized Control

2011 ◽  
Vol 55-57 ◽  
pp. 591-595
Author(s):  
Xiang Chen ◽  
Jun Yong Tang ◽  
Yong Zhang
Keyword(s):  
Load Balance ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Control Agent ◽  
Distributed Computation ◽  
Multicast Tree ◽  
Algorithm Analysis ◽  
Local Network ◽  
Centralized Control ◽  
Multicast Routing Algorithm

Distributed routing can find multicast tree and adapt to dynamic changes of multicast members in case of acknowledge local network state. Majority of current distributed multicast routing algorithms based on the shortest delay, which can achieve load balance large additional overhead. The paper presented a kind of load balance multicast routing algorithm based on distributed computation and centralized control. It reside computation Agent in each node to compute forward probability and to maintain node routing table, node state table and forwarding probability table. In addition, it can detect delay of adjacent nodes and coordinate session establishment based on the copy, parameter transmission and notification of control Agent. On this basis, the algorithm achieved dynamically joins and leave session of multicast members. Algorithm analysis results show that the algorithm can improve the overall efficiency of network transmission.

Sign in / Sign up

Export Citation Format

Share Document