NSFIB construction & aggregation with next hop of strict partial order

@article{Li2013NSFIBC,
  title={NSFIB construction \& aggregation with next hop of strict partial order},
  author={Qing Li and Mingwei Xu and Meng Chen},
  journal={2013 Proceedings IEEE INFOCOM},
  year={2013},
  pages={550-554}
}
The Internet global routing tables have been expanding at a dramatic and increasing rate. In this paper, we propose the next hop of strict partial order to construct and aggregate the Nexthop-Selectable FIB (NSFIB). We control the path stretch caused by NSFIB aggregation by setting an upper limit number of next hops. According to our simulation, our aggregation algorithms shrink the FIB to 5-15%, compared with 20-60% of single-nexthop FIB aggregation algorithms; our method works very well in… 
2 Citations

Figures from this paper

Mathematical analysis on forwarding information base compression
TLDR
In order to guarantee the ultimate correctness of FIB compression algorithms, routing table equation test is proposed and implemented to verify the equivalence of the two routing tables before and after compression by traversing the 32-bit IP address space.
Real-Time Dynamic Decomposition Storage of Routing Tables
TLDR
A real-time dynamic decomposition storage model, named RDDS, which takes the IP prefix with 8 bits length mask as a pocket prefix and distributes the routing entries (REs) to different line cards (LCs) according to different pocket prefixes, and achieves real- time part-storage and the load balancing of REs in LCs.

References

SHOWING 1-10 OF 10 REFERENCES
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 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.
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.
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.
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.
New dynamic SPT algorithm based on a ball-and-string model
  • P. Narváez, K. Siu, H. Tzeng
  • 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
This paper presents a new dynamic SPT algorithm that makes use of the structure of the previously computed SPT by recasting the SPT problem into an optimization problem in a dual linear programming framework, which can also be interpreted using a ball-and-string model.
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.
Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy
This memo discusses strategies for address assignment of the existing IP address space with a view to conserve the address space and stem the explosive growth of routing tables in default-route-free
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.