{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:58:44Z","timestamp":1725469124369},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325113"},{"type":"electronic","value":"9783642325120"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32512-0_11","type":"book-chapter","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T22:21:08Z","timestamp":1342822868000},"page":"122-133","source":"Crossref","is-referenced-by-count":1,"title":["iBGP and Constrained Connectivity"],"prefix":"10.1007","author":[{"given":"Michael","family":"Dinitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gordon","family":"Wilfong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Basu, A., Ong, C.-H.L., Rasala, A., Shepherd, F.B., Wilfong, G.: Route oscillations in I-BGP with route reflection. In: Proc. ACM SIGCOMM (2002)","key":"11_CR1","DOI":"10.1145\/633025.633048"},{"doi-asserted-by":"crossref","unstructured":"Bates, T., Chandra, R., Chen, E.: BGP route reflection - an alternative to full mesh IBGP. RFC 2796 (2000)","key":"11_CR2","DOI":"10.17487\/rfc2796"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22006-7_1","volume-title":"Automata, Languages and Programming","author":"P. Berman","year":"2011","unstructured":"Berman, P., Bhattacharyya, A., Makarychev, K., Raskhodnikova, S., Yaroslavtsev, G.: Improved Approximation for the Directed Spanner Problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol.\u00a06755, pp. 1\u201312. Springer, Heidelberg (2011)"},{"doi-asserted-by":"crossref","unstructured":"Bhattacharyya, A., Grigorescu, E., Jung, K., Raskhodnikova, S., Woodruff, D.P.: Transitive-closure spanners. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 932\u2013941 (2009)","key":"11_CR4","DOI":"10.1137\/1.9781611973068.101"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/978-3-540-79549-0_47","volume-title":"NETWORKING 2008 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet","author":"M.-O. Buob","year":"2008","unstructured":"Buob, M.-O., Uhlig, S., Meulle, M.: Designing Optimal iBGP Route-Reflection Topologies. In: Das, A., Pung, H.K., Lee, F.B.S., Wong, L.W.C. (eds.) NETWORKING 2008. LNCS, vol.\u00a04982, pp. 542\u2013553. Springer, Heidelberg (2008)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-04128-0_3","volume-title":"Algorithms - ESA 2009","author":"M. Charikar","year":"2009","unstructured":"Charikar, M., Hajiaghayi, M.T., Karloff, H.: Improved Approximation Algorithms for Label Cover Problems. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 23\u201334. Springer, Heidelberg (2009)"},{"key":"11_CR7","first-page":"323","volume-title":"Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC 2011","author":"M. Dinitz","year":"2011","unstructured":"Dinitz, M., Krauthgamer, R.: Directed spanners via flow-based linear programs. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC 2011, pp. 323\u2013332. ACM, New York (2011)"},{"unstructured":"Dinitz, M., Wilfong, G.T.: iBGP and Constrained Connectivity. CoRR, abs\/1107.2299 (2011), \n                    \n                      http:\/\/arxiv.org\/abs\/1107.2299","key":"11_CR8"},{"unstructured":"Fabrikant, A., Papadimitriou, C.: The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond. In: SODA 2008: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 844\u2013853 (2008)","key":"11_CR9"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.jcss.2011.05.009","volume":"78","author":"M. Feldman","year":"2012","unstructured":"Feldman, M., Kortsarz, G., Nutov, Z.: Improved approximation algorithms for directed steiner forest. Journal of Computer and System Sciences\u00a078(1), 279\u2013292 (2012)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1109\/90.993304","volume":"10","author":"T.G. Griffin","year":"2002","unstructured":"Griffin, T.G., Shepherd, F.B., Wilfong, G.: The stable paths problem and interdomain routing. IEEE\/ACM Trans. Netw.\u00a010(2), 232\u2013243 (2002)","journal-title":"IEEE\/ACM Trans. Netw."},{"doi-asserted-by":"crossref","unstructured":"Griffin, T.G., Wilfong, G.: On the correctness of IBGP configuration. In: Proc. ACM SIGCOMM (September 2002)","key":"11_CR12","DOI":"10.1145\/633025.633028"},{"doi-asserted-by":"crossref","unstructured":"Kortsarz, G.: On the hardness of approximating spanners. Algorithmica\u00a030 (1999)","key":"11_CR13","DOI":"10.1007\/s00453-001-0021-y"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/1374376.1374388","volume-title":"STOC 2008: Proceedings of the 40th Annual ACM Symposium on Theory of Computing","author":"H. Levin","year":"2008","unstructured":"Levin, H., Schapira, M., Zohar, A.: Internet routing and games. In: STOC 2008: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 57\u201366. ACM, New York (2008)"},{"unstructured":"Stewart, J.W.: BGP4: Inter-Domain Routing in the Internet. Addison-Wesley (1999)","key":"11_CR15"},{"doi-asserted-by":"crossref","unstructured":"Traina, P., McPherson, D., Scudder, J.: Autonomous system confederations for BGP. RFC 3065 (2001)","key":"11_CR16","DOI":"10.17487\/rfc3065"},{"doi-asserted-by":"crossref","unstructured":"Vutukuru, M., Valiant, P., Kopparty, S., Balakrishnan, H.: How to Construct a Correct and Scalable iBGP Configuration. In: IEEE INFOCOM, Barcelona, Spain (April 2006)","key":"11_CR17","DOI":"10.1109\/INFOCOM.2006.122"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32512-0_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:05:23Z","timestamp":1620129923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32512-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325113","9783642325120"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32512-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}