Responsive image
博碩士論文 etd-0706100-145003 詳細資訊
Title page for etd-0706100-145003
論文名稱
Title
IPv6路由搜尋演算法的探討
On the Routing Lookup Algorithm for IPv6
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
53
研究生
Author
指導教授
Advisor
召集委員
Convenor

口試委員
Advisory Committee
口試日期
Date of Exam
1999-07-22
繳交日期
Date of Submission
2000-07-06
關鍵字
Keywords
路由搜尋
Routing Lookup, IPv6
統計
Statistics
本論文已被瀏覽 5658 次,被下載 2450
The thesis/dissertation has been browsed 5658 times, has been downloaded 2450 times.
中文摘要
近年來由於網路規模的持續成長,衍生了許多問題。首先IP位址的數量在未來將不敷使
用,在這方面則是以位址長度為128位元長的IPv6取代現行長度為32位元長的IPv4。
再者,路由器成了網路速度的瓶頸,因此有許多的路由搜尋演算法產生以加速路由器的
處理速度。
1998年7月新版的RFC定義了詳細的IPv6位址格式,這使得原先在IPv4上討論的路由搜尋
演算法可以擴展至IPv6上討論。本篇論文是在討論IPv4的路由演算法在IPv6上的性能。
第一章為簡介。第二章相關文獻介紹現行IPv6的位址格式及IPv4上的路由搜尋演算法。
第三章介紹我們所修改的IPv6路由搜尋演算法。第四章介紹測試數據的設計及程式模擬
結果。第五章為總結。
Abstract
As the Internet grows, there are several problems needed be solve. First, the IP addresses will be exhausted.
The 128 bits IPv6 addresses will replace the 32 bits IPv4 addresses to solve the problem. Secondly,
routers become the bottlenecks of networks. There are many routing lookup algorithms to improve
routers' performance.
In July 1998, the detail address formats of IPv6 are defined by the IETF in RFC 2373, 2374 and 2375.
These definitions make the discussion of routing lookup algorithms from IPv4 to IPv6 become possible.
This paper focuses on the scalability of performing those IPv4 routing lookup algorithms for IPv6.
The paper also proposals a new IPv6 lookup algorithm based on the characteristics of the IPv6 address
formats. Chapter 1 is introduction. Chapter 2 introduces the current IPv6 addressing types and reviews
previous work on IPv4. Chapter 3 presents our modified IPv6 routing lookup algorithm.
Chapter 4 describes the generation of the test patterns for IPv6 lookups and presents the simulation
results. Chapter 5 concludes this paper.
目次 Table of Contents
第一章 簡介
第二章 相關文獻
第三章 Modified Memory Access Algorithm for IPv6
第四章 Test Pattern Design And Simulation Result
第五章 Conclusion and Future Work
Reference
參考文獻 References
[1] V. Fuller, T. Li, J. Yu, "Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy", RFC 1519, Sept. 1993
[2] R. Hinden, S. Deeromg, "IP Version 6 Addressing Architecture", RFC 2373, Jul. 1998
[3] R. Hinden, M. O'Dell, S. Deering, "An IPv6 Aggregatable Global Unicast Address Format", RFC 2374, Jul. 1998
[4] R. Hinden, S. Deering, "IPv6 Multicast Address Assignments", RFC 2375, Jul. 1998
[5] Willibald Doeringer, Mechdi Nassehi, "Routing on Longest-Matching Prefixes", IEEE/ACM Trans. On Network, vol.4, No. 1, Feb. 1996, pp.86-96
[6] Anthony J. McAuley, Paul F. Tsuchiya, Daniel V. Wilson, "Fast Routing Table Lookup Using CAM", IEEE INFOCOM 1993, Vol. 3, pp1382-1391
[7] Tzi-cker Chiueh, and Prashant Pradhan, "High-Performance IP Routing Table Lookup Using CPU Caching", IEEE INFOCOM 1999, Section 10C-2
[8] Peter Newman, Greg Minshall, Larry Huston, "IP Switching and Gigabit Routers", IEEE Communications Magazine, January 1997, pp.64-69
[9] Pankaj Gupta, Steven Lin, Nick McKeown, "Routing Lookups in Hardware at Memory Access Speeds", IEEE INFOCOM 1997, Session 10B-1
[10] Marcel Waldvogel, George Varghese, Jon Turner, Bernhard Plattner, "Scalable High Speed IP Routing Lookups", ACM Sigcomm 97, Vol. 27, No. 4, pp.25-36
[11] Butler Lampson, V. Srinvasan, George Varghese, "IP Lookups using Multiway and Multicolumn Search", IEEE INFOCOM 1998, Session 10B-2
[12] Mickael Degermark, Andrej Brodnik, Svante Carlsson, Stephen Pink, "Small Forwarding Tables for Fast Routing Lookups", ACM SIGCOMM 1997, Vol. 27, No. 4, pp.3-14
[13] V. Srinivasan, George Varghese, "Faster IP Lookups using Controlled Prefix Expansion", Sigmetrics 1998,
[14] Michigan University and Merit Network. Internet Performance Management and Analysis(IPMA) Project. http://nic.merit.edu/ipma
[15] IPv6 Resource Center, http://www.cs-ipv6.lancs.ac.uk/ipv6/6Bone/
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內校外完全公開 unrestricted
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


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

QR Code