簡易檢索 / 詳目顯示

研究生: 連政煌
Cheng-Huang Lien
論文名稱: 分波多工全光學網路之網路公平性路徑選擇
Fair Routing in WDM All-Optical Networks
指導教授: 蔡榮宗
Tsai, Jung-Tsung
學位類別: 碩士
Master
系所名稱: 資訊教育研究所
Graduate Institute of Information and Computer Education
論文出版年: 2000
畢業學年度: 88
語文別: 英文
中文關鍵詞: 波幅路由器波幅連續限制路徑長度多重路徑選擇公平性路徑選擇與波幅指定
英文關鍵詞: wavelength router, wavelength continuity constraint, path length, alternate routing, fairness, routing and wavelength assignment
論文種類: 學術論文
相關次數: 點閱:197下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 藉由分波多工技術,不同的波幅可以同時在一條光纖中傳輸。其中,每個波幅都可提供高達每秒數十億位元的頻寬。波幅路由器的使用,讓若干連結可以在互斥 的路徑中配置相同的波幅,因此提高了波幅的利用率。在沒有波幅轉換功能的分波多工網路中,系統必須在路徑上配置相同的波幅來建立連結。因此,若連結要求的路徑經過較多鏈結將比較不易配置到可用的波幅,而使得連線要求的阻斷率相對的提高。
    本論文的目的在探討連結公平性的問題,此問題源自於來源節點至目的節點間的連結長度不同而導致的阻斷率失衡情況。能夠不受路徑長度的增加而增加。本論文提出一個適用於分波多工全光學網路架構的路由與波幅指定的策略,使得阻斷率較高的連結能夠獲得較多的光徑來降低連結失敗的機率。此外,我們也提出一個分析模式來計算網路中每個來源節點至目的節點間連結的阻斷率,並以此分析模式來找出阻斷率較高的連結,據此給予光徑。
    此外,我們以模擬的結果來評估我們的分析模式的正確性,並且指出多路徑選擇策略在給予不同的網路參數時,例如:拓樸、路徑數量等等所能降低的阻斷率。而不同的路由與波幅指定策略所造成的影響也將以公平性的角度予以探討。

    The vast bandwidth in fibers can be efficiently tapped by advanced WDM technology, by which several different wavelengths are simultaneously transmitted in an optical fiber and each carries traffic at several Gbps. The use of wavelength router in WDM networks provides topological dynamics to support high aggregate capacity by wavelength reuse at disjoint paths. Without wavelength conversion, a connection is set up by allocating the same wavelength of every link along the path. Consequently, longer connections require to win more times contending to use the same wavelength on each link, which results in a higher blocking probability for distant connection requests.
    This thesis aims to solve the fairness issue, which arises from the imbalance of blocking probabilities with regard to connection-path length. We propose a strategy, which continues to allocate one more light-path for a source-destination(S-D) pair found to have a higher blocking probability than others. This strategy incorporates an analysis model which is proposed to compute the blocking probabilities for S-D pairs and to identify the S-D pairs with maximum blocking probability in the network.
    The proposed strategy for fairness and the analysis model are verified through simulations. Results show that the analysis model is accurate if offered load is high, and underestimated if offered load is low; and that the strategy, compared with others, achieves better fairness even for different network parameters and topologies.

    Chapter 1 Introduction……………………………………………………………7 1.1 Background.………………………………………………………………..7 1.2 Objective…………………………………………………………………...9 1.3 Thesis Organization………………………………………………..……….10 Chapter 2 Background and Related Works………………………………….…11 2.1 Wavelength-Routed Networks…………………………………………..…11 2.2 Analysis for Blocking Probability………………………………………...16 2.3 Layer-Graph Notation………………………………………………….…18 Chapter 3 Systems and Problem Formulation……………………………...…22 3.1 Fairness……………………………………………………………………23 3.1.1 Network Model……………………………………………………...23 3.1.2 Traffic Model……………………………………………………...…23 3.1.3 Problem Formulation…………………………………………….…..24 3.1.4 The Issues……………………………………………………………25 3.2 Numerical Algorithm…………………………………………………..…...26 3.2.1 Analysis Model………………………………………………….…...26 3.2.2 MinMax Algorithm……………………………………..…………....29 3.2.2.1 Procedure Description………………………..……….….…29 3.2.2.2 Routing Strategy……………………………..………..….…31 Chapter 4 Numerical Data and Simulation Results………………………..…….32 4.1 Analytical data versus simulation data…………………………….…..…...32 4.1.1 Offered Load………………………………………………….…...…33 4.1.2 Alternative Shortest Paths………………………………….……...…36 4.2 Simulation Results…………………………………………..………...……40 4.2.1 Hypercube Network………………………………………...…..……41 4.2.2 Non-uniform Traffic…………………………………….……..……48 Chapter 5 Conclusion and Future Works………………………….…….…..……56 Bibliography……………………………………………………….…………….……58

    [1] R. K. Pankaj and R. G. Gallager, "Wavelength requirements of all-optical networks," IEEE ICC '94, vol. 3, pp. 1658-1663, 1994.
    [2] I.Chlamtac, A. Ganz, and G. Karmi, "Lightpath communications: An approach to high bandwidth optical WAN's," IEEE Trans. Commun., vol. 40, pp. 1171-1182, July 1992.
    [3] E. Karasan and E. Ayanoglu, "Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks," IEEE/ACM Trans. Networking, vol. 6, no. 2, pp. 186-196, Apr. 1998.
    [4] C. Chen and S. Banerjee, "A new model for optimal routing and wavelength assignment in wavelength division multiplexed optical networks," Proc. IEEE INFOCOM '96, San Francisco, pp. 164-171, Apr. 1996.
    [5] A. Birman and A. Kershenbuam, "Routing and wavelength assignment methods in single-hop all-optical networks with blocking," Proc. IEEE INFOCOM '95, Boston, MA, pp. 431-438, Apr. 1995.
    [6] Z. S. Zhang and A. Acampora, "A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength reuse," IEEE/ACM Trans. Networking, vol. 3, no. 3, pp. 281-288, June 1995.
    [7] M. Kovacevic and A. Acampora, "Benefits of wavelength translation in all-optical clear-channel networks," IEEE J. Select. Areas Commun., vol. 14, no. 5, pp. 868-880, June1996.
    [8] I. Chlamtac, A. Ganz, and G. Karmi, "Lightnets: Topologies for high-speed optical networks," IEEE/OSA J. Lightwave Technol., vol. 11, no. 5/6, May/June 1993.
    [9] H. Harai, M. Murata, and H. Miyahara, "Performance of alternate routing methods in all-optical switching networks," Proc. INFOCOM '97, Kobe, Japan, pp. 516-524, Apr. 1997.
    [10] R. A. Barry and P. A. Humblet, "Models of blocking probability in all-optical networks with and without wavelength changers," IEEE J. Select. Areas Commun., vol. 14, no. 5, pp. 858-867, June 1996.
    [11] A. Birman, "Computing approximate blocking probabilities for a class of all-optical networks," IEEE J. Select. Areas Commun., vol. 14, no. 5, pp. 852-857, 1996.
    [12] R. Ramaswami and K. N. Sivarajan, "Routing and wavelength assignment in all-optical networks," IEEE/ACM Trans. Networking, vol. 3, no. 5, pp. 489-500, Oct. 1995.
    [13] A. Mokhtar and M. Azizoglu, "Adaptive wavelength routing in all-optical netwroks," IEEE/ACM Trans. Networking, vol. 6, pp. 197-206, Apr. 1998.
    [14] B. Mukherjee, S. Ramamurthy, D. Banerjee, and A. Mukherjee, "Some principles for designing a wide-area optical network," Proc. IEEE INFOCOM '94, 1994.
    [15] R. Ramaswami, "Multiwavelength lightwave networks for computer communication," IEEE Commun. Mag., vol. 31, pp. 78-88, Feb. 1993.
    [16] E. Karasan and E. Ayanoglu, "Performance of WDM transport networks," IEEE J. Select. Areas Commun., vol. 16, no. 7, pp. 1081-1096, Sep. 1998.
    [17] K. C. Lee and V. K. Li, "A wavelength-convertible optical network," J. Lightwave Technol. vol.11, pp. 962-970, May/June 1993.
    [18] H. Harai, M. Murata, and H. Miyahara, "Performance analysis of wavelength assigment policies in all-optical networks with limited-range wavelength conversion," J. Select. Areas Commun., vol. 16, no. 7, pp. 1051-1060, Sep. 1998.
    [19] D. Bersekas and R. Gallager, Data Networks, Second Edition. Englewood Cliffs, NJ: Prentice-Hall, 1992.
    [20] S. Subramaniam, M. Azizoglu, and A. K. Somani, "On optimal converter placement in wavelength-routed networks," IEEE/ACM Trans. Networking, vol. 7, no. 5, pp. 754-766, Oct. 1999.

    QR CODE