원문정보
한국인터넷방송통신학회
The International Journal of Advanced Smart Convergence
Volume 5 Number 3
2016.09
pp.47-55
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Router main task is to provide routing of Internet Protocol (IP) packets. Routing is achieved with help of the IP lookup. Router stores information about the networks and interfaces in data structures commonly called as routing tables. Comparison of IP from incoming packet with the IPs stored in routing table for the information about route is IP Lookup. IP lookup performs by longest IP prefix matching. The performance of the IP router is based on the speed of prefix matching. IP lookup is a major bottle neck in the performance of Router. Various algorithms and data structures are available for IP lookup. This paper is about reviewing various tree based structure and its performance evaluation.
목차
Abstract
1. Introduction
2. IPv6
2.1 IPv6 Header
2.2 Address Prefix:
2.3 Address Types:
3. IPv6 Routing
3.1 IPv6 Forwarding Process
3.2 Routing Table
3.3 Router IP Lookup
4. Data Structure and Algorithms
4.1 Requirements for Algorithms
4.2 Binary Tries
4.3 Path Compressed Tire
4.4 Prefix Expanded Trie
4.5 Fixed Stride Multibit Trie
5. Conclusions
6. Acknowledgements
References
1. Introduction
2. IPv6
2.1 IPv6 Header
2.2 Address Prefix:
2.3 Address Types:
3. IPv6 Routing
3.1 IPv6 Forwarding Process
3.2 Routing Table
3.3 Router IP Lookup
4. Data Structure and Algorithms
4.1 Requirements for Algorithms
4.2 Binary Tries
4.3 Path Compressed Tire
4.4 Prefix Expanded Trie
4.5 Fixed Stride Multibit Trie
5. Conclusions
6. Acknowledgements
References
저자정보
참고문헌
자료제공 : 네이버학술정보