Welcome to the InfoSci Platform
Reference Hub1
New Strategies and Extensions in Kruskal’s Algorithm in Multicast Routing

New Strategies and Extensions in Kruskal’s Algorithm in Multicast Routing

Mohamed Aissa, Adel Ben Mnaouer, Rion Murray, Abdelfettah Belghith
Copyright: © 2011 |Volume: 7 |Issue: 4 |Pages: 20
ISSN: 1548-0631|EISSN: 1548-064X|EISBN13: 9781613505885|DOI: 10.4018/jbdcn.2011100103
Cite Article Cite Article

MLA

Aissa, Mohamed, et al. "New Strategies and Extensions in Kruskal’s Algorithm in Multicast Routing." IJBDCN vol.7, no.4 2011: pp.32-51. http://doi.org/10.4018/jbdcn.2011100103

APA

Aissa, M., Ben Mnaouer, A., Murray, R., & Belghith, A. (2011). New Strategies and Extensions in Kruskal’s Algorithm in Multicast Routing. International Journal of Business Data Communications and Networking (IJBDCN), 7(4), 32-51. http://doi.org/10.4018/jbdcn.2011100103

Chicago

Aissa, Mohamed, et al. "New Strategies and Extensions in Kruskal’s Algorithm in Multicast Routing," International Journal of Business Data Communications and Networking (IJBDCN) 7, no.4: 32-51. http://doi.org/10.4018/jbdcn.2011100103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Multimedia applications are expected to guarantee end-to-end quality of service (QoS) and are characterized by stringent constraints on delay, delay-jitter, bandwidth, cost, and so forth. The authors observe that Kruskal’s algorithm is limited to minimal (maximal) spanning unconstrained tree. As such, the authors extend Kruskal’s algorithm to incorporate the delay bound constraint. Consequently, a novel algorithm is proposed, called EKRUS (Extended Kruskal), for constructing multicast trees. The EKRUS’ distinguishing features consists of a better management of Kruskal’s priority queues, and in the provision of edge priority aggregation. Preliminary results show that the proposed EKRUS algorithm performs as well as the best-known algorithms (such as the DDMC, DMCTc algorithms) while exhibiting reduced complexity. The authors conducted an intensive analysis and evaluations of different strategies of assigning edges into the classes of the queue as well as edge selection. As a result, the EKRUS algorithm was further extended with different edge assignment and selection strategies. Through extensive simulations, the authors have evaluated various versions of the EKRUS and analyzed their performance under different load conditions.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.