Creating a network slice is hard.  It is NP-hard and can be reduced to the multiway separator problem.  Given a set of resources, which have attributes (e.g., bandwidth, capacity, storage, cpu, etc.) can you create a slice with a set of constraints which can be efficiently embedded onto the resources.

SABRES approach to this problem is lead by Satish Kumar Thittamaranahalli.

Publications

• Yi Zheng, Srivatsan Ravi, Erik Kline, Sven Koenig and T. K. Satish Kumar (2022). Conflict-Based Search for the Virtual Network Embedding Problem. Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling (ICAPS-2022).
• Omkar Thakoor, Ang Li, Sven Koenig, Srivatsan Ravi, Erik Kline and T. K. Satish Kumar (2022). The FastMap Pipeline for Facility Location Problems. Proceedings of the Twenty-Fourth International Conference on Principles and Practice of Multi-Agent Systems (PRIMA-2022).
• Yi Zheng, Hang Ma, Sven Koenig, Erik Kline and T. K. Satish Kumar (2023). Priority-Based Search for the Virtual Network Embedding Problem. Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling (ICAPS-2023).
• Yi Zheng, Srivatsan Ravi, Erik Kline, Lincoln Thurlow, Sven Koenig and T. K. Satish Kumar (2023). Improved Conflict-Based Search for the Virtual Network Embedding Problem. Proceedings of the Thirty-Second International Conference on Computer Communications and Networks (ICCCN-2023).