{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:17:21Z","timestamp":1740133041009,"version":"3.37.3"},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2016,8,1]],"date-time":"2016-08-01T00:00:00Z","timestamp":1470009600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100008982","name":"Qatar National Research Fund (a member of the Qatar Foundation)","doi-asserted-by":"publisher","award":["NPRP 5-137-2-045"],"award-info":[{"award-number":["NPRP 5-137-2-045"]}],"id":[{"id":"10.13039\/100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1109\/lcomm.2016.2571691","type":"journal-article","created":{"date-parts":[[2016,5,23]],"date-time":"2016-05-23T18:39:18Z","timestamp":1464028758000},"page":"1543-1546","source":"Crossref","is-referenced-by-count":4,"title":["Optimal Polynomial Time Algorithm for Restoring Multicast Cloud Services"],"prefix":"10.1109","volume":"20","author":[{"given":"Sara","family":"Ayoubi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chadi","family":"Assi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lata","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khaled","family":"Shaban","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935228"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2169985"},{"key":"ref10","volume":"53","author":"hwang","year":"1992","journal-title":"The Steiner Tree Problem"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUD.2015.114"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592575"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/COMSNETS.2014.6734903"},{"key":"ref8","first-page":"690","article-title":"A ‘dual-tree’ scheme for fault-tolerant multicast","volume":"3","author":"fei","year":"2001","journal-title":"Proc IEEE ICC"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2404440"},{"key":"ref2","first-page":"99","article-title":"Survey on survivable virtual network embedding problem and solutions","author":"herker","year":"2013","journal-title":"Proc ICNS"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.91"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018477"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/7539712\/07476816.pdf?arnumber=7476816","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:02:49Z","timestamp":1642003369000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7476816\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":11,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2016.2571691","relation":{},"ISSN":["1089-7798"],"issn-type":[{"type":"print","value":"1089-7798"}],"subject":[],"published":{"date-parts":[[2016,8]]}}}