Internet QoS: Architectures and Mechanisms for Quality of Service
Internet QoS: Architectures and Mechanisms for Quality of Service
OSPF Network Design Solutions
Packet loss probability for DiffServ over IP and MPLS reliable homogeneous multicast networks
Information Processing Letters
Optimal multicast multichannel routing in computer networks
Computer Communications
A multi-constrained multicast QoS routing algorithm
Computer Communications
Optimal multichannel data transmission in computer networks
Computer Communications
A comparison of the Internet multicast routing protocols
Computer Communications
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
The Journal of Supercomputing
The Journal of Supercomputing
| Hi-index | 0.00 |
With the development of multimedia group applications and multicasting demands, the construction of multicast routing tree satisfying Quality of Service (QoS) is more important. A multicast tree, which is constructed by existing multicast algorithms, suffers three major weaknesses: (1) it cannot be constructed by multichannel routing, transmitting a message using all available links, thus the data traffic cannot be preferably distributed; (2) it does not formulate duplication capacity; consequently, duplication capacity in each node cannot be optimally distributed; (3) it cannot change the number of links and nodes used optimally. In fact, it cannot employ and cover unused backup multichannel paths optimally. To overcome these weaknesses, this paper presents a polynomial time algorithm for distributed optimal multicast routing and Quality of Service (QoS) guarantees in networks with multichannel paths which is called Distributed Optimal Multicast Multichannel Routing Algorithm (DOMMR). The aim of this algorithm is: (1) to minimize End-to-End delay across the multichannel paths, (2) to minimize consumption of bandwidth by using all available links, and (3) to maximize data rate by formulating network resources. DOMMR is based on the Linear Programming Formulation (LPF) and presents an iterative optimal solution to obtain the best distributed routes for traffic demands between all edge nodes. Computational experiments and numerical simulation results will show that the proposed algorithm is more efficient than the existing methods. The simulation results are obtained by applying network simulation tools such as QSB, OpNet and MATLB to some samples of network. We then introduce a generalized problem, called the delay-constrained multicast multichannel routing problem, and show that this generalized problem can be solved in polynomial time.