DocumentCode :
3253870
Title :
TabooQMR: A Taboo-based search algorithm improving Mamcra for multicast routing
Author :
Mnaouer, Adel Ben ; Belghith, Abdelfettah ; Ali, Naouel Ben ; Molnár, Miklós
Author_Institution :
ICT Dept., Univ. of Trinidad & Tobago, Wallerfield
fYear :
2008
fDate :
14-17 Oct. 2008
Firstpage :
547
Lastpage :
549
Abstract :
The well-known greedy multicast routing algorithm Mamcra, proposed in the literature, computes the set of shortest paths from a source to all destinations, and then reduces this set to an efficient set of multicast routes, without compromising the requested level of QoS. In this paper, we propose a taboo search algorithm, named TabooQMR, that is augmented by some meta-heuristics to improve the multicast sub-graph computed by the greedy algorithm Mamcra, leading to a considerable improvement, as demonstrated by the simulation results.
Keywords :
multicast communication; quality of service; search problems; telecommunication network routing; Mamcra; QoS; meta-heuristics; multicast routing; multicast sub-graph; quality of service; taboo-based search algorithm; tabooQMR; Bandwidth; Computational modeling; Delay; Greedy algorithms; Multicast algorithms; Quality of service; Routing; Video on demand; Video sharing; Videoconference;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Local Computer Networks, 2008. LCN 2008. 33rd IEEE Conference on
Conference_Location :
Montreal, Que
Print_ISBN :
978-1-4244-2412-2
Electronic_ISBN :
978-1-4244-2413-9
Type :
conf
DOI :
10.1109/LCN.2008.4664231
Filename :
4664231
Link To Document :
بازگشت