Abstract
Segment routing is an emerging networking technology, where an arbitrary forwarding path can be identified using a list of segments. In this article, we study network monitoring in segment routing based on monitoring trails. Unlike the existing monitoring cycle, a trail is more flexible because it can be either open or closed (i.e., a cycle). Consider a network with a given set of ${k}$ monitors, which are devices responsible for network monitoring. A monitoring trail must start and end at a monitor. The ${k}$ -monitor cover problem is to cover every link in the network using trails such that each trail has no more than ${K}$ segments and the total length of all trails is minimized. In this article, we prove that the ${k}$ -monitor cover problem is NP-hard. To solve it, the first ILP is formulated and an efficient heuristic algorithm ( ${k}$ -MCA) is designed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Network and Service Management
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
