異構(gòu)網(wǎng)絡(luò)測試床拓?fù)溆成渌惴ㄑ芯?/H1>
發(fā)布時(shí)間：2018-06-25 16:58
本文選題：異構(gòu)網(wǎng)絡(luò)測試床 + 拓?fù)溆成?/strong> ； 參考：《解放軍信息工程大學(xué)》2014年碩士論文
【摘要】：網(wǎng)絡(luò)測試床是測試驗(yàn)證網(wǎng)絡(luò)協(xié)議、服務(wù)及分布式系統(tǒng)的重要基礎(chǔ)設(shè)施。融合了多種模擬仿真手段的異構(gòu)網(wǎng)絡(luò)測試床是網(wǎng)絡(luò)測試床中非常重要的一類。為虛擬網(wǎng)絡(luò)高效地分配硬件資源是網(wǎng)絡(luò)測試床中的一個(gè)關(guān)鍵問題,稱為拓?fù)溆成鋯栴}。拓?fù)溆成涞男阅芎托手苯佑绊懥司W(wǎng)絡(luò)測試床的規(guī)模和效益,因此具有重要的研究意義。本文以降低算法時(shí)間開銷、提高請(qǐng)求接受率和資源利用效率為主要目標(biāo),對(duì)異構(gòu)網(wǎng)絡(luò)測試床中的拓?fù)溆成渌惴ㄟM(jìn)行了專門研究。首先,建立了異構(gòu)網(wǎng)絡(luò)測試床中的拓?fù)溆成淠Ｐ?選取了拓?fù)溆成渌惴ㄔu(píng)價(jià)指標(biāo)和測試方法,并據(jù)此構(gòu)建了仿真實(shí)驗(yàn)環(huán)境；然后,基于虛擬網(wǎng)絡(luò)粗化和映射方案修正思想提出了一種多層拓?fù)溆成渌惴ǹ蚣�；最�?分別研究框架中的3個(gè)主要問題,提出3種算法。本文完成的主要工作和取得的研究成果包括：1)提出了多層拓?fù)溆成渌惴ǹ蚣�。該框架以同時(shí)保證映射質(zhì)量和降低拓?fù)溆成鋾r(shí)間開銷為目標(biāo),基于虛擬網(wǎng)絡(luò)粗化和映射方案修正思想,采用多層粗化／修正模式,將一次拓?fù)溆成浞譃榇只A段、映射階段和細(xì)化階段,分別完成虛擬網(wǎng)絡(luò)逐層粗化、映射粗化后的虛擬網(wǎng)絡(luò)求得初始映射方案、逐層細(xì)化和修正映射方案得到最終映射方案。2)研究粗化階段的虛擬網(wǎng)絡(luò)粗化問題,提出了一種底層資源感知算法。通過分析底層網(wǎng)絡(luò)可用資源和虛擬網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)對(duì)虛擬網(wǎng)絡(luò)粗化問題影響,在基于節(jié)點(diǎn)配對(duì)的貪心算法的基礎(chǔ)上,引入了多節(jié)點(diǎn)合并策略,設(shè)計(jì)了底層資源感知的鏈路排序函數(shù)和節(jié)點(diǎn)合并條件。仿真實(shí)驗(yàn)表明,相對(duì)于簡單虛擬網(wǎng)絡(luò)粗化算法,該算法可大幅提升了較高負(fù)載條件下的虛擬網(wǎng)絡(luò)粗化質(zhì)量。3)研究細(xì)化階段的拓?fù)溆成湫拚龁栴},提出了一種基于變鄰域搜索的啟發(fā)式算法。該算法針對(duì)貪心算法易陷入局部最優(yōu)的問題,設(shè)計(jì)了一種映射方案的可變鄰居結(jié)構(gòu),引入了變鄰域搜索過程,并融合了模擬退火算法的解接受策略。仿真實(shí)驗(yàn)表明,該算法可有效提高修正后拓?fù)溆成浞桨傅馁|(zhì)量。4)研究映射階段的拓?fù)溆成鋯栴},提出了一種基于分布估計(jì)的啟發(fā)式算法。針對(duì)映射階段輸入規(guī)模較低而映射質(zhì)量要求較高的特點(diǎn),引入元啟發(fā)式方法中求解質(zhì)量較高的分布估計(jì)算法,設(shè)計(jì)了拓?fù)溆成浞桨傅木幋a方式和拓?fù)溆成鋯栴}的分布估計(jì)概率模型。仿真實(shí)驗(yàn)表明,在多層拓?fù)溆成淇蚣芟陆M合上述3個(gè)算法,可在小幅度提升映射質(zhì)量的同時(shí),大幅降低了拓?fù)溆成鋾r(shí)間。
[Abstract]:The network test bed is an important infrastructure for testing and verifying network protocols, services and distributed systems. Heterogeneous network test bed, which combines many simulation methods, is a very important class of network test bed. Efficient allocation of hardware resources for virtual networks is a key problem in the network test bed, called topology mapping. The performance and efficiency of topology mapping directly affect the scale and efficiency of the network test bed, so it has important research significance. In order to reduce the time cost of the algorithm, improve the request acceptance rate and resource utilization efficiency, the topology mapping algorithm in the heterogeneous network test bed is studied in this paper. Firstly, the topology mapping model in heterogeneous network test bed is established, the evaluation index and test method of topology mapping algorithm are selected, and the simulation experimental environment is constructed. Based on the concepts of virtual network coarsening and mapping scheme modification, a multi-layer topology mapping algorithm framework is proposed. Finally, three main problems in the framework are studied and three algorithms are proposed. The main work and research results in this paper include: 1) A multi-layer topology mapping algorithm framework is proposed. The framework aims to ensure the mapping quality and reduce the time cost of topological mapping at the same time. Based on the coarsening of virtual network and the modification of mapping scheme, the primary topology mapping is divided into coarse stage by adopting multi-layer coarsening / modifying mode. In the mapping stage and the refinement stage, the virtual network layer by layer coarsening is completed, and the initial mapping scheme is obtained by the mapping coarsening virtual network. Layer by layer thinning and modifying mapping scheme to get the final mapping scheme .2) the coarsening problem of virtual network in coarsening stage is studied and a low-level resource awareness algorithm is proposed. By analyzing the influence of the available resources of the underlying network and the topology structure of the virtual network on the coarsening of the virtual network, a multi-node merging strategy is introduced on the basis of the greedy algorithm based on the node pairing. The link sort function and node merging condition are designed. Simulation results show that compared with simple virtual network coarsening algorithm, this algorithm can greatly improve the coarsening quality of virtual network under high load. A heuristic algorithm based on variable neighborhood search is proposed. Aiming at the problem that greedy algorithm is prone to local optimization, a variable neighbor structure of mapping scheme is designed, variable neighborhood search process is introduced, and the solution acceptance strategy of simulated annealing algorithm is fused. Simulation results show that the proposed algorithm can effectively improve the quality of the modified topology mapping scheme. (4) A heuristic algorithm based on distribution estimation is proposed to study the topology mapping problem in the mapping stage. In view of the characteristics of low input scale and high mapping quality in the mapping stage, a meta-heuristic method is introduced to solve the high quality distribution estimation algorithm. The coding method of topological mapping scheme and the probability model of distribution estimation for topological mapping problem are designed. The simulation results show that the combination of the above three algorithms under the framework of multi-layer topology mapping can greatly reduce the mapping time while improving the mapping quality by a small margin.
【學(xué)位授予單位】：解放軍信息工程大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.06
【相似文獻(xiàn)】
相關(guān)期刊論文 前6條
1 溫星,陸國棟,李基拓;基于拓?fù)溆成涞狞c(diǎn)集在凸多邊形內(nèi)外判斷算法[J];中國圖象圖形學(xué)報(bào);2003年04期
2 黃敏桓;張堯?qū)W;唐洪;況曉輝;;大規(guī)模仿真網(wǎng)絡(luò)拓?fù)溆成涞淖泳W(wǎng)分割技術(shù)[J];北京郵電大學(xué)學(xué)報(bào);2011年S1期
3 吳春福,陸國棟,張樹有;基于拓?fù)溆成涞亩噙呅雾旤c(diǎn)凸凹判別算法[J];計(jì)算機(jī)輔助設(shè)計(jì)與圖形學(xué)學(xué)報(bào);2002年09期
4 王昱,朱家元,馮驚雷,張恒喜;多屬性信息決策的改進(jìn)無監(jiān)督學(xué)習(xí)算法建模與應(yīng)用[J];計(jì)算機(jī)工程與應(yīng)用;2002年21期
5 李積元;點(diǎn)集在凸多邊形內(nèi)外判斷算法的拓?fù)溆成浞椒╗J];青海大學(xué)學(xué)報(bào)(自然科學(xué)版);2005年01期
6 ;[J];;年期
相關(guān)碩士學(xué)位論文 前1條
1 李睿;異構(gòu)網(wǎng)絡(luò)測試床拓?fù)溆成渌惴ㄑ芯縖D];解放軍信息工程大學(xué);2014年
，
本文編號(hào)：2066838
本文鏈接：http://sikaile.net/guanlilunwen/ydhl/2066838.html
本文選題：異構(gòu)網(wǎng)絡(luò)測試床 + 拓?fù)溆成?/strong> ； 參考：《解放軍信息工程大學(xué)》2014年碩士論文
【摘要】：網(wǎng)絡(luò)測試床是測試驗(yàn)證網(wǎng)絡(luò)協(xié)議、服務(wù)及分布式系統(tǒng)的重要基礎(chǔ)設(shè)施。融合了多種模擬仿真手段的異構(gòu)網(wǎng)絡(luò)測試床是網(wǎng)絡(luò)測試床中非常重要的一類。為虛擬網(wǎng)絡(luò)高效地分配硬件資源是網(wǎng)絡(luò)測試床中的一個(gè)關(guān)鍵問題,稱為拓?fù)溆成鋯栴}。拓?fù)溆成涞男阅芎托手苯佑绊懥司W(wǎng)絡(luò)測試床的規(guī)模和效益,因此具有重要的研究意義。本文以降低算法時(shí)間開銷、提高請(qǐng)求接受率和資源利用效率為主要目標(biāo),對(duì)異構(gòu)網(wǎng)絡(luò)測試床中的拓?fù)溆成渌惴ㄟM(jìn)行了專門研究。首先,建立了異構(gòu)網(wǎng)絡(luò)測試床中的拓?fù)溆成淠Ｐ?選取了拓?fù)溆成渌惴ㄔu(píng)價(jià)指標(biāo)和測試方法,并據(jù)此構(gòu)建了仿真實(shí)驗(yàn)環(huán)境；然后,基于虛擬網(wǎng)絡(luò)粗化和映射方案修正思想提出了一種多層拓?fù)溆成渌惴ǹ蚣�；最�?分別研究框架中的3個(gè)主要問題,提出3種算法。本文完成的主要工作和取得的研究成果包括：1)提出了多層拓?fù)溆成渌惴ǹ蚣�。該框架以同時(shí)保證映射質(zhì)量和降低拓?fù)溆成鋾r(shí)間開銷為目標(biāo),基于虛擬網(wǎng)絡(luò)粗化和映射方案修正思想,采用多層粗化／修正模式,將一次拓?fù)溆成浞譃榇只A段、映射階段和細(xì)化階段,分別完成虛擬網(wǎng)絡(luò)逐層粗化、映射粗化后的虛擬網(wǎng)絡(luò)求得初始映射方案、逐層細(xì)化和修正映射方案得到最終映射方案。2)研究粗化階段的虛擬網(wǎng)絡(luò)粗化問題,提出了一種底層資源感知算法。通過分析底層網(wǎng)絡(luò)可用資源和虛擬網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)對(duì)虛擬網(wǎng)絡(luò)粗化問題影響,在基于節(jié)點(diǎn)配對(duì)的貪心算法的基礎(chǔ)上,引入了多節(jié)點(diǎn)合并策略,設(shè)計(jì)了底層資源感知的鏈路排序函數(shù)和節(jié)點(diǎn)合并條件。仿真實(shí)驗(yàn)表明,相對(duì)于簡單虛擬網(wǎng)絡(luò)粗化算法,該算法可大幅提升了較高負(fù)載條件下的虛擬網(wǎng)絡(luò)粗化質(zhì)量。3)研究細(xì)化階段的拓?fù)溆成湫拚龁栴},提出了一種基于變鄰域搜索的啟發(fā)式算法。該算法針對(duì)貪心算法易陷入局部最優(yōu)的問題,設(shè)計(jì)了一種映射方案的可變鄰居結(jié)構(gòu),引入了變鄰域搜索過程,并融合了模擬退火算法的解接受策略。仿真實(shí)驗(yàn)表明,該算法可有效提高修正后拓?fù)溆成浞桨傅馁|(zhì)量。4)研究映射階段的拓?fù)溆成鋯栴},提出了一種基于分布估計(jì)的啟發(fā)式算法。針對(duì)映射階段輸入規(guī)模較低而映射質(zhì)量要求較高的特點(diǎn),引入元啟發(fā)式方法中求解質(zhì)量較高的分布估計(jì)算法,設(shè)計(jì)了拓?fù)溆成浞桨傅木幋a方式和拓?fù)溆成鋯栴}的分布估計(jì)概率模型。仿真實(shí)驗(yàn)表明,在多層拓?fù)溆成淇蚣芟陆M合上述3個(gè)算法,可在小幅度提升映射質(zhì)量的同時(shí),大幅降低了拓?fù)溆成鋾r(shí)間。
[Abstract]:The network test bed is an important infrastructure for testing and verifying network protocols, services and distributed systems. Heterogeneous network test bed, which combines many simulation methods, is a very important class of network test bed. Efficient allocation of hardware resources for virtual networks is a key problem in the network test bed, called topology mapping. The performance and efficiency of topology mapping directly affect the scale and efficiency of the network test bed, so it has important research significance. In order to reduce the time cost of the algorithm, improve the request acceptance rate and resource utilization efficiency, the topology mapping algorithm in the heterogeneous network test bed is studied in this paper. Firstly, the topology mapping model in heterogeneous network test bed is established, the evaluation index and test method of topology mapping algorithm are selected, and the simulation experimental environment is constructed. Based on the concepts of virtual network coarsening and mapping scheme modification, a multi-layer topology mapping algorithm framework is proposed. Finally, three main problems in the framework are studied and three algorithms are proposed. The main work and research results in this paper include: 1) A multi-layer topology mapping algorithm framework is proposed. The framework aims to ensure the mapping quality and reduce the time cost of topological mapping at the same time. Based on the coarsening of virtual network and the modification of mapping scheme, the primary topology mapping is divided into coarse stage by adopting multi-layer coarsening / modifying mode. In the mapping stage and the refinement stage, the virtual network layer by layer coarsening is completed, and the initial mapping scheme is obtained by the mapping coarsening virtual network. Layer by layer thinning and modifying mapping scheme to get the final mapping scheme .2) the coarsening problem of virtual network in coarsening stage is studied and a low-level resource awareness algorithm is proposed. By analyzing the influence of the available resources of the underlying network and the topology structure of the virtual network on the coarsening of the virtual network, a multi-node merging strategy is introduced on the basis of the greedy algorithm based on the node pairing. The link sort function and node merging condition are designed. Simulation results show that compared with simple virtual network coarsening algorithm, this algorithm can greatly improve the coarsening quality of virtual network under high load. A heuristic algorithm based on variable neighborhood search is proposed. Aiming at the problem that greedy algorithm is prone to local optimization, a variable neighbor structure of mapping scheme is designed, variable neighborhood search process is introduced, and the solution acceptance strategy of simulated annealing algorithm is fused. Simulation results show that the proposed algorithm can effectively improve the quality of the modified topology mapping scheme. (4) A heuristic algorithm based on distribution estimation is proposed to study the topology mapping problem in the mapping stage. In view of the characteristics of low input scale and high mapping quality in the mapping stage, a meta-heuristic method is introduced to solve the high quality distribution estimation algorithm. The coding method of topological mapping scheme and the probability model of distribution estimation for topological mapping problem are designed. The simulation results show that the combination of the above three algorithms under the framework of multi-layer topology mapping can greatly reduce the mapping time while improving the mapping quality by a small margin.
【學(xué)位授予單位】：解放軍信息工程大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.06
【相似文獻(xiàn)】
相關(guān)期刊論文 前6條
1 溫星,陸國棟,李基拓;基于拓?fù)溆成涞狞c(diǎn)集在凸多邊形內(nèi)外判斷算法[J];中國圖象圖形學(xué)報(bào);2003年04期
2 黃敏桓;張堯?qū)W;唐洪;況曉輝;;大規(guī)模仿真網(wǎng)絡(luò)拓?fù)溆成涞淖泳W(wǎng)分割技術(shù)[J];北京郵電大學(xué)學(xué)報(bào);2011年S1期
3 吳春福,陸國棟,張樹有;基于拓?fù)溆成涞亩噙呅雾旤c(diǎn)凸凹判別算法[J];計(jì)算機(jī)輔助設(shè)計(jì)與圖形學(xué)學(xué)報(bào);2002年09期
4 王昱,朱家元,馮驚雷,張恒喜;多屬性信息決策的改進(jìn)無監(jiān)督學(xué)習(xí)算法建模與應(yīng)用[J];計(jì)算機(jī)工程與應(yīng)用;2002年21期
5 李積元;點(diǎn)集在凸多邊形內(nèi)外判斷算法的拓?fù)溆成浞椒╗J];青海大學(xué)學(xué)報(bào)(自然科學(xué)版);2005年01期
6 ;[J];;年期
相關(guān)碩士學(xué)位論文 前1條
1 李睿;異構(gòu)網(wǎng)絡(luò)測試床拓?fù)溆成渌惴ㄑ芯縖D];解放軍信息工程大學(xué);2014年
，本文編號(hào)：2066838
本文鏈接：http://sikaile.net/guanlilunwen/ydhl/2066838.html
最近更新
教材專著
