Optimal multicast multichannel routing in computer networks

This paper presents a polynomial time algorithm for optimal multicast routing and quality of service (QoS) guarantees in networks with multichannel paths. It minimizes end-to-end delay and consumption of bandwidth across channels using linear programming formulation (LPF). At first, we study some existing unicast and multicast algorithms. The existing unicast algorithms transfer messages from a source node to a destination node and existing multicast algorithms transfer messages from a source node to a group of destination nodes using single paths, multichannel paths or minimum spanning trees in a minimum time. Our survey shows that there are some problems and weaknesses in applying these algorithms to the network. Then we will remove these weaknesses by constructing a new algorithm, called optimal multicast multichannel routing algorithm, which is more efficient than existing algorithms. The OMMR algorithm formulates capacities and resources of the network in terms of a linear programming system of equalities or inequalities. It also, transfers data from a sender node to the group of receivers using multichannel paths in minimal time. In fact, the key innovative aspect of this work lies in the ability to allocating resources to traffic flows in multicast environments optimally. Computer examples will show that the new algorithm is more efficient than the existing algorithms.