{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T19:33:13Z","timestamp":1777059193450,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540258094","type":"print"},{"value":"9783540320173","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11422778_27","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T20:01:28Z","timestamp":1279051288000},"page":"328-341","source":"Crossref","is-referenced-by-count":37,"title":["Reducing Large Internet Topologies for Faster Simulations"],"prefix":"10.1007","author":[{"given":"V.","family":"Krishnamurthy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Faloutsos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Chrobak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Lao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. -H.","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. G.","family":"Percus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: STOC (2000)","DOI":"10.1145\/335305.335326"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Albert, R., Barabasi, A.: Statistical mechanics of complex networks. Review of Modern Physics (2002)","DOI":"10.1103\/RevModPhys.74.47"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Barabasi, A., Albert, R.: Emergence of scaling in random networks. Science\u00a08 (October 1999)","DOI":"10.1126\/science.286.5439.509"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Battista, G., Patrignani, M., Pizzonia, M.: Computing the types of the relationships between autonomous systems. In: IEEE INFOCOM (2003)","DOI":"10.1109\/INFCOM.2003.1208668"},{"key":"27_CR5","unstructured":"Bu, T., Towsley, D.: On distinguishing between Internet power law topology generators. In: Infocom (2002)"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Calvert, K., Zegura, E., Doar, M.: Modeling Internet topology. IEEE Trans on Communication, 160\u2013163 (December 1997)","DOI":"10.1109\/35.587723"},{"key":"27_CR7","unstructured":"Chen, Q., Chang, H., Govindan, R., Jamin, S., Shenker, S.J., Willinger, W.: The origin of power laws in Internet topologies revisited. In: INFOCOM (2002)"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Dimitropoulos, X.A., Riley, G.F.: Creating realistic BGP models. In: 11th IEEE\/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (2003)","DOI":"10.1109\/MASCOT.2003.1240643"},{"key":"27_CR9","volume-title":"Proc. Global Internet","author":"M. Doar","year":"1996","unstructured":"Doar, M.: A better model for generating test networks. In: Proc. Global Internet. IEEE, Los Alamitos (1996)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Koutsoupias, E., Papadimitriou, C.H.: Heuristically optimized trade-offs: A new paradigm for power laws in the internet (extended abstract). In: STOC (2002)","DOI":"10.1007\/3-540-45465-9_11"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the Internet topology. In: ACM SIGCOMM, Cambridge MA, September 1-3, pp. 251\u2013262 (1999)","DOI":"10.1145\/316188.316229"},{"key":"27_CR12","unstructured":"National Laboratory for Applied Network Research. Online data and reports. Supported by NSF (1998), http:\/\/www.nlanr.net"},{"key":"27_CR13","unstructured":"Gao, L.: On inferring automonous system relationships in the Internet. In: Proc. Global Internet (November 2000)"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Riley, G.F.: On standardized network topologies for network research. In: Simulation Conference, 2002. Proceedings of the Winter, vol.\u00a01, pp. 664\u2013670 (2002)","DOI":"10.1109\/WSC.2002.1172945"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Gkantsidis, C., Mihail, M., Zegura, E.: Spectral analysis of Internet topologies. In: IEEE INFOCOM (2003)","DOI":"10.1109\/INFCOM.2003.1208688"},{"key":"27_CR16","unstructured":"Jin, C., Chen, Q., Jamin, S.: Inet: Internet topology generator. Techical Report UM CSETR- 433-00 (2000)"},{"key":"27_CR17","first-page":"1","volume":"58","author":"D. Karger","year":"1998","unstructured":"Karger, D.: Randomization in graph optimization problems: A survey. Optima\u00a058, 1\u201311 (1998)","journal-title":"Optima"},{"key":"27_CR18","unstructured":"Karypis, G.: Multilevel hypergraph partitioning. Technical Report, Department of Computer Science, University of Minnesota: 02-025 (2002)"},{"key":"27_CR19","unstructured":"Karypis, G., Kumar, V.: A fast and high quality scheme for partitioning irregular graphs. Technical Report, Department of Computer Science, University of Minnesota: 95-035 (1995)"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Krishnamurthy, V., Faloutsos, M., Chrobak, M., Lao, L., Cui, J.H., Percus, A.G.: Reducing large internet topologies for faster simulations, UC Riverside, Technical Report (2005)","DOI":"10.1007\/11422778_27"},{"key":"27_CR21","unstructured":"Krishnamurthy, V., Sun, J., Faloutsos, M., Tauro, S.: Sampling internet topologies: How small can we go? In: International Conference on Internet Computing, Las Vegas (2005)"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Subramanian, L., Agarwal, S., Rexford, J., Katz, R.: Characterizing the Internet hierarchy from multiple vantage points. In: Proc. IEEE INFOCOM (2002)","DOI":"10.1109\/INFCOM.2002.1019307"},{"key":"27_CR23","unstructured":"Medina, A., Lakhina, A., Matta, I., Byers, J.: Brite:an approach to universal topology generation. In: MASCOTS (2001)"},{"issue":"2","key":"27_CR24","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/505680.505683","volume":"30","author":"A. Medina","year":"2000","unstructured":"Medina, A., Matta, I., Byers, J.: On the origin of powerlaws in Internet topologies. ACM SIGCOMM Computer Communication Review\u00a030(2), 18\u201334 (2000)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: A brief history of generative models for power law and lognormal distributions. Internet Mathematics\u00a01(2) (2004)","DOI":"10.1080\/15427951.2004.10129088"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Palmer, C.R., Gibbons, P.B., Faloutsos, C.: Anf: A fast and scalable tool for data mining in massive graphs. In: SIGKDD (2002)","DOI":"10.1145\/775047.775059"},{"key":"27_CR27","unstructured":"Riley, G.F., Ammar, M.H., Fujimoto, R.M., Perumalla, K., Xu, D.: Distributed network simulations using the dynamic simulation backplan. In: International Conference on Distributed Computing Systems 2001, ICDCS 2001 (2001)"},{"key":"27_CR28","doi-asserted-by":"crossref","unstructured":"Siganos, G., Faloutsos, M., Faloutsos, P., Faloutsos, C.: Power-laws of the Internet topology. IEEE\/ACM Trans. on Networking (August 2003)","DOI":"10.1109\/TNET.2003.815300"},{"key":"27_CR29","doi-asserted-by":"crossref","unstructured":"Tangmurankit, H., Govindan, R., Jamin, S., Shenker, S.J., Willinger, W.: Network topology generators: Degree-based vs structural. In: SIGCOMM (2002)","DOI":"10.1145\/633038.633040"},{"issue":"9","key":"27_CR30","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\u00a06(9), 1617\u20131622 (1988)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"27_CR31","doi-asserted-by":"crossref","unstructured":"Zegura, E., Calvert, K., Bhattacharjee, S.: How to model an Internetwork. In: IEEE INFOCOM (1996)","DOI":"10.1109\/INFCOM.1996.493353"},{"key":"27_CR32","doi-asserted-by":"crossref","unstructured":"Zegura, E.W., Calvert, K.L., Donahoo, M.J.: A quantitative comparison of graph-based models for Internetworks. TON\u00a05(6) (December 1997)","DOI":"10.1109\/90.650138"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11422778_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:52:16Z","timestamp":1605642736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11422778_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258094","9783540320173"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/11422778_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}