EPON中面向多播業(yè)務的節(jié)能算法設計與仿真實現(xiàn)
發(fā)布時間:2018-03-02 05:29
本文關鍵詞: 以太無源光網(wǎng)絡 多播業(yè)務 節(jié)能 調度 出處:《東北大學》2014年碩士論文 論文類型:學位論文
【摘要】:隨著社會的不斷進步與全球經(jīng)濟的快速發(fā)展,氣候變暖、能源危機等全球化問題日益加劇。由于現(xiàn)有網(wǎng)絡系統(tǒng)的能源消耗很大,網(wǎng)絡系統(tǒng)的節(jié)能減排已刻不容緩,網(wǎng)絡能耗中占有較大比重的接入網(wǎng)成為節(jié)能技術的重要研究對象。近年來,以太無源光網(wǎng)絡(Ethernet Passive Optical Network, EPON)快速發(fā)展,被大量部署,業(yè)界認為EPON是實現(xiàn)接入網(wǎng)“最后一公里”的最佳技術選擇。然而,多媒體技術的普及和推廣導致EPON網(wǎng)絡中多播業(yè)務與日劇增,從而加劇了網(wǎng)絡能量浪費。如何降低多播業(yè)務的額外能耗成為EPON網(wǎng)絡未來發(fā)展和演進過程中亟待解決的關鍵問題之一光網(wǎng)絡單元(Optical Network Unit, ONU)作為EPON系統(tǒng)中重要的耗能設備,由于數(shù)量眾多,成為EPON總網(wǎng)絡能耗的主要組成部分。本文研究EPON中面向多播業(yè)務的ONU節(jié)能問題,提出基于TSP (Travelling Salesman Problem)問題的ONU休眠節(jié)能算法,該算法的核心思想是將EPON中ONU能耗最小化問題轉化為經(jīng)典的TSP問題求解。研究內容主要包括三部分:首先構造面向多播業(yè)務的ONU能耗模型,引入多播業(yè)務調度的相關約束條件,對能耗最小化問題進行規(guī)范的數(shù)學描述。其次,對多播組調度順序與時隙之間的關系進行全面分析,指出多播業(yè)務調度的關鍵問題是多播組與時隙之間的最佳匹配。最后,將ONU能耗最小化問題轉化為一個TSP問題實例,采用鄰接數(shù)組構造不同多播組之間狀態(tài)轉換的有向完全圖,將各多播組能耗及組間狀態(tài)轉換存儲于圖的數(shù)組中。通過遞歸法計算出不同調度順序下ONU總能耗,并按照能耗最低的調度順序進行多播業(yè)務傳輸。本文通過網(wǎng)絡仿真軟件OPNET構建EPON仿真系統(tǒng),對提出的節(jié)能算法進行性能分析。仿真結果表明,本文提出的節(jié)能算法能有效降低EPON中多播業(yè)務能耗。
[Abstract]:With the continuous progress of the society and the rapid development of the global economy, the globalization problems such as climate warming and energy crisis are becoming more and more serious. Because the energy consumption of the existing network system is very large, the energy saving and emission reduction of the network system is urgent. In recent years, Ethernet Passive Optical Network (EPON), which occupies a large proportion of network energy consumption, has become an important research object of energy saving technology. The industry regards EPON as the best technical choice to realize "last kilometer" of access network. However, the popularization and popularization of multimedia technology has led to the rapid increase of multicast services in EPON network. Therefore, how to reduce the extra energy consumption of multicast service has become one of the key problems to be solved in the future development and evolution of EPON network. Optical Network Unit (EPON) is an important energy consuming device in EPON system. In this paper, the problem of ONU energy saving for multicast service in EPON is studied, and a ONU dormant energy saving algorithm based on TSP travelling Salesman problem is proposed, which is based on the problem of TSP travelling Salesman problem. The core idea of the algorithm is to transform the ONU energy consumption minimization problem in EPON into a classical TSP problem. The main contents of the research are as follows: firstly, the ONU energy consumption model for multicast services is constructed, and the constraints of multicast service scheduling are introduced. Secondly, the relationship between multicast group scheduling order and time slot is analyzed comprehensively, and the key problem of multicast service scheduling is the best match between multicast group and slot. Finally, the paper analyzes the relationship between multicast group scheduling order and time slot scheduling, and points out that the key problem of multicast service scheduling is the best match between multicast group and time slot. The problem of minimizing ONU energy consumption is transformed into an example of TSP problem, and the directed complete graph of state conversion between different multicast groups is constructed by adjacent array. The energy consumption of each multicast group and the state conversion between groups are stored in the array of graphs. The total energy consumption of ONU is calculated by recursive method under different scheduling order. In this paper, the EPON simulation system is constructed by the network simulation software OPNET, and the performance of the proposed energy-saving algorithm is analyzed. The simulation results show that, The proposed energy saving algorithm can effectively reduce the energy consumption of multicast services in EPON.
【學位授予單位】:東北大學
【學位級別】:碩士
【學位授予年份】:2014
【分類號】:TN929.1
【相似文獻】
相關期刊論文 前10條
1 楊樹偉;田霖;石晶林;;單小區(qū)多播業(yè)務調度算法設計與仿真[J];系統(tǒng)仿真學報;2009年18期
2 張林叢;劉業(yè)君;郭磊;魏可峰;戴翠琴;;以太無源光網(wǎng)絡中面向多播業(yè)務的節(jié)能算法(英文)[J];光子學報;2014年07期
3 趙紹剛;;WCDMA中支持MBMS業(yè)務的無線鏈路技術[J];電信快報;2006年05期
4 石明衛(wèi);;MBMS及其演進[J];電視技術;2012年11期
5 趙紹剛;;WCDMA中支持MBMS業(yè)務的無線鏈路技術[J];移動通信;2006年06期
6 趙紹剛,李岳夢;CDMA2000系統(tǒng)中的廣播和多播業(yè)務[J];電信快報;2005年08期
7 趙紹剛;李岳夢;;CDMA2000系統(tǒng)中的廣播和多播業(yè)務[J];數(shù)字通信世界;2005年08期
8 鄭瑜;;CDMA 2000廣播—多播業(yè)務的安全研究[J];移動通信;2008年09期
9 徐赤t,
本文編號:1555230
本文鏈接:http://sikaile.net/kejilunwen/wltx/1555230.html
最近更新
教材專著