ScholarLens Back to search
2008•Jisuanji gongcheng yu shejiRequires access

IPv6 routing lookup algorithm based on LFT and DAG

Lei Yang

Open publisher page 0 citations

Abstract

With constant development of network,the information of router table increase constantly.This would affect efficiency of routing transit and network speed.By the analysis on standard of routing algorithm's good or bad and now available IPv4 and the IPv6 routing algorithm,especially architectural of LFT(level forwarding table) and DAG(directed acyclic graph),a routing algorithm synthesized merits of LFT,DAG and LC Trie(level-compressed Trie),and then another algorithm,the main data structure and the running flow diagram of this algorithm is brought forward,which algorithm improved routing lookup efficiency.

About this research paper

What this paper is about

With constant development of network,the information of router table increase constantly.This would affect efficiency of routing transit and network speed.By the analysis on standard of routing algorithm's good or bad and now available IPv4 and the IPv6 routing algorithm,especially architectural of LFT(level forwarding table) and DAG(directed acyclic graph),a routing algorithm synthesized merits of LFT,DAG and LC Trie(level-compressed Trie),and then another algorithm,the main data structure and the running flow diagram of this algorithm is brought forward,which algorithm improved routing lookup efficiency.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

With constant development of network,the information of router table increase constantly.This would affect efficiency of routing transit and network speed.By the analysis on standard of routing algorithm's good or bad and now available IPv4 and the IPv6 routing algorithm,especially architectural of LFT(level forwarding table) and DAG(directed acyclic graph),a routing algorithm synthesized merits of LFT,DAG and LC Trie(level-compressed Trie),and then another algorithm,the main data structure and the running flow diagram of this algorithm is brought forward,which algorithm improved routing lookup efficiency.

Key concepts: Computer science, Routing table, Static routing, Algorithm, Directed acyclic graph, Trie, Enhanced Interior Gateway Routing Protocol, Dynamic Source Routing

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
IPv6 routing lookup algorithm based on LFT and DAG — Research Paper | ScholarLens