The Babel Routing Protocol
draft-ietf-babel-rfc6126bis-02

Document Type Active Internet-Draft (babel WG)
Last updated 2017-05-24
Replaces draft-chroboczek-babel-rfc6126bis
Stream IETF
Intended RFC status Proposed Standard
Formats plain text xml pdf html bibtex
Stream WG state WG Document
On Agenda babel at IETF-99
Document shepherd No shepherd assigned
IESG IESG state I-D Exists
Consensus Boilerplate Yes
Telechat date
Responsible AD (None)
Send notices to (None)
Network Working Group                                      J. Chroboczek
Internet-Draft                         IRIF, University of Paris-Diderot
Intended status: Standards Track                            May 24, 2017
Expires: November 25, 2017

                       The Babel Routing Protocol
                     draft-ietf-babel-rfc6126bis-02

Abstract

   Babel is a loop-avoiding distance-vector routing protocol that is
   robust and efficient both in ordinary wired networks and in wireless
   mesh networks.

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 25, 2017.

Copyright Notice

   Copyright (c) 2017 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.

Chroboczek              Expires November 25, 2017               [Page 1]
Internet-Draft         The Babel Routing Protocol               May 2017

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   3
     1.1.  Features  . . . . . . . . . . . . . . . . . . . . . . . .   3
     1.2.  Limitations . . . . . . . . . . . . . . . . . . . . . . .   4
     1.3.  Specification of Requirements . . . . . . . . . . . . . .   4
   2.  Conceptual Description of the Protocol  . . . . . . . . . . .   4
     2.1.  Costs, Metrics and Neighbourship  . . . . . . . . . . . .   5
     2.2.  The Bellman-Ford Algorithm  . . . . . . . . . . . . . . .   5
     2.3.  Transient Loops in Bellman-Ford . . . . . . . . . . . . .   6
     2.4.  Feasibility Conditions  . . . . . . . . . . . . . . . . .   6
     2.5.  Solving Starvation: Sequencing Routes . . . . . . . . . .   8
     2.6.  Requests  . . . . . . . . . . . . . . . . . . . . . . . .   9
     2.7.  Multiple Routers  . . . . . . . . . . . . . . . . . . . .  10
     2.8.  Overlapping Prefixes  . . . . . . . . . . . . . . . . . .  11
   3.  Protocol Operation  . . . . . . . . . . . . . . . . . . . . .  11
     3.1.  Message Transmission and Reception  . . . . . . . . . . .  12
     3.2.  Data Structures . . . . . . . . . . . . . . . . . . . . .  12
     3.3.  Acknowledged Packets  . . . . . . . . . . . . . . . . . .  16
     3.4.  Neighbour Acquisition . . . . . . . . . . . . . . . . . .  16
     3.5.  Routing Table Maintenance . . . . . . . . . . . . . . . .  18
     3.6.  Route Selection . . . . . . . . . . . . . . . . . . . . .  22
     3.7.  Sending Updates . . . . . . . . . . . . . . . . . . . . .  23
     3.8.  Explicit Route Requests . . . . . . . . . . . . . . . . .  25
   4.  Protocol Encoding . . . . . . . . . . . . . . . . . . . . . .  29
     4.1.  Data Types  . . . . . . . . . . . . . . . . . . . . . . .  29
     4.2.  Packet Format . . . . . . . . . . . . . . . . . . . . . .  30
     4.3.  TLV Format  . . . . . . . . . . . . . . . . . . . . . . .  31
     4.4.  Sub-TLV Format  . . . . . . . . . . . . . . . . . . . . .  31
     4.5.  Parser state  . . . . . . . . . . . . . . . . . . . . . .  32
     4.6.  Details of Specific TLVs  . . . . . . . . . . . . . . . .  33
     4.7.  Details of specific sub-TLVs  . . . . . . . . . . . . . .  43
   5.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .  43
   6.  Security Considerations . . . . . . . . . . . . . . . . . . .  44
   7.  References  . . . . . . . . . . . . . . . . . . . . . . . . .  44
     7.1.  Normative References  . . . . . . . . . . . . . . . . . .  44
     7.2.  Informative References  . . . . . . . . . . . . . . . . .  44
   Appendix A.  Cost and Metric Computation  . . . . . . . . . . . .  45
     A.1.  Maintaining Hello History . . . . . . . . . . . . . . . .  45
     A.2.  Cost Computation  . . . . . . . . . . . . . . . . . . . .  46
Show full document text