TY - GEN

T1 - Finding a dense-core in jellyfish graphs

AU - Gonen, Mira

AU - Ron, Dana

AU - Weinsberg, Udi

AU - Wool, Avishai

PY - 2007

Y1 - 2007

N2 - The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway Protocol (BGP). These relationships can be modeled as a graph, called the AS-graph, in which the vertices model the ASes, and the edges model the peering arrangements between the ASes. Based on topological studies, it is widely believed that the Internet graph contains a central dense-core: Informally, this is a small set of high-degree, tightly interconnected ASes that participate in a large fraction of end-to-end routes. Finding this densecore is a very important practical task when analyzing the Internet's topology. In this work we introduce a randomized sublinear algorithm that finds a densecore of the AS-graph. We mathematically prove the correctness of our algorithm, bound the density of the core it returns, and analyze its running time. We also implemented our algorithm and tested it on real AS-graph data. Our results show that the core discovered by our algorithm is nearly identical to the cores found by existing algorithms - at a fraction of the running time.

AB - The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway Protocol (BGP). These relationships can be modeled as a graph, called the AS-graph, in which the vertices model the ASes, and the edges model the peering arrangements between the ASes. Based on topological studies, it is widely believed that the Internet graph contains a central dense-core: Informally, this is a small set of high-degree, tightly interconnected ASes that participate in a large fraction of end-to-end routes. Finding this densecore is a very important practical task when analyzing the Internet's topology. In this work we introduce a randomized sublinear algorithm that finds a densecore of the AS-graph. We mathematically prove the correctness of our algorithm, bound the density of the core it returns, and analyze its running time. We also implemented our algorithm and tested it on real AS-graph data. Our results show that the core discovered by our algorithm is nearly identical to the cores found by existing algorithms - at a fraction of the running time.

KW - Time Complexity

KW - Edge Density

KW - IEEE INFOCOM

KW - Sparse Graph

KW - Border Gateway Protocol

UR - http://www.scopus.com/inward/record.url?scp=38349016971&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-77004-6_3

DO - 10.1007/978-3-540-77004-6_3

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:38349016971

SN - 9783540770039

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 29

EP - 40

BT - Algorithms and Models for the Web-Graph - 5th International Workshop, WAW 2007, Proceedings

T2 - 5th Workshop on Algorithms and Models for the Web-Graph, WAW 2007

Y2 - 11 December 2007 through 12 December 2007

ER -