• Title/Summary/Keyword: Multicast algorithm

Search Result 256, Processing Time 0.018 seconds

On Minimum Cost Multicast Routing Based on Cost Prediction

  • Kim, Moon-Seong;Mutka, Matt W.;Hwang, Dae-Jun;Choo, Hyun-Seung
    • Journal of Communications and Networks
    • /
    • v.11 no.5
    • /
    • pp.500-508
    • /
    • 2009
  • We have designed an algorithm for a problem in multicast communication. The problem is to construct a multicast tree while minimizing its cost, which is known to be NP-complete. Our algorithm, which employs new concepts defined as potential cost and spanning cost, generates a multicast tree more efficiently than the well-known heuristic called Takahashi and Matsuyama (TM) [1] in terms of tree cost. The time complexity of our algorithm is O($kn^2$) for an n-node network with k members in the multicast group and is comparable to the TM. Our empirical performance evaluation comparing the proposed algorithm with TM shows that the enhancement is up to 1.25%~4.23% for each best case.

Multiple Multicast Tree Allocation Algorithm in Multicast Network

  • Lee Chae Y.;Cho Hee K.
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.120-127
    • /
    • 2002
  • The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols and construct multicast routing graphs for a single multicast group. However. there have been few researches about the relation between multiple and concurrent multicast groups. In this paper, the multiple multicast tree allocation algorithm to avoid congestion is proposed. The multicast group with different bandwidth requirement is also considered. A two-phase algorithm is proposed. The first phase is for basic search and the second phase for further improvement. The performance of the proposed algorithm is experimented with computational results. Computational results show that the proposed algorithm outperforms an existing algorithm.

  • PDF

Multi-Objective Micro-Genetic Algorithm for Multicast Routing (멀티캐스트 라우팅을 위한 다목적 마이크로-유전자 알고리즘)

  • Jun, Sung-Hwa;Han, Chi-Geun
    • IE interfaces
    • /
    • v.20 no.4
    • /
    • pp.504-514
    • /
    • 2007
  • The multicast routing problem lies in the composition of a multicast routing tree including a source node and multiple destinations. There is a trade-off relationship between cost and delay, and the multicast routing problem of optimizing these two conditions at the same time is a difficult problem to solve and it belongs to a multi-objective optimization problem (MOOP). A multi-objective genetic algorithm (MOGA) is efficient to solve MOOP. A micro-genetic algorithm(${\mu}GA$) is a genetic algorithm with a very small population and a reinitialization process, and it is faster than a simple genetic algorithm (SGA). We propose a multi-objective micro-genetic algorithm (MO${\mu}GA$) that combines a MOGA and a ${\mu}GA$ to find optimal solutions (Pareto optimal solutions) of multicast routing problems. Computational results of a MO${\mu}GA$ show fast convergence and give better solutions for the same amount of computation than a MOGA.

A Genetic Algorithm for Cluster Based Multicast Routing Problem (클러스터 기반의 멀티캐스트 라우팅 문제 해법을 위한 유전자 알고리즘)

  • 강명주
    • Journal of the Korea Society of Computer and Information
    • /
    • v.8 no.3
    • /
    • pp.150-155
    • /
    • 2003
  • Multicasting, the transmission of data to a group, can be solved from constructing multicast tree, that is, the whole network is partitioned to some clusters and the clusters are constructed by multicast tree. This paper proposes an algorithm that reduces the multicast routing costs using a clustering method. Multicast tree is constructed by minimum-cost Steiner tree. It is important to solve the mnimum-cost Steiner tree problem in the multicast routing problems. Hence, this paper proposes a genetic algorithm for multicast routing problems using clustering method.

  • PDF

Multicast Tree Construction with User-Experienced Quality for Multimedia Mobile Networks

  • Jung, Hoejung;Kim, Namgi
    • Journal of Information Processing Systems
    • /
    • v.13 no.3
    • /
    • pp.546-558
    • /
    • 2017
  • The amount of multimedia traffic over the Internet has been increasing because of the development of networks and mobile devices. Accordingly, studies on multicast, which is used to provide efficient multimedia and video services, have been conducted. In particular, studies on centralized multicast tree construction have attracted attention with the advent of software-defined networking. Among the centralized multicast tree construction algorithms, the group Takahashi and Matsuyama (GTM) algorithm is the most commonly used in multiple multicast tree construction. However, the GTM algorithm considers only the network-cost overhead when constructing multicast trees; it does not consider the temporary service disruption that arises from a link change for users receiving an existing service. Therefore, in this study, we propose a multiple multicast tree construction algorithm that can reduce network cost while avoiding considerable degradation of service quality to users. This is accomplished by considering both network-cost and link-change overhead of users. Experimental results reveal that, compared to the GTM algorithm, the proposed algorithm significantly improves the user-experienced quality of service by substantially reducing the number of linkchanged users while only slightly adding to the network-cost overhead.

A Study on The Efficient Multicast Algorithm of Wormhole Routing Method in Multistage Networks (다단계 네트워크에서 웜홀 라우팅 방식의 효율적인 멀티캐스트 알고리즘 연구)

  • 김소은;김창수;최계현
    • Journal of Korea Multimedia Society
    • /
    • v.2 no.2
    • /
    • pp.184-194
    • /
    • 1999
  • We present a new algorithm to minimize channel contention while sending multiple messages from multiple source to overlapped destination set on Multistage Interconnection Network (MIN) which supports wormhole routed turnaround routing. The multicast tree of the U-MIN(Unicast MIN) algorithm is useful in performing messages from one source to multiple destination but gives rise to a serious channel connection in performing multiple multicast because it has been designed for only single multicast. For multiple multicast communication on MIN, we address how to implement multiple multicast services efficiently. And a SPU-MIN(Source Partitioned Unicast MIN) algorithm is proposed and shown to be superior than the U-MIN algorithm for multiple multicast. The turnaround routing algorithm based on wormhole routing technique is employed as a message sending method.

  • PDF

A Novel Shared Segment Protection Algorithm for Multicast Sessions in Mesh WDM Networks

  • Lu, Cai;Luo, Hongbin;Wang, Sheng;Li, Lemin
    • ETRI Journal
    • /
    • v.28 no.3
    • /
    • pp.329-336
    • /
    • 2006
  • This paper investigates the problem of protecting multicast sessions in mesh wavelength-division multiplexing (WDM) networks against single link failures, for example, a fiber cut in optical networks. First, we study the two characteristics of multicast sessions in mesh WDM networks with sparse light splitter configuration. Traditionally, a multicast tree does not contain any circles, and the first characteristic is that a multicast tree has better performance if it contains some circles. Note that a multicast tree has several branches. If a path is added between the leave nodes on different branches, the segment between them on the multicast tree is protected. Based the two characteristics, the survivable multicast sessions routing problem is formulated into an Integer Linear Programming (ILP). Then, a heuristic algorithm, named the adaptive shared segment protection (ASSP) algorithm, is proposed for multicast sessions. The ASSP algorithm need not previously identify the segments for a multicast tree. The segments are determined during the algorithm process. Comparisons are made between the ASSP and two other reported schemes, link disjoint trees (LDT) and shared disjoint paths (SDP), in terms of blocking probability and resource cost on CERNET and USNET topologies. Simulations show that the ASSP algorithm has better performance than other existing schemes.

  • PDF

Multicast Tree Generation using Meta Reinforcement Learning in SDN-based Smart Network Platforms

  • Chae, Jihun;Kim, Namgi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.9
    • /
    • pp.3138-3150
    • /
    • 2021
  • Multimedia services on the Internet are continuously increasing. Accordingly, the demand for a technology for efficiently delivering multimedia traffic is also constantly increasing. The multicast technique, that delivers the same content to several destinations, is constantly being developed. This technique delivers a content from a source to all destinations through the multicast tree. The multicast tree with low cost increases the utilization of network resources. However, the finding of the optimal multicast tree that has the minimum link costs is very difficult and its calculation complexity is the same as the complexity of the Steiner tree calculation which is NP-complete. Therefore, we need an effective way to obtain a multicast tree with low cost and less calculation time on SDN-based smart network platforms. In this paper, we propose a new multicast tree generation algorithm which produces a multicast tree using an agent trained by model-based meta reinforcement learning. Experiments verified that the proposed algorithm generated multicast trees in less time compared with existing approximation algorithms. It produced multicast trees with low cost in a dynamic network environment compared with the previous DQN-based algorithm.

Solving Cluster Based Multicast Routing Problems Using A Simulated Annealing Algorithm (시뮬레이티디 어닐링 알고리즘을 이용한 클러스터 기반의 멀티캐스트 라우팅 문제 해법)

  • Kang Myung-Ju
    • Journal of the Korea Society of Computer and Information
    • /
    • v.9 no.3
    • /
    • pp.189-194
    • /
    • 2004
  • This paper proposes a Simulated Annealing(SA) algorithm for cluster-based Multicast Routing problems. Multicasting, the transmission of data to a group, can be solved from constructing multicast tree, that is. the whole network is partitioned to some clusters and the clusters are constructed by multicast tree. Multicast tree can be constructed by minimum-cost Steiner tree. In this paper, an SA algorithm is used in the minimum-cost Steiner tree. Especially, in SA, the cooling schedule is an important factor for the algorithm. Hence, in this paper, a cooling schedule is proposed for SA for multicast routing problems and analyzed the simulation results.

  • PDF

Energy-efficient Multicast Algorithm for Survivable WDM Networks

  • Pu, Xiaojuan;Kim, Young-Chon
    • Current Optics and Photonics
    • /
    • v.1 no.4
    • /
    • pp.315-324
    • /
    • 2017
  • In recent years, multicast services such as high-definition television (HDTV), video conferencing, interactive distance learning, and distributed games have increased exponentially, and wavelength-division multiplexing (WDM) networks are considered to be a promising technology due to their support for multicast applications. Multicast survivability in WDM networks has been the focus of extensive attention since a single-link failure in an optical network may result in a massive loss of data. But the improvement of network survivability increases energy consumption due to more resource allocation for protection. In this paper, an energy-efficient multicast algorithm (EEMA) is proposed to reduce energy consumption in WDM networks. Two cost functions are defined based on the link state to determine both working and protection paths for a multicast request in WDM networks. To increase the number of sleeping links, the link cost function of the working path aims to integrate new working path into the links with more working paths. Sleeping links indicate the links in sleep mode, which do not have any working path. To increase bandwidth utilization by sharing spare capacity, the cost function of the protection path is defined to use sleeping fibers for establishing new protection paths. Finally, the performance of the proposed algorithm is evaluated in terms of energy consumption, and also the blocking probability is evaluated under various traffic environments through OPNET. Simulation results show that our algorithm reduces energy consumption while maintaining the quality of service.