跳到主要內容

臺灣博碩士論文加值系統

(44.192.48.196) 您好!臺灣時間:2024/06/23 20:48
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:郭朕逢
研究生(外文):Chen-Feng Kuo
論文名稱:都會擷取環形光網路之低運算複雜度動態訊務彙集機制
論文名稱(外文):Computation-Efficient Algorithm for Traffic Grooming in Metro-Access Ring Network
指導教授:張仲儒
指導教授(外文):Chung-Ju Chang
學位類別:碩士
校院名稱:國立交通大學
系所名稱:電信工程系所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2005
畢業學年度:93
語文別:英文
論文頁數:45
中文關鍵詞:光網路動態訊務彙集
外文關鍵詞:optical ring networktraffic groomingdynamic traffic
相關次數:
  • 被引用被引用:0
  • 點閱點閱:182
  • 評分評分:
  • 下載下載:4
  • 收藏至我的研究室書目清單書目收藏:0
在近幾年裡,同步光纖(SONET)環狀網路被大幅應用在光纖基礎建設上。而且隨著時間經過,光纖網路的發展已經有了很大的進步,不只如此訊務的流量也大幅激增。此外由於分波多工(WDM)的技術的成熟並且被大幅應用下,光纖網路的傳輸容量大幅的提升。然而相對於一個波長提供的頻寬,訊務的流量仍是相當的小。所以為了有效的利用資源,可以利用訊務彙集的技術,把需求頻寬小的訊務彙集到頻寬大的波長上。
在本篇論文中,我們考慮動態訊務彙集的問題。而且我們的目標是讓波長頻寬的使用率達到最高,同時降低新連線呼叫拒絕率。根據要達成的目標,我們把這個問題公式化成整數線性規劃(ILP)的問題,並且為了解這個問題,我們從模擬退火演算法的精神,提出一個STGA演算法來求的最佳解。但是因為計算複雜度的關係,我們另外提出計算法雜度較低的HTGA的演算法。在HTGA演算法裡面主要有三個步驟:訊務彙集的動作、波長指派的動作、訊務重新被安排的動作。這些動作的主要目的是在儘可能不要改變光通道的情況下讓系統的使用率更好。
從模擬裡我們可以得到幾個結果,HTGA在系統使用效率方面只比STGA差10%左右,而在計算複雜度方面HTGA卻是比STGA低很多;除此之外,HTGA在光通道被重新安排的數目也是比STGA少很多。從這些結果顯示,我們可以指出HTGA是個有可行性且吸引人的演算法。
In recent years, synchronous optical network (SONET) ring networks have been widely deployed for the optical network infrastructure. The progresses of optical networks evolve with time; meanwhile, the carried traffic streams surge. The transmission capacity of an optical network largely increases because of the development and application of wavelength division multiplexing (WDM) technologies. However the required bandwidth of a traffic stream is also much smaller than the bandwidth capacity of a wavelength. Thus, in order to efficiently utilize the network resources, many lower-speed traffic streams can be multiplexed onto a high-speed wavelength by traffic-grooming technique.
In the thesis, we consider the traffic grooming problem, which the property of the traffic is dynamic and nonuniform traffic. Our objective is to effectively reduce the new call blocking rate and maximize the utilization efficiency of the wavelengths which are used by the system. Integer linear problem (ILP) methodology is applied to formulate for this problem. And, in order to solve the ILP, we first propose a simulated annealing-based traffic grooming (STGA) algorithm to obtain the optimal solution. However, the STGA algorithm is infeasible due to its computation complexity. Alternatively, we propose a heuristic algorithm, called a heuristic-based traffic grooming (HTGA) algorithm.
There are the three main operations in HTGA algorithm: operation of traffic grooming, operation of wavelength assignments, operation of traffic rearrangement. The main purpose of these operations is to achieve the better system utilization without changing the lightpath topology as could as possible.
From the simulation evaluation, network performance measures are observed. For system utilization, the HTGA algorithm is only 10% less than the STGA algorithm, whereas the computation complexity of the STGA algorithm is much larger than that of the HTGA algorithm. In addition, the number of rearranged lightpaths by the HTGA algorithm is fewer than the ones by the STGA algorithm. From these results, we can conclude that the HTGA algorithm is a feasible and attractive algorithm.
[1] B. Mukherjee, S. Ramamurthy, D. Banerjee, and A. Mukherjee, “Some principles for designing a wide-area optical network,” Proc. of IEEE INFOCOM ‘94, vol. 1, pp. 110 – 119, June 1994.
[2] E. Modiano and P. J. Lin, “Traffic grooming in WDM networks,” IEEE Comm. Mag., vol. 39, no. 7, pp. 124 – 129, July 2001.
[3] K. Zhu, and B. Mukherjee, “Traffic grooming in an optical WDM mesh network,” IEEE Journal on Selected Areas in Communications, vol. 20, no. 1, pp. 122 – 133, Jan. 2002.
[4] R. Dutta, and G.. Rouskas, “On optimal traffic grooming in WDM rings,” IEEE Journal on Selected Areas in Communications, vol. 20, no. 1, pp. 110 – 121, Jan. 2002.
[5] D. Li, Z. Sun, X. Jia, and K. Makki “Traffic grooming on general topology WDM networks,” IEE Proc. Commun., vol. 150, no.3, pp. 197 – 201, June. 2003.
[6] B. Chen, G. Rouskas, and R. Dutta “Traffic grooming in WDM ring networks with the min-max objective,” Proceedings of Networking 2004, pp. 174 – 185, May. 2004.
[7] E. H. Modinao, and A. L. Chiu “Traffic grooming algorithms for reducing electronic multiplexing costs in unidirectional WDM ring network,” Journal of Lightwave Technology , vol.18, no. 1, pp. 2-12, Jan. 2000.
[8] X. Zhang, and C. Qiao “An effective and comprehensive solution to traffic grooming and wavelength assignment in SONET/WDM rings,” IEEE/ACM Transactions Journal on Networking, vol. 8, no. 5, pp. 608-617, Oct. 2000.
[9] Moon-Gil Yoon “Traffic grooming and light-path routing in WDM ring networks with hop-count constraint,” IEEE International Conference on Communications, vol. 3, pp. 731-737, June 2001.
[10] V.R. Konda, and T.Y. Chow “Algorithm for traffic grooming in optical networks to minimize the number of transceivers,” IEEE Workshop on High Performance Switching and Routing, pp. 218-221, May 2001.
[11] P. Prathombutr, J. Stach, and E.K. Park “An algorithm for traffic grooming in WDM optical mesh networks with multiple objectives,” ICCCN 2003, pp. 405-411, Oct. 2003.
[12] R.B. Billah, B. Wang, and A.S. Awwal “Efficient traffic grooming in synchronous optical network/wavelength-division multiplexing bidirectional line-switched ring network,” Optical Engineering, vol. 43, no. 5, pp. 1101-1114, May 2004.
[13] J. Wang, W. Cho, V. R. Vemuri, and B. Mukerjee “Improved approaches for cost-effective traffic grooming in WDM ring networks: ILP formulations and single-hop and multiple connections,” Journal of Lightwave Technology, vol. 19, no.11, pp. 1645 – 1653, November. 2001.
[14] H. Zang, J. P. Jue, and B. Mukerjee “A review of routing and wavelength assignment approaches for wavelength-routed optical WDM network,” Optical Network Mag., vol. 1, no.1, pp. 47 – 66, Jan. 2000.
[15] X. Sun, Y. Li, I. Lambadaris, and Y.Q. Zhao “Performance analysis of first-fit wavelength assignment algorithm in optical networks,” Telecommunications, 2003. ConTEL 2003, vol. 2, no.1, pp. 403 – 409, June. 2003.
[16] F. I. Romeo, “Simulated Annealing: Theory and applications to layout problems”. Memorandum No. UCB/ERL M89/29, March 1989.
[17] S. Kirkpatrick, C. D. Gellatt, and M. P. Vecchi. “Simulated annealing.” Science, 220, 1983.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top