Planarity of data networks

A planar graph is one that can be drawn (say on a piece of paper) without any crossing links. In this paper we show, using a new data set, that data-network graphs show a surprisingly high likelihood of being planar. The data set --- the Internet Topology Zoo --- is a store of network data created f...

Full description

Saved in:
Bibliographic Details
Main Authors: Bowden, Rhys, Nguyen, Hung X., Falkner, Nickolas, Knight, Simon, Roughan, Matthew
Format: Conference Proceeding
Language:English
Subjects:
Accuracy
Communication networks
Computer systems organization > Architectures > Distributed architectures
Computer systems organization > Dependable and fault-tolerant systems and networks
Continents
General and reference > Cross-computing tools and techniques > Performance
Hardware > Communication hardware, interfaces and storage
Network topology
Networks
Networks > Network performance evaluation
Optimization
Semiconductor device modeling
Software and its engineering > Software organization and properties > Software system structures > Distributed systems organizing principles
Topology
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A planar graph is one that can be drawn (say on a piece of paper) without any crossing links. In this paper we show, using a new data set, that data-network graphs show a surprisingly high likelihood of being planar. The data set --- the Internet Topology Zoo --- is a store of network data created from the information that network operators make public. As such, it includes meta-data that we could never have derived from automated network measurements. A surprising number of graphs in the Zoo are planar, many more than can be explained through the models for graph formation we tested. We speculate that planarity results from the requirement to build transparent networks that network operators can understand easily.
DOI:10.5555/2043468.2043509