Group multicast routing problem: A genetic algorithms based approach
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.07 |
Multicasting is an efficient and effective approach forsupporting content distribution based on the current Internetinfrastructure. In this paper, we have proposes thesource-initiated CRMA (Cycle-breaking Rollback MulticastRouting Algorithm), which is a congestion-aware QoS(Quality of Service) based multicast routing algorithm.CRMA attempts to achieve the objective of minimizingnetwork congestion conditions while satisfying bandwidthand end-to-end path delay requirements from users. Ourproposed approach has several features: (1) It construct ashared symmetric distribution tree for multicast source(s)and its members rather than the conventional approach ofconstructing multicast tree. (2) CRMA combines themulticast path computation with resource allocation throughintroducing the WFQ (Weighted Fair Queuing) packetscheduling into path computation. (3) CRMA can be easilyimplemented and integrated into the common shortest pathrouter architecture without a thorough adjustment. Throughextensive simulations, we demonstrate that our CRMA caneffectively reduce the cost, which is the reflection of networkcongestion conditions, of the computed multicast tree,compared to other proposed multicast routing schemes.