A method to quickly search and update IPv6 routing list

A table lookup and routing technology, applied in the field of computer networks, can solve problems such as difficulties and poor update efficiency, and achieve the effect of improving efficiency

Inactive Publication Date: 2007-05-16
烟台惠通网络技术有限公司
View PDF0 Cites 28 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although the increase of IPv6 address length has little effect on this method, the update efficiency of this method is poor. Due to the large dependency between prefixes and between prefixes and markers, when a prefix encounters addition, deletion, When updating and other operations, it is necessary to change the information of multiple prefixes or markers. How to find these prefixes or markers that need to be changed is very difficult.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A method to quickly search and update IPv6 routing list
  • A method to quickly search and update IPv6 routing list
  • A method to quickly search and update IPv6 routing list

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0067] Below in conjunction with accompanying drawing and embodiment, the present invention is described in further detail.

[0068] In RFC2373 and RFC2374, an aggregated global unicast address format scheme is proposed, which divides the IPv6 address into several segments, in which the first 64 bits are the network ID, and the last 64 bits are the interface ID. In the network ID, several network levels are divided, and different subnet addresses are assigned by different Internet organizations. Therefore, the present invention takes the first 16 bits of the address prefix of the routing table, that is, the range corresponding to the top-level aggregate identifier, as the index value of the first-level linear index, and constructs the HTL, and then forms the B-HTL according to the remaining 112-bit address, The dichotomy search is performed in it, and the schematic diagram of the data structure shown in FIG. 1 is shown in FIG. 2 . It is mainly divided into three data structur...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The related fast lookup and update method for IPv6 route table comprises: using a first-linear index table and a second hash table issued by binary search tree for two-stage lookup; using BMP-tree to recombine prefix relation in data structure, and improving update efficiency. Compared with traditional method or other methods, this invention is more proper to the IPv6 network.

Description

technical field [0001] The invention relates to the technical field of computer networks, in particular to a method for realizing fast routing table lookup and update based on IPv6 addresses. Background technique [0002] The routing table lookup method is the key technology in the router forwarding system, and the lookup efficiency affects the forwarding efficiency of the router to a great extent. The basic idea of ​​routing table lookup is that, given an address keyword, it is necessary to find the longest address prefix matching the address keyword in the routing table, and perform subsequent processing according to the next-hop port number of the address prefix. Compared with the traditional search that can only complete the exact match of keywords, the difficulty and complexity of routing table search are greatly increased. [0003] At present, there are many routing search methods for IPv4 routers. The most widely used methods include two types of search methods, name...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/56G06F17/30H04L29/06H04L45/74
Inventor 孙庆南鲁士文
Owner 烟台惠通网络技术有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap