Efficient routing table lookup for IPv6

Zitterbart, Martina; Harbaum, Till; Meier, D.; Brökelmann, Dieter

doi:10.1109/hpcs.1997.864020

Cited by 5 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Subdividing the IP address into portions is also proposed in Zitterbart et al (1997). Each node within a binary tree represents a part of the address and the corresponding portion of the subnet mask is associated with that node.…”

Section: (I) Table Lookup With Camsmentioning

confidence: 99%

High–performance routing–table lookup

Zitterbart

2000

Philosophical Transactions of the Royal Society of London. Seri

View full text Add to dashboard Cite

The dramatic performance increase observed in the Internet over the last couple of years requires considerably enhanced router technology in order to provide the view of an e¯cient global network to applications and users. Improvements are needed with respect to data rate but also considering router functionality, for example, to support Quality of Service for multimedia applications. This paper gives a brief overview of some aspects related to router design in general and to route lookup in more detail. Several actual approaches to increase route lookup performance are introduced.

show abstract

Section: (I) Table Lookup With Camsmentioning

confidence: 99%

High–performance routing–table lookup

Zitterbart

2000

Philosophical Transactions of the Royal Society of London. Seri

View full text Add to dashboard Cite

show abstract

“…In fact, the 128-bit IPv6 address poses a great challenge to the previous LPM algorithms [2], because previous algorithms were particularly designed for 32-bit IPv4 address, and had poor scalability to the length of IP address. The popular trie-based algorithms, for example, such as DIR-21-3-8 [ [4][5][6][7]. [4] is a multibit trie algorithm, its performance is improved compared to the unibit trie because it inspects several bits every stride.…”

Section: Introductionmentioning

confidence: 99%

“…The popular trie-based algorithms, for example, such as DIR-21-3-8 [ [4][5][6][7]. [4] is a multibit trie algorithm, its performance is improved compared to the unibit trie because it inspects several bits every stride. Its storage requirement, however, is still too massive and its lookup performance is still decreased compared to its application in IPv4 due to the longer IP address of IPv6.…”

Section: Introductionmentioning

confidence: 99%

Decision Tree Based Algorithm for IPv6 Routing Table Lookup

Zhang

2006

2006 International Conference on Communication Technology

View full text Add to dashboard Cite

The next generation Internet Protocol, IPv6, has attracted growing attention and has been deploying worldwide, especially in Europe, Asia, and North America. With 128-bit address, IPv6 provides an extremely large address space and poses a great challenge to the routing table lookup algorithms. The previous algorithms need reconsideration. An IPv6-specific longest prefix matching (LPM) scheme called DTLU (Decision Tree LookUp) is introduced is this paper. By dividing route prefixes into chunks, the scheme converts the IPv6 LPM problem to the multi-dimensional packet classification problem and then uses the decision tree to conquer the classification problem. Moreover observations are made on the real live IPv6 backbone BGP routing tables and on the converted classifiers. Then the observations are used to enhance the basic DTLU. DTLU supports incremental updates and only needs tens of kilobytes memory for the current real live IPv6 backbone BGP routing tables. The evaluation results show that the sample software implementation of DTLU can achieve more than 10 million lookups per second on a PC with Pentium4 2.4GHz CPU, 512M DDR333 memory, and Linux operating system.

show abstract

Layer 4+ switching with QoS support for RTP and HTTP

Harbaum

Zitterbart²,

Griffoul³

et al.

Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042)

Self Cite

View full text Add to dashboard Cite

This paper provides an overview over current approaches and applications of layer 4 switching (L4Sw) and outlines a scheme for QoS support based on layer 4 and higher layer information. Today, L4Sw is mainly used for filtering in the context of firewalls. Additionally L4Sw has the potential of introducing per flow QoS support without the need for complex out-of-band signaling. We used traffic measurements on a real router to determine which higher layer protocols generate the most traffic and should therefore be investigated first. From the measurements it is obvious, that HTTP is the most important candidate. Experiments on extracting TCP and HTTP information demonstrated the feasibility of Layer4+QoS support with respect to processing power and storage capacity demands of intermediate systems. In addition to the TCP-based HTTP protocol, future investigations will be done for RTP as a key protocol for multimedia traffic.

show abstract

Efficient routing table lookup for IPv6

Cited by 5 publications

References 7 publications

High–performance routing–table lookup

High–performance routing–table lookup

Decision Tree Based Algorithm for IPv6 Routing Table Lookup

Layer 4+ switching with QoS support for RTP and HTTP

Contact Info

Product

Resources

About