City University of Hong Kong

CityU Institutional Repository >
3_CityU Electronic Theses and Dissertations >
ETD - Dept. of Computer Engineering and Information Technology  >
IT - Master of Philosophy  >

Please use this identifier to cite or link to this item:

Title: Algorithms design for IPv6 address lookup and packet classification
Other Titles: Hu lian wang xie yi di liu ban de wei zhi sou xun ji feng bao bian shi de suan fa she ji
Authors: Li, Yiu Keung (李耀強)
Department: Department of Computer Engineering and Information Technology
Degree: Master of Philosophy
Issue Date: 2005
Publisher: City University of Hong Kong
Subjects: Internet addresses
Packet switching (Data transmission)
TCP/IP (Computer network protocol)
Notes: vii, 129 leaves : ill. ; 30 cm.
Thesis (M.Phil.)--City University of Hong Kong, 2005
Includes bibliographical references (leaves 123-129)
CityU Call Number: TK5105.875.I57 L56 2005
Type: Thesis
Abstract: In addition to the conventional 1-D address lookup used to determine the next-hop of an incoming packet, an IP router is also required to perform multi-field packet classification in order to support advanced functions, such as network security, quality of service, and virtual private network etc. Many algorithmic and Ternary Content Addressable Memory (TCAM) based approaches have been published for the address lookup and packet classification problems. In general, software implementations are suitable for low-end routers, whereas hardware search engines are employed in high-end routers that demand a very high packet-processing rate. Most of the existing algorithmic methods for address lookup exploit the characteristics of IPv4 routing tables to speed up the processing rate. The adoption of IPv6 with 128-bit addresses poses great challenges to the existing methods. In this research, we investigate the necessary modifications and extensions to several well-known address lookup algorithms for application to IPv6. It is found that a hybrid method that combines level-compressed trie with hashing will give the best performance. Multi-field packet classification is a much harder problem compares to the 1-D address lookup. TCAM-based approach is the dominant solution used in the industry. With the adoption of IPv6, the cost of TCAM-based search engine is jet up while the efficiency is degraded. In this research, we develop a novel encoding scheme, called prefix inclusion coding (PIC), which can compress a 5-tuple 296-bit IPv6 filter to 72 bits (or even 36 bits for classifiers with up to a few thousands filters). Hence, the overall TCAM storage requirement can be reduced by 90%.
Online Catalog Link:
Appears in Collections:IT - Master of Philosophy

Files in This Item:

File Description SizeFormat
abstract.html164 BHTMLView/Open
fulltext.html164 BHTMLView/Open

Items in CityU IR are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0!
DSpace Software © 2013 CityU Library - Send feedback to Library Systems
Privacy Policy · Copyright · Disclaimer