This paper proposes several clustering algorithms to explore the topology of the AS-graph. Using these algorithms, we are able to view the Internet topology, as encapsulated by the AS-graph, at three levels of abstraction: (1) a low-resolution view, which shows a coarse cluster cover of the whole AS-graph, (2) a mid-resolution view, showing the relationships between dense cores inside the coarse clusters, and (3) a high-resolution view of individual high-density cores. Using these tools we discovered that the Internet's central Dense Core is at least twice as large as what was previously reported. Attached to the central Dense Core, in what is known as the Transit Core, our clustering tools discovered several clusters, which we call the Regional Dense Cores: Interestingly, these clusters are as dense as the central core itself. Our tools highlight the fact that the Regional Dense Cores are mostly connected to the central Dense Core and less well connected among themselves.
|Number of pages||4|
|State||Published - 2004|
|Event||2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings - Tel-Aviv, Israel|
Duration: 6 Sep 2004 → 7 Sep 2004
|Conference||2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings|
|Period||6/09/04 → 7/09/04|