Responsive image
博碩士論文 etd-0903103-011106 詳細資訊
Title page for etd-0903103-011106
論文名稱
Title
一個能夠達到最短延遲時間的anycast路由協定
A Minimum Delay Anycast Routing Protocol
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
50
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2003-07-15
繳交日期
Date of Submission
2003-09-03
關鍵字
Keywords
任傳、路由協定、最小延遲時間
routing protocol, anycast, minimum delay, IPv6
統計
Statistics
本論文已被瀏覽 5807 次,被下載 3347
The thesis/dissertation has been browsed 5807 times, has been downloaded 3347 times.
中文摘要
IPv6(Internet Protocol Version 6) [6]在位址格式中新增加了anycast[5]的位址。在傳送anycast的封包時,若多個內容相同的伺服器擁有同一個anycast的位址,該anycast封包是送到離client最接近的伺服器中,因為離client最接近的伺服器,並不代表是delay time最小的伺服器,因此在這篇論文中,我們發表了一個針對anycast封包的通訊協定。在這個通訊協定中包含了兩個子協定。第一個子協定為建立routing table的子協定;第二個子協定為封包傳送的子協定。在建立routing table的子協定中,我們提出了一個新的方法,稱之為最短延遲時間路徑(minimum delay path method)。根據最短延遲時間路徑,我們可以得到從router到目的端最短延遲時間的路徑,若根據此路徑來傳送封包,則可得到比傳統方法較佳的QoS(Quality of Services)。在封包傳送的子協定中,我們提出一個最小延遲及負載平衡(minimum delay and load balancing)的方法。此方法最主要是根據目前所有伺服器的負載情況,及連接該伺服器的最短延遲時間路徑,來決定其中最適合傳送的伺服器及路徑。根據實驗的結果顯示出我們提出的方法可有效減少end-to-end delay及增加網路的throughput。
Abstract
Anycast is a new communication service defined in IPv6 (Internet Protocol Version 6) [6]. An anycast message is the one that should be delivered to the 'nearest' member in a group of designated recipients. The ‘nearest’ is not always the ‘best’ member. In this paper, we propose a routing protocol for anycast message. It is composed of two subprotocols: the routing table establishment subprotocol and the packet forwarding subprotocol. In the routing table establishment subprotocol, we propose a mininum delay path method (MDP). We get a minimum delay path from router to destination by MDP. In the packet forwarding protocol, we propose a minimum delay and load balancing method (MDLB). We dispatch traffic load to a server with minimum delay and light load by MDLB. The performance has demonstrated the benefits of MDP and MDLB in reducing end-to-end delay and increasing throughput of network.
目次 Table of Contents
摘要 i
Abstract ii
第一章 簡介 1
第二章 我們的方法 12
2.1 Routing Protocol概論 12
2.2 Routing Table Establishment Subprotocol 14
2.2.1 Candidate entries的建立 14
2.2.2 Updating Algorithm of TRACE message 15
2.2.3 Updating Algorithm of ACK message 17
2.2.4建立candidate entries 的演算法 19
2.2.5 Eligible Entries的選擇 20
2.2.6 Routing Table的建立 24
2.3 Packet Forwarding Subprotocol 24
2.3.1 Anycast entry之搜尋 24
2.3.2 Anycast entry之選擇 25
2.3.3 Anycast 封包之傳送 29
第三章 模擬結果 31
3.1 實驗一 31
3.2 實驗二 33
3.3 實驗三 36
3.4 實驗四 38
3.5 實驗五 41
3.6 實驗六 43
3.7 實驗七 46
第四章 結論 48
參考文獻 49
參考文獻 References
[1] E.W. Zegura, M.H. Ammar, Z. Fei, and S. Bhattacharjee,``Application-layer anycasting: a server selection architecture and use in a replicated Web service,' IEEE Trans. Networking., vol.~8, no.~4, pp.~455-466, Aug. 2000.

[2] W. Jia, G. Xu and W. Zhao, ``Integrated fault-tolerant multicast and anycast routing algorithms,'Proc. of IEE'00, vol.~147, no.~4, pp.~266-274 , Jul. 2000.

[3] D. Xu, and W. Jia,``Distributed admission control for anycast flows with QoS requirement,' Proc. of Distributed Computing System., vol.~8, no.~4, pp.~292-299, Apr. 2001.

[4] D. Xuan, W. Jia, W. Zhao, and H. Zhu, ``A routing protocol for anycast messages,' IEEE Trans. Parallel and Distributed Systems., vol.~11, no.~6, pp.~571-588, Jun. 2000.

[5] C. Partridge, T. Mendez, and W. Milliken, Host Anycasting Service, RFC1546, IETF and IESG, Nov. 1993.

[6] S. Deering and R. Hinden, Internet Protocol Version 6 (IPv6) Specification, RFC 2460, IETF and IESG, Dec. 1998.

[7] H. Bettahar, A. Bouabdallah, ``A new approach for delay-constrained routing,' Computer Communications, vol.~25, pp.~1751-1764 , Dec. 2002.

[8] M. Yamamoto, H. Miura, K. Nishimura and H. Ikeda, ``A network-supported server load balancing method: active anycast,' IEICE Trans. Communications., vol.~E84-B, no.~6, pp.~1561-1568, Jun. 2001.

[9] D.G. Thaler and C.V. Ravishankar, ``Distributed center-location algorithms,' IEEE Trans. Selected Areas in Communications., vol.~15, no.~3, pp.~291-303, Apr. 1997.

[10] A. Ariza, E. Casilari and F. Sandoval, ``Strategies for updating link states in QoS router,' Electronics Letter., vol.~36, no.~20, pp.~1749-1750, Sep. 2000.

[11] OPNET Technologies, Inc., OPNET Modeler 7.0.B,Bethesda, MD, Jun. 2000.

[12] K. Mase, A. Tsuno, Y. Toyama, and N. Karasawa,``A Web server selection algorithm using QoS measurement,'Proc. of ICC'01, vol.~8,pp.~2332-2336, Helsinki, Finland, Jun. 2001.

[13] R.L. Carter and M.E. Crovella,``Server selection using dynamic path characterization in wide-area networks,'Proc. of INFOCOM'97, vol.~3, pp.~1014-1021, Kobe, Japan, Apr. 1997.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內外都一年後公開 withheld
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code