Journal of Systems Engineering and Electronics ›› 2006, Vol. 17 ›› Issue (3): 642-647.doi: 10.1016/S1004-4132(06)60110-2

• SOFTWARE ALGORITHM AND SIMULATION • Previous Articles     Next Articles

Multicast routing algorithm of multiple QoS based on widest-bandwidth

Chen Niansheng1 2, Li Layuan1 & Dong Wushi2
  

  1. 1. School of Computer Science, Wuhan Univ. of Technlogy,Wuhan 430063, R. R. China;
    2. Dept. of Computer Science, Hubei Normal Univ. , Wuhan 435002, P. R. China
  • Online:2006-09-25 Published:2019-12-20

Abstract:

A multicast routing algorithm of multiple QoS constraints based on widest-bandwidth (MRQW) which
takes available bandwidth as the prime metric, considering the constraints of the surplus energy of the node, delay
and delay jitter, is presented. The process of routing based on MRQW is provided for as well. Correctness proof and
the complexity analysis of the MRQW are also given in the paper. Simulation results show that the MRQW has a
good performance in creating multicast trees. It not only satisfys multiple QoS constraints but also makes multicast
links have larger available bandwidth.

Key words: