Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Andrea Tomassilli' in GoogleThis author has not been identified. Look up 'Frédéric Giroire' in GoogleThis author has not been identified. Look up 'Nicolas Huin' in GoogleThis author has not been identified. Look up 'Stéphane Pérennes' in Google

runs on WebDSL