Academic
Publications
On the scalability of router forwarding tables: Nexthop-Selectable FIB aggregation

On the scalability of router forwarding tables: Nexthop-Selectable FIB aggregation,10.1109/INFCOM.2011.5935172,Qing Li,Dan Wang,Mingwei Xu,Jiahai Yang

On the scalability of router forwarding tables: Nexthop-Selectable FIB aggregation   (Citations: 1)
BibTex | RIS | RefWorks Download
Conference: IEEE INFOCOM - INFOCOM , pp. 321-325, 2011
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...∣�� �� (�� �� )∣ is exponential (proved in [13]), making the complexity of the algorithm unacceptable...
    • ...1 The proofs for all the lemmas and theories can be found in [13]...
    • ...The idea is that given an update <��,�� ������ > where �� is a prefix and �� ������ is the new set of next hops of �� , NS-FIB-Online() recalculates G, Gx values of the node �� and all the upstream nodes of �� in �� . We give the detailed description of the algorithm and the analysis of constant complexity in [13]...

    Qing Liet al. On the scalability of router forwarding tables: Nexthop-Selectable FIB...

Sort by: