博碩士論文 etd-0729103-120118 詳細資訊


[回到前頁查詢結果 | 重新搜尋]

姓名 林言(Yen Lin) 電子郵件信箱 E-mail 資料不公開
畢業系所 電機工程學系研究所(Electrical Engineering)
畢業學位 碩士(Master) 畢業時期 91學年第2學期
論文名稱(中) 具有多重侵占機制用以支援動態頻寬保留的協調式RSVP
論文名稱(英) A Negotiable RSVP with Multiple Preemption for supporting Dynamic Bandwidth Reservation
檔案
  • etd-0729103-120118.pdf
  • 本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
    請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
    論文使用權限

    電子論文:校內一年後公開,校外永不公開

    論文語文/頁數 中文/59
    統計 本論文已被瀏覽 5094 次,被下載 12 次
    摘要(中) 在RSVP的協定下,當提出頻寬保留的使用者很多,而網路的資源又不足時,這時候較晚提出保留請求的flow便很容易因為剩餘頻寬的不足而遭到拒絕,因此在本論文中,我們提出一個可以支援動態頻寬保留,並且具有多重侵占機制的協調式RSVP,此機制具有可協調以及多重侵占等特性,並且可以藉由這些特性來達到頻寬的重新分配,使優先權較高的flows獲得頻寬的保證。
    有別於原來的RSVP,協調式RSVP增設了優先權機制與上下限彈性頻寬等參數,並利用Resv Messages來傳送這些參數,使得每個提出請求的新flow都具有其個別的優先權等級,當目前的資源保留狀況顯示剩餘頻寬不足時,新的flow將可以依據自己擁有的優先權,對優先權比自己低的已保留flows作協調,估計它們所釋放出來的部分頻寬加上目前的剩餘頻寬的總和,是否滿足新flow的下限頻寬值,若可以滿足下限頻寬值,便可以知道這次的頻寬請求是成功的,根據釋放的頻寬大小,新flow最多可以取得上限頻寬值,若是得到的頻寬小於下限頻寬值,則表示這次的請求並沒有成功。
    本論文採用程式模擬以及實作來證明協調式RSVP的效能與可行性,我們模擬傳統的RSVP以及協調式RSVP,並且將它們兩者的模擬結果做比較,我們發現不論是保留成功的機率或是單位時間裡可保留的最大flow數,協調式RSVP都勝過傳統的RSVP。在實作方面,我們在FreeBSD平台上實作出協調式RSVP,並且藉由實驗來測試實作的協調頻寬能力,證明它確實可以達到我們預期的成果。
    摘要(英) In this Thesis, we propose a Negotiable RSVP with Multiple Preemption for supporting dynamic bandwidth reservation. With the properties of negotiation and preemption, we can re-allocate bandwidth to effectively increase the probability of successful reservations of flows with higher priority.
    Different from RSVP, negotiable RSVP uses a priority mechanism with many parameters, such as upper-bound bandwidth and upper-bound priority. Negotiable RSVP transmits these parameters by sending Resv Messages such that every RSVP flow possesses individual priority levels. When the available bandwidth is not enough, the arriving new flows can negotiate with the existing reserved flows that have lower priorities. We then estimate the sum of the available bandwidth and the preemptive bandwidth from the reserved flows. If the sum satisfies the lower-bound bandwidth of the arriving new flow, the reservation is successful. At the best case, if the sum can meet its high-bound bandwidth, the system can reserve the high-bound bandwidth for the flow. However, if the sum is lower than its low-bound bandwidth, it will be rejected.
    To demonstrate the efficiency and feasibility of negotiable RSVP, we build two simulation models, RSVP and Negotiable RSVP, respectively, and compare their simulation results. We have shown that negotiable RSVP can perform better than RSVP in many ways. For example, the probability of successful reservation and the number of reserved flows are significantly increased. We also implement the negotiable RSVP on FreeBSD platform, and measure the percentages of improvements through various experiments.
    關鍵字(中)
  • 優先權
  • 動態頻寬保留
  • 協調式RSVP
  • CBQ
  • 多重侵占機制
  • 關鍵字(英)
  • Multiple Preemption
  • Negotiable RSVP
  • Priority
  • Dynamic Bandwidth Reservation
  • CBQ
  • 論文目次 第一章 導論………………………..…………………………………………………1
    1.1 研究動機…………….………………………………………………………1
    1.2 研究方法……..…………………………………………………………….2
    1.3 論文架構…………………………………………………………………….3
    第二章 資源保留技術概述…………………………………………………………..4
    2.1 整合式服務(Integrated Service)……………………………………………4
    2.1.1 網路上的應用程式…………………………………………………..4
    2.1.2 IS定義的QoS服務規格……………….……………………………5
    2.1.3 IS model的實作參考架構………………………………………….5
    2.2資源保留協定(RSVP)的簡介……………………………………………...7
    2.2.1 RSVP的主要功能………………...………………………………….7
    2.2.2 RSVP的控制訊息………………….………………………………...7
    2.2.3 RSVP的建立流程……………………………………………………8
    2.2.4 RSVP的資源保留型態..……………..………………………………9
    2.3 RSVP網路上的priority相關研究………………………………………...10
    2.3.1網路上設立priority的原因………………………………………..10
    2.3.2 priority的定義與機制………………...…………………………….12
    2.3.3相關研究的綜合比較……………………………………………….14
    2.3.4協商式RSVP機制………………………………………………….16
    第三章 具多重侵占機制的協商式RSVP………….………………………………17
    3.1協商式RSVP…………………….………………..………………………...17
      3.1.1 協商式RSVP與原有RSVP的比較………………………………..17
      3.1.2 協商式RSVP的參數說明…………….…………….……………...18
    3.2 協商式RSVP的演算法 (Negotiable RSVP Algorithms)…………...…….20
    3.2.1 協商式演算法的作用………………………………………………20
    3.2.2 協商式演算法的運作流程………………………………………....20
    3.2.3 具多重侵占機制的協商式RSVP實例…………………………….25
      3.3 協商式RSVP的延伸功能………………………………………………....29
        3.3.1 加入Non_negotiation flow的機制…………………………………29
        3.3.2 增加可以處理多個同時請求的機制………………………………30
        3.3.3 可使用Kbps為保留單位的延伸功能...…………………………...31
    第四章 模擬結果與系統實作……………………………………………………....32
    4.1 模擬架構簡介……………………………………………………………...32
      4.1.1 協商式RSVP的模擬……………………………………………….33
    4.2協商式RSVP的系統實作………………………………………………….37
      4.2.1 協商式RSVP的模組介紹………………………………………….37
      4.2.2 協商式RSVP的實作部分………………………………………….39
      4.2.3 協商式RSVP的延伸功能………………………………………….41
    4.3實驗結果與分析……………………………………………………….…...42
    4.3.1 測試協商式RSVP的多重侵占功能……………………………….42
    4.3.2 測試Non_Negotiation flow機制…………………………………...45
    4.3.3 測試可以處理多個同時請求的機制………………………………47
    4.3.4 測試可使用Kbps為保留單位的延伸功能………………………..49
    第五章 結論與未來發展工作………………………………………………………51
    5.1 結論………………………………………………………………………...51
    5.2 未來發展工作…………………………………………………………...…52
    參考文獻(References)……….…………………………………………………...…..53
    索引(Index)…………………………………………………………………………..56
    參考文獻 [1] R. Braden, D. Clark, and S. Shenker, "Integrated Services in the Internet Architecture: an Overview", RFC 1633, June 1994.
    [2] T. Li and Y. Rekhter, "A Provider Architecture for Differentiated Services and Traffic Engineering (PASTE)", RFC2430, October 1998.
    [3] S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, "An Architecture for Differentiated Services", RFC 2475, December 1998.
    [4] K. Nichols, S. Blake, F. Baker, and D. Black, "Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers", RFC2474, December 1998.
    [5] R. Braden, L. Zhang, S. Berson, S. Herzog, and S. Jamin, "Resource ReSerVation Protocol (RSVP) --Version 1 Functional Specification", RFC 2205, September 1997.
    [6] R. Braden, D. Estrin, S. Berson, S. Herzog, and D. Zappala, "The Design of the RSVP Protocol", USC/Information Science Institute Final Report, 27 May 1993 - 30 June 1995.
    [7] L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala, "RSVP: a new Resource ReSerVation Protocol", IEEE Network, September 1993.
    [8] J. Wroclawski, "Specification of the Controlled Load Quality of Service", RFC 2211, September 1997.
    [9] S. Shenker, C. Partridge, and R. Guerin, "Specification of the Guaranteed Quality of Service", RFC 2212, September 1997.
    [10] Yee-Hsiang Chang, David Coggins, Daniel Pitt, David Skellern, Manu Thapar, and Chandra Venkatraman, "An Open-Systems Approach to Video on Demand", IEEE COMMUNICATIONS MAGAZINE, May 1994.
    [11] S. Shenker and J. Wroclawski, "General Characterization Parameters for Integrated Service Network Elements", RFC 2215, September 1997.
    [12] S. Shenker and J. Wroclawski, "Network Element QoS Control Service Specification Template", RFC 2216, September 1997.
    [13] Daniel Zappala, "RSRR: a Routing Interface for RSVP", Internet Draft, IETF, July 1998.
    [14] J. Wroclawski, "The Use of RSVP with IETF Integrated Services", RFC 2210, September 1997.
    [15] S. Shenker and L. Breslau, "Two Issues in Reservation Establishment", Proceedings of ACM SIGCOMM '95.
    [16] R. Braden and L. Zhang, "Resource ReSerVation Protocol (RSVP) -- Version 1 Message Processing Rules", RFC 2209, September 1997.
    [17] P. Pan, H. Schulzrinne, and R. Guerin, "Staged Refresh Timers for RSVP", Internet Draft, November 1997.
    [18] G. Mamais, M. Markaki, G. Politis, and I.S. Venieris, "Efficient buffer management and scheduling in a combined IntServ and DiffServ architecture: a performance study", ICATM '99, Page(s): 236 –242, 1999.
    [19] K.J. Loh and K.C. Chua, "A simple packet scheduling and buffer management scheme for scalable support of QoS in the Internet", Eight International Conference on Computer Communications and Networks, Page(s): 276 –281, 1999.
    [20] Longsong Lin, Mingshou Liu, and Lih-Chau Wuu, "Resource reservation and packet scheduling for prioritized delay-bounded multicast", ICON 2000, Page(s): 341 –345, 2000.
    [21] S. Deering, "Host Extensions for IP Multicasting", RFC 1112, August 1989.
    [22] W. Fenner, "Internet Group Management Protocol, Version 2", RFC 2236, November 1997.
    [23] Sally Floyd and Van Jacobson, "Link-sharing and Resource Management Models for Packet Networks", IEEE/ACM Transactions on Networking, vol. 3 No. 4, August 1995.
    [24] S. Floyd and M. F. Speer, "Experimental Results for Class-Based Queuing", unpublished manuscript, November 1998.
    [25] USC Information Sciences Institute, "ISI RSVP Daemon Release 4.2a4", http://www.isi.edu/div7/rsvp/release.html, August 1998.
    [26] R. Braden and D. Hoffman, "RAPI -- An RSVP Application Programming Interface Version 5", Internet Draft, February 1999.
    [27] Kenjiro Cho, "ALTQ -- Version 3.0 (Alternate Queueing for BSD UNIX) ", http://www.csl.sony.co.jp/person/kjc/programs.html, December 2000.
    [28] Kenjiro Cho, "The Design and Implementation of the ALTQ Traffic Management System", doctoral dissertation, Keio University, January 2001.
    [29] 陳鴻志 and 孫雅麗, "On the design and implementation of RSVP over ATM", 國立台灣大學資管所碩士論文, June 1998.
    [30] Chen-Yu Wang, Ce-Kuen Shieh, and Wen-Shyang Hwang, "An Alternative Approach To RSVP-aware MBone Applications", 國立成功大學電機所碩士論文, June 2001.
    口試委員
  • 謝錫堃 - 召集委員
  • 賴威光 - 委員
  • 黃仁竑 - 委員
  • 黃崇明 - 委員
  • 許蒼嶺 - 指導教授
  • 口試日期 2003-06-26 繳交日期 2003-07-29

    [回到前頁查詢結果 | 重新搜尋]


    如有任何問題請與論文審查小組聯繫