【原創】Stanford Dataset全集之Autonomous systems graphs

The graph of routers comprising the Internet can be organized into sub-graphs called Autonomous Systems (AS). Each AS exchanges traffic flows with some neighbors (peers). We can construct a communication network of who-talks-to- whom from the BGP (Border Gateway Protocol) logs.

The data was collected from University of Oregon Route Views Project - Online data and reports. The dataset contains 733 daily instances which span an interval of 785 days from November 8 1997 to January 2 2000. In contrast to citation networks, where nodes and edges only get added (not deleted) over time, the AS dataset also exhibits both the addition and deletion of the nodes and edges over time.

Dataset statistics are calculated for the graph with the highest number of nodes and edges (dataset from January 02 2000):

Dataset statistics
Nodes	6474
Edges	13233
Nodes in largest WCC	6474 (1.000)
Edges in largest WCC	13233 (1.000)
Nodes in largest SCC	6474 (1.000)
Edges in largest SCC	13233 (1.000)
Average clustering coefficient	0.3913
Number of triangles	6584
Fraction of closed triangles	0.009591
Diameter (longest shortest path)	9
90-percentile effective diameter	4.6

      資料堂免費提供資料挖掘資料集下載下傳：http://www.datatang.com/data/44137

      資料堂-國内科研資料免費下載下傳平台