{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T12:51:24Z","timestamp":1776257484290,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540698135","type":"print"},{"value":"9783540698142","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69814-2_11","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:39:36Z","timestamp":1217486376000},"page":"154-173","source":"Crossref","is-referenced-by-count":11,"title":["Tuning Topology Generators Using Spectral Distributions"],"prefix":"10.1007","author":[{"given":"Hamed","family":"Haddadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damien","family":"Fay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steve","family":"Uhlig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Moore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Mortier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Almerima","family":"Jamakovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel","family":"Rio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"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\u2013180 (2000)","DOI":"10.1145\/335305.335326"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"5234","DOI":"10.1103\/PhysRevLett.85.5234","volume":"85","author":"R. Albert","year":"2000","unstructured":"Albert, R., Barabasi, A.-L.: Topology of evolving networks: local events and universality. Physical Review Letters\u00a085, 5234 (2000)","journal-title":"Physical Review Letters"},{"issue":"5439","key":"11_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barabasi","year":"1999","unstructured":"Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science\u00a0286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"11_CR4","unstructured":"Bu, T., Towsley, D.: On distinguishing between Internet power law topology generators. In: Proceedings of IEEE Infocom 2002, New York, NY (June 2002)"},{"key":"11_CR5","unstructured":"Butler, S.: Lecture notes for spectral graph theory. Lectures in Nankai University, Tianjin, China. (2006)"},{"issue":"6","key":"11_CR6","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/35.587723","volume":"35","author":"K.L. Calvert","year":"1997","unstructured":"Calvert, K.L., Doar, M.B., Zegura, E.W.: Modeling Internet topology. IEEE Communications Magazine\u00a035(6), 160\u2013163 (1997)","journal-title":"IEEE Communications Magazine"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.20188","volume":"32","author":"F. Chung","year":"2008","unstructured":"Chung, F., Graham, R.: Quasi-random graphs with given degree sequences. Random Struct. Algorithms\u00a032(1), 1\u201319 (2008)","journal-title":"Random Struct. Algorithms"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Chung, F.R.K.: Spectral Graph Theory. CBMS Regional Conference Series in Mathematics. American Mathematical Society (1997)","DOI":"10.1090\/cbms\/092"},{"key":"11_CR9","unstructured":"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\u2013122. SIAM (1987)"},{"key":"11_CR10","unstructured":"Doar, M.B.: A better model for generating test networks. In: IEEE GLOBECOM 1996, London, UK (November 1996)"},{"key":"11_CR11","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs. In: Mathematical Institute Hungarian Academy, 196, London, (1985)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013262 (1999)","DOI":"10.1145\/316194.316229"},{"key":"11_CR13","unstructured":"Gkantsidis, C., Mihail, M., Zegura, E.: Spectral analysis of Internet topologies. In: Proceedings of IEEE Infocom 2003, San Francisco, CA (April 2003)"},{"key":"11_CR14","unstructured":"Hanna, S.: Representation and generation of plans using graph spectra. In: 6th International Space Syntax Symposium, Istanbul (2007)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"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\u201332 (2003)","DOI":"10.1145\/944777.944779"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Jamakovic, A., Uhlig, S.: On the relationship between the algebraic connectivity and graph\u2019s robustness to node and link failures. In: Next Generation Internet Networks, 3rd EuroNGI Conference on, Trondheim, Norway (2007)","DOI":"10.1109\/NGI.2007.371203"},{"key":"11_CR17","volume-title":"Advances in Neural Information Processing Systems","author":"U. Luxburg","year":"2005","unstructured":"Luxburg, U., Bousquet, O., Belkin, M.: Limits of spectral clustering. In: Advances in Neural Information Processing Systems. MIT Press, Cambridge (2005)"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/1111322.1111328","volume":"36","author":"P. Mahadevan","year":"2006","unstructured":"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\u00a036(1), 17\u201326 (2006)","journal-title":"SIGCOMM Computer Communication Review"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"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\u2013353 (2001)","DOI":"10.1109\/MASCOT.2001.948886"},{"key":"11_CR20","unstructured":"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)"},{"key":"11_CR21","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"J. Nelder","year":"1965","unstructured":"Nelder, J., Mead, R.: A simplex method for function minimization. Comput. J.\u00a07, 308\u2013313 (1965)","journal-title":"Comput. J."},{"key":"11_CR22","volume-title":"Advances in Neural Information Processing Systems 14","author":"A. Ng","year":"2002","unstructured":"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)"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"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\u2013159 (2002)","DOI":"10.1145\/633025.633040"},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"Innovative Internet Computing Systems","author":"D. Vukadinovic","year":"2002","unstructured":"Vukadinovic, D., Huang, P., Erlebach, T.: On the spectrum and structure of Internet topology graphs. In: Unger, H., B\u00f6hme, T., Mikler, A.R. (eds.) IICS 2002. LNCS, vol.\u00a02346, Springer, Heidelberg (2002)"},{"issue":"9","key":"11_CR25","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"B.M. Waxman","year":"1988","unstructured":"Waxman, B.M.: Routing of multipoint connections. IEEE Journal on Selected Areas in Communications (JSAC)\u00a06(9), 1617\u20131622 (1988)","journal-title":"IEEE Journal on Selected Areas in Communications (JSAC)"},{"key":"11_CR26","unstructured":"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)"},{"issue":"6","key":"11_CR27","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1109\/90.650138","volume":"5","author":"E.W. Zegura","year":"1997","unstructured":"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)\u00a05(6), 770\u2013783 (1997)","journal-title":"IEEE\/ACM Transactions on Networking (TON)"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Zhou, S.: Characterising and modelling the Internet topology, the rich-club phenomenon and the PFP model. BT Technology Journal\u00a024 (2006)","DOI":"10.1007\/s10550-006-0082-1"}],"container-title":["Lecture Notes in Computer Science","Performance Evaluation: Metrics, Models and Benchmarks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69814-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T07:32:02Z","timestamp":1738308722000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-69814-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540698135","9783540698142"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69814-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}