I-D Action: draft-behringer-ncrg-complexity-framework-02.txt

internet-drafts@ietf.org Mon, 25 April 2016 16:46 UTC

Return-Path: <internet-drafts@ietf.org>
X-Original-To: i-d-announce@ietf.org
Delivered-To: i-d-announce@ietfa.amsl.com
Received: from ietfa.amsl.com (localhost [IPv6:::1]) by ietfa.amsl.com (Postfix) with ESMTP id 15DE912D0DA for <i-d-announce@ietf.org>; Mon, 25 Apr 2016 09:46:02 -0700 (PDT)
MIME-Version: 1.0
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: 7bit
From: internet-drafts@ietf.org
To: i-d-announce@ietf.org
Subject: I-D Action: draft-behringer-ncrg-complexity-framework-02.txt
X-Test-IDTracker: no
X-IETF-IDTracker: 6.19.0
Auto-Submitted: auto-generated
Precedence: bulk
Message-ID: <20160425164602.28304.45972.idtracker@ietfa.amsl.com>
Date: Mon, 25 Apr 2016 09:46:02 -0700
Archived-At: <http://mailarchive.ietf.org/arch/msg/i-d-announce/srowYTZ9wJtWkJYGizn1G-ps9Ik>
X-BeenThere: i-d-announce@ietf.org
X-Mailman-Version: 2.1.17
Reply-To: internet-drafts@ietf.org
List-Id: Internet Draft Announcements only <i-d-announce.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/i-d-announce>, <mailto:i-d-announce-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/i-d-announce/>
List-Post: <mailto:i-d-announce@ietf.org>
List-Help: <mailto:i-d-announce-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/i-d-announce>, <mailto:i-d-announce-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 25 Apr 2016 16:46:02 -0000

A New Internet-Draft is available from the on-line Internet-Drafts directories.


        Title           : A Framework for Defining Network Complexity
        Authors         : Michael H. Behringer
                          Alvaro Retana
                          Russ White
                          Geoff Huston
	Filename        : draft-behringer-ncrg-complexity-framework-02.txt
	Pages           : 23
	Date            : 2016-04-25

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.

   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.


The IETF datatracker status page for this draft is:
https://datatracker.ietf.org/doc/draft-behringer-ncrg-complexity-framework/

There's also a htmlized version available at:
https://tools.ietf.org/html/draft-behringer-ncrg-complexity-framework-02

A diff from the previous version is available at:
https://www.ietf.org/rfcdiff?url2=draft-behringer-ncrg-complexity-framework-02


Please note that it may take a couple of minutes from the time of submission
until the htmlized version and diff are available at tools.ietf.org.

Internet-Drafts are also available by anonymous FTP at:
ftp://ftp.ietf.org/internet-drafts/