A Visualization of Internet AS Topology with Valley-free Rules

In this paper, we propose a new network drawing tool, which considers the direction of traffic on Autonomous System level (AS-level) networks. Almost all traditional network graph drawing tools consider only the connections between nodes and disregard the direction of traffic. Moreover, these tools tend to draw complicated pictures. The reasons for this are that AS-level network structures are very different to random graphs, and have a short diameter, effective connections, and several hubs. We also propose selection of information, and implement the spring algorithm to regulate the positions of nodes for better understanding and some ideas for AS-level network structures in graphic drawing tools. Information traffic is simulated in an AS-level network topology, with dynamic query scheduling to evaluate whether servers balance load well and are suitably located. Given the complexity of this topology, graphical drawing tools are necessary when depicting such networks. Our new network drawing tool draws simple pictures, and can not only express non-directed graphs, but also traffic with direction on AS-level networks, using valley-free rules proposed by Gao. These rules classify links into three policies which are expressed with different colors and shapes by our tool. Our tool clearly shows the differences between traffic routes with valley-free rules and shortest paths in non-directed graphs.