Dynamic MultiPath Routing

Document Type Expired Internet-Draft (individual)
Authors Fabrizio Devetak , Sanjiv Kapoor 
Last updated 2018-04-19 (latest revision 2017-09-12)
Stream (None)
Intended RFC status (None)
Expired & archived
pdf htmlized (tools) htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at


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.


Fabrizio Devetak (unknown-email-Fabrizio-Devetak)
Sanjiv Kapoor (kapoor@iit.edu)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)