A multi-constrained multicast QoS routing algorithm
Computer Communications
| Hi-index | 0.00 |
The original core-based multicast routing protocols construct the shortest paths between the core and the members in a multicast group without considering the quality-of-service (QoS) requirement. Providing quality-of-service guarantees in core-based multicast routing technique is a key issue for deploying multimedia applications. To support QoS, we need to find an optimal path among all end-to-end feasible paths satisfying multiple QoS constraints (e.g., bandwidth, delay, jitter, packet loss, etc.) This problem is called heuristic multi-constrained optimal path (H_MCOP). In this research, we propose a new heuristic, based on H_MCOP, namely H_MCCBT, for providing multiconstrained QoS in core-based tree technique. The simulation results show that the proposed algorithm can provide QoS guarantees for deploying QoS-aware applications. Specifically, it can provide average throughput and average end-to-end delay better than that ofCore-based Tree constructed by the original algorithm with Non-QoS requirement.