網路功能虛擬化技術改變了原本網路功能傳統在硬體上使用的方法，而使其能以軟體的方式進行。虛擬網路功能的放置就成為網路功能虛擬化技術裡主要的問題。在本篇論文中，虛擬網路功能之間的關係，包含其之間的關聯性與流量的變化，都成為放置虛擬網路功能在虛擬機器時重要考慮的因素。度量嵌入結合了虛擬網路功能間的關係與網路伺服器上的虛擬機器這兩者。嵌入演算法掌握了服務鏈裡虛擬網路功能組成的結構並且反映在虛擬網路功能的布置上。在實驗的章節，本篇論文所提出的演算法在試驗的例子比起其他的方法也有不錯的結果。

Network function virtualization (NFV) has changed the traditional usage of network functions from hardware appliances to software implementation. Placement of virtual network functions (VNFs) has become a fundamental problem in NFV. In this study, relation in VNFs, including dependency and changes of flow size, would be important factors in placement of VNFs onto virtual machines on servers. Metric embedding is adopted to combine the relation of VNFs and virtual machines on network servers. The structures shown in service chains are seized by embedding algorithm and thus reflect the result on placement of VNFs on the network. In the simulation section, the proposed technique is evaluated and performs well in test cases, showing that the proposed technique gives a fine solution to VNF placement problem.

[1] R. Guerzoni et al., “Network function virtualisation: an introduction, benefits, enablers, challenges and call for action, introductory white paper,” in SDN and OpenFlow World Congress, 2012.
[2] J. Sherry and S. Ratnasamy, “A survey of enterprise middlebox deployments,” in Tech. Rep. EECS, UC Berkeley, 2012.
[3] R. Cohen, L. Lewin-Eytan, J. Naor, and D. Raz, “Near optimal placement of virtual network functions,” in IEEE International Conference on Computer Communication (INFOCOM), 2015.
[4] T. Kuo, B. Liou, K. Lin, and M. Tsai, “Deploying chains of virtual network functions: on the relation between link and server usage,” in IEEE International Conference on Computer Communication (INFOCOM), 2016.
[5] Y. Li, L. Phan, and B. Loo, “Network functions virtualization with soft real-time guarantees,” in IEEE International Conference on Computer Communication (INFOCOM), 2016.
[6] T. Chen, Q. Yang, and X. Tang, “Directed graph embedding,” in Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 2007.
[7] F. Demirci, A. Shokoufandeh, Y. Keselman, S. Dickinson, and L. Bretzner, “Many to-
many matching of scale-space feature hierarchies using metric embedding,” in
Scale Space Methods in Computer Vision, 4th International Conference, 2003.
[8] R. Agarwala, V. Bafna, M. Farach, M. Paterson, and M. Thorup, “On the approximability of numerical taxonomy (fitting distances by tree metric),” in SIAM Journal on Computing, 28(2): 1073-1085, 1999.
[9] J. Matousek, “On embedding trees into uniformly convex Banach Spaces,” in Israel Journal of Mathematics, 237: 221-237, 1999.
[10] R. N. Mysore, A. Pamboris, N. Farrington, N. Huang, P. Miri, S. Radhakrishnan, V. Subramanya, and A. Vahdat, “PortLand: A scalable fault-tolerant layer 2 data center network fabric,” in ACM Special Interest Group on Data Communication (SIGCOMM), 2009.
[11] X. Li and C. Qian, “Low-complexity multi-resource packet scheduling for network function virtualization,” in IEEE International Conference on Computer Communication (INFOCOM), 2015.