By Topic

A Spectral Density Approach in Research of Internet Topology Properties

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xu Ye ; Coll. of Inf. Sci. & Eng., Shenyang Ligong Univ., Shenyang, China ; Wang Zhuo

Spectral density approach for distinguishing graphs was studied in this paper. Firstly, spectral density approach was testified for being effective in distinguishing different graphs by making comparisons among the spectrums of three different kind of graphs, the ER random graph, BA scale-free graph and the Internet topology graph. Secondly, we focused our studies on the properties of Internet graph that its spectrum could represent, and found that in standard spectral density analysis part, we found that the spectral density plot of Internet graph has a feature of having a maximum when ¿=0 and the second maximum when ¿=0.5 around. In SLS analysis part, we found the SLS spectrum had a set of highest tuples when SLS=1 and second highest tuples when SLS>2. Besides, a relationship of the power law distribution was observed when SLS>2, but there is no power-law relationship found when SLS. What was found here could be used to identify an Internet topology graph properties.

Published in:

Future Generation Communication and Networking, 2008. FGCN '08. Second International Conference on  (Volume:1 )

Date of Conference:

13-15 Dec. 2008