多波長分工網狀網路上訊流匯整及
路由波長分配演算法

近年來，光通訊網路技術中的多波長分工網路快速成長為被廣泛期許的傳輸標準之一。由於多波長分工網路技術發展，以及光波長的頻寬可高達每秒數十億位元組，使得光網路現有的流量需求常低於單一光波長的全頻寬。許多學者及業界人士正致力於將現有的網路流量以訊流匯整的方式負載於同一光波長上，讓多波長分工網路技術得以充分利用其所帶來之大量頻寬。目前相關研究大多著重在現有SONET的環狀網路架構下，如何最大化由於多波長分工網路上支援多網路流量共同使用同一波長光路徑而提高的網路流量；以及如何降低其網路架構成本。為能有效的利用多波長分工網路所帶來的大量頻寬，本篇論文將研究在一般網狀網路架構下之多波長分工網路訊流匯整問題。在既有的網路流量需求及其他限制條件下，對於網路服務提供者，希望能建立網路設備租用成本最小化的網路。我們將整個問題仔細地分析並轉換成一個最佳化數學模型，這個數學問題在本質上是一個非線性混和整數規劃問題，問題的本身具有高度的複雜性和困難度。我們採用以拉格蘭日鬆弛法為基礎的方法來處理此一複雜問題。

關鍵字

訊流匯整；多波長分工網路；拉格蘭日鬆弛法；路由；最佳化；最小成本；波長分配；數學規劃；網路服務提供者

並列摘要

Recently, there has been a growing excitement in the area of optical wavelength division multiplexing (WDM) networks. While a single fiber has a huge bandwidth capacity and a wavelength has over a gigabit per second transmission speed, the traffic demands at speed that are lower than the full wavelength capacity are frequent in the current WDM network. Researchers and optical networking industries are now trying to find a way to support multiple low-speed traffic streams onto a single high-speed wavelength to improve the wavelength channel utilization and to minimize the amount of electronic multiplexing equipment. The issue of traffic grooming, routing and wavelength assignment in optical WDM networks in this thesis is formulated as a combinatorial optimization problem, of which the objective function is to minimize the total leasing cost for network service provider (NSP) upon the underlying WDM network subject to physical link capacity constraints, wavelength continuity constraints, and wavelength add/drop port constraints. The decision variables in these formulations include traffic demand routing, lightpath in WDM layer routing and wavelength assignment, the number of leasing wavelengths in each fiber link, and the number of leasing add/drop ports in each optical cross-connects switch (OXC) . The basic approach to the algorithm development for this thesis is Lagrangian relaxation in conjunction with a number of optimization techniques. In computational experiments, the proposed algorithms are evaluated on different network topologies..

並列關鍵字

Network Service Provider ； Mathematical Programming ； Traffic Grooming ； Lagrangian Relaxatio ； Network Planning ； Optimization ； Minimum Cost ； WDM ； Wavelength Assignment ； Routing

參考文獻

[3] M. L. Fisher, “The Lagrangian relaxation method for solving integer programming problems”, Management Science, vol. 27, pp. 1-18, 1981.

[4] A. M. Geoffrion, “Lagrangian relaxation and its use in integer programming”, Math. Programming Study, vol. 2, pp. 82-114, 1974.

[5] O. Gerstel, P. Lin, G. Sasaki, “Combined WDM and SONET Network Design,” IEEE INFOCOM, Mar. 1999, pp. 734-743.

[6] J.Q. Hu, B. Leida, “Traffic Grooming, Routing, and Wavelength Assignment in Optical WDM Mesh Networks,” Sixth INFORMS Telecommunications Conference, Boca Raton, Florida, USA, March 10-13, 2002.

[7] Nen-Fu Huang, Guan-Hsiung Liaw, and Chuan-Pwu Wang, “A Novel All-optical Transport Network with Time-shared Wavelength Channels,” IEEE Journal on Selected Areas in Communications, vol.18, Issue 10, pp 1863-1875, October 2000.

國際替代計量

多波長分工網狀網路上訊流匯整及路由波長分配演算法

全文下載

主題瀏覽