{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T11:00:06Z","timestamp":1730286006124,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/noms.2018.8406148","type":"proceedings-article","created":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T23:09:23Z","timestamp":1531177763000},"page":"1-7","source":"Crossref","is-referenced-by-count":1,"title":["Multi-constrained maximally disjoint routing mechanism"],"prefix":"10.1109","author":[{"given":"Xin","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Lanlan","family":"Rui","sequence":"additional","affiliation":[]},{"given":"Jiawen","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xuesong","family":"Qiu","sequence":"additional","affiliation":[]},{"given":"Shaoyong","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Lin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Guangdong Power GridCompany","article-title":"Quantitative Evaluation Method of Safety Risk in Guangdong Electric Power Communication Network","year":"2010","key":"ref10"},{"key":"ref11","first-page":"120","article-title":"Security Event Quantitative Model and Forecasting Method for Power Communication Network","volume":"10","author":"xing","year":"2016","journal-title":"Journal of electronics and information technology"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.23919\/INM.2017.7987339"},{"journal-title":"A new shortest paths ranking algorithm","year":"1999","author":"martins","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1994.337532"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.1997.616037"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IranianCEE.2017.7985428"},{"key":"ref3","article-title":"Overlay multicasting at a path-level granularity for multihomed service nodes","author":"liu","year":"2011","journal-title":"Information Science and Technology (ICIST) 2011 International Conference on"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1146.2012.01052"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CC.2016.7563719"},{"key":"ref8","first-page":"60","article-title":"A maximally disjoint routing algorithm for power communication networks","volume":"44","author":"he","year":"2016","journal-title":"Power system protection and control"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/489149"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICTON.2011.5970892"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CMCSN.2016.44"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2013.02.020"}],"event":{"name":"NOMS 2018 - 2018 IEEE\/IFIP Network Operations and Management Symposium","start":{"date-parts":[[2018,4,23]]},"location":"Taipei, Taiwan","end":{"date-parts":[[2018,4,27]]}},"container-title":["NOMS 2018 - 2018 IEEE\/IFIP Network Operations and Management Symposium"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8399136\/8406102\/08406148.pdf?arnumber=8406148","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T13:29:41Z","timestamp":1643203781000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8406148\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/noms.2018.8406148","relation":{},"subject":[],"published":{"date-parts":[[2018,4]]}}}