WO2009059534A1 - Procédé et dispositif de recherche d'acheminement en réseau privé virtuel - Google Patents

Procédé et dispositif de recherche d'acheminement en réseau privé virtuel Download PDF

Info

Publication number
WO2009059534A1
WO2009059534A1 PCT/CN2008/072862 CN2008072862W WO2009059534A1 WO 2009059534 A1 WO2009059534 A1 WO 2009059534A1 CN 2008072862 W CN2008072862 W CN 2008072862W WO 2009059534 A1 WO2009059534 A1 WO 2009059534A1
Authority
WO
WIPO (PCT)
Prior art keywords
private network
virtual private
index
address
leaf node
Prior art date
Application number
PCT/CN2008/072862
Other languages
English (en)
Chinese (zh)
Inventor
Song YUAN
Cheng Tang
Jun GONG
Original Assignee
Huawei Technologies Co., Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Publication of WO2009059534A1 publication Critical patent/WO2009059534A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/66—Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H04L45/742—Route cache; Operation thereof
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/02—Network architectures or network communication protocols for network security for separating internal from external traffic, e.g. firewalls
    • H04L63/0272—Virtual private networks

Definitions

  • the present invention relates to the field of network communications, and in particular, to a method and apparatus for routing a virtual private network route.
  • VPN Virtual Private Network
  • an independent route lookup table is usually established for each VPN.
  • multiple Muti-bit Trie (or bitmap) algorithms are used to implement VPN route lookup.
  • another method is to use B-Tree's route lookup algorithm for route lookup.
  • the route lookup table is a B-Tree, and the bit vector is stored in the nodes of different layers of the B-Tree to guide the search process.
  • the embodiment of the present invention provides a method for routing a virtual private network route and Device.
  • the technical solution is as follows:
  • a method for routing a virtual private network route comprising:
  • a device for routing a virtual private network route comprising:
  • a search module configured to search for a lowermost leaf node corresponding to the keyword in a pre-established index tree
  • an acquiring module configured to obtain the search in a value interval and corresponding index information of the pre-stored virtual private network a block corresponding to the leaf node found by the module, the block includes one or more consecutive numerical intervals and corresponding index information, and the value interval to which the keyword belongs is obtained in the block, according to the value to which the keyword belongs
  • the index information corresponding to the interval finds the routing entry corresponding to the index information.
  • the IP address range corresponding to the keyword and its corresponding index are searched to obtain corresponding routing entries, thereby realizing the search of the VPN route and improving the search. effectiveness.
  • the lowermost leaf node corresponds to the block that stores the IP address range and the index information, reduces the height of the index tree, improves the speed of route lookup, and saves the IP address range and index information instead of the VPN routing entry, which can further improve the speed of route search.
  • the hierarchical search structure using index tree and routing related information can be easily implemented by FPGA or ASIC, which has low complexity in design and implementation, and can flexibly support many VPNs.
  • FIG. 1 is a flowchart of a method for searching for a route of a virtual private network according to Embodiment 1 of the present invention
  • FIG. 2 is a schematic diagram of a relationship between a VPN index table, a plurality of index trees, and a record table according to Embodiment 1 of the present invention
  • FIG. 3 is a schematic diagram of relationship between a VPN index table, index tree memory, and routing information memory according to Embodiment 1 of the present invention
  • 4 is a schematic diagram of route search using multiple index trees according to Embodiment 1 of the present invention
  • FIG. 5 is a schematic diagram of changes in index tree memory when a new VPN is added according to Embodiment 1 of the present invention.
  • FIG. 6 is a flowchart of a method for finding a route of a virtual private network route according to Embodiment 2 of the present invention.
  • FIG. 7 is a schematic diagram showing the relationship between an index tree and a record table according to Embodiment 2 of the present invention.
  • FIG. 8 is a schematic diagram of route search using an index tree according to Embodiment 2 of the present invention
  • FIG. 9 is a structural diagram of an apparatus for performing route lookup of a virtual private network according to Embodiment 3 of the present invention
  • FIG. 10 is a structural diagram of a search module according to Embodiment 3 of the present invention.
  • FIG. 11 is another structural diagram of a search module according to Embodiment 3 of the present invention. detailed description
  • the embodiment of the present invention obtains the lowest-level leaf node corresponding to the keyword in the pre-established index tree, and obtains the block corresponding to the leaf node in the value interval of the pre-stored virtual private network and the corresponding index information.
  • the block includes one or more consecutive numerical intervals and corresponding index information, and obtains a numerical interval to which the keyword belongs in the block, and finds a corresponding routing entry according to the index information corresponding to the numerical interval, and implements a VPN routing table. The item's lookup.
  • the numerical interval in the embodiment of the present invention may be specifically an IP address interval.
  • the IP address interval is taken as an example for specific description.
  • an embodiment of the present invention provides a method for searching a route of a virtual private network, which specifically includes:
  • the record table can be an ordered array, and the elements in the array can be sorted according to the size of the IP address, as in the order of small to large. Arrays can be implemented with low-speed memory to reduce cost.
  • An index tree is established for each VPN in advance. When multiple VPNs are used, multiple index trees are established.
  • the leaf nodes in each index tree store the IP address of the VPN corresponding to the index tree, and the lowest layer of leaves.
  • the node corresponds to a section of the record table, and the block has one or more consecutive elements, each element including an IP address interval and an index information. Using a block that contains multiple contiguous elements can increase the speed of the lookup compared to using a block that contains one element.
  • the index tree can be a binary tree or a multi-fork tree, usually a full tree.
  • the Cache Oblivious B-Tree 0 index tree can be saved by using a high-speed memory.
  • the order of the leaf nodes in the index tree can be arranged according to the rules of the binary search tree.
  • the IP address stored by the node on the left side of the next layer is smaller than the IP address saved by the node on the next layer.
  • the IP address saved by the node on the right side of the next layer is greater than or equal to The IP address saved by this layer node.
  • a VPN index table may be further established to save the identification information of the VPN, such as The VPN ID, and the address of the root node of the index tree corresponding to the VPN, find the index tree of the target VPN through the VPN identifier in the VPN index table, and perform route lookup.
  • the VPN index table has multiple VPN identifiers and address information of the root node of the index tree, including VPNi, VPNk, and VPNm, wherein, according to the identifier and corresponding of the VPNi The address of the root node of the index tree can be found in the index tree i.
  • the index tree k can be found according to the identifier of the VPNk and the address of the root node of the corresponding index tree, and can be found according to the identifier of the VPNm and the address of the root node of the corresponding index tree.
  • the index tree m the information about the routing table entry of the VPN in the lowermost leaf node of each index tree, including the IP address interval and index information.
  • the information stored in the VPN index table may also include the height of the index tree, which represents the length of space occupied by the index tree in the memory. For example, referring to FIG.
  • the information corresponding to each VPN ID in the VPN index table includes the height of the pointer and the index tree, and the pointer refers to the address of the root node of the index tree, corresponding to the start of the index tree in the index tree memory. Address, the height of the index tree determines the length of space the index tree occupies in memory. The lowermost leaf node of the index tree corresponds to the index information and IP address range of the routing entry stored in the routing information memory.
  • the routing information can be reserved with appropriate holes, that is, unused memory space, to facilitate the addition and deletion of routing information, and can achieve fast routing updates.
  • the destination IP address in the keyword is 1. 1. 1. 1, the VPN to which it belongs is VPN2, corresponding to index tree 2, the address of the root node of index tree 2 is found in the VPN index table, according to the address Find index tree 2 in memory.
  • the destination IP address Align the destination IP address with the IP address saved by the leaf node of the index tree in the found index tree, until the keyword, that is, the lowest-level leaf node corresponding to the destination IP address, that is, the root node of the index tree is started. If the destination IP address is smaller than the IP address saved by the current node, the search continues in the left subtree of the node. If the destination IP address is greater than or equal to the IP address saved by the current node, the right subtree of the node is located. Continue to search until the lowest leaf node corresponding to the keyword is found.
  • 105 Obtain, in the IP address interval and the index information of the pre-stored VPN, a block corresponding to the found lowest leaf node, that is, read a block corresponding to the lowest leaf node in the record table.
  • 106 Obtain an IP address range to which the destination IP address belongs in the obtained block, and find a routing entry corresponding to the index information according to the index information corresponding to the IP address interval, that is, obtain a VPN corresponding to the keyword. Routing entries, complete route lookup.
  • the logical selector can be used to select the obtained block, and the selected IP address interval is an IP address interval in the block, and the index corresponding to the IP address interval is the cable to be searched, according to the index.
  • the routing entry corresponding to the destination IP address For example, see Figure 4, the IP address of the routing entry with the destination IP address being VPNk, according to VPNk
  • the ID finds the index tree k, and travels the index tree until the lowest leaf node is found.
  • the leaf node corresponds to a block in the record table, and the IP address range to which the destination IP address belongs is obtained in the block, and the The index information corresponding to the IP address range is found according to the index information, and the route search is completed.
  • This embodiment can use a low-frequency chip to achieve high-speed route lookup and fast routing information update. Further, when the VPN information changes, the foregoing method may further include the step of updating:
  • the IP address range and index information corresponding to the routing entry are deleted in the pre-stored IP address range and the corresponding index information. If there is no content in the block, the lowermost leaf node corresponding to the block is deleted in the index tree.
  • IP address range and index information corresponding to the routing entry are added to the existing IP address interval and the corresponding index information; or A new block is added to the stored IP address interval and the corresponding index information, the IP address interval and index information corresponding to the routing entry are stored in the new block, and the lowermost leaf node corresponding to the new block is added in the index tree.
  • VPNi there are already VPNi, VPNj, etc., and the corresponding index, index tree height, pointer, and the like are stored in the VPN index table.
  • a VPNk is added, a new index tree k is created, and the index tree is written.
  • the ID of the VPNk, the height of the index tree k, and the pointer k, the pointer k points to the starting address of the index tree k in the memory.
  • a free area may be reserved between the newly added index tree k and the adjacent index tree j.
  • the starting address of the free area is the starting address of the previous index tree j plus the memory consumption of the index tree j, the idle
  • the capacity of the area is the starting address of the next index tree k minus the starting address of the free area.
  • an IP address range and index information of the index tree and the pre-stored VPN are used to search for an IP address range corresponding to the keyword and its corresponding index, thereby obtaining a corresponding routing entry, thereby implementing a VPN route search, and improving The efficiency of the search.
  • the use of the record table to store the IP address range and the index information compared with the prior art to establish a route lookup table for each VPN, greatly saves space resources and improves space utilization.
  • the lowermost leaf node corresponds to the block that stores the IP address interval and the index information, which reduces the height of the index tree and improves the speed of route search.
  • the hierarchical search structure of the index tree and the record table makes it easy to adopt the FPGA. Or ASIC implementation, design and implementation complexity is low, and flexible support for many VPNs. Using a low-frequency chip enables high-speed routing lookups and fast routing table updates. By updating the IP address interval and index information, and the corresponding index tree information, the route lookup is performed in the updated information, which can further improve the accuracy of the search.
  • an embodiment of the present invention provides a method for routing a virtual private network route, which specifically includes:
  • IP address range and index information of the VPN Pre-store the IP address range and index information of the VPN, and save the IP address range and index information of the VPN in a record table in the form of a record table. It can also be saved in two record tables and establish a one-to-one correspondence between IP address intervals and index information.
  • An index tree is jointly established for all the VPNs in advance.
  • the leaf nodes in the index tree store the VPN IP address and the VPN identification information, for example, the leaf node stores the VPN ID and the IP address of the VPN routing entry, and the index The lowest leaf node of the tree corresponds to a block of the record table.
  • the type of the index tree and the arrangement of the leaf nodes in this embodiment are the same as those in Embodiment 1, and are not described here.
  • an index tree is established for all VPNs.
  • Each leaf node in the lowermost layer of the index tree corresponds to a block in the record table.
  • the block has multiple consecutive elements, and each element holds an IP address. Interval and index information.
  • the keyword includes the ID of the VPNk and the destination IP address
  • the destination IP address is the IP address of the routing entry of the VPNk
  • the index tree is browsed according to the keyword until the lowest leaf node corresponding to the keyword is found.
  • the block in the record table corresponding to the leaf node is read, and the IP address range to which the destination IP address in the keyword belongs is obtained in the block by the logical selector, and the index information corresponding to the IP address range is read.
  • 205 Obtain an IP address range to which the destination IP address belongs in the keyword, and find a routing entry corresponding to the index information according to the index information corresponding to the IP address interval, that is, obtain a VPN corresponding to the keyword. Routing entries, complete route lookup.
  • This embodiment can use a low-frequency chip to achieve high-speed route lookup and fast routing information update.
  • the foregoing method may further include an update step, including in an existing VPN. Updates when adding new routing entries or deleting existing routing entries, and adding new VPNs.
  • the specific process of the update that is added or deleted in the existing VPN is the same as that in the first embodiment, and details are not described herein again.
  • the update process includes: adding at least one new block to the pre-stored IP address interval and the corresponding index information, and storing the IP address interval and index information corresponding to all routing entries of the new VPN in the new block.
  • the leaf node corresponding to the new VPN is added, and the information of the newly added leaf node is written into the corresponding index tree memory.
  • an IP address range and index information of the index tree and the pre-stored VPN are used to search for an IP address range corresponding to the keyword and its corresponding index, thereby obtaining a corresponding routing entry, thereby implementing a VPN route search, and improving The efficiency of the search.
  • the record table is used to store the IP address and the index information.
  • a route lookup table is established for each VPN, which greatly saves space resources and improves space utilization.
  • the lowermost leaf node corresponds to the block that stores the IP address range and the index information, which reduces the height of the index tree and improves the speed of route lookup. By saving the IP address range and index information instead of the VPN routing entry, the route lookup speed can be further improved.
  • the hierarchical search structure of the index tree and the record table can be easily implemented by FPGA or ASIC, and the design and implementation complexity is low, and flexible support for many VPNs.
  • Using a low-frequency chip enables high-speed routing lookups and fast routing table updates.
  • the route lookup is performed in the updated information, which can further improve the accuracy of the search.
  • an embodiment of the present invention further provides an apparatus for searching for a virtual private network, which specifically includes: a searching module 301, configured to search for a lowermost leaf node corresponding to a keyword in a pre-established index tree;
  • the obtaining module 302 is configured to obtain, in the value interval and the corresponding index information of the pre-stored virtual private network, a block corresponding to the leaf node found by the searching module 301, where the block includes one or more consecutive value intervals and corresponding
  • the index information is obtained in the block, and the routing table corresponding to the index information is found according to the index information corresponding to the numerical interval to which the keyword belongs.
  • the value interval may be specifically an IP address interval.
  • the searching module 301 may specifically include:
  • the establishing unit 301a is configured to pre-establish an index tree, where the leaf node of the index tree stores the identifier information and the IP address of the virtual private network;
  • the searching unit 301b is configured to compare the identification information of the virtual private network in the keyword and the identification information and the IP address saved by the leaf node of the index tree in the index tree established by the establishing unit 301a until the keyword is found. Corresponding lowermost leaf nodes.
  • the searching module 301 may further include:
  • the establishing unit 301c is configured to establish an index tree for each virtual private network in advance, and the leaf node of the index tree stores the IP address of the virtual private network;
  • the searching unit 301d is configured to: in the index tree established by the establishing unit 301c, find a corresponding index tree according to the identification information of the virtual private network to which the destination IP address belongs in the keyword, and compare the destination IP address in the found index tree. The IP address saved with the leaf node of the index tree until the lowest leaf node corresponding to the keyword is found.
  • the above apparatus may further include:
  • the update module is configured to delete the IP address range and the index information corresponding to the routing entry in the pre-stored IP address range and the corresponding index information when the routing entry is deleted in the virtual private network. If there is no content in the block to which the entry belongs, the lowermost leaf node corresponding to the block is deleted in the index tree.
  • the above apparatus may further include:
  • An entry update module is configured to increase an IP address range corresponding to the routing entry in a pre-stored IP address interval and an existing block in the corresponding index information when the routing entry is added to the virtual private network. Index information; or adding a new block in the pre-stored IP address interval and the corresponding index information, storing the IP address interval and index information corresponding to the routing entry in the new block, and adding the new block corresponding to the index tree The lowest leaf node.
  • the above apparatus may further include:
  • Adding a virtual private network update module when adding a new virtual private network, adding at least one new block to the pre-stored IP address interval and the corresponding index information, and all the routing entries of the new virtual private network
  • the corresponding IP address range and index information are stored in the new block, and a leaf node corresponding to the new virtual private network is added in the index tree or a new index tree is established for the new virtual private network.
  • the index tree and the pre-stored VPN IP address interval and index information are used to find the corresponding keyword.
  • the IP address interval and its corresponding index are used to obtain corresponding routing entries, which implements the lookup of the VPN route and improves the efficiency of the search.
  • the record table is used to store the IP address and the index information.
  • a route lookup table is established for each VPN, which greatly saves space resources and improves space utilization.
  • the method of establishing an index tree for each VPN improves the speed of route lookup.
  • the lowermost leaf node corresponds to the block that stores the IP address interval and the index information, which reduces the height of the index tree and improves the speed of route search. Saving the IP address range and index information instead of the VPN routing entry can further improve the speed of route lookup.
  • the hierarchical search structure of the index tree and the record table can be easily implemented by FPGA or ASIC, and the design and implementation complexity is low, and the VPN can be flexibly supported.
  • Using a low-frequency chip enables high-speed routing lookups and fast routing table updates.
  • the route lookup is performed in the updated information, which can further improve the accuracy of the search.
  • the embodiments of the present invention may be implemented by software, and the corresponding software may be stored in a readable storage medium, such as a hard disk, a memory or an optical disk of a computer.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Hardware Design (AREA)
  • Computer Security & Cryptography (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne un procédé et dispositif de recherche d'acheminement dans un champ de communication dans un réseau. Le procédé consiste notamment à rechercher le noeud feuille le plus bas selon le mot clé dans l'arborescence d'index pré-établie; à obtenir un bloc correspondant au noeud feuille dans l'intervalle numérique dans un réseau privé virtuel pré-stocké et les informations d'index correspondantes, qui comportent un ou plusieurs intervalles numériques continus et les informations d'index correspondantes; à acquérir l'intervalle numérique auquel le mot clé obtenu du bloc appartient; à trouver l'article de la liste d'acheminement correspondant aux informations d'index sur la base des informations d'index correspondant à l'intervalle numérique auquel l'intervalle numérique appartient. Le dispositif comporte un module de recherche et un module d'acquisition.
PCT/CN2008/072862 2007-11-02 2008-10-28 Procédé et dispositif de recherche d'acheminement en réseau privé virtuel WO2009059534A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CNB2007101767716A CN100566281C (zh) 2007-11-02 2007-11-02 虚拟私用网路由查找的方法和装置
CN200710176771.6 2007-11-02

Publications (1)

Publication Number Publication Date
WO2009059534A1 true WO2009059534A1 (fr) 2009-05-14

Family

ID=39307584

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2008/072862 WO2009059534A1 (fr) 2007-11-02 2008-10-28 Procédé et dispositif de recherche d'acheminement en réseau privé virtuel

Country Status (2)

Country Link
CN (1) CN100566281C (fr)
WO (1) WO2009059534A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115858542A (zh) * 2023-03-03 2023-03-28 神州灵云（北京）科技有限公司 一种GeoIPv6树状索引方法、系统及电子设备

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100566281C (zh) * 2007-11-02 2009-12-02 华为技术有限公司 虚拟私用网路由查找的方法和装置
CN101459569B (zh) * 2008-12-12 2011-08-10 华为技术有限公司 建立路由索引树的方法、装置和查找路由索引树的方法、装置
CN102024046B (zh) * 2010-12-14 2013-04-24 华为数字技术（成都）有限公司 数据重复性校验方法和装置及系统
CN103745008B (zh) * 2014-01-28 2016-08-31 河海大学 一种大数据索引的排序方法
CN106302178B (zh) * 2015-05-20 2020-02-21 中兴通讯股份有限公司 一种路由查询方法及装置
CN106330716B (zh) * 2015-06-30 2019-12-13 新华三技术有限公司 Ip路由查找方法及装置
CN105141525B (zh) * 2015-06-30 2018-08-10 新华三技术有限公司 IPv6路由查找方法及装置
CN106330721B (zh) * 2015-06-30 2019-09-17 新华三技术有限公司 Ip路由查找方法及装置
CN105512229B (zh) * 2015-11-30 2019-02-22 北京奇艺世纪科技有限公司 一种ip地址的地域信息的存储、查询方法及装置
CN105512320B (zh) * 2015-12-18 2019-03-01 北京金山安全软件有限公司 一种用户排名获得方法、装置及服务器
CN105528463B (zh) * 2016-01-21 2018-12-14 北京奇艺世纪科技有限公司 一种搜索引擎的索引数据加载方法和装置
CN114244772B (zh) * 2021-12-29 2023-05-30 厦门大学 一种更新复杂度为o（1）的tcam实现方法及系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1768512A (zh) * 2003-04-01 2006-05-03 思科技术公司 Mpls网络中的递归bgp路由更新方法
CN1859297A (zh) * 2005-12-23 2006-11-08 华为技术有限公司 一种路由管理系统和方法
CN101051987A (zh) * 2007-05-22 2007-10-10 网御神州科技（北京）有限公司 一种利用IPSec将网络路由扩展到远程网络的方法及装置
CN101159658A (zh) * 2007-11-02 2008-04-09 华为技术有限公司 虚拟私用网路由查找的方法和装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1768512A (zh) * 2003-04-01 2006-05-03 思科技术公司 Mpls网络中的递归bgp路由更新方法
CN1859297A (zh) * 2005-12-23 2006-11-08 华为技术有限公司 一种路由管理系统和方法
CN101051987A (zh) * 2007-05-22 2007-10-10 网御神州科技（北京）有限公司 一种利用IPSec将网络路由扩展到远程网络的方法及装置
CN101159658A (zh) * 2007-11-02 2008-04-09 华为技术有限公司 虚拟私用网路由查找的方法和装置

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115858542A (zh) * 2023-03-03 2023-03-28 神州灵云（北京）科技有限公司 一种GeoIPv6树状索引方法、系统及电子设备
CN115858542B (zh) * 2023-03-03 2023-06-13 神州灵云（北京）科技有限公司 一种GeoIPv6树状索引方法、系统及电子设备

Also Published As

Publication number Publication date
CN100566281C (zh) 2009-12-02
CN101159658A (zh) 2008-04-09

Similar Documents

Publication Publication Date Title
WO2009059534A1 (fr) Procédé et dispositif de recherche d'acheminement en réseau privé virtuel
KR100864888B1 (ko) 라우팅 시스템 및 라우팅 시스템의 룰 엔트리 관리 방법
US9680747B2 (en) Internet protocol and Ethernet lookup via a unified hashed trie
US9269411B2 (en) Organizing data in a hybrid memory for search operations
CN100550847C (zh) 一种解决Hash冲突的方法及装置
US8284787B2 (en) Dynamic tree bitmap for IP lookup and update
US20070171911A1 (en) Routing system and method for managing rule entry thereof
CN102484610A (zh) 路由表建立方法和装置及路由表查找方法和装置
CN103780491B (zh) 一种实现IPv6快速路由查找的方法
WO2009135417A1 (fr) Procédé de correspondance du préfixe le plus long et dispositif basé sur la structure de données arborescente
US7801151B2 (en) Method and apparatus for forwarding service in a data communication device
JP2001168910A (ja) データ検索システム及びパケット処理装置並びに制御方法
WO2015032216A1 (fr) Procédé et dispositif de consultation de routage et procédé de construction de structure d'arbre-b
JP2014220808A (ja) ネットワークスイッチにおける集中型メモリプールを用いるテーブル検索のための装置および方法
CN110460529B (zh) 一种内容路由器转发信息库存储结构的数据处理方法和芯片
CN107948060A (zh) 一种新型的路由表建立、以及ip路由查找方法和装置
US20160269290A1 (en) Method for looking up data in hash tables and associated network device
CN106656816B (zh) 分布式ipv6路由查找方法和系统
US6615311B2 (en) Method and system for updating a content addressable memory (CAM) that prioritizes CAM entries according to prefix length
CN102739550B (zh) 基于随机副本分配的多存储器流水路由体系结构
Shen et al. High-performance IPv6 lookup with real-time updates using hierarchical-balanced search tree
CN104301227B (zh) 基于tcam的高速低功耗ip路由表查找方法
CN102724061A (zh) 一种网络接口管理方法
CN107948075A (zh) 有效解决公网和私网路由转发的方法及系统
CN109194574B (zh) 一种IPv6路由查找方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08847639

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 08847639

Country of ref document: EP

Kind code of ref document: A1