Multicast routing in internetworks and extended LANs
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
The revised ARPANET routing metric
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A loop-free extended Bellman-Ford routing protocol without bouncing effect
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A new responsive distributed shortest-path rounting algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Shortest path first with emergency exits
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
An architecture for wide-area multicast routing
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An overview of the new routing algorithm for the ARPANET
ACM SIGCOMM Computer Communication Review - Special twenty-fifth anniversary issue. Highlights from 25 years of the Computer Communication Review
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
The end-to-end effects of Internet path selection
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
QoS-aware multicast routing for the internet: the design and evaluation of QoSMIC
IEEE/ACM Transactions on Networking (TON)
A Distributed Delay-Constrained Dynamic Multicast Routing Algorithm
IDMS '97 Proceedings of the 4th International Workshop on Interactive Distributed Multimedia Systems and Telecommunication Services
Adaptive source routing of real-time traffic in integrated services networks
Adaptive source routing of real-time traffic in integrated services networks
Multicast routing support for real-time applications
Multicast routing support for real-time applications
Multicast routing with end-to-end delay and delay variation constraints
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
RSVP: a new resource reservation protocol
IEEE Communications Magazine - Part Anniversary
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
IEEE Journal on Selected Areas in Communications
A QoS-aware multicast routing protocol
IEEE Journal on Selected Areas in Communications
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
Multi-path routing scheme for non-interactive multicast communications
International Journal of Network Management
Optimal placement of antennae using metaheuristics
NMA'06 Proceedings of the 6th international conference on Numerical methods and applications
A tree-based particle swarm optimization for multicast routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
QoS driven online multicast routing algorithm
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
| Hi-index | 0.00 |
Current network-layer multicast routing protocols build multicast trees based only on hop count and policy. If a tree cannot meet application requirements, the receivers have no alternative. In this paper, we propose a general and modular architecture that integrates alternate path routing with the network's multicast services. This enables individual multicast receivers to reroute a multicast tree according to their needs, subject to policy restrictions. Our design focuses on the two primary components of this architecture--a loop-free path installation protocol and a scalable, distributed path computation algorithm. Based on a simulation study, we demonstrate that using alternate path routing enables receivers to find acceptable paths nearly as well as a link-state protocol, with much lower overhead. We also show that our approach scales to large networks and that performance improves as a multicast group grows in size.