Generic Fault-avoidance Routing Protocol for Data Center Networks
draft-sl-rtgwg-far-dcn-03

• Status
• IESG evaluation record
• IESG writeups
• Email expansions
• History

• Versions
• 00
• 01
• 02
• 03
• 04
• 05
• 06
• 07
• 08
• 09
• 10
• 11

Routing Area Working Group                                       Bin Liu
Internet-Draft                                                  ZTE Inc.
Intended status: Informational                                Yantao Sun
Expires: November 1, 2015                                     Jing Cheng
                                                            Yichen Zhang
                                             Beijing Jiaotong University
                                                       Bhumip Khasnabish
                                                             ZTE TX Inc.
                                                          April 30, 2015

   Generic Fault-avoidance Routing Protocol for Data Center Networks
                       draft-sl-rtgwg-far-dcn-03

Abstract

   This draft proposes a generic routing method and protocol for a
   regular data center network, named as the fault-avoidance routing
   (FAR) protocol.  FAR protocol provides a generic routing method for
   all types of network architectures that are proposed for large-scale
   cloud-based data centers over the past few years.  FAR protocol is
   well designed to fully leverage the regularity in the topology and
   compute its routing table in a simplistic manner.  Fat-tree is taken
   as an example architecture to illustrate how FAR protocol can be
   applied in real operational scenarios.

Status of This Memo

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

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at http://datatracker.ietf.org/drafts/current/.

   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."

   This Internet-Draft will expire on November 1, 2015.

Copyright Notice

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

Bin Liu, et al.         Expires November 1, 2015                [Page 1]
Internet-Draft                 FAR for DCN                    April 2015

   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  . . . . . . . . . . . . . . . . . . . . . . . .   3
     1.1.  Acronyms & Definitions  . . . . . . . . . . . . . . . . .   3
   2.  Conventions used in this document . . . . . . . . . . . . . .   4
   3.  Problem Statement . . . . . . . . . . . . . . . . . . . . . .   4
     3.1.  The Impact of Large-scale Networks on Route Calculation .   4
     3.2.  Dilemma of conventional routing methods in a large-scale
           network with giant number nodes of routers  . . . . . . .   5
     3.3.  Network Addressing Issues . . . . . . . . . . . . . . . .   7
     3.4.  Big Routing Table Issues  . . . . . . . . . . . . . . . .   8
     3.5.  Adaptivity Issues for Routing Algorithms  . . . . . . . .   8
     3.6.  Virtual Machine Migration Issues  . . . . . . . . . . . .   8
   4.  The FAR Framework . . . . . . . . . . . . . . . . . . . . . .   9
   5.  Data Format . . . . . . . . . . . . . . . . . . . . . . . . .  10
     5.1.  Data Tables . . . . . . . . . . . . . . . . . . . . . . .  10
     5.2.  Messages  . . . . . . . . . . . . . . . . . . . . . . . .  12
   6.  FAR Modules . . . . . . . . . . . . . . . . . . . . . . . . .  16
     6.1.  Neighbor and Link Detection Module(M1)  . . . . . . . . .  16
     6.2.  Device Learning Module(M2)  . . . . . . . . . . . . . . .  17
     6.3.  Invisible Neighbor and Link Failure Inferring Module(M3)   17
     6.4.  Link Failure Learning Module(M4)  . . . . . . . . . . . .  17
     6.5.  BRT Building Module(M5) . . . . . . . . . . . . . . . . .  18
     6.6.  NRT Building Module(M6) . . . . . . . . . . . . . . . . .  18
     6.7.  Routing Table Lookup(M7)  . . . . . . . . . . . . . . . .  18
   7.  How a FAR Router Works  . . . . . . . . . . . . . . . . . . .  18
   8.  Compatible Architecture . . . . . . . . . . . . . . . . . . .  21
   9.  Application Example . . . . . . . . . . . . . . . . . . . . .  22
     9.1.  BRT Building Procedure  . . . . . . . . . . . . . . . . .  24
     9.2.  NRT Building Procedure  . . . . . . . . . . . . . . . . .  25