Power Based Topologies in OSPF using LDP for label exchanges
draft-mjsraman-rtgwg-ospf-ldp-power-topo-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Shankar Raman , Balaji Venkat Venkataswami , Gaurav Raina , Vasan Srini | ||
| Last updated | 2013-11-11 (Latest revision 2013-05-10) | ||
| 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 this specification OSPF shortest path first computation is done based on power ratios (consumed-power to available-bandwidth OR available-bandwidth to available-bandwidth) assigned to links and nodes such as Broadcast-Multi-Access networks that form part of the topology in an area. When MPLS is deployed in the area (be it the backbone or non-backbone area) LDP can be used to distribute a disjoint set of labels for the power based topology. Flows some or all of those that traverse the area can then be mapped either to the regular shortest-path tree or the power based shortest-path tree. This document specifies the proposal to construct and maintain such a tree called the power based SPT.
Authors
Shankar Raman
Balaji Venkat Venkataswami
Gaurav Raina
Vasan Srini
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)