簡易檢索 / 詳目顯示

研究生: 唐子桓
Tang, Tzu-Huan
論文名稱: 一個光曳帶網路上考慮流量聚合的動態群播繞徑演算法
A Dynamic Multicast Routing Algorithm with Traffic Grooming Consideration in Light-trail Networks
指導教授: 許靜芳
Hsu, Ching-Fang
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Department of Computer Science and Information Engineering
論文出版年: 2010
畢業學年度: 98
語文別: 英文
論文頁數: 63
中文關鍵詞: 高密度分波多工光曳帶群播繞徑流量聚合
外文關鍵詞: Dense Wavelength Division Multiplexing (DWDM), Light-trail, multicast routing, traffic grooming
相關次數: 點閱:200下載:1
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 近幾年來由於網際網路與多媒體應用程式的蓬勃發展,使用者對於網路頻寬的需求與日俱增,群播式多媒體網路服務的興起更為新一代的網路環境帶來了全新的面貌。在光纖網路上,藉由高密度光波分工技術,單一光纖鏈結的頻寬得到了大幅度地提升,然而傳統的光通道卻有頻寬利用率低落的缺點。此外光通道對於快速動態提供連線以及支援群播技術的能力亦不純熟,漸漸地無法滿足新一代的網路服務趨勢。相較於光通道,光曳帶網路架構可以快速地建立多組連線且不需負擔光訊號交換所帶來的額外成本,自提出後便被視為是一個能有效運用高密度光波分工網路頻寬的傳輸架構。藉由支援子波長粒度,光曳帶能有效地提升單一波長的頻寬利用度。最重要的是,光曳帶與生俱來便有支援群播的優點。進一步考慮資料能在任意節點上由一個光曳帶聚合至另一個光曳帶,光曳帶儼然成為支援新一代群播式多粒度頻寬需求之光網路的主要考量。

    在本篇論文中,我們提出了一個在光曳帶網路上結合群播技術與流量聚合的動態群播繞徑演算法,稱為以光曳帶為基礎之群播繞徑演算法。針對靜態網路,我們提出了一組整數線性規畫公式以求得群播繞徑問題之最佳解。在動態網路方面,藉由在輔助圖模型上準確地標示出網路資源的分佈與狀態,我們可以更有效率地為群播要求進行路徑選取。在模擬實驗中,我們使用不同的網路拓樸與資源的參數設定以分析本篇論文所提出的方法,實驗得到的結果驗證了我們所設計的演算法所得到的結果能近似於最佳解,並且能夠充分的發揮光曳帶網路本身的特點。相較於過去文獻中提出的動態繞徑演算法,我們的方法可以大幅改善阻斷機率的表現。我們也驗證了光曳帶網路確實能夠支援現今多粒度動態頻寬需求與群播的網路環境。

    In recent years, because of the popularity of Internet and the rapid growth of multimedia applications, the requirements of bandwidth from users increase violently in optical networks. The variant multicast multimedia service also brings to the big challenges for next generation optical networks. As the rapid advance of DWDM, the bandwidth of a single fiber link is significantly improved. However, the traditional circuit switching architecture, lightpath, has the disadvantage with lower bandwidth utilization of a single wavelength. Besides, lightpath is not mature of fast provisioning for connections as well as the multicast property. Lightpath is seemed to become insufficient for the web service of next generation networks. Light-trail has been proposed as an efficient solution to support optical networks today. Compare with lightpath, a light-trail can establish multiple connections fast without optical switching. The support of sub-wavelength granularity in light-trial network increases the utilization of wavelength bandwidth effectively. The most important thing is that light-trail allows multiple node access the transmission channel. In a light-trail, the single send by one node will be received by the downstream nodes. In other words, light-trail has the advantage of natural multicasting. Further, if we take the property that the traffic can be groomed from one light-trail to other light-trails at any nodes into consideration; the light-trail obviously becomes a strong candidate to support the multicast and the multi-granularity bandwidth demands in the future networks.

    In this thesis, we propose a dynamic multicast routing algorithm with traffic grooming consideration in light-trail networks, named Dynamic Light-Trail-based Multicast Routing algorithm (DLTMR). For the static networks, we propose a set of ILP formulations to calculate the optimal solution for minimizing the number of established light-trails. In the dynamic networks, we can efficiently find a best route for each multicast request by using DLTMR. In the simulation, we use different network topologies and the variant limitation of network resource to verify that DLTMR can efficiently improve blocking performance in the light-trail networks. On the other hand, we also verify that the light-trails are suitable to support the multi-granularity bandwidth demand and multicasting.

    摘要 III Abstract V 誌謝 VII Acknowledgment VIII List of Tables X List of Figures XI Chapter 1 Introduction 1 Chapter 2 Background 4 2.1 The concept of light-trail 4 2.2 The control protocol 6 2.2.1 Setting up a light-trail 7 2.2.2 Setting up the connection in a light-trail 8 2.3 The node architecture for mesh networks 8 2.4 Strongly connected light-trail : SLiT 10 2.5 Traffic grooming in light-trail networks 12 Chapter 3 Related Work 13 3.1 Multicast routing in light-trail WDM networks 14 3.2 Tune-in light-trail : TILT 15 3.2.1 Node architecture for TILT 15 3.2.2 Auxiliary graphs for dynamic traffic grooming algorithm in TILT networks 17 3.2.3 Dynamic traffic grooming algorithm for TILT networks 20 3.3 Waveband switching light-trail 22 Chapter 4 The Proposed Scheme 27 4.1 Motivation and problem definition 27 4.2 The preprocessing for DLTMR 28 4.3 ILP formulations 29 4.4 The dynamic multicast routing algorithm with traffic grooming consideration 32 4.5 Summary for DLTMR 44 Chapter 5 Performance Evaluation 46 5.1 Simulation environment 47 5.2 The performance comparison for ILP and DLTMR 49 5.3 Numerical results 54 Chapter 6 Conclusion 60 Bibliography 61

    [1] A. S. Ayad, K. M. El Sayed, and S. H. Ahmed, “Efficient solution of the traffic grooming problem in light-trail optical networks,” in 11th IEEE Symposium on Computers and Communications (IEEE, 2006), pp. 622-627.
    [2] S. Balasubramanian, A.E. Kamal, A.K. Somani, “Network design in IP-Centric Light-Trail Networks,” Proc of the 2nd international conference on Broadband Networks (Broadnets), Boston, MA, USA, Oct 2005, vol. 1, pp. 41-50.
    [3] S. Balasubramanian and A. K. Somani, “Dynamic Survivable Network Design for Path Level Traffic Grooming in WDM Optical Networks,” IEEE GLOBECOM 2007.
    [4] S. Balasubramanian and A.K. Somani, “Traffic grooming in statistically shared optical networks.” IEEE Local Computer Networks, September 2006.
    [5] S. Balasubramanian, A. K. Somani, and A. E. Kamal, “Sparsely hubbed light-trail grooming networks,” IEEE Fourteenth International Conference on Computer Communications and Networks (ICCCN), San Diego CA, October 2005.
    [6] J. Feng, W. He and A. Somani, “Optimal Light-Trail design in WDM optical networks, Intl Conf on Communications, ” IEEE ICC 2004, Vol. 3, June 2004, pp.1699-1703.
    [7] P. Fishwick, SimPack Toolkit, http://www.cise.ufl.edu/~fishwick/simpack.html
    [8] A. Gumaste, “Light-Trail and Light-Frame architectures for optical networks.” Ph.D thsis, Fall 2003, EE UT-Dallas.
    [9] A. Gumaste and I. Chlamtac, “Light-Trails: An optical solution for IP transport, ” OSA Journal on Optical Networking, May 2004, pp.864-891.
    [10] A. Gumaste and I. Chlamtac, “Light-Trails: A novel conceptual framework for conducting optical communications,” IEEE HPSR 2003, June 2003, pp.251-256.
    [11] A. Gumaste and I. Chlamtac, “Mesh implementations of Light-trails: A solution to IP centric communication in the optical Domain,” IEEE ICCCN 2003, October 2003, pp.178-183.
    [12] A. Gumaste, S. Jain, and S. Q. Zheng, “SLiT: Strongly connected light-trail solution for cost efficient and dynamic optical network,” in Proc. 22nd IEEE/OSA Opt. Fiber Commun. Conf. OFC 2006, Anahiem, CA, 2006, JThB61.
    [13] A. Gumaste and S.Q. Zheng, “Next generation optical storage area networks: The Light-trails approach,” IEEE Communications Magazine, Vol. 43, Issue 3, March 2005, pp.72-19.
    [14] A. Gumaste and S. Q. Zheng, “Protection and restoration scheme for light-trail WDM ring networks,” Optical Network Design and Modeling Conference 2005, February 2005, pp.311-320.
    [15] Yan Li, J.-P. Wang, A. Gumaste, Yun Xu, and Yinlong Xu, “Multicast Routing in Light-trail WDM Networks,” IEEE GLOBECOM 2008, pp. 1-5.
    [16] S. Paul, “Multicasting on the Internet and its applications,” Kluwer Academic Publishers, Boston/London/Dordrecht, 1998.
    [17] R. Ramamurthy and B. Mukherjee, “Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks,” IEEE/ACM Transactions on Networking 2002, Vol. 10, Issue 3, June 2002, pp.351-367.
    [18] G. Robins and A. Zelikovsky, “Improved Steiner tree approximation in graphs,” Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 770-779, 2000.
    [19] Yabin Ye, H. Woesner and I. Chlamtac, “Traffic Grooming Techniques in Optical Networks,” IEEE BROADNETS, 2006. Octorber 2006, pp. 1-9.
    [20] Y. Ye, H. Woesner, R. Grasso, T. Chen and I. Chlamtac, “Traffic Grooming in Light Trail Networks,” IEEE GLOBECOM 2005, Vol 4, November 2005, pp.1957-1962.
    [21] W. Zhang, G. Xue and K. Thulasiraman, “Dynamic light-trail routing and protection issues in WDM optical networks,” IEEE GLOBECOM 2005, Vol4, November 2005, pp. 1963-1967.
    [22] H. Zhu, H. Zang, and B. Mukherjee, “Dynamic Traffic Grooming in WDM Mesh Networks Using a Novel Graph Model,” IEEE Globecom, 2006.
    [23] ILOG CPLEX 10.1 http://www.ieor.berkeley.edu/Labs/ilog_docs/html/index.html

    下載圖示 校內:2013-08-30公開
    校外:2013-08-30公開
    QR CODE