Generic Fault-Avoidance Routing Protocol for Data Center Networks
draft-sl-rtgwg-far-dcn-21
Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Active".
Expired & archived
|
|
---|---|---|---|
Authors | Bin Liu , Yantao Sun , Jing Cheng , Yichen Zhang , Bhumip Khasnabish | ||
Last updated | 2024-06-26 (Latest revision 2023-12-24) | ||
RFC stream | Independent Submission | ||
Formats | |||
Stream | ISE state | Response to Review Needed | |
Consensus boilerplate | Unknown | ||
Document shepherd | Eliot Lear | ||
IESG | IESG state | Expired | |
Telechat date | (None) | ||
Responsible AD | (None) | ||
Send notices to | rfc-ise@rfc-editor.org |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
This document describes a generic routing method and protocol for a regular data center network, named the Fault-Avoidance Routing (FAR) protocol. The FAR protocol provides a generic routing method for all types of regular topology network architectures that have been proposed for large-scale cloud-based data centers over the past few years. The FAR protocol is designed to leverage any regularity in the topology and compute its routing table in a concise manner. Fat- tree is taken as an example architecture to illustrate how the FAR protocol can be applied in real operational scenarios.
Authors
Bin Liu
Yantao Sun
Jing Cheng
Yichen Zhang
Bhumip Khasnabish
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)