Default Nickname Based Approach for Multilevel TRILL
draft-tissa-trill-multilevel-00
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
|
|
|---|---|---|---|
| Authors | Ayan Banerjee , Janardhanan Pathangi , Jon Hudson , Les Ginsberg , Sam Aldrin , Sameer Merchant , Tissa Senevirathne | ||
| Last updated | 2012-08-24 (Latest revision 2012-02-21) | ||
| 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
Multilevel TRILL allows the interconnection of multiple TRILL networks to form a larger TRILL network without proportionally increasing the size of the IS-IS LSP DB. In this document, an approach based on default route concept is presented. Also, presented in the document is a novel method of constructing multi- destination trees using partial nickname space. Methods presented in this document are compatible with the RFC6325 specified data plane operations.
Authors
Ayan Banerjee
Janardhanan Pathangi
Jon Hudson
Les Ginsberg
Sam Aldrin
Sameer Merchant
Tissa Senevirathne
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)