Power Based Topologies and TE-Shortest Power Paths in OSPF
draft-mjsraman-rtgwg-ospf-power-topo-02
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Shankar Raman , Balaji Venkat Venkataswami , Gaurav Raina , Vasan Srini | ||
| Last updated | 2013-11-04 (Latest revision 2013-04-27) | ||
| 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 Interior Gateway Protocol like OSPF (Open Shortest Path First) the computation of the Constrained shortest path to destinations is computed for an area say a backbone or a non-backbone area using the TE-metrics advertised in the area. With importance given to the reduction of power within a network it becomes important to provide a solution that reduces the power consumed amongst routers and links that make up the network (in this case an area or a collection of areas including the backbone and non-backbone areas). This proposal aims at providing such a solution by producing a power topology of the area / areas. This power topology is constructed by assigning metrics to links based on the power consumed by the linecards (and hence their respective ports in an indirect way) of adjacent routers that are interconnected by each such link.
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.)