Kannan Varadhan, Ramesh Govindan, and Deborah Estrin, "Persistent Routing Oscillations in InterDomain Routing." USC/ISI, Available at the Routing Arbiter project's homepage at USC/ISI. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Internet Routing Instability - Labovitz, Malan, Jahanian (1997) (130 citations) (Correct)
....incoming update. Until recently, most backbone engineers believed that the ASPATH mechanism in BGP was sufficient to ensure network convergence. A recent study, however, has shown that under certain unconstrained routing policies, BGP may not converge and will sustain persistent route oscillations [23]. A number of solutions have been proposed to address the problem of routing instability, including the deployment of route dampening algorithms and the increased use of route aggregation [20, 21, 2] Aggregation, or supernetting, combines a number of smaller IP prefixes into a single, less ....
....update oscillation. This type of interaction is highly suspect as most IGP protocols utilize internal timers based on some multiple of 30 seconds. We are working closely with router vendors and backbone providers on an ongoing analysis of these interactions. As described earlier, Varadhan et al. [23] show that unconstrained routing policies can lead to persistent route oscillations. Only the severely restrictive shortest path route selection algorithm is provably safe. Since the end of the NSFNet, routing policies have been growing in size and complexity. As the number of peering arrangements ....
Kannan Varadhan, Ramesh Govindan, and Deborah Estrin, "Persistent Routing Oscillations in InterDomain Routing." USC/ISI, Available at the Routing Arbiter project's homepage at USC/ISI.
Internet Routing Instability - Labovitz, Malan, Jahanian (1997) (130 citations) (Correct)
....incoming update. Until recently, many backbone engineers believed that the ASPATH mechanism in BGP was sufficient to ensure network convergence. A recent study, however, has shown that under certain unconstrained routing policies, BGP may not converge and will sustain persistent route oscillations [21]. A number of solutions have been proposed to address the problem of routing instability, including the deployment of route dampening algorithms and the increased use of route aggregation [18, 19, 2] Aggregation, or supernetting, combines a number of smaller IP prefixes into a single, less ....
....update oscillation. This type of interaction is highly suspect as most IGP protocols utilize internal timers based on some multiple of 30 seconds. We are working closely with router vendors and backbone providers on an ongoing analysis of these interactions. As described earlier, Varadhan et al. [21] show that unconstrained routing policies can lead to persistent route oscillations. Only the severely restrictive shortest path route selection algorithm is provably safe. Since the end of the NSFNet, routing policies have been growing in size and complexity. As the number of peering arrangements ....
K. Varadhan, R. Govindan, and D. Estrin, "Persistent Routing Oscillations in InterDomain Routing," USC/ISI, Available at the Routing Arbiter project's homepage at USC/ISI.
Internet Routing Instability - Craig Labovitz (1997) (130 citations) (Correct)
....update. Until recently, many backbone engineers believed that the ASPATH mechanism in BGP was sufficient to ensure network convergence. A recent study, however, has shown that under certain unconstrained routing policies, BGP may not converge and will sustain persistent route oscillations [21]. A number of solutions have been proposed to address the problem of routing instability, including the deployment of route dampening algorithms and the increased use of route aggregation [18, 19, 2] Aggregation, or supernetting, combines a number of smaller IP prefixes into a single, less ....
....update oscillation. This type of interaction is highly suspect as most IGP protocols utilize internal timers based on some multiple of 30 seconds. We are working closely with router vendors and backbone providers on an ongoing analysis of these interactions. As described earlier, Varadhan et al. [21] show that unconstrained routing policies can lead to persistent route oscillations. Only the severely restrictive shortest path route selection algorithm is provably safe. Since the end of the NSFNet, routing policies have been growing in size and complexity. As the number of peering arrangements ....
K. Varadhan, R. Govindan, and D. Estrin, "Persistent Routing Oscillations in Inter-Domain Routing," USC/ISI, Available at the Routing Arbiter project's homepage at USC/ISI.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC