{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:09:24Z","timestamp":1725494964105},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423027"},{"type":"electronic","value":"9783540477280"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47728-4_61","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T01:39:45Z","timestamp":1195004385000},"page":"620-629","source":"Crossref","is-referenced-by-count":5,"title":["An Evaluation of Shared Multicast Trees with Multiple Active Cores"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Zappala","sequence":"first","affiliation":[]},{"given":"Aaron","family":"Fabbri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,22]]},"reference":[{"key":"61_CR1","doi-asserted-by":"crossref","unstructured":"S. Kumar, P. Radoslavov, D. Thaler, C. Alaettinoglu, D. Estring, and M. Handley, \u201cThe MASC\/BGMP Architecture for Inter-domain Multicast Routing\u201d in ACM SIGCOMM, August 1998.","DOI":"10.1145\/285237.285264"},{"key":"61_CR2","unstructured":"Liming Wei and Deborah Estrin, \u201cThe Trade-offs of Multicast Trees and Algorithms\u201d in 1994 International Conference on Computer Communications Networks, September 1994."},{"key":"61_CR3","doi-asserted-by":"crossref","unstructured":"Stephen Deering, Deborah Estrin, Dino Farinacci, Van Jacobson, Ching-Gung Liu, and Liming Wei, \u201cAn Architecture for Wide-Area Multicast Routing\u201d in ACM SIGCOMM, August 1994.","DOI":"10.1145\/190314.190326"},{"key":"61_CR4","unstructured":"Deborah Estrin, Mark Handley, Ahmed Helmy, Polly Huang, and David Thaler, \u201cA Dynamic Bootstrap Mechanism for Rendezvous-based Multicast Routing\u201d submitted to ACM\/IEEE Transactions on Networking."},{"key":"61_CR5","doi-asserted-by":"crossref","unstructured":"K.L. Calvert, E.W. Zegura, and M.J. Donahoo, \u201cCore Selection Methods for Multicast Routing\u201d in International Conference on Computer Communications Networks, September 1995.","DOI":"10.1109\/ICCCN.1995.540184"},{"key":"61_CR6","doi-asserted-by":"crossref","unstructured":"A. J. Ballardie, P.F. Francis, and J. Crowcroft, \u201cCore Based Trees\u201d in ACM SIGCOMM, August 1993.","DOI":"10.1145\/166237.166246"},{"key":"61_CR7","unstructured":"C. Shields and J.J. Garcia-Luna-Aceves, \u201cThe Ordered Core Based Tree Protocol\u201d in IEEE INFOCOM, 1997."},{"key":"61_CR8","doi-asserted-by":"crossref","unstructured":"Bernard M. Waxman, \u201cRouting of Multipoint Connections\u201d IEEE Journal on SelectedA reas in Communications, vol. 6, no. 9, December 1988.","DOI":"10.1109\/49.12889"},{"key":"61_CR9","unstructured":"Ken Calvert and Ellen Zegura, \u201cGeorgia Tech Internetwork Topology Models\u201d http:\/\/www.cc.gatech.edu\/fac\/Ellen.Zegura\/graphs.html ."}],"container-title":["Lecture Notes in Computer Science","Networking \u2014 ICN 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47728-4_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T11:31:15Z","timestamp":1556969475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47728-4_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423027","9783540477280"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-47728-4_61","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}