{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T09:00:11Z","timestamp":1773392411225,"version":"3.50.1"},"reference-count":21,"publisher":"Scientific Research Publishing, Inc.","issue":"03","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["CN"],"published-print":{"date-parts":[[2011]]},"DOI":"10.4236\/cn.2011.33021","type":"journal-article","created":{"date-parts":[[2011,8,29]],"date-time":"2011-08-29T03:00:51Z","timestamp":1314586851000},"page":"168-183","source":"Crossref","is-referenced-by-count":2,"title":["Maximizing Resilient Throughput in Peer-to-Peer Network"],"prefix":"10.4236","volume":"03","author":[{"given":"Bo","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanchuan","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2751","reference":[{"key":"ref1","unstructured":"M. Guo and M. Ammar, \u201cScalable Livideo Streaming to Cooperative Clients Using Time Shifting and Video Patching,\u201d Proceedings of the International Conference on Computer Communications and Networks, Chicago, 11-13 October 2004."},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2003.1249753"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945474"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/507670.507695"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1030194.1015480"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.140"},{"key":"ref7","unstructured":"G. Tan and S. Jarvis, \u201cOn the Reliability of DHT-Based Multicast,\u201d Proceeding of International Conference on, Computer Communications and Networks, Honolulu, 13-16 August 2007."},{"key":"ref8","doi-asserted-by":"crossref","unstructured":"D. Leonard, Z. Yao, V. Rai and D. Loguinov, \u201cOn Lifetime-Based Node Failure and Stochastic Resilience of Decentralized Peer-to-peer Networks,\u201d IEEE\/ACM Transactions on Networking, Vol. 15, No. 3, 2007, pp. 644-656.","DOI":"10.1109\/TNET.2007.893199"},{"key":"ref9","unstructured":"R. Ahuja, T. Magnanti and J. Orlin, \u201cNetwork Flows: Theory, Algorithms, and Applications,\u201d Englewood Cliffss, Bergen, 1993."},{"key":"ref10","unstructured":"K. Wayne, \u201cA Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow,\u201d Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Atlanta, 1-4 May 1999, pp. 19-28."},{"key":"ref11","unstructured":"E. Tardos and K. Wayne, \u201cSimple Generalized Maximum Flow Algorithm,\u201d 7th International Integer Programming and Combinatorial Optimization Conference, Graz, 9-11 June 1999, pp. 1-16."},{"key":"ref12","unstructured":"K. Wayne and L. Fleischer, \u201cFaster Approximation Algorithms for Generalized Flow,\u201d Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 1999."},{"key":"ref13","unstructured":"Y. Cui, Y. Xue and K. Nahrstedt, \u201cMax-min Overlay Multicast: Rate Allocation and Tree Construction,\u201d IEEE International Workshop on Quality of Service, Montreal, June 2004."},{"key":"ref14","unstructured":"N. Deo, \u201cGraph Theory with Applications to Engineering and Computer Science,\u201d Prentice Hall Inc., Upper Saddle River, 1994."},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916727"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1165389.945473"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/258128.258201"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/314464.314508"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366884"},{"key":"ref20","unstructured":"A. Goel, M. Henzinger and S. Plotkin, \u201cOnline Throughput-competitive Algorithm for Multicast Routing and Admission Control,\u201d Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, Vol. 5, 1998."},{"key":"ref21","unstructured":"Y. Cui, B. Li and K. Nahrstedt, \u201cOn Achieving Optimized Capacity Utilization in Application Overlahy Networks with Multiple Competing Sessions,\u201d 16th annual ACM Symposium on Parallel Algorithms and Architectures, Barcelona, 27 - 30 June 2004, pp. 11-19."}],"container-title":["Communications and Network"],"original-title":[],"link":[{"URL":"http:\/\/www.scirp.org\/journal\/PaperDownload.aspx?DOI=10.4236\/cn.2011.33021","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.scirp.org\/journal\/paperinformation?paperid=6898","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.scirp.org\/journal\/paperinformation?paperid=6898","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T07:13:44Z","timestamp":1773386024000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.scirp.org\/journal\/paperinformation?paperid=6898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"references-count":21,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2011]]}},"URL":"https:\/\/doi.org\/10.4236\/cn.2011.33021","relation":{},"ISSN":["1949-2421","1947-3826"],"issn-type":[{"value":"1949-2421","type":"print"},{"value":"1947-3826","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}