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

The information below is for an old version of the document
Document Type Active Internet-Draft (individual)
Last updated 2013-12-19
Stream (None)
Intended RFC status (None)
Formats plain text pdf html bibtex
Additional URLs
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
Routing Area Working Group                                       Bin Liu
Internet-Draft                                                  ZTE Inc.
Intended status: Informational                                Yantao Sun
Expires: June 22, 2014                                        Jing Cheng
                                                            Yichen Zhang
                                             Beijing Jiaotong University
                                                       December 19, 2013

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

Abstract

   This draft proposed 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 kinds of network architectures that are proposed for large-scale
   cloud 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 simple way.  Fat-tree is taken as an example
   architecture to illuminate how to apply FAR protocol in this draft.

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 June 22, 2014.

Copyright 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

Bin Liu, et al.           Expires June 22, 2014                 [Page 1]
Internet-Draft                 FAR for DCN                 December 2013

   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.  Network Addressing Issues . . . . . . . . . . . . . . . .   5
     3.3.  Big Routing Table Issues  . . . . . . . . . . . . . . . .   5
     3.4.  Adaptivity Issues for Routing Algorithms  . . . . . . . .   6
     3.5.  Virtual Machine Migration Issues  . . . . . . . . . . . .   6
   4.  The FAR Framework . . . . . . . . . . . . . . . . . . . . . .   6
   5.  Data Format . . . . . . . . . . . . . . . . . . . . . . . . .   7
     5.1.  Data Tables . . . . . . . . . . . . . . . . . . . . . . .   7
     5.2.  Messages  . . . . . . . . . . . . . . . . . . . . . . . .  10
   6.  FAR Modules . . . . . . . . . . . . . . . . . . . . . . . . .  14
     6.1.  Neighbor & Link Detection Module(M1)  . . . . . . . . . .  14
     6.2.  Device Learning Module(M2)  . . . . . . . . . . . . . . .  14
     6.3.  Invisible Neighbor & Link Failure Inferring Module(M3)  .  15
     6.4.  Link Failure Learning Module(M4)  . . . . . . . . . . . .  15
     6.5.  BRT Building Module(M5) . . . . . . . . . . . . . . . . .  15
     6.6.  NRT Building Module(M6) . . . . . . . . . . . . . . . . .  15
     6.7.  Routing Table Lookup(M7)  . . . . . . . . . . . . . . . .  16
   7.  Application Example . . . . . . . . . . . . . . . . . . . . .  16
     7.1.  BRT Building Procedure  . . . . . . . . . . . . . . . . .  18
     7.2.  NRT Building Procedure  . . . . . . . . . . . . . . . . .  18
       7.2.1.  Single Link Failure . . . . . . . . . . . . . . . . .  19
       7.2.2.  A Group of Link Failures  . . . . . . . . . . . . . .  20
       7.2.3.  Node Failures . . . . . . . . . . . . . . . . . . . .  20
     7.3.  Routing Procedure . . . . . . . . . . . . . . . . . . . .  21
   8.  Conclusion  . . . . . . . . . . . . . . . . . . . . . . . . .  22
   9.  Reference . . . . . . . . . . . . . . . . . . . . . . . . . .  23
   10. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . .  23
Show full document text