Tuning topology generators using spectral distributions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5119 LNCS, Issue , 2008, Pages 154-173

  Haddadi, Hamed ^a   Fay, Damien ^b   Uhlig, Steve ^c   Moore, Andrew ^b   Mortier, Richard ^d   Jamakovic, Almerima ^c   Rio, Miguel ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^c DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^d Vipadia Ltd

Author keywords

Graph Spectrum; Internet Topology

Indexed keywords

BENCHMARKING; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA;

GRAPH SPECTRA; INTERNET TOPOLOGIES; LARGEST EIGENVALUES; NORMALIZED LAPLACIAN; OPTIMIZING PARAMETERS; SPECTRAL DISTRIBUTION; SPECTRAL METHODS; SYNTHETIC TOPOLOGY;

TOPOLOGY;

EID: 70349884154     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69814-2_11     Document Type: Conference Paper

References (28)

1. Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: STOC 2000: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, Portland, OR, May 2000, pp. 171-180 (2000)
2. Albert, R., Barabasi, A.-L.: Topology of evolving networks: local events and universality. Physical Review Letters 85, 5234 (2000)
3. Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509-512 (1999)
4. Bu, T., Towsley, D.: On distinguishing between Internet power law topology generators. In: Proceedings of IEEE Infocom 2002, New York, NY (June 2002)
5. Butler, S.: Lecture notes for spectral graph theory. Lectures in Nankai University, Tianjin, China. (2006)
6. Calvert, K.L., Doar, M.B., Zegura, E.W.: Modeling Internet topology. IEEE Communications Magazine 35(6), 160-163 (1997)
7. Chung, F., Graham, R.: Quasi-random graphs with given degree sequences. Random Struct. Algorithms 32(1), 1-19 (2008)
8. Chung, F.R.K.: Spectral Graph Theory. CBMS Regional Conference Series in Mathematics. American Mathematical Society (1997)
9. Dennis, J., Woods, D.: Optimization in microcomputers: The nelder-meade simplex algorithm. In: Wouk, A. (ed.) New Computing Environments: Microcomputers in Large-Scale Computing, pp. 116-122. SIAM (1987)
10. Doar, M.B.: A better model for generating test networks. In: IEEE GLOBECOM 1996, London, UK (November 1996)
11. Erdös, P., Ŕenyi, A.: On random graphs. In: Mathematical Institute Hungarian Academy, 196, London, (1985)
12. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the In-ternet topology. In: Proceedings of ACM SIGCOMM 1999, Cambridge, Massachusetts, United States, pp. 251-262 (1999)
13. Gkantsidis, C., Mihail, M., Zegura, E.: Spectral analysis of Internet topologies. In: Proceedings of IEEE Infocom 2003, San Francisco, CA (April 2003)
14. Hanna, S.: Representation and generation of plans using graph spectra. In: 6th International Space Syntax Symposium, Istanbul (2007)
15. Heckmann, O., Piringer, M., Schmitt, J., Steinmetz, R.: On realistic network topologies for simulation. In: MoMeTools 2003: Proceedings of the ACM SIG-COMM workshop on Models, methods and tools for reproducible network research, New York, NY, USA, pp. 28-32 (2003)
16. Jamakovic, A., Uhlig, S.: On the relationship between the algebraic connectivity and graph's robustness to Networks, 3rd EuroNGI Conference on, Trondheim, Norway (2007)
17. Luxburg, U., Bousquet, O., Belkin, M.: Limits of spectral clustering. In: Advances in Neural Information Processing Systems. MIT Press, Cambridge (2005)
18. Mahadevan, P., Krioukov, D., Fomenkov, M., Dimitropoulos, X., Claffy, K.C., Vah-dat, A.: The Internet AS-level topology: three data sources and one definitive metric. SIGCOMM Computer Communication Review 36(1), 17-26 (2006)
19. Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: an approach to universal topology generation. In: IEEE MASCOTS, Cincinnati, OH, USA, August 2001, pp. 346-353 (2001)
20. Nadler, B., Lafon, S., Coifman, R., Kevrekidis, I.: Diffusion maps, spectral clustering and eigenfunctions of fokker-planck operators. In: Neural Information Processing Systems (NIPS) (2005)
21. Nelder, J., Mead, R.: A simplex method for function minimization. Comput. J. 7, 308-313 (1965)
22. Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: Dietterich, T., Becker, S., Ghahramani, Z. (eds.) Advances in Neural Information Processing Systems 14. MIT Press, Cambridge (2002)
23. Tangmunarunkit, H., Govindan, R., Jamin, S., Shenker, S., Willinger, W.: Network topology generators: degree-based vs. structural. In: Proceedings of ACM SIGCOMM 2002, Pittsburgh, PA, pp. 147-159 (2002)
24. Vukadinovic, D., Huang, P., Erlebach, T.: On the spectrum and structure of In-ternet topology graphs. In: Unger, H., Böhme, T., Mikler, A.R. (eds.) IICS 2002. LNCS, vol.2346, Springer, Heidelberg (2002)
25. Waxman, B.M.: Routing of multipoint connections. IEEE Journal on Selected Areas in Communications (JSAC) 6(9), 1617-1622 (1988)
26. Winick, J., Jamin, S.: Inet-3.0: Internet topology generator. Technical Report CSE-TR-456-02, University of Michigan Technical Report CSE-TR-456-502 (2002)
27. Zegura, E.W., Calvert, K.L., Donahoo, M.J.: A quantitative comparison of graph-based models for Internet topology. IEEE/ACM Transactions on Networking (TON) 5(6), 770-783 (1997)
28. Zhou, S.: Characterising and modelling the Internet topology, the rich-club phenomenon and the PFP model. BT Technology Journal 24 (2006)