{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T10:21:36Z","timestamp":1729678896864,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1109\/csndsp54353.2022.9907983","type":"proceedings-article","created":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T19:41:19Z","timestamp":1665085279000},"page":"246-251","source":"Crossref","is-referenced-by-count":2,"title":["A Two-Stage Routing Algorithm for Time-Triggered Flows in Time Sensitive Networks"],"prefix":"10.1109","author":[{"given":"You-Ru","family":"Lee","sequence":"first","affiliation":[{"name":"National Chung Cheng University,Dept. Comm. Engr.,Chiayi,Taiwan"}]},{"given":"Pin-Chun","family":"Hou","sequence":"additional","affiliation":[{"name":"National Chung Cheng University,Dept. Comm. Engr.,Chiayi,Taiwan"}]},{"given":"Ting-Chao","family":"Hou","sequence":"additional","affiliation":[{"name":"National Chung Cheng University,Dept. Comm. Engr.,Chiayi,Taiwan"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1287\/mnsc.17.11.712"},{"key":"ref11","article-title":"A K-Best Paths Algorithm for Highly Reliable Communication Networks","volume":"e82 b","author":"lee","year":"1999","journal-title":"IEICE Transaction on Communications"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"11","DOI":"10.25080\/TCWV9851","article-title":"Exploring network structure, dynamics, and function using NetworkX","author":"hagberg","year":"2008","journal-title":"Proceedings of the 7th Python in Science Conference (SciPy2008)"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1007\/978-1-4612-0619-4"},{"year":"1979","author":"garey","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","key":"ref4"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/2997465.2997494"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1145\/3139258.3139289"},{"year":"2014","author":"optimization","journal-title":"optimizer reference manual version 6 0","key":"ref5"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1007\/BF01386390"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1145\/3378408.3378411"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/2997465.2997470"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/RTSS.2010.25"},{"year":"2000","author":"thales","article-title":"Multipath Issues in Unicast and Multicast Next-Hop Selection","key":"ref9"}],"event":{"name":"2022 13th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)","start":{"date-parts":[[2022,7,20]]},"location":"Porto, Portugal","end":{"date-parts":[[2022,7,22]]}},"container-title":["2022 13th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9907868\/9907893\/09907983.pdf?arnumber=9907983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,5]],"date-time":"2024-10-05T08:49:57Z","timestamp":1728118197000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9907983\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/csndsp54353.2022.9907983","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]}}}