TRILL: Parent Selection in Distribution Trees
draft-yang-trill-parent-seletion-02
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
|
|
|---|---|---|---|
| Authors | Howard Yang , Ayan Banerjee , Donald E. Eastlake 3rd , Radia Perlman | ||
| Last updated | 2014-07-21 (Latest revision 2014-01-06) | ||
| RFC stream | (None) | ||
| Formats | |||
| 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
This document describes a protocol extension in TRILL IS-IS and a parent selection tiebreak algorithm in the calculation of distribution trees in TRILL. The proposal is to modify the current algorithm to improve the stability of the distribution trees when multiple equal cost parents are present. It also offers the capabilities of pinning down multi-destination traffic and re-shaping the distribution trees to improve the traffic load balancing.
Authors
Howard Yang
Ayan Banerjee
Donald E. Eastlake 3rd
Radia Perlman
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)