{
  "draft": "draft-behringer-ncrg-complexity-framework-02",
  "doc_id": "RFC7980",
  "title": "A Framework for Defining Network Complexity",
  "authors": [
    "M. Behringer",
    "A. Retana",
    "R. White",
    "G. Huston"
  ],
  "format": [
    "TEXT",
    "HTML"
  ],
  "page_count": "24",
  "pub_status": "INFORMATIONAL",
  "status": "INFORMATIONAL",
  "source": "INDEPENDENT",
  "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. While it may be impossible to define a metric for overall network complexity, there is a desire to better understand 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 as well as some practical examples for trade-offs in networking.\n\n This document summarizes the work of the IRTF's Network Complexity Research Group (NCRG) at the time of its closure. It does not present final results, but a snapshot of an ongoing activity, as a basis for future work.",
  "pub_date": "October 2016",
  "keywords": [
    "Complicated",
    "Fragile",
    "Self-organization",
    "Trade-off",
    "Technical Debt",
    "Dependency"
  ],
  "obsoletes": [],
  "obsoleted_by": [],
  "updates": [],
  "updated_by": [],
  "see_also": [],
  "doi": "10.17487/RFC7980",
  "errata_url": null
}