{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:37:20Z","timestamp":1742387840931,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/infcom.2004.1354692","type":"proceedings-article","created":{"date-parts":[[2004,12,28]],"date-time":"2004-12-28T18:32:06Z","timestamp":1104258726000},"page":"2743-2753","source":"Crossref","is-referenced-by-count":13,"title":["A proactive approach to reconstructing overlay multicast trees"],"prefix":"10.1109","volume":"4","author":[{"family":"Mengkun Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Zongming Fei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208987"},{"key":"18","article-title":"A dual-tree scheme for fault-tolerant multicast","author":"fei","year":"2001","journal-title":"Proc ICC 2001"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/378344.378357"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019370"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.802069"},{"key":"14","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1109\/INFCOM.1996.493353","article-title":"How to model an internetwork","author":"zegura","year":"1996","journal-title":"Proceedings of INFOCOM'96"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"11"},{"journal-title":"INTRODUCTION TO ALGORITHMS Second Edition","year":"2001","author":"cormen","key":"12"},{"journal-title":"An architecture for internet content distribution as an infrastructure service","year":"2000","author":"chawathe","key":"3"},{"journal-title":"Yoid Extending the Internet multicast architecture","year":"0","author":"francis","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/339331.339337"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1995.515897"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/71.808133"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/781027.781041"},{"key":"5","article-title":"Streaming live media over a peer-to-peer network","volume":"cs 2001 31","author":"deshpande","year":"2001","journal-title":"Technical Report"},{"key":"4","article-title":"Transience of peers and streaming media","author":"bawa","year":"2002","journal-title":"Proc HotNets 2002"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(80)90022-2"},{"key":"8","first-page":"104","article-title":"An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem","author":"raidi","year":"0","journal-title":"Proceedings of the 2000 Congress on Evolutionary Computation CEC00"}],"event":{"name":"IEEE INFOCOM 2004","acronym":"INFCOM-04","location":"Hong Kong, China"},"container-title":["IEEE INFOCOM 2004"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9369\/29753\/01354692.pdf?arnumber=1354692","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T10:10:26Z","timestamp":1497607826000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1354692\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/infcom.2004.1354692","relation":{},"subject":[]}}