淡江大學機構典藏:Item 987654321/114800
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62805/95882 (66%)
造訪人次 : 3993498      線上人數 : 298
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/114800


    題名: 基於軟體定義網路之品質感知多服務類型路由方法
    其他題名: An SDN-based quality aware routing mechanism for various service
    作者: 陳柏瑋;Chen, Po-Wei
    貢獻者: 淡江大學電機工程學系碩士班
    李維聰;Lee, Wei-Tsong
    關鍵詞: SDN;多服務類型;路由演算法;various services;routing algorithm
    日期: 2017
    上傳時間: 2018-08-03 15:04:27 (UTC+8)
    摘要: 近年來網際網路快速的成長和發展,越來越多的網路應用及服務也漸漸出現在日常生活中,隨著服務的發展,大家也開始注重服務的品質及體驗,於是Internet Engineering Task Force (IETF)提出了Quality of Service(QoS) 來完成品質保證,但QoS架構中提出的兩種服務品質保證方法IntServ、Diffserv受限於傳統網路的架構,都是基於傳統的hop-by-hop routing,無法對整體網路資源做有效率的利用,而且無法依據不同服務類型來滿足特定需求的頻寬、延遲和抖動。例如:根據經驗和研究,串流的要求主要有足夠的頻寬,較低的延遲,較低的抖動,幾乎不會遺失封包,才能讓整體串流順暢;而語音服務則是需要低延遲、低抖動、但不需要太大頻寬,若有dejitter buffer會讓整體服務較不受抖動影響,但是也會升高延遲,而延遲會在對話上造成困擾;線上遊戲服務需要低延遲、低抖動,但是實際需要的資料傳輸量並不大;而一般檔案傳輸只需要足夠的頻寬即可,只要延遲和抖動不是極端的狀態就不會有太大影響。
    而最近興起的SDN概念可以有效解決傳統架構的問題,OpenFlow協議下的SDN是一個擁有方便管理、高效率、可適應性、高動態性等優點的新網路架構,SDN將整體網路架構分成控制層和轉發層,switch只做轉發功用,剩下的控制全部交由controller處理,彼此之間透過OpenFlow協議溝通,經由這樣集中式的控制器管理,可以有效進行軟體控制,感知整體網路中交換器的連結狀態,進而提供良好的路由控制,選擇出網路拓樸中的最佳路徑來傳遞封包。而在許多的最短路徑演算法中,Dijkstra’s Shortest Path Algorithm被認為是一種簡單明瞭,又能求出最佳解的演算法,此演算法從某一節點出發,利用路徑不同的權重,建立起一個最短路徑樹,以此迅速計算出結果。
    因此,本篇論文綜合以上概念,建立一個機制,針對不同服務類型所注重的參數來計算路徑權重,並利用Dijkstra’s Shortest Path Algorithm計算結果,在有限資源的環境下,提供最符合各類服務品質需求的路由。
    Best-effort delivery mechanism is no longer fulfilling the needs of growing internet requirements, Internet Engineering Task Force (IETF) therefore announced Quality of Service (QoS) to relieve the intense network. However, those two service insurance methods (IntServ, Diffserv) of QoS are still basing on conventional hop-by-hop routing, which requires massive facilities to fulfill rush hours, but mostly idling on off-peak time. Besides, those improvements cannot specifically match every kind of internet services by various conditions, such as bandwidth, delay and jitter. According to experiments, we know that Streaming services need sufficient bandwidth、low delay、low jitter and low loss rate; Voice services need low delay、low jitter,but Voice service does not need much bandwidth, if it has a dejitter buffer, it can reduce the jitter, but increase the delay; Gaming services need low delay and low jitter, but jitter is the most serious impact on the game experience; data transmission services just need sufficient bandwidth.
    The developing SDN is therefore presenting to solve this issue effectively. Under the OpenFlow standard, SDN is a novel networking structure, which is considering as highly efficient, adaptive, and easy to be altered and managed. SDN contains control layer and transmission layer, transmissions are handled by switch and the controller processes the rest of the control progresses, and OpenFlow standard is used for communications between controllers and network devices. Centralized controller management can therefore achieve an effective software control. Sensing the connecting status of switches further to provide efficient routing control i.e. transmitting packages by the best path in the network topology. Among various routing algorithms, Dijkstra’s Shortest Path Algorithm is considering as a simple but very efficient algorithm. This algorithm calculates routing weight from nodes to nodes to build best routing tree and to acquire the routing result quickly.
    This work makes a combination of all those conditions and conceptions above, creates alternative routing mechanisms to process different networking services. And by Dijkstra’s Shortest Path Algorithm to calculate proper routing, this work would be therefore achieve the multi-services quality insurance control based on SDN.
    顯示於類別:[電機工程學系暨研究所] 學位論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML131檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋