Modelling of Minimum Cost Overlay Multicast Tree in Two Layer Networks

Author(s):  
Michal Kucharzak ◽  
Krzysztof Walkowiak
2008 ◽  
Vol 31 (14) ◽  
pp. 3163-3168 ◽  
Author(s):  
Jin-Han Jeon ◽  
Seung-chul Son ◽  
Ji-Seung Nam

2009 ◽  
Vol 29 (1) ◽  
pp. 25-27
Author(s):  
Chun-de YANG ◽  
Jing-jing REN

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.


Electronics ◽  
2021 ◽  
Vol 10 (23) ◽  
pp. 3002
Author(s):  
Bo Li ◽  
Jinlin Wang ◽  
Xiaoyong Zhu ◽  
Jiali You ◽  
Linlin Hu

Many information-centric services have emerged, such as IPTV and video conferencing. These services put a lot of demands on scalable multicast communication. However, traditional IP multicast has low adoption because of its poor scalability. Therefore, some stateless multicast methods were proposed, which encapsulate the destination’s information into the packet header without requiring routers to maintain the multicast forwarding state. However, stateless multicast also faces some problems, such as ingress router overload, high forwarding overhead, packet redundancy, etc. In addition, most multicast methods cannot optimize the multicast tree because the multicast flow is simply forwarded along the shortest path tree from the source to receivers. This paper proposes an Adaptive Hierarchical Hybrid Multicast (AHHM) based on Information-Centric Networking. To balance the forwarding states and forwarding overhead, AHHM is designed as a two-layer structure, in which the upper layer establishes a stateful main tree and the lower layer establishes several stateless sub trees. The router on the main tree is defined as the multicast join node (MJN), and AHHM uses the Name Resolution System to maintain the mapping between each multicast group name and corresponding MJNs. To optimize the multicast transmission path, we designed the minimum cost selection strategy for users to select the appropriate MJN to join. Simulation results show that compared with Source-Specific Multicast (SSM) and Bit Index Explicit Replication (BIER), AHHM can not only reduce the multicast forwarding states but also reduce the control overhead and link load.


Sign in / Sign up

Export Citation Format

Share Document