Multicast Routing Model Research Articles

Fault-tolerant multicast routing in infocommunication network with path and bandwidth protection

The article presents and investigates a flow-based mathematical model of fault-tolerant multicast routing. Under the proposed mathematical model, the technical task of fault-tolerant multicast routing was reduced to the Boolean programming optimization problem. The mathematical model was based on linear optimality criterion and constraints represented by the conditions of single-path routing, flow conservation, multicast connectivity, and prevention of overload and looping. The routing variables that guided the multicast routing process were Boolean. The optimal primary and backup paths are calculated by implementing path and bandwidth protection schemes within the model for each multicast flow. The restrictions on routing variables introduced into the model were responsible for protecting the route and bandwidth. The optimality criterion in determining the optimal and backup multicast paths at the level of routing metrics considered the network topology and links bandwidth. The additive nature of the criterion focused on finding paths that included a minimum number of communication links. According to the selected routing metric, a feature of the model is to ensure priority in assigning the primary route of the path that had a shorter «length» than the backup path. The analysis of the obtained solutions confirmed their operability under the specified protection scheme’s implementation and their optimality according to variants of the used routing metrics. The proposed mathematical model can be used to develop the fault-tolerant multicast routing protocols of multimedia flows.

A secure multicast routing algorithm Based on distributed PCE in multi-domain optical networks

Aiming at the calculation of secure multicast routing in multi-domain optical network, a new secure multicast routing algorithm based on distributed path calculation element was proposed. Firstly, the distributed PCE multicast routing model was constructed, and the intra-domain cost, inter-domain cost, maximum available wavelength and related constraints were defined. Secondly, the pheromone update strategy of ant colony algorithm with ant queen was locally simplified and modified to make it suitable for the distributed PCE architecture of multi-domain optical network. At the same time, by optimizing the trust value calculation method in the lightweight cross domain trust model, the algorithm can be applied to the calculation of trust value of multicast routing in multi domain optical networks. Finally, the specific implementation steps of the algorithm were given. The analysis and experimental results show that the algorithm can not only ensure the security of cross domain multicast routing, but also prevent the malicious nodes from destroying. Compared with the typical multicast routing algorithm, it has better performance in multicast tree cost and blocking rate in malicious node environment.

Multicast Routing Model to Minimize Number of Flow Entries in Software-Defined Network

Software-defined network (SDN) is a network that the centralized SDN controller stores flow entries in the flow table of each SDN switch and controls packet flows as instructed by the stored flow entries. When a multicast service is provided in an SDN, the SDN controller stores a multicast entry dedicated for a multicast group in each SDN switch. It is necessary to suppress the number of flow entries required to set up a multicast tree due to the limited capacity of the flow table. In a conventional research, a multicast routing model that suppresses the number of multicast entries in one multicast request by replacing a part of them with unicast entries has been devised. However, since this conventional model individually determines a multicast tree route for each request, unicast entries configured for the same receiver are distributed in various SDN switches when multiple multicast services are requested. As a result, there is still the possibility of improving the reduction of the number of flow entries. In this paper, we propose a multicast routing model for multiple multicast requests that minimizes the number of flow entries. This proposed model determines multiple multicast tree routes simultaneously so that a unicast entry configured for the same receiver and stored in the same SDN switch is shared by multicast trees. We formulate the proposed model as an Integer Linear Programming (ILP) problem. Numerical results show that the proposed model reduces the required number of flow entries compared to the conventional model.

Tree-Based Ant Colony Optimization Algorithm for Effective Multicast Routing in Mobile Adhoc Network

Background: Multimedia transmission over wireless communication is gaining momentum with rapid use of mobile hand-held devices. Providing a QoS based routing solution is a major challenge, due to the transient and inaccurate state of Mobile Ad hoc Networks. Discovering optimal multicast routes is an NP-Problem and hence, QoS based routing is typically an optimization problem. Swarm Intelligence is a heuristic-based approach to find solutions to various complex problems using the principle of collective behaviour of natural agents. Objective: An ACO based approach for optimization of QoS based multicast routing algorithm for multimedia streaming applications is proposed. Proposed approach performed well in comparison to other state-of-the-art approaches with respect to path maintenance, packet delivery ratio, and end-toend delay. Methods: The multicast routing model is simulated as a tree structure, where the nodes represent stations and the edges represent the link between the stations. Results: Results show that proposed approach is much faster in convergence speed than the conventional AntNet. With the increasing size of the MANET environment, the convergence time of proposed approach is much better than AntNet. This is mainly due to the trace maintenance, treebased approach for path selection and implementation of local update and global update of the pheromone values. Conclusion: We can conclude that the proposed approach is a more effective algorithm for multiconstraints multicast routing.

Improvement of the flow-based multicast routing model on the principles of Traffic Engineering technology

Improvement of the flow-based multicast routing model on the principles of Traffic Engineering technology

Multipath-Based Multicasting Strategies for Wormhole-Routed Star Graph Interconnection Networks

The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In this paper, we present a multipath-based multicast routing model for wormholerouted star graph networks, propose two efficient multipath routing schemes, and contrast the performance of the proposed schemes with the performance of the scheme presented in our previous work. Both of the two proposed schemes have been proven to be deadlock-free. The first scheme, simple multipath routing, uses multiple independent paths for concurrent multicasting. The second scheme, two-phase multipath routing, includes two phases: source-to-relay and relay-to-destination. For each phase, multicasting is carried out using simple multipath routing. Experimental results show that, for short and medium messages with small message startup latencies, the proposed schemes reduce multicast latency more efficiently than other schemes.

KHIP—a scalable protocol for secure multicast routing

We present Keyed HIP (KHIP), a secure, hierarchical multicast routing protocol. We show that other shared-tree multicast routing protocols are subject to attacks against the multicast routing infrastructure that can isolate receivers or domains or introduce loops into the structure of the multicast routing tree. KHIP changes the multicast routing model so that only trusted members are able to join the multicast tree. This protects the multicast routing against attacks that could form branches to unauthorized receivers, prevents replay attacks and limits the effects of flooding attacks. Untrusted routers that are present on the path between trusted routers cannot change the routing and can mount no denial-of-service attack stronger than simply dropping control messages. KHIP also provides a simple mechanism for distributing data encryption keys while adding little overhead to the protocol.

A theory of deadlock-free adaptive multicast routing in wormhole networks

A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks, proposed by the author (1991, 1993), supplies sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. Also, two design methodologies were proposed. Multicast communication refers to the delivery of the same message from one source node to an arbitrary number of destination nodes. A tree-like routing scheme is not suitable for hardware-supported multicast in wormhole networks because it produces many headers for each message, drastically increasing the probability of a message being blocked. A path-based multicast routing model was proposed by Lin and Ni (1991) for multicomputers with 2D-mesh and hypercube topologies. In this model, messages are not replicated at intermediate nodes. This paper develops the theoretical background for the design of deadlock-free adaptive multicast routing algorithms. This theory is valid for wormhole networks using the path-based routing model. It is also valid when messages with a single destination and multiple destinations are mixed together. The new channel dependencies produced by messages with several destinations are studied. Also, two theorems are proposed, developing conditions to verify that an adaptive multicast routing algorithm is deadlock-free, even when there are cyclic dependencies between channels. As an example, the multicast routing algorithms of Lin and Ni are extended, so that they can take advantage of the alternative paths offered by the network. >