以基因演算法配置動態多波長分波多工網路之備用頻寬最佳化

光網路的發展已經是日漸成熟的發展技術，過去光網路主要的議題會著重在服務品質的提昇，但是在已經廣泛運用的光網路，最需要被關注的議題則是如何提高網路穩定度，光網路產生一次的網路中斷，通常會造成業者與用戶產生嚴重的損失，因此網路服務提供的業者們，最關注的問題則是如何在有限的資源下，建構與提供一個具有高存活性網路（Survivability Networks）。 p-cycles在建構高存活性網路中，是一個較有效的方法。高存性網路的配置的相關文獻中，有許多是在於是事後規劃的機制中，採用保護的議題下建構，一般而言常見的是找尋備援路徑的方式，但這樣的方式在網路產生損毀的同時才建構路徑，在於時間的考量因素之下，是較為不可行；因此在考量事先規劃的機制中，恢復是較為可行的，在網路提供前及先規劃網路的備用頻寬，在網路產生損毀的同時，可以有效的轉換到備援的頻寬之中，快速的恢復網路的傳輸；近期文獻中較為常見的則是p-cycles的配置，本方法採用預先建構環狀的備援頻寬，且有效的配置之下，不需要路徑的相關資訊及可以有效的配置備援網路。本研究目的在於以多波長分波多工網路的環境中，設計出一套方法來提供p-cycles網路的建構準則，在p-cycles的網路建構過程中，需要列舉出多大的候選圈集合，才可以在考量時間與備援網路的效能，因此在本研究中採用基因演算法，利用演算法具有快速收斂與全域處理的特性，本研究的p-cycles網路的配置方法，在實驗與分析之後，顯著的可以提供網路服務業者配置備援網路的一個有效的方法。

關鍵字

多波長分波多工網路；高存活網路；基因演算法； p-cycles

並列摘要

In recent years, optical networks have been well developed by using WDM (Wavelength Division Multiplexing) technology to provide many hundreds of wavelength in the fibers for backbone infrastructure. Because of the existence of fiber-cut, the internet services providers (ISPs) may have many data loss and damage that network connection. So the internet services provider need to construct the survivable networking in the resource of limited to restore the networks very quickly. In related literature, p-cycles are constructed for survivability of WDM networks. This topic of protection needs to find backup path but the method needs to receive OD-pairs information. The integer linear programming (ILP) based p-cycle network requires enumerating all simple cycles or a set of simple cycles. However, p-cycles do not need any connect information so this method can be applied quickly for internet services providers. The objective of this thesis is to design a novel genetic algorithm, which provides a rule for placing subset of cycles to construct p-cycle for WDM networks. This study used a Mutual Therapeutic Genetic Algorithm (MTGA) to solve the survivability problem and used Taguchi orthogonal analysis to analyze the influence of variables in experimental. Finally, experimental results show that our approach can effectively construct p-cycles for WDM networks.

並列關鍵字

Survivable ； Wavelength Division Multiplexing ； Genetic Algorithm ； p-cycles

參考文獻

[2]R. Asthana and Y.N. Singh, “Distributed protocol for removal of loop backs and optimum allocation of p-cycles to minimize the restored path lengths,” Journal of Lightwave Technology, vol. 26, pp. 616-627, 2008.

[3]R. Asthana and Y.N. Singh, “Second phase reconfiguration of restored path for removal of loop back in P-cycle protection,” IEEE Communications Letters, vol. 11, pp. 201-203, 2007.

[4] R. Asthana and Y.N. Singh, “Protection and restoration in optical networks,” IETE journal of research, vol. 50, pp. 319-329, 2004.

[5]S. Chaudhuri and E. Goldstein, “On the value of optical-layer reconfigurability in IP over WDM lightwave networks,” IEEE Photonics Technology Letters, vol. 12, pp. 1097-1099, 2000.

[6]J. Doucette, W.D. Grover, and T. Bach, “Bi-criteria studies of mesh network restoration path-length versus capacity tradeoffs,” Conference and Exhibit Optical Fiber Communication, vol. 2, pp. TuG2.2-TuG2.3, 2001.

國際替代計量

以基因演算法配置動態多波長分波多工網路之備用頻寬最佳化

未授權

主題瀏覽