Abstract
An increasing number of synthetic topology generators are available, each claiming to produce representative Internet topologies. Every generator has its own parameters, allowing the user to generate topologies with different characteristics. However, there exist no clear guidelines on tuning the value of these parameters in order to obtain a topology with specific characteristics.
In this paper we optimize the parameters of several topology generators to match a given Internet topology. The optimization is performed either with respect to the link density, or to the spectrum of the normalized Laplacian matrix. Contrary to approaches in the literature that rely only on the largest eigenvalues, we take into account the set of all eigenvalues. However, we show that on their own the eigenvalues cannot be used to construct a metric for optimizing parameters. Instead we present a weighted spectral method which simultaneously takes into account all the properties of the graph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Albert, R., Barabasi, A.-L.: Topology of evolving networks: local events and universality. Physical Review Letters 85, 5234 (2000)
Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
Bu, T., Towsley, D.: On distinguishing between Internet power law topology generators. In: Proceedings of IEEE Infocom 2002, New York, NY (June 2002)
Butler, S.: Lecture notes for spectral graph theory. Lectures in Nankai University, Tianjin, China. (2006)
Calvert, K.L., Doar, M.B., Zegura, E.W.: Modeling Internet topology. IEEE Communications Magazine 35(6), 160–163 (1997)
Chung, F., Graham, R.: Quasi-random graphs with given degree sequences. Random Struct. Algorithms 32(1), 1–19 (2008)
Chung, F.R.K.: Spectral Graph Theory. CBMS Regional Conference Series in Mathematics. American Mathematical Society (1997)
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)
Doar, M.B.: A better model for generating test networks. In: IEEE GLOBECOM 1996, London, UK (November 1996)
Erdös, P., Rényi, A.: On random graphs. In: Mathematical Institute Hungarian Academy, 196, London, (1985)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the Internet topology. In: Proceedings of ACM SIGCOMM 1999, Cambridge, Massachusetts, United States, pp. 251–262 (1999)
Gkantsidis, C., Mihail, M., Zegura, E.: Spectral analysis of Internet topologies. In: Proceedings of IEEE Infocom 2003, San Francisco, CA (April 2003)
Hanna, S.: Representation and generation of plans using graph spectra. In: 6th International Space Syntax Symposium, Istanbul (2007)
Heckmann, O., Piringer, M., Schmitt, J., Steinmetz, R.: On realistic network topologies for simulation. In: MoMeTools 2003: Proceedings of the ACM SIGCOMM workshop on Models, methods and tools for reproducible network research, New York, NY, USA, pp. 28–32 (2003)
Jamakovic, A., Uhlig, S.: On the relationship between the algebraic connectivity and graph’s robustness to node and link failures. In: Next Generation Internet Networks, 3rd EuroNGI Conference on, Trondheim, Norway (2007)
Luxburg, U., Bousquet, O., Belkin, M.: Limits of spectral clustering. In: Advances in Neural Information Processing Systems. MIT Press, Cambridge (2005)
Mahadevan, P., Krioukov, D., Fomenkov, M., Dimitropoulos, X., Claffy, K.C., Vahdat, A.: The Internet AS-level topology: three data sources and one definitive metric. SIGCOMM Computer Communication Review 36(1), 17–26 (2006)
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)
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)
Nelder, J., Mead, R.: A simplex method for function minimization. Comput. J. 7, 308–313 (1965)
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)
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)
Vukadinovic, D., Huang, P., Erlebach, T.: On the spectrum and structure of Internet topology graphs. In: Unger, H., Böhme, T., Mikler, A.R. (eds.) IICS 2002. LNCS, vol. 2346, Springer, Heidelberg (2002)
Waxman, B.M.: Routing of multipoint connections. IEEE Journal on Selected Areas in Communications (JSAC) 6(9), 1617–1622 (1988)
Winick, J., Jamin, S.: Inet-3.0: Internet topology generator. Technical Report CSE-TR-456-02, University of Michigan Technical Report CSE-TR-456-02 (2002)
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)
Zhou, S.: Characterising and modelling the Internet topology, the rich-club phenomenon and the PFP model. BT Technology Journal 24 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haddadi, H. et al. (2008). Tuning Topology Generators Using Spectral Distributions. In: Kounev, S., Gorton, I., Sachs, K. (eds) Performance Evaluation: Metrics, Models and Benchmarks. SIPEW 2008. Lecture Notes in Computer Science, vol 5119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69814-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-69814-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69813-5
Online ISBN: 978-3-540-69814-2
eBook Packages: Computer ScienceComputer Science (R0)