Optimal Dynamic Multicast Routing

摘要

In a communication network, a multicasting session consists of a group of destination nodes connecting to a source node by some intermediate nodes and links, The intermediate nodes and links construct a multicasting path such as tree and Multicast Multichannel Path (MMCP) which transmit packets from a source node to destination nodes. Within time of the multicast data transmission, either failing some of current destination nodes or adding some new destination nodes can be happen. Failing a destination node loses packets which are bing transmitted to that node and this causes that multicasting path must be recomputed and reconstructed. On the other hand, adding a destination node to the group of current destination nodes changes the multicasting path and it must, be recomputed. This means that failing and adding destination nodes may disconnect multicasting path and halt data transmission, therefore, can lose packets and wastes bandwidth, Consequently, this reduces network performance and wastes resources, Also recomputing and reconstructing the multicasting path repeats routing functions and services of the network and can decrease data rate and network efficiency. In this paper we present a new dynamic routing algorithm which inhibits repeating of functions and services and can also prevent, from losing of packets and wasting of the network bandwidth. Our new algorithm is based on the multichannel constraint-based routing and supports Quality of Services (QoS). We call the new algorithm as Optimal Dynamic Multicast Multichannel Routing (ODMMR). Computational results and simulation analysis will show that our new algorithm is more efficient than other available routing algorithms.