{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T13:10:58Z","timestamp":1761397858839,"version":"build-2065373602"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1016\/j.comnet.2020.107605","type":"journal-article","created":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T22:25:04Z","timestamp":1602627904000},"page":"107605","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["ILP formulations for monitoring-cycle design based on segment routing"],"prefix":"10.1016","volume":"183","author":[{"given":"Xiaoqian","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwan L.","family":"Yeung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.comnet.2020.107605_bib0001","series-title":"IETF RFC 5880","article-title":"Bidirectional forwarding detection (bfd)","author":"Katz","year":"2010"},{"key":"10.1016\/j.comnet.2020.107605_bib0002","series-title":"Proc. USENIX Annual Technical Conference","first-page":"25","article-title":"Stealth probing: efficient data-plane security for IP routing","author":"Avramopoulos","year":"2006"},{"key":"10.1016\/j.comnet.2020.107605_bib0003","series-title":"Proc. ACM SIGMETRICS","first-page":"193","article-title":"Path-quality monitoring in the presence of adversaries","author":"Goldberg","year":"2008"},{"key":"10.1016\/j.comnet.2020.107605_bib0004","series-title":"Proc. ACM Workshop on Hot Topics in Networks (Hotnets-V)","first-page":"7","article-title":"Don't secure routing protocols, secure data delivery","author":"Wendlandt","year":"2006"},{"key":"10.1016\/j.comnet.2020.107605_bib0005","series-title":"Proc. IEEE INFOCOM","first-page":"1","article-title":"SCMon: leveraging segment routing to improve network monitoring","author":"Aubry","year":"2016"},{"key":"10.1016\/j.comnet.2020.107605_bib0006","series-title":"Proc. IEEE International Conference on Communications (ICC)","first-page":"1726","article-title":"Spanning-tree based monitoring-cycle construction for fault detection and localization in mesh AONs","author":"Zeng","year":"2005"},{"key":"10.1016\/j.comnet.2020.107605_bib0007","series-title":"Proc. IEEE Globecom","first-page":"1","article-title":"M2 -CYCLE: an optical layer algorithm for fast link failure detection in All-Optical mesh networks","author":"Wu","year":"2006"},{"key":"10.1016\/j.comnet.2020.107605_bib0008","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.comnet.2018.10.010","article-title":"Bandwidth-efficient network monitoring algorithms based on segment routing","volume":"147","author":"Li","year":"2018","journal-title":"Comput. Netw."},{"key":"10.1016\/j.comnet.2020.107605_bib0009","series-title":"Proc. IEEE LCN (Local Computer Networks)","first-page":"1","article-title":"ILP formulations for monitoring-cycle construction using segment routing","author":"Li","year":"2018"},{"key":"10.1016\/j.comnet.2020.107605_bib0010","series-title":"Proc. IEEE GLOBECOM","first-page":"1","article-title":"The segment routing architecture","author":"Filsfils","year":"2015"},{"key":"10.1016\/j.comnet.2020.107605_bib0011","series-title":"Internet Draft, draft-ietf-spring-segment-routing-14","article-title":"Segment routing architecture","author":"Filsfils","year":"2017"},{"key":"10.1016\/j.comnet.2020.107605_bib0012","series-title":"Internet Draft, draft-filsfils-spring-segment-routing-use-cases-00","article-title":"Segment routing use cases","author":"Filsfils","year":"2014"},{"key":"10.1016\/j.comnet.2020.107605_bib0013","series-title":"Internet Draft, draft-ietf-spring-segment-routing-mpls-11","article-title":"Segment routing with MPLS date plane","author":"Filsfils","year":"2017"},{"key":"10.1016\/j.comnet.2020.107605_bib0014","series-title":"Internet Draft, draft-psenak-ospf-segment-routing-extensions-24","article-title":"OSPF extensions for segment routing","author":"Psenak","year":"2017"},{"key":"10.1016\/j.comnet.2020.107605_bib0015","series-title":"Internet Draft, draft-ietf-isis-segment-routing-extensions-15","article-title":"IS-IS extensions for segment routing","author":"Previdi","year":"2017"},{"issue":"9","key":"10.1016\/j.comnet.2020.107605_bib0016","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/2500468.2500473","article-title":"Software-defined networking","volume":"56","author":"Kirkpatrick","year":"2013","journal-title":"Communinications of the ACM"},{"key":"10.1016\/j.comnet.2020.107605_bib0017","unstructured":"Cisco (2017), \u201cMaking networks SDN-ready with segment routing,\u201d [white paper]. Available: https:\/\/2.zoppoz.workers.dev:443\/https\/www.segmentrouting.net\/images\/lightreading_report.pdf."},{"key":"10.1016\/j.comnet.2020.107605_bib0018","series-title":"Proc. IEEE International Symposium on Network Computing and Applications (NCA)","first-page":"113","article-title":"Label encoding algorithm for MPLS segment routing","author":"Guedrez","year":"2016"},{"key":"10.1016\/j.comnet.2020.107605_bib0019","series-title":"Proc. IEEE Global Communications Conference (GLOBECOM)","first-page":"1","article-title":"Path encoding in segment routing","author":"Giorgetti","year":"2015"},{"key":"10.1016\/j.comnet.2020.107605_bib0020","series-title":"Proc. IEEE Conference on Computer Communications (INFOCOM)","first-page":"657","article-title":"Optimized network traffic engineering using segment routing","author":"Bhatia","year":"2015"},{"key":"10.1016\/j.comnet.2020.107605_bib0021","series-title":"Proc. IFIP Networking Conference (IFIP Networking) and Workshops","first-page":"1","article-title":"Traffic engineering using segment routing and considering requirements of a carrier IP network","author":"Sch\u00fcller","year":"2017"},{"key":"10.1016\/j.comnet.2020.107605_bib0022","series-title":"Proc. IEEE 42nd Conference on Local Computer Networks (LCN)","first-page":"667","article-title":"Predictive traffic engineering with 2-segment routing considering requirements of a carrier IP network","author":"Sch\u00fcller","year":"2017"},{"issue":"1","key":"10.1016\/j.comnet.2020.107605_bib0023","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TNET.2009.2025769","article-title":"ILP formulations for p-cycle design without candidate cycle enumeration","volume":"18","author":"Wu","year":"2010","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.comnet.2020.107605_bib0024","series-title":"Modern Graph Theory","first-page":"215","author":"Bollob\u00e1s","year":"1998"},{"key":"10.1016\/j.comnet.2020.107605_bib0025","first-page":"65","article-title":"A set of typical transport network scenarios for network modelling","volume":"182","author":"Hulsermann","year":"2004","journal-title":"ITG Fachber."},{"issue":"1","key":"10.1016\/j.comnet.2020.107605_bib0026","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TNET.2003.822655","article-title":"Measuring ISP topologies with rocketfuel","volume":"12","author":"Spring","year":"2004","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.comnet.2020.107605_bib0027","unstructured":"Gurobi Solver [Online]. Available:2020 https:\/\/2.zoppoz.workers.dev:443\/http\/www.gurobi.com\/."},{"key":"10.1016\/j.comnet.2020.107605_bib0028","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1389128620312378?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1389128620312378?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T13:08:08Z","timestamp":1761397688000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128620312378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":28,"alternative-id":["S1389128620312378"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.comnet.2020.107605","relation":{},"ISSN":["1389-1286"],"issn-type":[{"type":"print","value":"1389-1286"}],"subject":[],"published":{"date-parts":[[2020,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"ILP formulations for monitoring-cycle design based on segment routing","name":"articletitle","label":"Article Title"},{"value":"Computer Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.comnet.2020.107605","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"107605"}}