[1] Ricci R, Alfeld C, Lepreau J. A solver for the network testbed mapping problem[J]. ACM SIGCOMM Computer Communication Review, 2003, 33(2): 65-81.[2] Zhu Yong, Ammar M H. Algorithms for assigning substrate network resources to virtual network components[C]//Proc. IEEE INFOCOM. Barcelona, Spain: IEEE, 2006: 1-12.[3] Fan Jingliang, Ammar M H. Dynamic topology configuration in service overlay networks: a study of reconfiguration policies[C]//Proc. IEEE INFOCOM. Barcelona, Spain: IEEE, 2006: 1-12.[4] Yu Minlan, Yi Yung, Rexford J, et al. Rethinking virtual network embedding: substrate support for path splitting and migration[J]. ACM SIGCOMM Computer Communication Review, 2008, 38(2): 17-29.[5] Cheng Xiang, Su Sen, Zhang Zhongbao, et al. Virtual network embedding through topology-aware node ranking[J]. ACM SIGCOMM Computer Communication Review, 2011, 41(2): 38-47.[6] Cheng Xiang, Su Sen, Zhang Zhongbao, et al. Virtual network embedding through topology awareness and optimization[J]. Computer Networks, 2012, 56(6): 1797-1813.[7] Wang Zihou, Han Yanni, Lin Tao, et al. Virtual network embedding by exploiting topological information[C]//Proc IEEE GLOBECOM. Anaheim, CA: IEEE, 2012: 2603-2608.[8] 刘光远, 苏森. 面向底层单节点失效的轻量级可靠虚拟网络映射算法[J]. 电子与信息学报, 2013, 35(11): 2644-2649. Liu Guangyuan, Su Sen. Less stringent reliable virtual network mapping algorithm for substrate single node failure[J]. Journal of Electronics and Information Technology, 2013, 35(11): 2644-2649.[9] 王颖, 熊文成, 李文璟. 基于最大独立链路集的随机虚拟网络映射算法[J]. 北京邮电大学学报, 2014, 37(S1): 8-11. Wang Ying, Xiong Wencheng, Li Wenjing. Random virtual network embedding algorithm based on maximum independent link set[J]. Journal of Beijing University of Posts and Telecommunications, 2014, 37(S1): 8-11. |