A Visualization-Driven Approach to Overlay-Underlay Engineering ? ? ?

Abstract. Overlay applications are popular as they provide high-level functionality by masking the intrinsic complexity of the underlay network. However, overlays rely on the underlay to provide them with basic connectivity. Therefore, the intrinsic features of the underlay network determine the efficiency of the overlay. Accordingly, studying the interdependency of the overlay and underlay networks leads to a better understanding of overlay application behaviour. We present a visualization-driven analysis technique for evaluating the overlay architecture with respect to the underlay, inspired by the goal of overlay engineering. Using Gnutella as a case study, our analysis confirms that Gnutella topology differs from a randomly generated network and that there is an implicit correlation between the overlay and underlay topologies.

[1]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[2]  Donald E. Knuth.  Two notes on notation , 1992 .

[3]  Jussi Myllymaki,et al.  Visual exploration of large data sets , 1996, Electronic Imaging.

[4]  Duane Wessels,et al.  Visualization of the Growth and Topology of the NLANR Caching Hierarchy , 1998, Comput. Networks.

[5]  Colin Ware,et al.  Information Visualization: Perception for Design , 2000 .

[6]  Daniel A. Keim,et al.  Visual exploration of large data sets , 2001, Commun. ACM.

[7]  Krishna P. Gummadi,et al.  A measurement study of Napster and Gnutella as examples of peer-to-peer file sharing systems , 2002, CCRV.

[8]  Vladimir Batagelj,et al.  Generalized Cores , 2002, ArXiv.

[9]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[10]  Randy H. Katz,et al.  Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Christos Gkantsidis,et al.  Spectral analysis of Internet topologies , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[12]  Akihiro Nakao,et al.  A routing underlay for overlay networks , 2003, SIGCOMM '03.

[13]  Anja Feldmann,et al.  Methodology for Estimating Network Distances of Gnutella Neighbors , 2004, GI Jahrestagung.

[14]  Don Towsley,et al.  On the Interaction Between Overlay Routing and Traffic Engineering , 2004 .

[15]  Ulrik Brandes,et al.  Drawing the AS Graph in 2.5 Dimensions , 2004, GD.

[16]  Maurizio Patrignani,et al.  Dynamic Analysis of the Autonomous System Graph , 2004 .

[17]  Alessandro Vespignani,et al.  Large scale networks fingerprinting and visualization using the k-core decomposition , 2005, NIPS.

[18]  Ulrik Brandes,et al.  Network Analysis: Methodological Foundations (Lecture Notes in Computer Science) , 2005 .

[19]  Klaus Wehrle,et al.  Peer-to-Peer Systems and Applications , 2005, Peer-to-Peer Systems and Applications.

[20]  Mostafa H. Ammar,et al.  On the Interaction Between Dynamic Routing in Native and Overlay Layers , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[21]  Dorothea Wagner,et al.  LunarVis - Analytic Visualizations of Large Graphs , 2007, GD.

[22]  Christian Scheideler,et al.  Can ISPS and P2P users cooperate for improved performance? , 2007, CCRV.

[23]  Anja Feldmann,et al.  Modelling Overlay-Underlay Correlations Using Visualization , 2008 .