How Hard Can It Be?: Understanding the Complexity of Replica Aware Virtual Cluster Embeddings - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Carlo Fuerst, Maciek Pacut, Paolo Costa, Stefan Schmid. How Hard Can It Be?: Understanding the Complexity of Replica Aware Virtual Cluster Embeddings. In 23rd IEEE International Conference on Network Protocols, ICNP 2015, San Francisco, CA, USA, November 10-13, 2015. pages 11-21, IEEE, 2015. [doi]

This author has not been identified. Look up 'Carlo Fuerst' in GoogleThis author has not been identified. Look up 'Maciek Pacut' in GoogleThis author has not been identified. Look up 'Paolo Costa' in GoogleThis author has not been identified. Look up 'Stefan Schmid' in Google

runs on WebDSL