{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:04:57Z","timestamp":1725473097617},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540368212"},{"type":"electronic","value":"9783540368236"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11808107_12","type":"book-chapter","created":{"date-parts":[[2006,11,20]],"date-time":"2006-11-20T12:30:27Z","timestamp":1164025827000},"page":"260-274","source":"Crossref","is-referenced-by-count":1,"title":["Robustness of the Internet at the Topology and Routing Level"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Erlebach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Hall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linda","family":"Moonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Panconesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danica","family":"Vukadinovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Agarwal, S., Subramanian, L., Rexford, J., Katz, R.H.: Characterizing the Internet hierarchy from multiple vantage points, project web-page (2002-2003), \n                    \n                      http:\/\/www.cs.berkeley.edu\/~sagarwal\/research\/BGP-hierarchy\/"},{"key":"12_CR2","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"A. Ahuja","year":"1993","unstructured":"Ahuja, A., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"12_CR3","volume-title":"Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties. Springer, Berlin (1999)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Baake, P., Wichmann, T.: On the economics of Internet peering. Netnomics\u00a01(1) (1999)","DOI":"10.1023\/A:1011449721395"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E., Nemhauser, G., Savelsbergh, M., Vance, P.: Branch-and-price: Column generation for solving huge integer programs. Operations Research\u00a046(3), 316\u2013329 (1998)","journal-title":"Operations Research"},{"issue":"3","key":"12_CR6","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1137\/S0097539798337716","volume":"30","author":"C.L. Barrett","year":"2000","unstructured":"Barrett, C.L., Jacob, R., Marathe, M.: Formal language constrained path problems. SIAM J. Comput.\u00a030(3), 809\u2013837 (2000)","journal-title":"SIAM J. Comput."},{"key":"12_CR7","unstructured":"Di Battista, G., Patrignani, M., Pizzonia, M.: Computing the types of the relationships between Autonomous Systems, project web-page, \n                    \n                      http:\/\/www.dia.uniroma3.it\/~compunet\/relationships\/"},{"key":"12_CR8","unstructured":"Di Battista, G., Patrignani, M., Pizzonia, M.: Computing the types of the relationships between autonomous systems. In: Proceedings of INFOCOM 2003 (2003)"},{"key":"12_CR9","unstructured":"Erlebach, T., Hall, A., Schank, T.: Classifying customer-provider relationships in the Internet. In: Proceedings of the IASTED International Conference on Communications and Computer Networks, pp. 538\u2013545 (2002)"},{"key":"12_CR10","unstructured":"Erlebach, T., Hall, A., Panconesi, A., Vukadinovi\u0107, D.: Cuts and disjoint paths in the valley-free path model. TIK-Report 180, Computer Engineering and Networks Laboratory (TIK), ETH Z\u00fcrich (2003), available electronically at: \n                    \n                      ftp:\/\/ftp.tik.ee.ethz.ch\/pub\/publications\/TIK-Report180.pdf"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11527954_6","volume-title":"Combinatorial and Algorithmic Aspects of Networking","author":"T. Erlebach","year":"2005","unstructured":"Erlebach, T., Hall, A., Panconesi, A., Vukadinovi\u0107, D.: Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing. In: L\u00f3pez-Ortiz, A., Hamel, A.M. (eds.) CAAN 2004. LNCS, vol.\u00a03405, pp. 49\u201362. Springer, Heidelberg (2005)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Erlebach, T., Moonen, L.S., Spieksma, F.C.R., Vukadinovi\u0107, D.: Connectivity measures for Internet topologies. DTEW Research Report 0550, Katholieke Universiteit Leuven, Leuven, Belgium (2005)","DOI":"10.2139\/ssrn.870269"},{"key":"12_CR13","unstructured":"Figueiredo, D.R., Ge, Z., Jaiswal, S.: Logical relationship inference program (implementation of algorithms from [14]), \n                    \n                      http:\/\/www-net.cs.umass.edu\/~ratton\/AS\/"},{"issue":"6","key":"12_CR14","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/90.974527","volume":"9","author":"L. Gao","year":"2001","unstructured":"Gao, L.: On inferring Autonomous System relationships in the Internet. IEEE\/ ACM Transactions on Networking\u00a09(6), 733\u2013745 (2001)","journal-title":"IEEE\/ ACM Transactions on Networking"},{"key":"12_CR15","unstructured":"Gao, L., Wang, F.: The extent of AS path inflation by routing policies. In: Proceedings of IEEE Global Internet Symposium 2002 (2002)"},{"key":"12_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Springer, Berlin (1988)"},{"issue":"1","key":"12_CR17","first-page":"2","volume":"2","author":"G. Huston","year":"1999","unstructured":"Huston, G.: Interconnection, peering and settlements\u2014Part I. Internet Protocol Journal\u00a02(1), 2\u201316 (1999)","journal-title":"Internet Protocol Journal"},{"issue":"2","key":"12_CR18","first-page":"2","volume":"2","author":"G. Huston","year":"1999","unstructured":"Huston, G.: Interconnection, peering and settlements\u2014Part II. Internet Protocol Journal\u00a02(2), 2\u201323 (1999)","journal-title":"Internet Protocol Journal"},{"key":"12_CR19","unstructured":"ILOG CPLEX Optimizer, version 9.0, \n                    \n                      http:\/\/www.ilog.com\/products\/cplex\/"},{"key":"12_CR20","unstructured":"Labovitz, C., Ahuja, A., Wattenhofer, R., Venkatachary, S.: The impact of Internet policy and topology on delayed routing convergence. In: Proceedings of INFOCOM 2001 (2001)"},{"key":"12_CR21","unstructured":"Library of efficient data types and algorithms (LEDA), \n                    \n                      http:\/\/www.algorithmic-solutions.com\/enleda.htm"},{"key":"12_CR22","unstructured":"Rimondini, M., Pizzonia, M., Di Battista, G., Patrignani, M.: Algorithms for the Inference of the Commercial Relationships between Autonomous Systems: Results Analysis and Model Validation. In: Proceedings of IPS 2004, International Workshop on Inter-domain Performance and Simulation (2004)"},{"key":"12_CR23","unstructured":"Route Views project web-site, University of Oregon, \n                    \n                      http:\/\/www.routeviews.org"},{"key":"12_CR24","unstructured":"Subramanian, L., Agarwal, S., Rexford, J., Katz, R.: Characterizing the Interenet hierarchy from multiple vantage points. In: Proceedings of INFOCOM 2002 (2002)"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Tangmunarunkit, H., Govindan, R., Shenker, S.: Internet path inflation due to policy routing. In: Proceedings of SPIE ITCom 2001 (2001)","DOI":"10.1117\/12.434394"},{"key":"12_CR26","unstructured":"Tangmunarunkit, H., Govindan, R., Shenker, S., Estrin, D.: The impact of routing policy on Internet paths. In: Proceedings of INFOCOM 2001 (2001)"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Teixeira, R., Marzullo, K., Savage, S., Voelker, G.: Characterizing and measuring path diversity of Internet topologies. In: Proceedings of ACM SIGMETRICS 2003 (2003)","DOI":"10.1145\/781027.781069"},{"key":"12_CR28","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6377(96)00033-8","volume":"19","author":"F. Vanderbeck","year":"1996","unstructured":"Vanderbeck, F., Wolsey, L.A.: An exact algorithm for IP column generation. Operations Research Letters\u00a019, 151\u2013159 (1996)","journal-title":"Operations Research Letters"},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/978-3-540-30551-4_55","volume-title":"Algorithms and Computation","author":"E. Wanke","year":"2004","unstructured":"Wanke, E., K\u00f6tter, R.: Oriented paths in mixed graphs. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 629\u2013643. Springer, Heidelberg (2004)"},{"key":"12_CR30","unstructured":"Xia, J., Gao, L.: On the Evaluation of AS Relationship Inferences. In: Proceedings of IEEE Global Communications Conference (GLOBECOM 2004) (2004)"}],"container-title":["Lecture Notes in Computer Science","Dependable Systems: Software, Computing, Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11808107_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:35Z","timestamp":1605644015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11808107_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540368212","9783540368236"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11808107_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}