P. Wette, M. Draxler, and A. Schwabe, MaxiNet: Distributed emulation of software-defined networks, 2014 IFIP Networking Conference, pp.1-9, 2014.

, Stratified Rates:, Multivariable Analysis, pp.164-187

G. D. Lena, A. Tomassilli, D. Saucez, F. Giroire, T. Turletti et al., Mininet on steroids: exploiting the cloud for mininet performance, IEEE CloudNet, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02362997

, Mètis Anthropologie des mondes grecs anciens

. Nancy, Jean-Alain Lesourd. <italic>Sociologie Du Catholicisme Anglais, 1767?1851</italic>. (Publications Université Nancy Ii.) Nancy: Université de Nancy. 1981. Pp. 212. 113 fr, The American Historical Review, 1982.

G. Karypis and V. Kumar, Multilevel Algorithms for Multi-Constraint Graph Partitioning, Proceedings of the IEEE/ACM SC98 Conference, pp.28-28, 1998.

A. Fischer, J. F. Botero, M. T. Beck, H. De-meer, and X. Hesselbach, Virtual Network Embedding: A Survey, IEEE Communications Surveys & Tutorials, vol.15, issue.4, pp.1888-1906, 2013.

N. M. Chowdhury, M. R. Rahman, and R. Boutaba, Virtual Network Embedding with Coordinated Node and Link Mapping, IEEE INFOCOM 2009 - The 28th Conference on Computer Communications, pp.783-791, 2009.

J. F. Botero, X. Hesselbach, M. Duelli, D. Schlosser, A. Fischer et al., Energy Efficient Virtual Network Embedding, IEEE Communications Letters, vol.16, issue.5, pp.756-759, 2012.

M. Yu, Y. Yi, J. Rexford, and M. Chiang, Rethinking virtual network embedding, ACM SIGCOMM Computer Communication Review, vol.38, issue.2, pp.17-29, 2008.

M. Rost and S. Schmid, Charting the Complexity Landscape of Virtual Network Embeddings, 2018 IFIP Networking Conference (IFIP Networking) and Workshops, 2018.

M. R. Garey, D. S. Johnson, and L. Stockmeyer, Some simplified NP-complete problems, Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74, pp.47-63, 1974.

R. Krauthgamer, J. (. Naor, and R. Schwartz, Partitioning Graphs into Balanced Components, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.942-949, 2009.

H. D. Simon and S. Teng, How Good is Recursive Bisection?, SIAM Journal on Scientific Computing, vol.18, issue.5, pp.1436-1445, 1997.

B. W. Kernighan and S. Lin, An Efficient Heuristic Procedure for Partitioning Graphs, Bell System Technical Journal, vol.49, issue.2, pp.291-307, 1970.

D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham, Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms, SIAM Journal on Computing, vol.3, issue.4, pp.299-325, 1974.

S. G. Kolliopoulos and C. Stein, Improved approximation algorithms for unsplittable flow problems, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.426-436