{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:55:04Z","timestamp":1740131704375,"version":"3.37.3"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100010418","name":"Institute for Information and communications Technology Promotion","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Korean government (MSIT)","award":["2017-0-00067"],"award-info":[{"award-number":["2017-0-00067"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1109\/tcomm.2018.2884988","type":"journal-article","created":{"date-parts":[[2018,12,5]],"date-time":"2018-12-05T19:57:27Z","timestamp":1544039847000},"page":"2130-2143","source":"Crossref","is-referenced-by-count":5,"title":["Priority Assignment Algorithms for Shared Mesh Protection Switching"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9077-9905","authenticated-orcid":false,"given":"Choong-hee","family":"Cho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taesik","family":"Cheung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6064-9157","authenticated-orcid":false,"given":"Jeong-dong","family":"Ryoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2009.06.010"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2007.07.009"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2006.1709731"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICTEL.2003.1191228"},{"journal-title":"Label switched path (LSP) preemption policies for MPLS traffic engineering","year":"2007","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.833156"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2009.091594"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2007.061525"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2007.1008"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.1003046"},{"journal-title":"RSVP-TE Extensions to RSVP for LSP Tunnels","year":"2001","key":"ref28"},{"journal-title":"Assured forwarding PHB group","year":"1999","key":"ref27"},{"journal-title":"Fast Reroute Extensions to RSVP-TE for LSP Tunnels","year":"2005","key":"ref29"},{"journal-title":"Generic Protection Switching—Shared Mesh Protection","year":"2012","key":"ref2"},{"journal-title":"Optical Transport Network (OTN)—Shared Mesh Protection","year":"2017","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/bltj.2147"},{"key":"ref22","first-page":"251","article-title":"Shared backup path optimization in telecommunication networks","author":"j\u00f3zsa","year":"2001","journal-title":"Proc DRCN"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832265"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.842220"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.819071"},{"journal-title":"Multi-protocol Label Switching (MPLS) Support of Differentiated Services","year":"2002","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2003.1214298"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1515\/eletel-2017-0053"},{"journal-title":"MPLS-TP Ring Protection","year":"2017","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IEEESTD.2004.94804"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICTON.2010.5549101"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2008.4623718"},{"journal-title":"Requirements of An Mpls Transport Profile","year":"2009","key":"ref13"},{"journal-title":"MPLS Transport Profile (MPLS-TP) Survivability Framework","year":"2011","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.810313"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2002.806338"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.830280"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/49.725189"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2004.825346"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.751461"},{"journal-title":"Requirements for MPLS Transport Profile (MPLS-TP) Shared Mesh Protection","year":"2014","key":"ref3"},{"journal-title":"Generic Functional Architecture of Transport Networks","year":"2000","key":"ref6"},{"key":"ref5","first-page":"2023","article-title":"Survivable WDM mesh networks. Part II—Restoration","author":"ramamurthy","year":"1999","journal-title":"Proc IEEE Int Conf Commun (ICC)"},{"journal-title":"Types and Characteristics of SDH Network Protection Architectures","year":"1998","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6979981"},{"journal-title":"Abilene Network","year":"2018","key":"ref49"},{"journal-title":"ODUk Shared Ring Protection (SRP)","year":"2015","key":"ref9"},{"key":"ref46","first-page":"558","author":"kleinberg","year":"2005","journal-title":"Algorithm Design"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.11.013"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322390"},{"key":"ref47","first-page":"391","article-title":"Hypergraphs and their duals","author":"berge","year":"1976","journal-title":"Graphs Hypergraphs"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/NOMS.2012.6212010"},{"article-title":"Approximation algorithms for independent set problems on hypergraphs","year":"2009","author":"losievskaja","key":"ref44"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523693"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/8667745\/08561185.pdf?arnumber=8561185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:56:55Z","timestamp":1657745815000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8561185\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":50,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2018.2884988","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2019,3]]}}}