Efficient visualization of large routing topologies

Authors:
Siew Cheong Au;Christopher Leckie;Ajeet Parhar;Gerard Wong
Affiliations:
Department of Electrical and Electronic Engineering at The University of Melbourne, Australia;ARC Special Research Centre for Ultra-Broadband Information Networks at The University of Melbourne, Australia;Telstra Research Laboratories in Melbourne, Australia;Department of Electrical and Electronic Engineering at The University of Melbourne, Australia
Venue:
International Journal of Network Management
Year:
2004

Citing 8
Cited 2

An algorithm for drawing general undirected graphs

Information Processing Letters
A node-positioning algorithm for general trees

Software—Practice & Experience
On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Delayed Internet routing convergence

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Stable internet routing without global coordination

IEEE/ACM Transactions on Networking (TON)
Visualizing Network Data

IEEE Transactions on Visualization and Computer Graphics
Mapping the Internet

Computer
Self-Organizing Graphs - A Neural Network Perspective of Graph Layout

GD '98 Proceedings of the 6th International Symposium on Graph Drawing

Visualising internet traffic data with three-dimensional spherical display

APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Sybil attack detection through global topology pattern visualization

Information Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

As the Internet grows in size and complexity, network managers face a significant challenge in trying to understand the behaviour of routing protocols in large networks. In this paper, we present a tool called VLNT (visualizing large network topologies), which helps network managers to analyse complex routing topologies. A key contribution of our system is a novel hybrid layout algorithm, which significantly reduces the computation time required to layout large network topologies in comparison to conventional layout approaches. In addition our algorithm includes a novel termination criterion that avoids unnecessary iterations when optimizing the network layout. We demonstrate how the visualization features of VLNT can be used to analyse and improve BGP routing topologies, and provide examples using real-life routing data.