Network Design Complexity Measurement and Tradeoffs
draft-irtf-ncrg-network-design-complexity-00
Document | Type | Replaced Internet-Draft (ncrg RG) | |
---|---|---|---|
Authors | Alvaro Retana , Russ White | ||
Last updated | 2015-08-21 (latest revision 2013-08-30) | ||
Replaced by | RFC 7980 | ||
Stream | IRTF | ||
Intended RFC status | (None) | ||
Formats |
Expired & archived
pdf
htmlized (tools)
htmlized
bibtex
|
||
Stream | IRTF state | (None) | |
Consensus Boilerplate | Unknown | ||
Document shepherd | No shepherd assigned | ||
IESG | IESG state | Replaced by draft-behringer-ncrg-complexity-framework | |
Telechat date | |||
Responsible AD | (None) | ||
Send notices to | (None) |
https://www.ietf.org/archive/id/draft-irtf-ncrg-network-design-complexity-00.txt
Abstract
Network architecture revolves around the concept of fitting the design of a network to its purpose; of asking the question, "what network will best fit these needs?" A part of fitting network design to requirements is the problem of complexity, an idea often informally measured using intuition and subjective experience. When would adding a particular protocol, policy, or configuration be "too complex?" This document suggests a series of continuums along which network complexity might be measured. No suggestions are made on how to measure complexity for each of these continuums; this is left for future documents.
Authors
Alvaro Retana
(aretana@cisco.com)
Russ White
(russw@riw.us)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)