Delay-constrained minimum cost multicast tree algorithm

2009 ◽  
Vol 29 (1) ◽  
pp. 25-27
Author(s):  
Chun-de YANG ◽  
Jing-jing REN
1996 ◽  
Vol 19 (8) ◽  
pp. 637-644 ◽  
Author(s):  
Xiaohua Jia ◽  
C.H. Lee ◽  
Kia Makki ◽  
Niki Pissinou

2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Xiao-Min Hu ◽  
Jun Zhang

Multicast routing (MR) is a technology for delivering network data from some source node(s) to a group of destination nodes. The objective of the minimum cost MR (MCMR) problem is to find an optimal multicast tree with the minimum cost for MR. This problem is NP complete. In order to tackle the problem, this paper proposes a novel algorithm termed the minimum cost multicast routing ant colony optimization (MCMRACO). Based on the ant colony optimization (ACO) framework, the artificial ants in the proposed algorithm use a probabilistic greedy realization of Prim’s algorithm to construct multicast trees. Moving in a cost complete graph (CCG) of the network topology, the ants build solutions according to the heuristic and pheromone information. The heuristic information represents problem-specific knowledge for the ants to construct solutions. The pheromone update mechanisms coordinate the ants’ activities by modulating the pheromones. The algorithm can quickly respond to the changes of multicast nodes in a dynamic MR environment. The performance of the proposed algorithm has been compared with published results available in the literature. Results show that the proposed algorithm performs well in both static and dynamic MCMR problems.


2013 ◽  
Vol 2013 ◽  
pp. 1-19 ◽  
Author(s):  
Frank Yeong-Sung Lin ◽  
Chiu-Han Hsiao ◽  
Kuo-Chung Chu ◽  
Yi-Heng Liu

With the continued evolution of wireless communication technology, relaying is one of the features proposed for the 4G LTE Advanced (LTE-A) system. The aim of relaying is to enhance both coverage and capacity. The idea of relays is not new, but relaying is being considered to ensure that the optimum performance is achieved to enable the expectations or good quality of service (QoS) of the users to be met while still keeping capital expenditure (CAPEX) within the budgeted bounds of operators. In this paper, we try to stand for an operator to propose a solution that determines where and how many relays should be deployed in the planning stages to minimize the development cost. In the planning stages, we not only derive a multicast tree routing algorithm to both determine and fulfill the QoS requirements to enhance throughput, but we also utilize the Lagrangian relaxation (LR) method in conjunction with optimization-based heuristics and conduct computational experiments to evaluate the performance. Our contribution is utilizing the LR method to propose an optimal solution to minimize the CAPEX of operators to build up a relay network with more efficiency and effectiveness and the QoS can be guaranteed by service level agreement.


2015 ◽  
Vol 36 (1) ◽  
Author(s):  
Huanlin Liu ◽  
Yuming Yang ◽  
Yuan Li ◽  
Yong Chen ◽  
Sheng Huang

AbstractWith the growth of multi-point to multi-point multicast applications, the optical network bandwidth resource consumption is increasing rapidly. It attracted more and more researchers to improve the limited wavelength bandwidth utilization for multicast applications in wavelength division multiplexing (WDM) networks. In the paper, a multi-core shared multicast tree algorithm based on network coding is proposed to minimize the fiber link stress. The proposed algorithm includes three processes: searching the core node candidate set excluding core node loop path, selecting the core nodes from the convergence matrix based on heuristic algorithm, and constructing the multi-core nodes shared trees. The convergence matrix based on the heuristic method is constructed for selecting the core nodes from candidate core node set. To improve the limited wavelength utilization, we introduce network coding into the shared tree to compress the transmitting information. The simulation results show that the proposed algorithm’s performance is better than the existing algorithms’ performance in terms of link stress and balance degree.


2005 ◽  
Vol 12C (1) ◽  
pp. 105-110
Author(s):  
Moon-Seong Kim ◽  
Hyun-Seung Choo ◽  
Young-Ro Lee

Sign in / Sign up

Export Citation Format

Share Document