Mapping and Visualizing the Internet
Mapping and Visualizing the Internet
复制标题
DOI：
--
复制
发表时间：
2000-06
期刊：
影响因子：
--
通讯作者：
B. Cheswick;H. Burch;Steve Branigan
中科院分区：
文献类型：
--
作者：
B. Cheswick;H. Burch;Steve Branigan
自1998年8月以来，我们一直在收集和记录从测试主机到Internet上90，000多个注册网络中的每个网络的路由路径。所得到的数据库包含有趣的路由和可达性信息，并提供给公众的研究目的。每日扫描覆盖互联网上约十分之一的网络，大约每月进行一次全面扫描。我们也一直在收集朗讯的内部网数据，并应用这些工具来了解其规模和连通性。我们还发现，由于北约轰炸，南斯拉夫的路由器失去了电力。一个模拟弹簧力算法列出了这些数据库的结果图。这种算法是众所周知的，但从未被应用于如此大的问题。互联网图大约有88，000个节点和100，000条边，比数据可视化社区以前认为的要大。由此产生的互联网布局是令人愉快的，虽然相当混乱。在较小的网络上，如朗讯的内联网，布局以一种有用的方式呈现数据。对于互联网数据，我们还尝试绘制最小距离生成树;通过丢弃边，可以使剩余的图更容易访问。一旦选择了布局，它可以以各种方式着色以显示网络相关数据，例如IP地址，域信息，位置，ISP和扫描结果（完成，过滤，循环等）。本文扩展并更新了IEEE计算机文章[1]中给出的项目描述。
We have been collecting and recording routing paths from a test host to each of over 90,000 registered networks on the Internet since August 1998. The resulting database contains intersting routing and reachability information, and is available to the public for research purpose. The daily scans cover approximately a tenth of the networks on the Internet, with a full scan run roughly once a month. We have also been collecting Lucent's intranet data, and applied these tools to understanding its size and connectivity. We have also detected the sloss of power to routers in Yugoslavia as the result of NATO bombing. A simulated spring-force algorithm lays out the graphs thgat results from these database. This algorithm is well known, but has never been applied to such a large problem. The Internet graph, with around 88,000 nodes and 100,000 edges, is larger than those previsouly considered tractable by the data visualization community. The resulting Internet layouts are pleasent, though rather cluttered. On smaller networks, like Lucent's intranet, the layouts present the data in a useful way. For the Internet data, we have also tried plotting a minimum distance spanning tree; by throwing away edges, the remaining graph can be made more accessible. Once a layout is chosen, it can be colored in various ways to show network-relevant data, such as IP address, domain information, location, ISPs, and result of scan (completed, filtered, loop, etc). This paper expands and updates the description of the project given in an IEEE Computer article [1].