Reducing Power Consumption using BGP
draft-mjsraman-rtgwg-inter-as-psp-06

RTGWG Working Group                                        Shankar Raman
Internet-Draft                                Balaji Venkat Venkataswami
Intended Status: Experimental RFC                           Gaurav Raina
Expires: October 30, 2013                                     IIT Madras
                                                          April 28, 2013

                 Reducing Power Consumption using BGP 
                  draft-mjsraman-rtgwg-inter-as-psp-06

Abstract

   In this paper, we propose a framework to reduce the aggregate power
   consumption of the Internet using a collaborative approach between
   Autonomous Systems (AS). We identify the low-power paths among the AS
   and then use Traffic Engineering (TE) techniques to route the packets
   along the paths. Such low-power paths can be identified by using the
   consumed-power-to-available-bandwidth (PWR) ratio as an additional
   constraint in the Constrained Shortest Path First (CSPF) algorithm.
   For re-routing the data traffic through these low-power paths, the
   Inter-AS Traffic Engineered Label Switched Path (TE-LSP) that spans
   multiple AS can be used. Extensions to the Border Gateway Protocol
   (BGP) can be used to disseminate the PWR ratio metric among the AS
   thereby creating a collaborative approach to reduce the power
   consumption. Since calculating the low-power paths can be
   computationally intensive, a graph-labeling heuristic is also
   proposed. This heuristic reduces the computational complexity but may
   provide a sub-optimal low-power path. The feasibility of our
   approaches is illustrated by applying our algorithm to a subset of
   the Internet. The techniques proposed in this paper for the Inter-AS
   power reduction require minimal modifications to the existing
   features of the Internet. The proposed techniques can be extended to
   other levels of Internet hierarchy, such as Intra-AS paths, through
   suitable modifications.

Status of this Memo

   This Internet-Draft is submitted to IETF in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF), its areas, and its working groups.  Note that
   other groups may also distribute working documents as
   Internet-Drafts.

 

Shankar Raman.et.al     Expires October 30, 2013                [Page 1]
INTERNET DRAFT    Reducing power consumption using BGP    April 28, 2013

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   The list of current Internet-Drafts can be accessed at
   http://www.ietf.org/1id-abstracts.html

   The list of Internet-Draft Shadow Directories can be accessed at
   http://www.ietf.org/shadow.html

Copyright and License Notice

   Copyright (c) 2013 IETF Trust and the persons identified as the
   document authors. All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (http://trustee.ietf.org/license-info) in effect on the date of
   publication of this document. Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document. Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1  Introduction  . . . . . . . . . . . . . . . . . . . . . . . . .  4
     1.1 Low-power routers and switches . . . . . . . . . . . . . . .  4
     1.2 Power reduction using routing and traffic engineering  . . .  4
     1.1  Terminology . . . . . . . . . . . . . . . . . . . . . . . .  5
   2.  Methodology  . . . . . . . . . . . . . . . . . . . . . . . . .  5
     2.1 Pre-requisites for the Proposed Method . . . . . . . . . . .  6
       2.1.1 Constructing network topology using BGP strands  . . . .  6
       2.1.2 PWR ratio calculation  . . . . . . . . . . . . . . . . .  7
         2.1.2.1 Earlier method of computing numerator of PWR
                 ratio. . . . . . . . . . . . . . . . . . . . . . . .  9
       2.1.3 Explicit routing using TE-LSPs . . . . . . . . . . . . . 10
     2.2 LOW-POWER PATHS  . . . . . . . . . . . . . . . . . . . . . . 11
         2.2.0.1 Algorithm 1 ASBR low-power path algorithm  . . . . . 12
         2.2.0.2 Algorithm 2 PCE low-power path algorithm . . . . . . 12
       2.2.1 Illustration . . . . . . . . . . . . . . . . . . . . . . 12
       2.2.3 Equivalence class with total ordering  . . . . . . . . . 13
         2.2.3.1 Algorithm 3 PCE low-power path algorithm with