ICRA: incremental cycle reduction algorithm for optimizing multi-constrained multicast routing

Authors:
Naouel Ben Ali;Miklos Molnar;Abdelfettah Belghith
Affiliations:
HANA Research Group, ENSI, University of Manouba, Tunisia;INSA, University of Rennes, France;HANA Research Group, ENSI, University of Manouba, Tunisia
Venue:
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Year:
2008

Citing 7
Cited 0

QoSMIC: quality of service sensitive multicast Internet protocol

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
A distributed multicast routing protocol for real-time multicast applications

IC3N '97 Selected papers of the 6th international conference on Computer communications and networks
Hop by hop multicast routing protocol

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Hop-by-hop quality of service routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
MAMCRA: a constrained-based multicast routing algorithm

Computer Communications
An overview of quality of service routing for next-generation high-speed networks: problems and solutions

IEEE Network: The Magazine of Global Internetworking
Multicast routing and its QoS extension: problems, algorithms, and protocols

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In future Internet, multimedia applications will be strongly present. When a group of users is concerned by the same traffic flow, the multicast communication can decrease considerably the network bandwidth utilization. The major part of this kind of multicast communication needs quality of service (QoS) specification. Often, the QoS is given as a set of QoS criteria and the computation of feasible or optimal routes corresponds to a multi-constrained optimization. Finding the multicast graph respecting the defined QoS requirements and minimizing network resources is a NPcomplete optimization task. Exhaustive search algorithms are not supported in real networks. Greedy algorithms was proposed to find good multicast sub-graphs. In this paper, we propose a greedy algorithm ICRA to improve the multi-constrained multicast sub-graph computed by the already proposed algorithm Mamcra. We show through different examples that ICRA tackles all cases that Mamcra fails to deal with.