Classifying network complexity

Authors:
Michael H. Behringer
Affiliations:
Cisco Systems, Biot - Sophia Antipolis, France
Venue:
Proceedings of the 2009 workshop on Re-architecting the internet
Year:
2009

Citing 4
Cited 1

A bound for the complexity of a simple graph

Discrete Mathematics
Directory Enabled Networks

Directory Enabled Networks
Using dependency models to manage complex software architecture

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
A Complexity Measure

IEEE Transactions on Software Engineering

Resilience and survivability in communication networks: Strategies, principles, and survey of disciplines

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Growing complexity in the Internet is the subject of many debates. While there is extensive research on complexity in some specific areas such as graph theory or software design, the complexity of a real life network is not very well defined or understood. This position paper provides a proposed classification of network complexity, some observations, and an overview of approaches to control network complexity. The goal is to stimulate and aid future discussions on the subject.