<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.behringer-ncrg-complexity-framework" target="https://datatracker.ietf.org/doc/html/draft-behringer-ncrg-complexity-framework-02">
   <front>
      <title>A Framework for Defining Network Complexity</title>
      <author initials="M. H." surname="Behringer" fullname="Michael H. Behringer">
         <organization>Cisco Systems</organization>
      </author>
      <author initials="A." surname="Retana" fullname="Alvaro Retana">
         <organization>Cisco Systems</organization>
      </author>
      <author initials="R." surname="White" fullname="Russ White">
         <organization>Ericsson</organization>
      </author>
      <author initials="G." surname="Huston" fullname="Geoff Huston">
         <organization>APNIC</organization>
      </author>
      <date month="April" day="25" year="2016" />
      <abstract>
	 <t>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.

 This document summarizes the work of the IRTF&#x27;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.
	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-behringer-ncrg-complexity-framework-02" />
   
</reference>
