Redundant LSA reduction in OSPF
draft-kini-dube-ospf-redundant-lsa-reduction-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Rohit Dube , Sriganesh Kini | ||
| Last updated | 1999-10-12 | ||
| 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
In a link state routing protocol like OSPF, the network and CPU bandwidth consumed by the routing protocol is primarily to propagate and process information about the network topology and changes in the topology. The 'flooding procedure' of OSPF propagates the topology change information to all routers in the network. This procedure delivers the information, multiple times to a router (depending on the source of the information and its connectivity) even though it needs to be delivered only once. The resultant wastage of network bandwidth and CPU processing time reduces the scalability of OSPF. In some cases like a fully connected subgraph this redundant information increases by an order of magnitude (from O(n) to O(n^2)). This draft describes a technique to reduce this redundant information for a fully connected subgraph of the network.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)