Skip to main content

A Framework for Defining Network Complexity
draft-behringer-complexity-framework-00

Document Type Expired Internet-Draft (individual)
Authors Michael H. Behringer , Geoff Huston
Last updated 2013-04-18 (Latest revision 2012-10-15)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
Stream Stream state (No stream defined)
Consensus boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date (None)
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-behringer-complexity-framework-00.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, but most of them 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 H. Behringer
Geoff Huston

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