A Framework for Defining Network Complexity
draft-irtf-ncrg-complexity-framework-01

Document Type Replaced Internet-Draft (ncrg RG)
Authors Michael Behringer  , Geoff Huston 
Last updated 2015-08-21 (latest revision 2013-11-04)
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)

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-irtf-ncrg-complexity-framework-01.txt

Abstract

Complexity is a widely used parameter in network design, yet there is no generally accepted definition of the term. Complexity metrics exist in a wide range of research papers, but most of these address only a particular aspect of a network, for example the complexity of a graph or software. There is a desire to define the complexity of a network as a whole, as deployed today to provide Internet services. This document provides a framework to guide research on the topic of network complexity.

Authors

Michael Behringer (mbehring@cisco.com)
Geoff Huston (gih@apnic.net)

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