Efficient partition based IPv6 lookup algorithm for packet forwarding

Author

Al-Khaffaf, Bassam A. ; Karuppiah, E.K. ; Abdulah, R.

Author_Institution

Sch. of Comput. Sci., Universiti Sains Malaysia, Penang, Malaysia

Volume

1

fYear

2003

fDate

21-24 Sept. 2003

Firstpage

238

Abstract

Due to the rapid growth of the Internet and increasing address needs, IPv4 addresses are fast depleting. A new Internet addressing protocol, IPv6 with wide range of addresses has been proposed to replace the existing IPv4. Hence, the backbone routers need to maintain larger IPv6-based lookup tables with relevant forwarding information to the next hops. Since the destination address fields of the IPv6 packet is 128 bits each, this means that the lookup table need to maintain up to 2128 entries. Normal linear lookup method is not suitable, in terms of time and memory consumption, for the lookup operation. In this paper we proposed an efficient partition based scheme compared to existing method of Chang and Lim with software implementation [R.C. Chang et al., 2001].

Keywords

Internet; packet switching; table lookup; telecommunication network routing; transport protocols; 128 bit; 1Pv6 lookup algorithm; CIDR; IPv4; Internet addressing protocol; backbone routers; classes interdomain routing; classless interdomain routing; normal linear lookup method; packet forwarding; partition prefix; redundant partition prefixes; route flapping; software implementation; Computer science; Fluctuations; Internet; Operating systems; Partitioning algorithms; Routing protocols; Software performance; Software systems; Spine; Table lookup;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 2003. APCC 2003. The 9th Asia-Pacific Conference on

Print_ISBN

0-7803-8114-9

Type

conf

DOI

10.1109/APCC.2003.1274350

Filename

1274350