Abstract — 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. I.
|
898
|
RSVP: A New Resource ReSerVation Protocol
– Zhang, Deering, et al.
- 1993
|
|
526
|
How to model an internetwork
– Zegura, Calvert, et al.
|
|
235
|
Multicast routing in internetworks and extended LANs
– Deering
- 1988
|
|
233
|
The New Routing Algorithm for the ARPANET
– McQuillan, Richer, et al.
- 1980
|
|
186
|
Routing Information Protocol
– Hedrick
- 1988
|
|
111
|
The revised ARPANET routing metric
– Khanna, Zinky
- 1989
|
|
111
|
How bad is naive multicast routing
– Doar
- 1993
|
|
78
|
A distributed algorithm for delay-constrained unicast routing
– Salama, Reeves, et al.
- 1997
|
|
74
|
Quality of service routing for supporting multimedia applications
– Wang, Crowcroft
- 1996
|
|
68
|
Multicast routing with end-to-end delay and delay variation constraints
– Rouskas, Baldine
- 1997
|
|
66
|
Garcia-Luna-Aceves, “A loop-free extended Bellman-Ford routing protocol without bouncing effect
– Cheng, Reley, et al.
- 1989
|
|
54
|
GT-ITM: Georgia Tech internetwork topology models
– Calvert, Zegura
- 1996
|
|
52
|
Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks
– Salama, Reeves, et al.
- 1997
|
|
51
|
Distributed QoS routing with imprecise state information
– Chen, Nahrstedt
- 1998
|
|
45
|
The Overload Performance of Engineered Networks With Nonhierarchical and Hierarchical Routing
– Akinpelu
- 1984
|
|
30
|
Comparative Evaluations of Randomized and Dynamic Routing Strategies for Circuit-Switched Networks
– Mitra, Seery
- 1991
|
|
27
|
Analysis and Optimal Design of Aggregated-Least-Busy-Alternative Routing on Symmetric Loss Networks with Trunk Reservation
– Mitra, Gibbens, et al.
- 1991
|
|
27
|
A New Responsive Distributed Shortest-Path Routing Algorithm
– Rajagopalan, Faiman
- 1989
|
|
25
|
Multicast Extensions to OSPF”. RFC
– Moy
- 1548
|
|
20
|
Alternate Path Routing and Pinning for Interdomain Multicast Routing
– Zappala, Estrin, et al.
- 1997
|
|
19
|
An Analytical Model for Adaptive Routing Networks
– Ash, Huang
- 1993
|
|
17
|
A Survey of Dynamic Routing Methods for Circuit-Switched Traffic
– Hurley, Seidl, et al.
- 1991
|
|
16
|
K.: Quality of Service Routing: A Performance Perspective
– Apostolopoulos, Guerin, et al.
- 1998
|
|
16
|
Servicing and RealTime Control of Networks with Dynamic Routing
– Ash, Kafker, et al.
- 1981
|
|
10
|
QoSMIC: Quality of Service Multicast Internet protoCol
– Faloutsos, Banerjea, et al.
- 1998
|
|
9
|
A Distributed Delay-Constrained Dynamic Multicast Routing Algorithm
– Sun, Langendorfer
- 1997
|
|
9
|
Dynamic Alternative Routing - Modelling and Behavior
– Gibbons, Kelley, et al.
- 1988
|
|
6
|
Adaptive Source Routing of Real-Time Traffic
– Breslau
- 1995
|
|
6
|
Multicast Routing Support for Real-Time Applications
– Zappala
- 1997
|
|
5
|
RSVP Loop Prevention for Wildcard Reservations,” Internet Draft: work in progress
– Zappala
- 1996
|
|
4
|
LBNL Network Simulator,” http://ee.lbl.gov/ns
– McCanne, Floyd, et al.
|
