It is the cache of ${baseHref}. It is a snapshot of the page. The current page could have changed in the meantime.
Tip: To quickly find your search term on this page, press Ctrl+F or ⌘-F (Mac) and use the find bar.

On Cross-Correlation Evaluation Model of Internet Macroscopic Topology by Genetic Algorithm | XU | Journal of Networks
Journal of Networks, Vol 6, No 2 (2011), 230-237, Feb 2011
doi:10.4304/jnw.6.2.230-237

On Cross-Correlation Evaluation Model of Internet Macroscopic Topology by Genetic Algorithm

Ye XU, Zhuo WANG

Abstract


Cross-correlation evaluation model, CCEM, was mainly studied to evaluate how much two different topologies are similar to each other in a quantitative way, and further used in evaluating whether a topology by an Internet topology model is close to real Internet or not. SLS (Signless Laplacian Spectra), is used to quantitatively identify the topology properties of the Internet generated by the model and the Internet out of real measuring. SLS eigenvectors could be gained out of this procedure, then a cross-correlation calculation was performed on the eigenvectors to give the difference identification in a quantitative way. With this, a recommended way of using the CCEM within a Genetic Algorithm was finally given.


Keywords


Cross-correlation; Internet topology; topology evaluation; SLS

References


[1] Jiang Y, Fang B.X., Hu M.Z. An Example of Analyzing the Characteristics of a Large Scale ISP Topology Measured from Multiple Vantage Points[J]. Journal of Software, 2005,16(5):846-856
doi:10.1360/jos160846

[2] Douglas B. West. An introduction to Graph Theory[M]. Chian Machine Press, 2006,1-47,339-348.

[3] Farkas IJ, Derényi I, Barabási A, Vicsek T. Spectra of ‘real-world’ graphs: Beyond the semicircle law[J]. Physical Review E, 2001,64(2):1-12.
doi:10.1103/PhysRevE.64.026704

[4] ZHANG Yu+, ZHANG Hong-Li, FANG Bin-Xing. A Survey on Internet Topology Modeling. Journal of Software, 2004,15(8):1221~1226

[5] Wang X.F., Li X., Chen G.R., Complex networks theory and its application[M]. Beijing: QsingHua Press, 2006,49-70.

[6] Faloutsos M, Faloutsos P, Faloutsos C. On power-law relationships of the Internet topology[J]. ACM SIGCOMM ComputerCommunication Review, 1999,29(4):251-262.
doi:10.1145/316194.316229

[7] Mehta ML. Random Matrices. 2nd ed[M]. New York: Academic Press, 1991.

[8] Goh KI, Kahang B, Kim D. Spectra and eigenvectors of scale-free networks[J]. Physical Review E, 2001,64(5):1-5.
doi:10.1103/PhysRevE.64.051903

[9] Barabasi A L, Eric Bonabeau. Scale free networks[J ]. Scientific American, 2003. 50- 59

[10] Barabási AL, Albert R. Emergence of scaling in random networks[J]. Science, 1999,286(5439):509~512.
doi:10.1126/science.286.5439.509

[11] Albert R, Barabási A. Statistical mechanics of complex networks[J]. Reviews of Modern Physics, 2002,74(1):47-97.
doi:10.1103/RevModPhys.74.47

[12] XU Y. A TL Model for Router-level Internet Macroscopic Topology(D). Shenyang: Northeastern University,2006,36-38.

[13] Gkantsidis C, Mihail M, Zegura E. Spectral analysis of Internet topologies[C], In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'03), IEEE Computer Society, New York, 2003, 364--374.

[14] Dam E, Haemers WH. Which graphs are determined by their spectrum? [J]. Linear Algebra and its Applications, 2003,373:241-272.
doi:10.1016/S0024-3795(03)00483-X

[15] Rorabaugh. COMPLETE DIGITAL SIGNAL PROCESSING[M]. US:McGraw-Hill, 2005.

[16] R. Teixeira, K. Marzullo, S. Savage, and G. Voelker, In search of path diversity in ISP networks[C]. Proceedings of the USENIX/ACM Internet Measurement Conference, (Miami, FL, USA), October 2003.

[17] S. Bilir, K. Sarac, and T. Korkmaz, End to end intersection characteristics of Internet paths and trees[C]. IEEE International Conference on Network Protocols (ICNP), (Boston, MA, USA), November 2005.
doi:10.1109/ICNP.2005.20

 


Full Text: PDF


Journal of Networks (JNW, ISSN 1796-2056)

Copyright @ 2006-2014 by ACADEMY PUBLISHER – All rights reserved.