Computer Engineering & Science >
A New Analysis Technique on the Internet Topology:The dMSeries Analysis Method
Received date: 2009-08-28
Revised date: 2009-12-25
Online published: 2010-03-25
It is an important task for the network topology research to analyze the properties of topologies and generate topologies that share the same properties with the original topologies. The dKseries analysis is an efficient technique to analyze the properties of the Internet topology. Increasing the values of the d capture progressively more properties of the original topology are at the cost of more complex states. The drawback of the dKseries is that the states increase fast when d increasess, and also the generation algorithm is too complicate. We present a new series analysis technique based on the neighbor graph distribution, called the dMseries analysis technique. The dMseries analysis technique has less states and easier algorithm generation compared with the dKseries analysis technique, so it is more practical when analyzing large scale networks like the Internet ASlevel topology.
YANG Guoqiang,DOU Wenhua . A New Analysis Technique on the Internet Topology:The dMSeries Analysis Method[J]. Computer Engineering & Science, 2011 , 33(3) : 1 -6 . DOI: 10.3969/j.issn.1007130X.2011.
［1］张宇, 张宏莉, 方滨兴. Internet 拓扑建模综述［J］.软件学报,2004,15(8):12201226.
［2］Watts D, Strogatz S. Collective Dynamics of ‘SmallWorld’ Networks［J］. Nature, 1998,393(6684):440442.
［3］Tangmunarunkit H, Govindan R, Jamin S, et al. Network Topology Generators:DegreeBased vs. Structural［J］. ACM SIGCOMM Computer Communication Review, 2002,31(4):147159.
［4］Gkantsidis C, Mihail M, Zegura E. Spectral Analysis of Internet Topologies［C］∥Proc of the IEEE INFOCOM’03,2003:364374.
［5］Krioukov D, Chung F, Claffy K C. The Workshop on Internet Topology (WIT) Report［J］. ACM SIGCOMM Computer Communication Review, 2007,37(1):6973.
［6］Mahadevan P, Krioukov D,Fall K. Systematic Topology Analysis and Generation Using Degree Correlations［C］∥Proc of ACM SIGCOMM,2006:135146.
［7］Mahadevan P, Hubble C, Huffaker B, et al. Orbis: Rescaling Degree Correlations to Generate Annotated Internet Topologies［J］. ACM SIGCOMM Computer Communication Review, 2007,37(4):325336.
［8］The Skitter AS Links Dataset［EB/OL］.［20080510］. http://www.caida.org/data/active/skitter_aslinks_dataset.xml.
［9］Li L, Alderson D, Willinger W, et al. A FirstPrinciples Approach to Understanding the Internet's RouterLevel Topology［C］∥Proc of ACM SIGCOMM’04,2004:314.
［10］The CAIDA AS Relationships Dataset［EB/OL］.［20080510］. http://www.caida.org/data/active/asrelationships/.
［11］University of Oregon RouteViews Project［EB/OL］.［20080510］. http://www.routeviews.org/.
［12］Goh KI, Oh E,Kahng B, et al. Betweenness Centrality Corelation in Social Networks［J］. Physical Review E, 2003,67(12):01710110171012.
［13］Bu T,Towsley D. On Distinguishing Between Internet Power Law Topology Generators［C］∥Proc of the IEEE INFOCOM’02, 2002:638647.
/
| 〈 |
|
〉 |