Multicast Tree Algorithm Research Articles

QoS-Aware Software-Defined Multicast in LEO Satellite Networks

The emerging low earth orbit (LEO) broadband constellations are capable of distributing videos via advanced multicasting techniques to multiplex bandwidth in both satellite access and backbone networks, thereby reducing huge amounts of traffics. Previous work on LEO-based multicast routing relied on IP multicast, which fails to employ global information to achieve the optimal bandwidth saving. In this article, we leverage the novel software-defined multicasting paradigm on LEO constellations to empower advanced video distribution with optimized multicast trees, thereby significantly outperforming conventional multicasting techniques. In the presence of quality-of-service (QoS) constraints, we propose weighted rectilinear Steiner minimal trees (WRSTs), which balance bandwidth saving and QoS requirements. Our multicast tree algorithm adopts the Voronoi diagram and Delaunay triangulation to obtain suitable candidate Steiner points, which are exploited by subsequent iterative edge substitutions for WRST construction. We also design QoS-aware multicast management schemes to deal with frequent member updates and potential failures in LEO constellations. We carry out thorough experiments to demonstrate the effectiveness and efficiency of the proposed routing tree construction algorithm and multicasting protocols when compared with traditional algorithms.

A QoE-Driven Multicast Strategy With Segment Routing—A Novel Multimedia Traffic Engineering Paradigm

Quality of Experience (QoE) reflects end users' overall experience and feeling with network services, but needs support in terms of end-to-end Quality of Service (QoS). Segment routing (SR) as a new routing paradigm can provide good end-to-end QoS guarantee, making traditional multimedia traffic routing more efficient and scalable. In this paper, we address two problems related to the new SR mechanism: enabling fine-grained end-to-end QoS routing under a complex network environment and constructing the multicast routing tree with branch node load balancing. To solve these problems, an Inaccurate information-based QoE-driven Routing algorithm (IQdR) and a Branch-aware Multicast Tree (BaMT) algorithm were proposed. Simulation test results that have compared the performance of our proposed solution against that of other algorithms show that the previous works were outperformed. Additionally, the results also show that our multicast architecture improves the scalability of the network in terms of the number of flows.

Cost Optimization for the Coupled Video Delivery Networks

Video delivery networks (VDNs) are one of the key enablers for alleviating contradiction between demands increasing for online video and response time of users accessing video content. However, existed works mainly adopt either proactive or reactive delivery scheme, which leads to the problems of backbone traffic overloaded and delays increased. In these works, the impact of performance indicators, such as bandwidth, delay, and personalized demand on delivery cost are not comprehensively taken into account. To overcome these problems, we propose a cost optimization for coupled video delivery model (CO-CVDM), which combines coupled proactive delivery and coupled reactive delivery method to minimize delivery cost in terms of bandwidth consumption, delay performance, personalized demand and construct a multicast delivery tree for the video delivery. The coupled delivery cost minimization problem under constraint conditions is formulated. Since this problem is NP-hard and is prohibitively difficult to solve, we develop a heuristic multicast delivery tree (HMDT) algorithm to provide more optimized approximate cost. Based on this, we extend CO-CVDM to distribute video in a dynamic scenario. Specifically, with dynamic change of user's requirement for video, the process of video delivery is truncated into a sequence of static graphs and the change of interest attenuation is modeled with human forgetting curve. Finally, the numerical simulations are conducted to validate the advantage of CO-CVDM in terms of optimization delivery cost, and the delivery cost is inversely proportional to the attenuation of user interest.

다중 홉 무선 네트�p에서 지연을 고려한 멀티케스트 루팅

Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol : end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results.

Innovating Multicast Tree and Artificial Algorithms for Service Based Routing

In advance network we may use service Based Routing (SBR), so data is transmitted from a source node to destination nodes are not depended on destination addresses. So, it may be comfortable with new advanced technology as cloud computing and also flexible and reliable. Multicast routing is advanced technique to deliver data simultaneously from one source node to multiple destination nodes with QOS (quality of service). In this paper, we introduce a technique that is extended from multicast technique with multiple multicast trees that are conformed quality of service routing and multiple path routing. It also guarantees QOS of routes such as bandwidth. This technique is based on Greedy, Ant Colony Optimization, artificial neural network and fuzzy logic to get optimal routes to transmit data from one source to multiple destination node very effectively. The usage of the ANT Colony optimization, Greedy, fuzzy logic algorithms to find cyclic or multiple paths routes on each trunk by multiple criterions to transmit data effectively.

A Multi-core Shared Tree Algorithm Based on Network Coding for Multi-point Optical Multicast

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.

Performance Characteristics of Cluster -Based Multicast Key Distribution Scheme for Mobile Adhoc Networks

Many emerging commercial and military applications require secure multicast communication in adhoc environments. Secure multicast communication in mobile adhoc networks is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority, high packet loss rates and limited resources such as bandwidth, time and power. Hence key management is the fundamental challenge in achieving reliable secure communication using multicast key distribution for mobile adhoc networks. This paper proposes and evaluates the performance of an new cluster-based multicast tree algorithm with destination sequenced distance vector routing protocol to provide efficient and reliable multicast key distribution. Simulation results in NS2 accurately predict the performance of proposed scheme in terms of energy, latency, key delivery ratio and packet drop rate under varying network conditions. This proposed scheme achieves reliability, while exhibiting low packet loss rate with high key delivery ratio compared with the existing scheme.

Energy efficient CBMT for secure multicast key distribution in mobile ad hoc networks

Multicast key distribution in mobile adhoc networks is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority and limited resources such as bandwidth, time and power. In many multicast interactions, a new member can join, a current member can leave at any time and existing members must communicate securely using multicast key distribution within constrained energy for mobile adhoc networks. This paper proposes a new efficient cluster based multicast tree (CBMT) algorithm for secure multicast key distribution, in which the source node uses a Multicast version of the Destination Sequenced Distance Vector (MDSDV) routing protocol to consume less energy. It also reduces end to end delay in multicast transmission. Simulation results show the efficient CBMT using MDSDV have better system performance in terms of QOS metrics such as energy, latency, key delivery ratio and packet drop rate under varying network conditions. This proposed scheme achieves reliability, while exhibiting low packet loss rate with high key delivery ratio.

Delay-constrained minimum cost multicast tree algorithm

Based on the Random Selective Tree Node First (RSTF) algorithm that constructs minimum cost multicast tree and considering the delay of the network, this paper presented a new algorithm constructing delay-constrained minimum cost multicast tree. The simulation about random network model shows that compared with KPP the new algorithm has better performance in terms of cost and time delay.

Dynamic multicast routing and wavelength assignment using generic graph model for wavelength-division-multiplexing networks

The problem of dynamic multicast routing and wavelength assignment (MC-RWA) in the wavelength-routed wavelength-division-multiplexing networks is addressed. Current solutions to this problem always rely on homogeneous network constructions. However, future backbone networks tend to be heterogeneous in nature. Thus, the dynamic MC-RWA problem should be studied in a more realistic situation by considering the heterogeneity of network structures. A new graph model is proposed for the MC-RWA problem. This model is based on layered auxiliary graph which is generic and able to support various node architectures and heterogeneous network structures. Based on this graph model, the dynamic MC-RWA problem can be simply solved by an efficient multicast tree algorithm on various light-splitting and wavelength-conversion scenarios. In general, this graph model provides a universal platform to study different aspects of the dynamic MC-RWA as well as related problems.

Explicit routing in multicast overlay networks

Application Level Multicast is a promising approach to overcome the deployment problems of IP level multicast by establishing delivery trees using overlay links among end systems. This paper presents algorithms to support traffic engineering, to improve the reliability of multicast delivery, and to facilitate secure group communications. First, we introduce the so-called backup multicast tree algorithm to compute a set of n − 1 backup multicast delivery trees from the default multicast tree. Each backup multicast tree has exactly one link of the default multicast tree that is replaced by a backup link from the set of available links. The algorithm can calculate this set of trees with a complexity of O ( m log n), which is identical with the complexity of well known minimum spanning tree algorithms. The so-called reduced multicast tree algorithm is based on the backup multicast tree algorithm and can calculate a tree from the default multicast tree by removing a particular node and by replacing the links of the removed node. Using the algorithms trees can be calculated individually by each of the nodes but it requires global topology knowledge. We therefore discuss distributed versions of the algorithms.

Multicast Algorithms for Hypercube Multiprocessors

Depending on different switching technologies, the multicast communication problem has been formulated as three different graph theoretical problems: the Steiner tree problem, the multicast tree problem, and the multicast path problem. Our efforts in this paper are to reduce the communication traffic of multicast in hypercube multiprocessors. We propose three heuristic algorithms for the three problem models. Our multicast path algorithm is distributed, our Steiner tree algorithm is centralized, and our multicast tree algorithm is hybrid. Compared with the previous results by simulation, each of our heuristic algorithms improves the communication traffic in the corresponding multicast problem model.

Efficient multicast tree algorithm in ATM networks

Many applications of ATM networks require the multicast function, which sends the same packet to a group of destinations. This paper proposes an algorithm for multicast routing in ATM networks. We define the network cost of a routing as the combination of the cost of establishing connections, the cost of overall bandwidth and the cost of overall switchings. Our routing algorithm works on the original topology of ATM networks with physical switches and physical links, and considers the different switching functionalities of VP (virtual path) switches and VC (virtual channel) switches in the networks. It generates an optimal multicast routing with the minimal overall network cost. Simulations have been done to compare the quality of the routing generated by our algorithm with those of other major algorithms.