簡易檢索 / 詳目顯示

研究生: 徐榮秀
Jung-Hsiu Hsu
論文名稱: 同步光纖網路自復環規劃之研究
The Study of Self-Healing Ring Network Planning
指導教授: 溫于平
Ue-Pyng Wen
口試委員:
學位類別: 碩士
Master
系所名稱: 工學院 - 工業工程與工程管理學系
Department of Industrial Engineering and Engineering Management
論文出版年: 2002
畢業學年度: 90
語文別: 英文
論文頁數: 57
中文關鍵詞: 網路規劃自復環同步光纖網路同步數位架構
外文關鍵詞: Network Planning, Self-Healing Ring, SONET, SDH
相關次數: 點閱:113下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 隨著光纖技術的來臨,電信網路的存活度問題也隨之受到重視,所謂存活度即是網路有抵擋和復原中斷的能力。在光纖網路中,關於存活度的技術大致可分為兩大類:預設保護、動態復原,其中自復環是在預設保護中非常成功的技術,且對於存活網路而言,它是最廣泛被設置的架構。本論文探討同步光纖網路中雙向自復環的規劃問題。給定一個網路及各點對間的需求,我們要決定如何在已有的鏈路上設置雙向自復環,使所有需求能被設備的現有容量所滿足,並同時指派路由。我們的目標是最小化此復原網路的總成本,為此我們提出了兩種啟發式演算法來解決大型的網路問題,一種適用於使用相同種類的設備;而另一種則適用於不同種類的設備,同時也呈現其結果在各種不同績效值上的表現。


    The advent of fiber optic technology has increased concerns about the survivability of telecommunication networks. Survivability is the ability of a network to withstand and recover from failures. The techniques that have been proposed and used for survivability in optical networks can be classified under two general categories: predesigned protection and dynamic restoration. In the predesigned protection, Self-Healing Ring (SHR) is a very successful technique for survivable optical networks. SHRs are one of the more widely deployed survivable network architectures, particularly in metropolitan areas. In this thesis we study the network planning problem of bi-directional self-healing ring (BSHR), which is a network structure providing higher survivability when there is a failure on link or node. Given a network with nodes, links, and demand pairs, our target is to design an optimal network comprising rings, which use only the existing links to satisfy all demands. The routing paths of all demands are simultaneously determined. The objective is to minimize the total cost of the restoration networks. We propose two heuristic algorithms for larger networks. One is suitable for the network problem with the same ADMs facilities. The other is suitable for the network problem with different ADMs facilities. Computational results are given to show the performances by the proposed heuristic algorithms.

    ABSTRACT i ACKNOWLEDGEMENT iii TABLE OF CONTENT iv LIST OF FIGURES v LIST OF TABLES vi 1. INTRODUCTION 1 2. LITERATURE REVIEW 5 3. THE PROPOSED HEURISTIC ALGORITHM (I) 8 3.1 Problem Description 8 3.2 Notations and Formulation 8 3.3 The Proposed Algorithms 10 3.4 An Illustrative Example 15 4. COMPUTATIONAL EXPERIENCE 21 5. THE PROPOSED HEURISTIC ALGORITHM (II) 31 6. CONCLUSION 42 REFERENCES 43 APPENDIX A 45

    [1] 林育瑩, “存活性通信網路備用容量之規劃研究,” 中華大學工業工程與管理研究所碩士論文, 民國八十九年七月。
    [2] ILOG CPLEX 7.0 Getting Started, ILOG, August 2000.
    [3] Laguna, M., “Clustering for the design of SONET rings in interoffice telecommunications,” Management Science, vol. 40, no. 11, pp. 1533-1541, 1994.
    [4] Lee, C. Y. and Chang, S. G., “Balancing loads on SONET rings with integer demand splitting,” Computers and Operations Research, vol. 24, no. 3, pp. 221-229, 1997.
    [5] Lee, C. Y. and Koh, S. J., “A design of the minimum cost ring-chain network with dual-homing survivability: a tabu search approach,” Computers and Operations Research, vol. 24, no. 9, pp. 883-897, 1997.
    [6] Lee, C. Y. and Koh, S. J., “Assignment of ADM Rings and DCS Mesh in Telecommunication Network,” Journal of the O.R. Society, vol. 52, no. 4, pp. 440-448, April 2001.
    [7] LINGO user’s guide, LINDO SYSTEMS INC., 1999.
    [8] McDysan, D. E. and Spohn, D. L., ATM: theory and application, McGraw-Hill series on computer communications, 1994.
    [9] Morley, G. D. and Grover, W. D., “A Comparative Survey of Methods for Automated Design of Ring-based Transport Networks,” TRLabs Technical Report, TR-97-04, Issue 1.0, January 28, 1998.
    [10] Optimization Modeling with LINGO, Fourth Edition, LINDO SYSTEMS INC., 1999.
    [11] Owen, H. L., “Synchronous Digital Hierarchy Optical Metroplitan Network Ring Traffic Analysis,” European Transactions on Telecommunications, vol. 4, no. 6, Nov.-Dec. 1993, pp. 591-597.
    [12] Shi, J. and Fonseka, J. P., ”Hierarchical self-healing rings,” IEEE/ACM Transactions on Networking, vol. 3, no. 6, pp. 690-697, 1995.
    [13] Shyur, C. C., Wen, U. P. and Hsiao, Y. F., “Analysis and planning method for SDH network,” Chunghwa Telecom Technical Quarterly, vol. 2, no. 3, pp. 228-247, 1998.
    [14] Shyur, C. C., Wu Y. M. and Chen, C. H., “A Capacity Comparison for SONET Self-Healing Rings Networks,” Global Telecommunications Conference, including a Communications Theory Mini-Conference. Technical Program Conference Record, IEEE in Houston, vol. 3, pp. 1574-1578, 1993.
    [15] Smith, B. E. and Yackle, C., “SONET Bidirectional Ring Capacity Analysis: A Pragmatic View,” IEEE International Conference,vol. 1, pp. 489-493, 1994.
    [16] Sosnosky, J. and Wu, T. H., “SONET Ring Applications for Survivable Fiber Loop Networks,” IEEE Communications Magazine, June: 51-58, 1991.
    [17] Wen, U. P., Wu, T. L. and Shyur, C. C., “Bi-directional self-healing ring network planning,” Computers & Operations Research, vol. 29, pp. 1719-1737, 2002.
    [18] Wu, T. H., Kolar, D. J. and Cardwell, R. H., “Survivable Network Architectures for Broad-Band Fiber Optic Networks: Models and Performance Comparison.” IEEE Journal of Lightwave Technology, 6: 1698-1709, 1988.
    [19] Wu, T. H. and Lau, R. C., “A class of self-healing ring architectures for SONET network applications,” IEEE Transactions on Communications, vol. 40, no. 11, pp. 1746-1756, 1992.
    [20] Xu, J., Chiu, S. Y. and Glover, F., “Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search,” Management Science, vol. 45, no. 3, March 1999.
    [21] Zhou, D. and Subramanian, S., “Survivability in Optical Networks,” IEEE Network, November/December 2000.

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)

    全文公開日期 本全文未授權公開 (國家圖書館:臺灣博碩士論文系統)
    QR CODE