alternate path routing, telecommunication, networks, multicast
Alternate path routing has been well-explored in telecommunication networks as a means of decreasing the call blocking rate and increasing network utility. However, aside from some work applying these concepts to unicast flows, alternate path routing has received little attention in the Internet community. We describe and evaluate an architecture for alternate path routing for multicast flows. For path installation, we design a receiver-oriented alternate path protocol and prove that it reconfigures multicast trees without introducing loops. For path computation, we propose a scalable local search heuristic that allows receivers to find alternate paths using only partial network information. We use a simulation study to demonstrate the ability of local search to find alternate paths approximately as well as a link-state protocol, with much lower overhead.
Original Publication Citation
Daniel Zappala, "Alternate Path Routing for Multicast", IEEE Infocom 2, Conference on Computer Communications, March 2.
BYU ScholarsArchive Citation
Zappala, Daniel, "Alternate Path Routing for Multicast" (2000). All Faculty Publications. 603.
Physical and Mathematical Sciences
© 2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Copyright Use Information