Please use this identifier to cite or link to this item:
|Title:||Planarity of data networks|
|Citation:||Proceedings of the 23rd International Teletraffic Congress (ITC), 6-9 September, 2011, San Francisco, CA: pp.254-261|
|Conference Name:||International Teletraffic Congress (ITC) (23rd : 2011 : San Francisco, CA)|
|Rhys Bowden, Hung X. Nguyen, Nickolas Falkner, Simon Knight and Matthew Roughan|
|Abstract:||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.|
|Rights:||© 2011 ITC|
|Appears in Collections:||Electrical and Electronic Engineering publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.