Name
Abstract | ||
|---|---|---|
In this paper, we present a new link-state routing algorithm called Approximate Link state (XL) aimed at increasing routing efficiency by suppressing updates from parts of the network. We prove that three simple criteria for update propagation are sufficient to guarantee soundness, completeness and bounded optimality for any such algorithm. We show, via simulation, that XL significantly outperforms standard link-state and distance vector algorithms - in some cases reducing overhead by more than an order of magnitude - while having negligible impact on path length. Finally, we argue that existing link-state protocols, such as OSPF, can incorporate XL routing in a backwards compatible and incrementally deployable fashion. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1145/1402958.1402962 | SIGCOMM |
Keywords | Field | DocType |
network routing,routing protocol,link state | Link-state routing protocol,Enhanced Interior Gateway Routing Protocol,Path vector protocol,Computer science,Static routing,Computer network,Routing domain,Destination-Sequenced Distance Vector routing,Algorithm,Routing Information Protocol,Distance-vector routing protocol,Distributed computing | Conference |
Volume | Issue | ISSN |
38 | 4 | 0146-4833 |
Citations | PageRank | References |
17 | 1.12 | 19 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kirill Levchenko | 1 | 1235 | 83.12 |
| Geoffrey M. Voelker | 2 | 6844 | 666.37 |
| Ramamohan Paturi | 3 | 1260 | 92.20 |
| stefan savage | 4 | 11017 | 1067.00 |