Comparison of rate-based service disciplines
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
An architecture for wide-area multicast routing
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
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
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
QoS Multicast Routing in Networks with Uncertain Parameters
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Multi-Path Routing combined with Resource Reservation
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Resource optimization in QoS multicast routing of real-time multimedia
IEEE/ACM Transactions on Networking (TON)
Bandwidth Fragmentation Avoided QoS Multicast Routing by Employing Admission Control
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
A flows-based QoS routing protocol for multicast communication networks
International Journal of Computers and Applications
Efficient QoS partition and routing of unicast and multicast
IEEE/ACM Transactions on Networking (TON)
A QoS multicast routing protocol for clustering mobile ad hoc networks
Computer Communications
Finding a path subject to many additive QoS constraints
IEEE/ACM Transactions on Networking (TON)
Two techniques for fast computation of constrained shortest paths
IEEE/ACM Transactions on Networking (TON)
Polynomial time approximation algorithms for multi-constrained QoS routing
IEEE/ACM Transactions on Networking (TON)
A case for tree evolution in QoS multicasting
Computer Communications
A survey of QoS multicasting issues
IEEE Communications Magazine
Multicast routing with end-to-end delay and delay variation constraints
IEEE Journal on Selected Areas in Communications
Distributed quality-of-service routing in ad hoc networks
IEEE Journal on Selected Areas in Communications
A scheme for real-time channel establishment in wide-area networks
IEEE Journal on Selected Areas in Communications
A QoS-aware multicast routing protocol
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Multicast routing and its QoS extension: problems, algorithms, and protocols
IEEE Network: The Magazine of Global Internetworking
Small-world optimization based QoS multicast routing scheme with ABC supported
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
| Hi-index | 0.00 |
Many Internet multicast applications such as teleconferencing and remote diagnosis have Quality-of-Service (QoS) requirements. The requirements can be additive (end-to-end delay), multiplicative (loss rate), or of a bottleneck nature (bandwidth). Given such diverse requirements, it is a challenging task to build QoS-constrained multicast trees in a large network where no global network state is available. This paper proposes a scalable QoS multicast routing protocol (SoMR) that supports all three QoS requirement types. SoMR is scalable due to small communication overhead. It achieves favorable tradeoff between routing performance and routing overhead by carefully selecting the network sub-graph in which it searches for a path that can support the QoS requirements. The scope of search is automatically tuned based on the current network conditions. An early-warning mechanism helps detect and route around the long-delay paths in the network. The operations of SoMR are completely decentralized. They rely only on the local state stored at each router.