Building shared trees using a one-to-many joining mechanism
ACM SIGCOMM Computer Communication Review
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 multicast-based protocol for IP mobility support
COMM '00 Proceedings of NGC 2000 on Networked group communication
On the origin of power laws in Internet topologies
ACM SIGCOMM Computer Communication Review
QoS-aware multicast routing for the internet: the design and evaluation of QoSMIC
IEEE/ACM Transactions on Networking (TON)
WAVE: A New Multicast Routing Algorithm for Static and Dynamic Multicast Groups
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
ICCC '02 Proceedings of the 15th international conference on Computer communication
Survey of multicast routing algorithms and protocols
ICCC '02 Proceedings of the 15th international conference on Computer communication
A Hierarchical Mobility Management Scheme for Ipv6
ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
Quality of service for internet multimedia
Quality of service for internet multimedia
IEEE Network: The Magazine of Global Internetworking
Multicast routing and its QoS extension: problems, algorithms, and protocols
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.24 |
One of the most active research areas in networking is quality of service (QoS). The most fundamental requirement for QoS is the ability to find a path that can provide the required network resources between two nodes. These nodes will use QoS routing to find a feasible QoS path between both of them. In this paper, we present a distributed multicast QoS routing architecture that uses probes to find a quick and scalable QoS path between a joining router and the multicast tree. Any router that receives this probe will only know its neighbours and it will create a link to the previous router from where the probe comes from. The joining router will join the multicast tree by following these links on each router until it reaches the tree. Analysis of this method shows that the convergence rate and message overhead is lower than other similar schemes.