一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

高級(jí)搜索

留言板

尊敬的讀者、作者、審稿人, 關(guān)于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁(yè)添加留言。我們將盡快給您答復(fù)。謝謝您的支持!

姓名
郵箱
手機(jī)號(hào)碼
標(biāo)題
留言內(nèi)容
驗(yàn)證碼

一種基于拓?fù)鋭?shì)的虛擬網(wǎng)絡(luò)映射算法

劉新波 王布宏 楊智顯 劉帥琦

劉新波, 王布宏, 楊智顯, 劉帥琦. 一種基于拓?fù)鋭?shì)的虛擬網(wǎng)絡(luò)映射算法[J]. 電子與信息學(xué)報(bào), 2018, 40(7): 1684-1690. doi: 10.11999/JEIT170981
引用本文: 劉新波, 王布宏, 楊智顯, 劉帥琦. 一種基于拓?fù)鋭?shì)的虛擬網(wǎng)絡(luò)映射算法[J]. 電子與信息學(xué)報(bào), 2018, 40(7): 1684-1690. doi: 10.11999/JEIT170981
LIU Xinbo, WANG Buhong, YANG Zhixian, LIU Shuaiqi. A Virtual Network Embedding Algorithm Based on Topology Potential[J]. Journal of Electronics & Information Technology, 2018, 40(7): 1684-1690. doi: 10.11999/JEIT170981
Citation: LIU Xinbo, WANG Buhong, YANG Zhixian, LIU Shuaiqi. A Virtual Network Embedding Algorithm Based on Topology Potential[J]. Journal of Electronics & Information Technology, 2018, 40(7): 1684-1690. doi: 10.11999/JEIT170981

一種基于拓?fù)鋭?shì)的虛擬網(wǎng)絡(luò)映射算法

doi: 10.11999/JEIT170981 cstr: 32379.14.JEIT170981
基金項(xiàng)目: 

國(guó)家自然科學(xué)基金(61401499),陜西省自然科學(xué)基金(2015JM6340)

詳細(xì)信息
    作者簡(jiǎn)介:

    劉新波: 男,1983年生,博士生,研究方向?yàn)樘摂M網(wǎng)絡(luò)映射、網(wǎng)絡(luò)優(yōu)化. 王布宏: 男,1975年生,教授,博士,主要研究方向?yàn)榫W(wǎng)絡(luò)安全、陣列信號(hào)處理. 楊智顯: 男,1991年生,博士生,研究方向?yàn)榫W(wǎng)絡(luò)安全、網(wǎng)絡(luò)虛擬化. 劉帥琦: 女,1992年生,碩士生,研究方向?yàn)殛嚵行盘?hào)處理、網(wǎng)絡(luò)安全.

  • 中圖分類號(hào): TP393

A Virtual Network Embedding Algorithm Based on Topology Potential

Funds: 

The National Natural Science Foundation of China (61401499), Shanxi Provincial Natural Science Foundation (2015JM6340)

  • 摘要: 該文針對(duì)現(xiàn)有的虛擬網(wǎng)絡(luò)映射算法對(duì)網(wǎng)絡(luò)中節(jié)點(diǎn)的拓?fù)鋵傩钥紤]不夠周到,導(dǎo)致其請(qǐng)求接受率和收益開銷比較低的問題,將物理學(xué)里的場(chǎng)論思想引入了虛擬網(wǎng)絡(luò)映射,并提出一種基于拓?fù)鋭?shì)的虛擬網(wǎng)絡(luò)映射算法。該算法在節(jié)點(diǎn)映射階段,通過計(jì)算節(jié)點(diǎn)的拓?fù)鋭?shì)、節(jié)點(diǎn)的資源能力、待映射節(jié)點(diǎn)與已映射節(jié)點(diǎn)之間的距離,將虛擬節(jié)點(diǎn)映射至最佳的物理節(jié)點(diǎn)。在鏈路映射階段,通過計(jì)算物理路徑的可用帶寬和路徑跳數(shù),將虛擬鏈路映射至最佳的物理路徑。仿真實(shí)驗(yàn)表明,該算法在多種虛擬網(wǎng)絡(luò)到達(dá)強(qiáng)度下的請(qǐng)求接受率和收益開銷比均優(yōu)于當(dāng)前的虛擬網(wǎng)絡(luò)映射算法。
  • [2] FENG Jianyuan, ZHANG Qixun, DONG Guangzhe, et al. An approach to 5G wireless network virtualization: Architecture and trial environment[C]. IEEE Wireless Communications and Networking Conference, San Francisco, USA, 2017: 1-6.
    KHOT A S, GAWAS J, and WAMAN S. Network virtualization on optical networks[C]. International Conference on Wireless Communications, Signal Processing and Networking, Chennai, India, 2016: 568-573.
    [3] GHODA G, MERULIYA N, PAREKH D H, et al. A survey on data center network virtualization[C]. International Conference on Computing for Sustainable Global Development, New Delhi, India, 2016: 3464-3470.
    [4] ALCOBER J, HESSELBACH X, OLIVA A, et al. Internet future architectures for network and media independent services and protocols[C]. International Conference on Transparent Optical Networks, Cartagena, Spain, 2013: 1-4.
    [5] ANDERSON T, PETERSON L, SHENKER S, et al. Overcoming the Internet impasse through virtualization[J]. Computer, 2005, 38(4): 34-41. doi: 10.1109/MC.2005.136.
    YU Jianjun and WU Chunming. Virtual network mapping approximation algorithm with admission control[J]. Journal of Electronics & Information Technology, 2014, 36(5): 1235-1241. doi: 10.3724/SP.J.1146.2013.00965.
    [7] AMALDI E, CONIGLIO S, KOSTER A M C A, et al. On the computational complexity of the virtual network embedding problem[J]. Electronic Notes in Discrete Mathematics, 2016, 52(6): 213-220. doi: 10.1016/j.endm.2016.03.028.
    [8] WANG Li, QU Hua, ZHAO Jihong, et al. Virtual network embedding with discrete particle swarm optimization[J]. Electronics Letters, 2014, 50(4): 285-286. doi: 10.1049/el. 2013.3202.
    [9] GUAN Xinjie, WAN Xili, CHOI B Y, et al. Ant colony optimization based energy efficient virtual network embedding[C]. IEEE 4th International Conference on Cloud Networking, Niagara Falls, Canada, 2015: 273-278.
    [10] RICCI R, ALFELD C, and LEPREAU J. A solver for the network testbed mapping problem[J]. ACM SIGCOMM Computer Communication Review, 2003, 33(2): 65-81. doi: 10.1145/956981.956988.
    [11] ZHU Yong and AMMAR M. Algorithms for assigning substrate network resources to virtual network components [C]. IEEE International Conference on Computer Communications, Barcelona, Spain, 2006: 1-12.
    [12] YU M, YI Y, 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. doi: 10.1145/1355734.1355737.
    [13] 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): 39-47. doi: 10.1145/1971162.1971168.
    [14] DING Jian, HUANG Tao, LIU Jiang, et al. Virtual network embedding based on real-time topological attributes[J]. Frontiers of Information Technology & Electronic Engineering, 2015, 16(2): 109-118.
    [15] GONG Shuiqing, CHEN Jing, ZHAO Siyi, et al. Virtual network embedding with multi-attribute node ranking based on TOPSIS[J]. KSII Transactions on Internet and Information Systems, 2016, 10(2): 522-541. doi: 10.3837/tiis. 2016.02.005.
    [16] BIANCHI F and PRESTI FL. A markov reward model based greedy heuristic for the virtual network embedding problem[C]. IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, London, UK, 2016: 373-378.
    GAN Wenyan, LI Deyi, and WANG Jianmin. An hierarchical clustering method based on data fields[J]. Acta Electronica Sinica, 2006, 34(2): 258-262.
    [18] HE Nan, GAN Wenyan, and L I Deyi. Evaluate nodes importance in the network using data field theory[C]. International Conference on Convergence Information Technology, Gyeongju, South Korea, 2007: 1225-1230.
  • 加載中
計(jì)量
  • 文章訪問數(shù):  1629
  • HTML全文瀏覽量:  193
  • PDF下載量:  58
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  2017-10-20
  • 修回日期:  2018-02-27
  • 刊出日期:  2018-07-19

目錄

    /

    返回文章
    返回