Name
Abstract | ||
|---|---|---|
What does a childpsilas search of a large, complex cartoon for the eponymous character (Waldo) have to do with Internet routing? Network operators also search complex datasets, but Waldo is the least of their worries. Routing oscillation is a much greater concern. Networks can be designed to avoid routing oscillation, but the approaches so far proposed unnecessarily reduce the configuration flexibility. More importantly, apparently minor changes to a configuration can lead to instability. Verification of network stability is therefore an important task, but unlike the childpsilas search, this problem is NP hard. Until now, no practical method was available for large networks. In this paper, we present an efficient algorithm for proving stability of iBGP, or finding the potential oscillatory modes, and demonstrate its efficacy by applying it to the iBGP configuration of a large Tier-2 AS. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ICNP.2008.4697049 | ICNP |
Keywords | Field | DocType |
configuration flexibility,ibgp configuration,complex datasets,internet routing,practical search,complex cartoon,network operator,routing oscillation,childpsilas search,network stability,large network,algorithm design and analysis,topology,routing,oscillations,network performance,np hard problem,network topology,oscillators,routing protocols,internet | Algorithm design,Computer science,Computer network,Network topology,Theoretical computer science,Border Gateway Protocol,Operator (computer programming),IP forwarding,The Internet,Routing protocol,Distributed computing,Network performance | Conference |
ISSN | Citations | PageRank |
1092-1648 | 8 | 0.56 |
References | Authors | |
15 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| ashley flavel | 1 | 8 | 0.56 |
| Matthew Roughan | 2 | 1638 | 148.27 |
| nigel g bean | 3 | 47 | 10.77 |
| Aman Shaikh | 4 | 974 | 127.97 |