{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:01:01Z","timestamp":1725559261979},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540258094"},{"type":"electronic","value":"9783540320173"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11422778_84","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T20:01:28Z","timestamp":1279051288000},"page":"1043-1055","source":"Crossref","is-referenced-by-count":3,"title":["On Multipath Routing with Transit Hubs"],"prefix":"10.1007","author":[{"given":"A.","family":"Sen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. H.","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Murthy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Ganguly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"84_CR1","doi-asserted-by":"crossref","unstructured":"Anderson, D., Balakrishnan, H., Kaashoek, M., Morris, R.: Resilient Overlay Networks. In: Proc. 18th ACM SOSP, Canada (October 2001)","DOI":"10.1145\/502034.502048"},{"key":"84_CR2","unstructured":"Beck, M., Dongarra, J., Plank, J., Wolski, R.: Logistical Network Project, http:\/\/loci.cs.utk.edu\/scidac"},{"issue":"6","key":"84_CR3","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1109\/90.811453","volume":"7","author":"I. Cidon","year":"1999","unstructured":"Cidon, I., Rom, R., Shavitt, Y.: Analysis of Multi-path Routing. IEEE\/ACM Trans. on Networking\u00a07(6), 885\u2013896 (1999)","journal-title":"IEEE\/ACM Trans. on Networking"},{"key":"84_CR4","doi-asserted-by":"crossref","unstructured":"Cohen, R., Nakibli, G.: On the computational complexity and effectiveness of N-hub shortest path routing. In: Proc. of IEEE Infocom (2004)","DOI":"10.1109\/INFCOM.2004.1354540"},{"key":"84_CR5","doi-asserted-by":"crossref","unstructured":"Feamster, N., Anderson, D., Balakrishnan, H., Kaashoek, M.: Measuring the Effects of Internet Path Faults on Reactive Routing. In: Proc. of ACM SIGMETRICS, San Diego, CA (June 2003)","DOI":"10.1145\/781027.781043"},{"key":"84_CR6","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On Generating All Maximal Independent Sets. Information Processing Letters\u00a027, 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"key":"84_CR7","unstructured":"Kosar, T., Kola, G., Livny, M.: A Framework for Self-optimizing, Fault-tolerant, High Performance Bulk Data Transfers in a Heterogenous Grid Environments. In: Proc. ISPDC 2003 (2003)"},{"key":"84_CR8","unstructured":"Lee, S., Gerla, M.: Split Multipath Routing with Maximally Disjoint Paths in Ad-hoc Networks. In: Proc. of IEEE ICC 2001 (2001)"},{"key":"84_CR9","doi-asserted-by":"crossref","unstructured":"Perkins, C.: IP encapsulation within IP. IETF RFC 2003 (October 1996)","DOI":"10.17487\/rfc2003"},{"key":"84_CR10","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"S. Suurballe","year":"1984","unstructured":"Suurballe, S., Tarjan, R.: A Quick Method for Finding Shortest Pair of Disjoint Paths. Networks\u00a014, 325\u2013336 (1984)","journal-title":"Networks"},{"key":"84_CR11","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A New Algorithm for Generating All Maximal Independent Sets. SIAM Journal of Computing\u00a06, 505\u2013517 (1977)","journal-title":"SIAM Journal of Computing"},{"key":"84_CR12","doi-asserted-by":"crossref","unstructured":"Stoica, S.Z.S.S.I., Adkins, D., Surana, S.: Internet indirection infrastructure. In: Proceedings of ACM SIGCOMM 2002 (August 2002)","DOI":"10.1145\/633025.633033"}],"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_84.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:52:32Z","timestamp":1605642752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11422778_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258094","9783540320173"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11422778_84","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}