Applicability of Maximally Redundant Trees to IEEE 802.1Qca Path Control and Reservation
draft-bowers-rtgwg-mrt-applicability-to-8021qca-01
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Authors | Chris Bowers , János Farkas | ||
| Last updated | 2016-01-04 (latest revision 2015-07-03) | ||
| Stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats |
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) | ||
https://www.ietf.org/archive/id/draft-bowers-rtgwg-mrt-applicability-to-8021qca-01.txt
Abstract
IEEE 802.1Qca Path Control and Reservation (PCR) [IEEE8021Qca] uses the algorithm specified in [I-D.ietf-rtgwg-mrt-frr-algorithm] to compute Maximally Redundant Trees (MRTs) to be used for the protection of data traffic in bridged networks. This document discusses the applicability of the MRT algorithm to 802.1Qca.
Authors
Chris Bowers
(cbowers@juniper.net)
János Farkas
(janos.farkas@ericsson.com)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)