Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints

Andrea Tomassilli, Frédéric Giroire, Nicolas Huin, Stéphane Pérennes. Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints. In 2018 IEEE Conference on Computer Communications, INFOCOM 2018, Honolulu, HI, USA, April 16-19, 2018. pages 774-782, IEEE, 2018. [doi]

Abstract

Abstract is missing.