本文選題：可重構(gòu)服務(wù)承載網(wǎng) + 節(jié)能��； 參考：《解放軍信息工程大學(xué)》2014年碩士論文

【摘要】：可重構(gòu)信息通信基礎(chǔ)網(wǎng)絡(luò)體系通過在共享的底層物理資源基礎(chǔ)上構(gòu)建可重構(gòu)服務(wù)承載網(wǎng)(RSCN),支持多種異構(gòu)網(wǎng)絡(luò)的并存與管理,進(jìn)而可以向網(wǎng)絡(luò)用戶提供多樣化的網(wǎng)絡(luò)業(yè)務(wù)服務(wù)。然而當(dāng)前在構(gòu)建RSCN的過程中,底層承載網(wǎng)節(jié)能的需求沒有得到滿足。一方面用戶需求到達(dá)時(shí)沒有快速可靠的節(jié)能方案來構(gòu)建RSCN,另一方面用戶需求結(jié)束時(shí)底層承載網(wǎng)并不處于較好的節(jié)能狀態(tài)。如何構(gòu)建及調(diào)整RSCN使其最優(yōu)化地滿足當(dāng)前網(wǎng)絡(luò)的節(jié)能需求是亟待解決的重要研究課題。論文依托國(guó)家973項(xiàng)目“可重構(gòu)信息通信基礎(chǔ)網(wǎng)絡(luò)體系研究”和“業(yè)務(wù)自適應(yīng)認(rèn)知承載機(jī)理”子課題,針對(duì)RSCN節(jié)能問題在需求到達(dá)時(shí)和需求結(jié)束時(shí)兩種情況下存在的難點(diǎn)展開了較為深入的研究。具體工作如下:1.針對(duì)一般需求的RSCN節(jié)能構(gòu)建問題,提出了基于節(jié)點(diǎn)聚合使用的兩階段映射方法。該方法考慮了底層節(jié)點(diǎn)的資源能力和網(wǎng)絡(luò)拓?fù)湮恢脙煞矫嬉蛩?并基于緊密中心度提出了節(jié)點(diǎn)節(jié)能重要度的概念,節(jié)點(diǎn)排序后根據(jù)貪婪策略優(yōu)先映射服務(wù)節(jié)點(diǎn),并檢驗(yàn)保證底層鏈路距離較短。仿真結(jié)果表明本方法在一般需求的RSCN情況下使構(gòu)建成功率達(dá)到70%、長(zhǎng)期收益開銷比達(dá)到75%的同時(shí),提高收益能耗比10%左右。2.針對(duì)大規(guī)模及高帶寬需求的RSCN節(jié)能構(gòu)建問題,提出了一種拓?fù)渚酆鲜褂玫膶ず擞成浞椒�。該方法在�?jié)點(diǎn)節(jié)能重要度的基礎(chǔ)上,找到核心服務(wù)節(jié)點(diǎn)優(yōu)先映射,通過檢驗(yàn)確保所選底層承載核心節(jié)點(diǎn)滿足核心服務(wù)節(jié)點(diǎn)的要求,節(jié)點(diǎn)和鏈路映射同步進(jìn)行,根據(jù)貪婪策略進(jìn)行鄰居搜索保證所選底層節(jié)點(diǎn)距離和較小。同時(shí)提出一種RSCN的需求判定方法進(jìn)而使用混合算法進(jìn)行RSCN構(gòu)建。仿真結(jié)果表明該算法在處理大規(guī)模及高帶寬需求的RSCN節(jié)能構(gòu)建問題時(shí)能夠提升接近20%的構(gòu)建成功率,提高長(zhǎng)期收益開銷比和收益能耗比10%以上;該混合算法能夠有效地處理普通環(huán)境下RSCN節(jié)能構(gòu)建問題,提高構(gòu)建性能。3.針對(duì)RSCN結(jié)束時(shí)底層承載網(wǎng)節(jié)能重構(gòu)問題,提出了基于逼近理想排序法的均衡節(jié)能重構(gòu)方法。該方法首先基于逼近理想排序法選擇底層承載節(jié)點(diǎn)的相關(guān)信息作為方案屬性,根據(jù)節(jié)能或均衡的重構(gòu)需求排序以找到最佳重構(gòu)節(jié)點(diǎn),然后優(yōu)先進(jìn)行節(jié)能重構(gòu),再對(duì)工作狀態(tài)的網(wǎng)絡(luò)拓?fù)溥M(jìn)行均衡重構(gòu)。仿真結(jié)果表明該方法改善了底層承載網(wǎng)的負(fù)載均衡情況和能耗水平,提升了構(gòu)建成功率和收益能耗比。
[Abstract]:The reconfigurable information and communication basic network system can support the coexistence and management of many heterogeneous networks by constructing a reconfigurable service bearer network on the basis of shared underlying physical resources, and then can provide a variety of network services to network users. However, in the process of constructing RSCN, the energy saving requirement of the underlying bearer network has not been satisfied. On the one hand, there is no fast and reliable energy saving scheme to build RSCN when user requirements arrive; on the other hand, the underlying carrier network is not in a better energy saving state when user demand ends. How to construct and adjust the RSCN to meet the energy saving requirements of the current network is an important research topic to be solved urgently. The thesis relies on the national 973 project "Research on Reconfigurable Information and Communication basic Network system" and "Service Adaptive Cognitive bearing Mechanism". In this paper, the problem of energy saving in RSCN is studied deeply in the two situations of demand arrival and demand end. The work is as follows: 1. A two-stage mapping method based on node aggregation is proposed to solve the problem of energy saving construction of RSCN with general requirements. This method takes into account the resource capacity of the underlying node and the network topology location, and proposes the concept of the node energy saving importance based on the closeness centrality. The nodes are sorted to map the service nodes first according to greedy strategy. And check to ensure that the lower link distance is short. The simulation results show that this method can make the construction success rate reach 70%, the long-term ratio of income to cost reach 75%, and increase the ratio of income to energy consumption about 10%. In order to solve the problem of large scale and high bandwidth RSCN energy saving construction, a kernel mapping method for topology aggregation is proposed. Based on the importance of energy saving of nodes, this method finds the priority mapping of core service nodes, ensures that the core nodes selected to carry the core nodes meet the requirements of the core service nodes, and synchronizes the mapping between nodes and links. According to greedy strategy, neighbor search ensures the distance and the size of the selected nodes are small. At the same time, a requirement determination method of RSCN is proposed, and then RSCN is constructed by hybrid algorithm. The simulation results show that the proposed algorithm can improve the success rate of RSCN construction by nearly 20% and increase the ratio of long-term income to cost and energy consumption by more than 10% when dealing with the problem of large scale and high bandwidth RSCN energy saving construction. The hybrid algorithm can effectively deal with the problem of energy saving construction of RSCN in common environment, and improve the performance of building. 3. 3. In order to solve the problem of energy saving reconfiguration of bottom bearing network at the end of RSCN, a balanced energy saving reconfiguration method based on approximate ideal sorting method is proposed. Firstly, based on the approximate ideal sorting method, the information of the underlying bearer node is selected as the scheme attribute, and the optimal reconfiguration node is sorted according to the energy saving or balanced reconfiguration requirements, and then the energy saving reconfiguration is given priority. Then the network topology of the working state is reconfigured. The simulation results show that the proposed method can improve the load balance and energy consumption level of the underlying load-carrying network, and improve the success rate of construction and the ratio of income to energy consumption.
【學(xué)位授予單位】：解放軍信息工程大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.09

【參考文獻(xiàn)】

相關(guān)期刊論文 前3條

1 汪斌強(qiáng);鄔江興;;下一代互聯(lián)網(wǎng)的發(fā)展趨勢(shì)及相應(yīng)對(duì)策分析[J];信息工程大學(xué)學(xué)報(bào);2009年01期

2 吳建平;吳茜;徐恪;;下一代互聯(lián)網(wǎng)體系結(jié)構(gòu)基礎(chǔ)研究及探索[J];計(jì)算機(jī)學(xué)報(bào);2008年09期

3 張宏科;蘇偉;;新網(wǎng)絡(luò)體系基礎(chǔ)研究——一體化網(wǎng)絡(luò)與普適服務(wù)[J];電子學(xué)報(bào);2007年04期

，

本文編號(hào)：1907287