Using Entropy as a Measure for Changes in Network Complexity
draft-sircar-complexity-entropy-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Rana P. Sircar, Michael H. Behringer | ||
| Last updated | 2014-04-24 (Latest revision 2013-10-21) | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| 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 is available in these formats:
Abstract
For the evaluation of network designs it is desirable to express their complexity in objective, measurable metrics. Previous work has shown that a large number of distinct, partly dependent scales play a role in overall complexity. This document proposes the use of multi- scale entropy metrics to describe the complexity of a network. We observe that the complexity of a network which undergoes no changes over a longer time period is constant. Conversely, when a network undergoes changes entropy is increasing; this is independent on whether the changes make the network more or less complex. In other words, also a simplification effort increases complexity temporarily.
Authors
Rana P. Sircar
Michael H. Behringer
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)