Adjacency Reduction in OSPF using SPT Reachability
draft-roy-ospf-smart-peering-01
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Author | Abhay Roy | ||
| Last updated | 2005-11-28 | ||
| 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
There is significant overhead in OSPF when a router has to establish adjacencies with every peer with whom it can verify 2-way connectivity. OSPF supports the broadcast network type for these scenarios, where you only have to peer with the designated router (DR). However,a full mesh of connectivity is required for proper operation and this doesn't help in networks with overlapping partial meshes of connectivity. This draft proposes a technique to reduce the number of adjacencies based on shortest path tree (SPT) reachability information.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)