Dynamic MultiPath Routing

Document Type Active Internet-Draft (individual)
Last updated 2017-09-12
Stream (None)
Intended RFC status (None)
Formats plain text xml pdf html bibtex
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)
Network Working Group                                         F. Devetak
Internet-Draft                                                 S. Kapoor
Expires: March 16, 2018                 Illinois Institute of Technology
                                                      September 12, 2017

                       Dynamic MultiPath Routing


   In this draft we consider dynamic multipath routing and introduce two
   methods that use additive increase and multiplicative decrease for
   flow control, similar to TCP.  Our first method allows for congestion
   control and re-routing flows as users join in or leave the network.
   As the number of applications and services supported by the Internet
   grows, bandwidth requirements increase dramatically so it is
   imperative to design methods to ensure not only that network
   throughput is maximized but also to ensure a level of fairness in
   network resource allocation.  Our second method provides fairness
   over multiple streams of traffic.  We drive the multiplicative
   decrease part of the algorithm with link queue occupancy data
   provided by an enhanced routing protocol.

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 https://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 March 16, 2018.

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

Devetak & Kapoor         Expires March 16, 2018                 [Page 1]
Internet-Draft          Dynamic MultiPath Routing         September 2017

   (https://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.

1.  Introduction

   Internet packet traffic keeps growing as the number of applications
   and services it supports as well as their bandwidth requirements
   explode.  It has then become necessary to find ways to ensure that
   network throughput is maximized.  In this draft we propose dynamic
   multi-path routing to improve network throughput.

   Multipath routing is important, not only for throughput but also for
   reliability and security.  In multipath routing, improvements in
   performance are achieved by utilizing more than one feasible path
   [M75].  This approach to routing makes for more effective network
   resource utilization.  Various research on multipath routing have
   addressed network redundancy, congestion, and QoS issues [CRS99]
   [ST92].  Prior work on multipath routing includes work on bounding
   delays as well as delay variance [DSAK11] [SKDA13].

   The prior work is primarily from the viewpoint of static network
   design but, in practice, congestion control is necessary to prevent
   some user flows from being choked due to link bottlenecks.  Single
   path routing implementations of TCP achieve that by rate control on
   specified paths.  TCP is able to handle elastic traffic from
   applications and establishes a degree of fairness by reducing the
   rate of transmission rapidly upon detecting congestion.  Regular TCP
   has been shown to provide Pareto-optimal allocation of resources
   [PU12].  However, unlike the single path approach of TCP, we consider
   multipath routing with associated issues of path selection and
   congestion.  We may note that multipath TCP (MPTCP) has been studied
   extensively [RG10] [GWH11] [RH10] [AP13] with a number of IETF
   proposals [M05] [M06] [M07] [M08].  Prior work on multipath TCP is
   defined over a specific set of paths and the choice of paths or the
   routing is independent of congestion control; determining the right
   number of paths thus becomes a problem.  The variation of throughput
   with the number of paths has been illustrated in [RG10] [GWH11]

   Along with consideration of congestion, we also need to ensure a
   level of fairness in network resource allocation.  Factoring fairness
Show full document text