Parallel Routing Table Computation for Scalable IP Routers
Abstract:
Abstract: The exponential growth of Internet traffic requires that routers be scalable. A generic scalable IP router is typically composed of a number of routing nodes (RNs) interconnected by a scalable switching fabric. A critical issue in the design of scalable IP routers is to provide a global and consistent routing table in such distributed-memory architectures. A parallel routing table computation approach is proposed in this paper. By dividing an OSPF area into a number of disjoint Within-Area-Routing-Regions (WARRs), the computation required to calculate the routing table can be divided into multiple independent portions and done by different RNs in parallel. Compared to conventional approaches, this approach can have a speedup between n and n 2 for within-area link state updates and n for outside-area link state updates, where n is the number of RNs in the router. This parallel routing table computation approach requires no modification of OSPF. 1.
Citations
| 479 | OSPF Version 2 – Moy - 1998 |
| 459 | End-to-end routing behavior in the Internet – Paxson - 1997 |
| 219 | Internet routing instability – LABOVITZ, MALAN, et al. - 1997 |
| 29 | End-to-End Routing Behavior – Paxson - 1996 |
| 6 | Design of a scalable IP router – Vuppala, Ni - 1997 |
| 2 | Pluris Massively Parallel Routing – Inc - 1998 |
| 1 | Design of A Scalable IP – Vuppala, Ni - 1997 |
