Transparent Interconnection of Lots of Links (TRILL): Problem and Applicability Statement
draft-touch-trill-prob-00

Document Type Replaced Internet-Draft (individual)
Last updated 2012-01-05 (latest revision 2005-11-21)
Replaced by draft-ietf-trill-prob
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Replaced by draft-ietf-trill-prob
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
https://www.ietf.org/archive/id/draft-touch-trill-prob-00.txt

Abstract

Current Ethernet (802.1) link layers use custom routing protocols that have a number of challenges. The routing protocols need to strictly avoid loops, even temporary loops during route propagation, because of the lack of header loop detection support. Routing tends not to take full advantage of alternate paths, or even non- overlapping pairwise paths (in the case of spanning trees). The convergence of these routing protocols and stability under link changes and failures is also of concern. This document addresses these concerns and suggests that they are related to the need to be able to apply network layer routing (e.g., link state or distance vector) protocols at the link layer. This document assumes that solutions would not address issues of scalability beyond that of existing bridged (802.1D) links, but that a solution would be backward compatible with 802.1D, including hubs, bridges, and their existing plug-and-play capabilities. This document is a work in progress; we invite you to participate on the mailing list at http://www.postel.org/rbridge

Authors

Joseph Touch (touch@isi.edu)

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