FIB Aggregation
draft-zhang-fibaggregation-02
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Beichuan Zhang , Lan Wang , Xin Zhao , Yaoqing Liu , Lixia Zhang | ||
| Last updated | 2009-10-26 | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
The rapid growth of Forwarding Information Base (FIB) has raised concerns among many Internet Service Providers. One potential solution to this problem is FIB aggregation, i.e. letting each router aggregate its FIB entries without affecting the forwarding paths taken by data traffic. It is a simple local software optimization within a router, requiring no changes to routing protocols or router hardware. To understand the effectiveness of using FIB aggregation to extend router lifetime, in this draft we present several FIB aggregation algorithms and evaluate their performance using routing tables and updates collected from tens of networks. Our results show that FIB aggregation can reduce the FIB table size by as much as 70% with small computational overhead. We also show that the computational overhead can be controlled through various mechanisms.
Authors
Beichuan Zhang
Lan Wang
Xin Zhao
Yaoqing Liu
Lixia Zhang
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)