Next hop of strict partial order for NSFIB construction & aggregation

@article{Li2012NextHO,
  title={Next hop of strict partial order for NSFIB construction \& aggregation},
  author={Qing Li and Mingwei Xu and Meng Chen},
  journal={2012 IEEE 20th International Workshop on Quality of Service},
  year={2012},
  pages={1-3}
}
The Internet is facing severe routing scalability problem. The Internet Service Providers cannot afford to upgrade their routers at the pace of routing table growth. Therefore, FIB aggregation has been proposed. However, current single-nexthop FIB aggregation solutions cannot provide a satisfactory performance. In this paper, we first propose the next hop of strict partial order (SPO next hop) to construct the Nexthop-Selectable FIB (NSFIB). The approach guarantees that NSFIB-based aggregation… 

Figures from this paper

References

SHOWING 1-10 OF 13 REFERENCES
On the scalability of router forwarding tables: Nexthop-Selectable FIB aggregation
TLDR
It is argued that a packet can be delivered to its destination through a path other than the one optimal path, and a novel algorithm is proposed that is O(N) that can reduce more than an order of the FIB size.
Incremental Forwarding Table Aggregation
TLDR
This paper proposes two incremental FIB aggregation algorithms based on the ORTC scheme and quantifies the tradeoffs of the proposed algorithms, which will help operators choose the algorithms best suited for their networks.
On the Aggregatability of Router Forwarding Tables
TLDR
It is found that FIB aggregation can reduce the FIB table size by as much as 70% with small computational overhead, and it is shown that the computational overhead can be controlled through various mechanisms.
Practical and Near-Optimal FIB Aggregation using SMALTA
TLDR
SMALTA is presented, a practical, near-optimal FIB aggregation scheme that shrinks forwarding table size without modifying routing semantics or the external behavior of routers, and without requiring changes to FIB lookup algorithms and associated hardware and software.
SMALTA: practical and near-optimal FIB aggregation
TLDR
SMALTA is presented, a practical, near-optimal FIB aggregation scheme that shrinks forwarding table size without modifying routing semantics or the external behavior of routers, and without requiring changes to FIB lookup algorithms and associated hardware and software.
Constructing optimal IP routing tables
  • R. Draves, Christopher King, V. Srinivasan, B. Zill
  • Computer Science
    IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320)
  • 1999
TLDR
The Optimal Routing Table Constructor (ORTC) algorithm that is presented produces routing tables with roughly 60% of the original number of prefixes for large backbone routers.
Survey and taxonomy of IP address lookup algorithms
TLDR
A survey of state-of-the-art IP address lookup algorithms is presented and their performance in terms of lookup speed, scalability, and update overhead is compared.
Inferring link weights using end-to-end measurements
TLDR
This work describes a novel constraint-based approach to approximate ISP link weights using only end-to-end measurements, which extends router-level ISP maps with link weights that are consistent with routing.
Report from the IAB Workshop on Routing and Addressing
TLDR
The key workshop findings include an analysis of the major factors that are driving routing table growth, constraints in router technology, and the limitations of today's Internet addressing architecture.
The China Education and Research Network (CERNET) IVI Translation Design and Deployment for the IPv4/IPv6 Coexistence and Transition
TLDR
This document presents the concept and practice of the prefix- specific and stateless address mapping mechanism (IVI) for IPv4/IPv6 coexistence and transition and a simplified version of version 00 to present the main concepts and recentpractice of the IVI translation scheme.
...
...