Dynamic MultiPath Routing Protocol
draft-pfeifer-rtgwg-dmpr-00
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
|
|
|---|---|---|---|
| Authors | Hagen Paul Pfeifer , Sebastian Widmann | ||
| Last updated | 2019-08-15 (Latest revision 2019-02-11) | ||
| RFC stream | (None) | ||
| Formats | |||
| Additional resources | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
Dynamic MultiPath Routing (DMPR) is a loop free path vector routing protocol with built-in support for policy based multipath routing. It has been designed from scratch to work at both low and high bandwidth networks - even with high packet loss. The objective was to keep routing overhead low and ensure a deterministic upper limit. DMPR can be used to manage huge networks with a similar feature set as BGPv4 except for the concept of autonomous systems.
Authors
Hagen Paul Pfeifer
Sebastian Widmann
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)