OSPFv2 No Transit Capability
draft-pillay-esnault-ospf-rbit-00
Document | Type |
Replaced Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Authors | Padma Pillay-Esnault , Michael Barnes , Paul Wells | ||
Last updated | 2010-03-01 | ||
Replaced by | draft-keyupate-ospf-ospfv2-hbit | ||
RFC stream | (None) | ||
Intended RFC status | (None) | ||
Formats | |||
Stream | Stream state | (No stream defined) | |
Consensus boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Replaced by draft-keyupate-ospf-ospfv2-hbit | |
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
Open Shortest Path First for IPv6 incorporates an R-bit in the router Link State Advertisement that controls whether or not other routers will compute transit paths through that node when they perform their Shortest Path First computation. This is a very useful feature of the protocol which is currently unavailable in Open Shortest Path First Version 2. This document extends the Open Shortest Path First Version 2 specification by adding a similar capability in a way that can safely coexist with implementations lacking this feature.
Authors
Padma Pillay-Esnault
Michael Barnes
Paul Wells
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)