Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2012, Article ID 383248, 14 pages
http://dx.doi.org/10.1155/2012/383248
Research Article

Genetic Algorithm Optimized CCEM for Complex Topology

College of Information Science and Engineering, Shenyang Ligong University, Shenyang 110168, China

Received 13 July 2011; Accepted 12 October 2011

Academic Editor: J. Jiang

Copyright © 2012 Ye Xu and Zhuo Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Y. Jiang, B. X. Fang, M. Z. Hu, and R. Q. He, “Example of analyzing the characteristics of a large scale ISP topology measured from multiple vantage points,” Journal of Software, vol. 16, no. 5, pp. 846–856, 2005. View at Publisher · View at Google Scholar · View at Scopus
  2. M. Faloutsos, P. Faloutsos, and C. Faloutsos, “On power-law relationships of the Internet topology,” ACM SIGCOMM Computer Communication Review, vol. 29, no. 4, pp. 251–262, 1999. View at Google Scholar
  3. X. F. Wang, X. Li, and G. R. Chen, Complex Networks Theory and Its Application, QsingHua Press, Beijing, China, 2006.
  4. Rorabaugh, Complete Digital Signal Processing, McGraw-Hill, New York, NY, USA, 2005.
  5. D. B. West, “An introduction to graph theory,” Chian Machine Press, no. 1–47, pp. 339–348, 2006. View at Google Scholar
  6. I. J. Farkas, I. Derényi, A. L. Barabási, and T. Vicsek, “Spectra of “real-world” graphs: beyond the semicircle law,” Physical Review E, vol. 64, no. 2, pp. 1–12, 2001. View at Google Scholar · View at Scopus
  7. Y. Zhang, H. L. Zhang, and B. X. Fang, “Survey on internet topology modeling,” Journal of Software, vol. 15, no. 8, pp. 1220–1226, 2004. View at Google Scholar · View at Scopus
  8. R. Teixeira, K. Marzullo, S. Savage, and G. M. Voelker, “In search of path diversity in ISP networks,” in Proceedings of the ACM SIGCOMM Internet Measurement Conference (IMC '03), pp. 313–318, October 2003. View at Scopus
  9. S. Bilir, K. Sarac, and T. Korkmaz, “Intersection characteristics of end-to-end internet paths and trees,” in Proceedings of the 13th IEEE International Conference on Network Protocols (ICNP '05), pp. 378–387, November 2005. View at Publisher · View at Google Scholar · View at Scopus
  10. Y. Xu, A TL model for router-level Internet macroscopic topology, Ph.D. thesis, Northeastern University, Shenyang, China, 2006.
  11. K. I. Goh, B. Kahng, and D. Kim, “Spectra and eigenvectors of scale-free networks,” Physical Review E, vol. 64, no. 5, pp. 1–5, 2001. View at Publisher · View at Google Scholar · View at Scopus
  12. A. L. Barabási and E. Bonabeau, “Scale-free networks,” Scientific American, vol. 288, no. 5, pp. 60–69, 2003. View at Google Scholar · View at Scopus
  13. A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, no. 5439, pp. 509–512, 1999. View at Publisher · View at Google Scholar
  14. R. Albert and A.-L. Barabási, “Statistical mechanics of complex networks,” Reviews of Modern Physics, vol. 74, no. 1, pp. 47–97, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  15. E. R. van Dam and W. H. Haemers, “Which graphs are determined by their spectrum?” Linear Algebra and Its Applications, vol. 373, pp. 241–272, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH