Skip to main content

A Framework for Measuring Network Complexity

Document Type Replaced Internet-Draft (individual)
Expired & archived
Authors Alvaro Retana , Russ White
Last updated 2013-09-15 (Latest revision 2013-03-14)
Replaced by RFC 7980
RFC stream (None)
Intended RFC status (None)
Stream Stream state (No stream defined)
Consensus boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Replaced by draft-behringer-ncrg-complexity-framework
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:


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 measured by "seat of pants" methods. 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 in measuring complexity for each of these continuums are provided; this is left for future documents.


Alvaro Retana
Russ White

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