SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
IEEE/ACM Transactions on Networking (TON)
Routing in the Internet
QoS routing in networks with inaccurate information: theory and algorithms
IEEE/ACM Transactions on Networking (TON)
Routing with end-to-end QoS guarantees in broadband networks
IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A source-based algorithm for delay-constrained minimum-cost multicasting
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
IEEE Journal on Selected Areas in Communications
Multicast routing with end-to-end delay and delay variation constraints
IEEE Journal on Selected Areas in Communications
Solving the Delay Constrained Multicast Routing Problem Using the Transiently Chaotic Neural Network
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks
Minimal traffic-constrained similarity-based SOAP multicast routing protocol
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Finding top-k shortest path distance changes in an evolutionary network
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Network-coding-based cache policy for loss recovery enhancement in reliable multicast
International Journal of Network Management
Hi-index | 0.00 |
In this paper we propose a QoS-based routing algorithm for dynamic multicasting. The complexity of the problem can be reduced to a simple shortest path problem by applying a Weighted Fair Queuing (WFQ) service discipline. Using a modified Bellman-Ford algorithm, the proposed routing builds a multicast tree, where a node is added to the existing multicast tree without re-routing and satisfying QoS constraints. With user defined life-time of connection this heuristic algorthm builds multicast tree which is near optimum over the whole duration of session. Simulation results show that tree costs are nearly as good as other dynamic multicast routings that does not consider QoS.