Multicast tree generation in networks with asymmetric links
IEEE/ACM Transactions on Networking (TON)
The multimedia multicasting problem
Multimedia Systems
IEEE/ACM Transactions on Networking (TON)
Introduction to algorithms
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Multicast routing for real-time communication of high-speed networks
Multicast routing for real-time communication of high-speed networks
A new delay-constrained algorithm for multicast routing tree construction: Research Articles
International Journal of Communication Systems
Kruskal's Algorithm for Query Tree Optimization
IDEAS '07 Proceedings of the 11th International Database Engineering and Applications Symposium
The Application of Union-Find Sets in Kruskal Algorithm
AICI '09 Proceedings of the 2009 International Conference on Artificial Intelligence and Computational Intelligence - Volume 02
Simulation Research of Communication Networks Based on Prim Algorithm
IFITA '10 Proceedings of the 2010 International Forum on Information Technology and Applications - Volume 03
Destination-driven routing for low-cost multicast
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
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.