Movatterモバイル変換


[0]ホーム

URL:


CN101895479A - System for increasing speed of route lookup - Google Patents

System for increasing speed of route lookup
Download PDF

Info

Publication number
CN101895479A
CN101895479ACN201010255494XACN201010255494ACN101895479ACN 101895479 ACN101895479 ACN 101895479ACN 201010255494X ACN201010255494X ACN 201010255494XACN 201010255494 ACN201010255494 ACN 201010255494ACN 101895479 ACN101895479 ACN 101895479A
Authority
CN
China
Prior art keywords
module
submodule
initialization
information
route
Prior art date
Legal status (The legal status 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 status listed.)
Granted
Application number
CN201010255494XA
Other languages
Chinese (zh)
Other versions
CN101895479B (en
Inventor
包旭雷
朱杰
孙林峰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Jiao Tong University
Original Assignee
Shanghai Jiao Tong University
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 Shanghai Jiao Tong UniversityfiledCriticalShanghai Jiao Tong University
Priority to CN201010255494XApriorityCriticalpatent/CN101895479B/en
Publication of CN101895479ApublicationCriticalpatent/CN101895479A/en
Application grantedgrantedCritical
Publication of CN101895479BpublicationCriticalpatent/CN101895479B/en
Expired - Fee Relatedlegal-statusCriticalCurrent
Anticipated expirationlegal-statusCritical

Links

Landscapes

Abstract

Translated fromChinese

一种计算机网络技术领域的提高路由查找速度的系统,包括:驱动模块、接口模块、初始化模块、路由存储模块、人机交互模块和查找模块,其中:驱动模块和人机交互模块相连传输驱动信息,人机交互模块与接口模块相连传输交互信息,接口模块与初始化模块相连传输初始化信息,接口模块与查找模块相连传输交互信息,查找模块与路由存储模块相连传输待查找的路由信息;所述的查找模块包括:分割子模块、寻址子模块、读子模块、写子模块和判断子模块。本发明平均查找速度可以达到50M条/秒;复杂度低;占用的数据空间少;脱离了二叉树结构:使得存储空间的增删更具灵活性;适合小容量的路由存储,当外部有大容量存储硬件设备,该系统也能实现。A system for increasing the speed of route search in the field of computer network technology, comprising: a drive module, an interface module, an initialization module, a route storage module, a human-computer interaction module and a search module, wherein: the drive module and the human-computer interaction module are connected to transmit drive information , the human-computer interaction module is connected to the interface module to transmit interactive information, the interface module is connected to the initialization module to transmit initialization information, the interface module is connected to the search module to transmit interactive information, and the search module is connected to the route storage module to transmit the routing information to be searched; The search module includes: dividing submodule, addressing submodule, reading submodule, writing submodule and judging submodule. The average search speed of the present invention can reach 50M items/second; the complexity is low; the occupied data space is small; it breaks away from the binary tree structure: making the addition and deletion of storage space more flexible; it is suitable for small-capacity routing storage, when there is large-capacity storage Hardware equipment, the system can also be realized.

Description

Improve the system of speed of route lookup
Technical field
What the present invention relates to is a kind of system of technical field of the computer network, specifically is a kind of system that improves speed of route lookup.
Background technology
Route querying belongs to the part of route forerunner engine.Network interface packet, sends to forerunner's engine by interchanger after receiving packet.The major function of forerunner's engine is at first CRC (cyclic redundancy check (CRC) code) verification to be carried out in data packet header, and the destination address according to packet carries out route querying then, inquires this and wraps next jumping port numbers.Therefore, route querying is the essential step of data forwarding.Because the data traffic of routing forwarding constantly increases at present, this inevitable requirement improves constantly the efficient of route querying, also makes route querying become the bottleneck that improves data forwarding efficient day by day.
About route querying, start with from pure technical standpoint on the one hand at present and improve the existing system of searching; On the other hand, be to utilize the existing system of searching to realize route querying in conjunction with novel equipment and the complexity that reduces computing.Present route querying mainly is to carry out the longest matched and searched on the basis of the address structure of CIDR (classless inter-domain routing).CIDR address structure use<address/prefix length〉to representing route entry.
Through existing literature search is found, the Chinese patent publication number is: CN1362822.A, name is called: the high speed route lookup system of content-based addressable memory, this technology comprises: Content Addressable Memory, synchronous static memory, route querying coprocessor and drive circuit, wherein: Content Addressable Memory links to each other with the route querying coprocessor by drive circuit, is read and is write by the route querying coprocessor control.Though this method effectively raises the speed of route querying, this method relates to the complex protocol of static memory read-write, and simultaneously, SOC (system on a chip) will be obtained memory address by bus, utilizes bus to carry out read-write operation again, causes crossing of bus resource to utilize.
Find by retrieval again, the Chinese patent publication number is: CN1863169.A, name is called: the route searching result processing method of processor Network Based, this technology sets up and safeguards a route querying cache table in the high-speed memory on the sheet of network processing unit, carrying out principle that order adjusts according to least-recently-used principle manages the list item of cache table, effectively raise seek rate, but, the existence of cache table must cause taking in a large number of storage resources, especially in the application of backbone network, its coverage rate belongs to tens0000 to IP up to a million, and its resources occupation rate also is very big so.
Summary of the invention
The objective of the invention is to overcome above shortcomings in the prior art, a kind of system that improves speed of route lookup is provided.The present invention has realized searching fast of route system by the combination of SOC (system on a chip) (SOC) and hardware searching module, not only have seek rate soon, realize simple advantage, but also have easy transplanting and extendible characteristics.
The present invention is achieved by the following technical solutions:
The present invention includes: driver module, interface module, initialization module, route memory module, human-computer interaction module and search module, wherein: driver module links to each other with human-computer interaction module and transmits activation bit, human-computer interaction module links to each other with interface module and transmits interactive information, interface module links to each other with initialization module and transmits initialization information, interface module with search the module transmission interactive information that links to each other, search module and link to each other with the route memory module and transmit routing iinformation to be found.
Described initialization module comprises: flag bit initialization submodule, memory address initialization submodule and state machine initialization submodule, wherein: flag bit initialization submodule links to each other with state machine initialization submodule with memory address initialization submodule respectively and transmits effective control information, memory address initialization submodule links to each other with interface module and transmits the initialization storage address information, and state machine initialization submodule links to each other with interface module and transmits the init state machine information.
Described route memory module comprises: four master meter sub module stored and four sublist sub module stored, wherein: each master meter sub module stored and each sublist sub module stored respectively with search the module routing address information that transmission searches that links to each other.
The described module of searching comprises: cut apart submodule, addressing submodule, read submodule, write submodule and judge submodule, wherein: cut apart submodule link to each other with interface module the transmission human-machine interactive information, cut apart submodule link to each other with the addressing submodule transmission effective address information, addressing submodule and judge the affirmation information that submodule links to each other and transmits routing address to be found is read submodule and is write submodule and link to each other with the route memory module respectively and transmit routing iinformation to be read and routing iinformation to be written.
Compared with prior art, the invention has the beneficial effects as follows:
1, speed height: average seek rate can reach 50M bar/second;
2, complexity is low: do not relate to the operation on other agreements, effectively improved total line use ratio of read-write;
3, the data space that takies is few: improved utilization of space by addressing of address efficient in operation ground;
4, broken away from binary tree structure: make the additions and deletions of memory space have more flexibility;
5, be fit to the route storage of low capacity, when there is suitable big capacity storage hardware device the outside, this system also can expand to jumbo route table items at an easy rate, more than the 10M bar.
Embodiment
Below system of the present invention is further described: present embodiment is being to implement under the prerequisite with the technical solution of the present invention, provided detailed execution mode and concrete operating process, but protection scope of the present invention is not limited to following embodiment.
Embodiment
Present embodiment comprises: driver module, interface module, initialization module, route memory module, human-computer interaction module and search module, wherein: driver module links to each other with human-computer interaction module and transmits activation bit, human-computer interaction module links to each other with interface module and transmits interactive information, interface module links to each other with initialization module and transmits initialization information, interface module with search the module transmission interactive information that links to each other, search module and link to each other with the route memory module and transmit routing iinformation to be found.
Described initialization module comprises: flag bit initialization submodule, memory address initialization submodule and state machine initialization submodule, wherein: flag bit initialization submodule links to each other with state machine initialization submodule with memory address initialization submodule respectively and transmits effective control information, memory address initialization submodule links to each other with interface module and transmits the initialization storage address information, and state machine initialization submodule links to each other with interface module and transmits the init state machine information.
The flag information that the utilization of described flag bit initialization submodule receives is effectively controlled with information memory address initialization submodule and state machine initialization submodule and is revised.
Described memory address initialization submodule carries out initialization to the content of a large space address.
Described state machine initialization submodule makes whole system enter and treats the operation state.
Described route memory module comprises: four master meter sub module stored and four sublist sub module stored, wherein: each master meter sub module stored and each sublist sub module stored respectively by the conflict situation flag bit with search the module routing address information that transmission searches that links to each other, separate between the master meter sub module stored, separate between the sublist sub module stored.
The route memory module is the read-write RAM (random access memory) of a 64KB in the present embodiment, and this RAM is divided into 4, and corresponding respectively IP prefix length is 1~20,21~24,25~28 and 29~32.For each block RAM memory block, in order to overcome the collision problem that HASH (hash) brings effectively, be provided with two memory blocks respectively---master meter sub module stored and sublist sub module stored, wherein: the master meter sub module stored has write down IP prefix, IP prefix length, collision flag position and the relevant routing iinformation of self; The sublist sub module stored has write down IP prefix, IP prefix length and relevant routing iinformation.
The described module of searching comprises: cut apart submodule, addressing submodule, read submodule, write submodule and judge submodule, wherein: cut apart submodule link to each other with interface module the transmission human-machine interactive information, cut apart submodule link to each other with the addressing submodule transmission effective address information, addressing submodule and judge the affirmation information that submodule links to each other and transmits routing address to be found is read submodule and is write submodule and link to each other with the route memory module respectively and transmit routing iinformation to be read and routing iinformation to be written.
The described submodule of cutting apart separates the routes/prefixes length information that human-computer interaction module obtains.
Described addressing submodule locks corresponding master meter sub module stored and sublist sub module stored to the prefix length information of cutting apart submodule and obtaining.
Described judgement submodule guarantees that the routing address of being searched is the address of really storing routing iinformation.
Describedly read submodule and the described submodule of writing is made amendment to route information and fed back.
The addressing of RAM is 14 in the present embodiment, the information of each bar address storage 32bits, each bar routing iinformation is formed by 64, comprises self IP prefix prefix of 32bits, the mixed information of 32bits (prefix length, conflict normal bit and next hop information).
According to the prefix of each node, try to achieve one 14 long address address by HASH, routing iinformation is deposited in the corresponding address.
Know that in the write operation to routing table what native system distributed is the address space of 16K*4Byte, and every routing iinformation comprises the data of 2*4Byte, therefore, this system's maximum can only be stored 8K bar information.Distribution (1: 8, promptly a master meter routing iinformation may conflict with it by potential 8 routing iinformations, and the routing iinformation that will occur conflicting is assigned in the sublist) according to parallel HASH method of the IPV4 of prefix optimization and master meter sublist.Identical when the space that each sublist sub module stored and master meter sub module stored are distributed, then each table can only be stored 1K bar routing iinformation at most.But master meter and sublist exist 1: 8 corresponding relation, so with respect to the sublist routing iinformation of 1K bar, the master meter sub module stored can only be stored 128 routing iinformations.Therefore, the real effective address figure place of herein calculating by HASH has only 7bits.
The HASH that adopt in this place utilizes XOR to realize, is example with first memory partitioning A here, and the core address is prefix[31:25], prefix[26:20] and prefix[21:15] the resultant A of XOR by turn between three items.When carrying out storage, this moment is for the master meter of first memory block, its address be 00000A00 (A front herein " 00000 " with " 00 " be respectively that the author is according to allocation space and definition voluntarily, each memory space is had nothing in common with each other, and it is also different between each master meter sublist), after searching the address, at first read operation is carried out in this address, when reading routing iinformation, then show and stored data in the master meter sub module stored, new data need be stored in the sublist sub module stored, the collision flag position in the master meter is set simultaneously.
For the search procedure of route, be exactly to adopt above-mentioned address computation method to obtain optimum IP address and obtain next hop information in fact in conjunction with the principle of long coupling.
The time of searching that the present embodiment method obtains is 16 * 10-9S, thus the seek rate of present embodiment method remains more than the 51M/s, and accurately obtained the address of next jumping.

Claims (8)

5. the system of raising speed of route lookup according to claim 1, it is characterized in that, the described module of searching comprises: cut apart submodule, the addressing submodule, read submodule, write submodule and judge submodule, wherein: cut apart submodule link to each other with interface module the transmission human-machine interactive information, cut apart submodule link to each other with the addressing submodule transmission effective address information, addressing submodule and judge the affirmation information that submodule links to each other and transmits routing address to be found is read submodule and is write submodule and link to each other with the route memory module respectively and transmit routing iinformation to be read and routing iinformation to be written.
CN201010255494XA2010-08-172010-08-17System for increasing speed of route lookupExpired - Fee RelatedCN101895479B (en)

Priority Applications (1)

Application NumberPriority DateFiling DateTitle
CN201010255494XACN101895479B (en)2010-08-172010-08-17System for increasing speed of route lookup

Applications Claiming Priority (1)

Application NumberPriority DateFiling DateTitle
CN201010255494XACN101895479B (en)2010-08-172010-08-17System for increasing speed of route lookup

Publications (2)

Publication NumberPublication Date
CN101895479Atrue CN101895479A (en)2010-11-24
CN101895479B CN101895479B (en)2013-03-27

Family

ID=43104552

Family Applications (1)

Application NumberTitlePriority DateFiling Date
CN201010255494XAExpired - Fee RelatedCN101895479B (en)2010-08-172010-08-17System for increasing speed of route lookup

Country Status (1)

CountryLink
CN (1)CN101895479B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN104038416A (en)*2014-06-172014-09-10上海新储集成电路有限公司Network processor

Citations (6)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN1362822A (en)*2002-02-012002-08-07清华大学High speed routing search system based on content addressable memory
CN1529454A (en)*2003-09-262004-09-15清华大学 Parallel route lookup method and system for eliminating longest prefix match lookup
CN1863169A (en)*2006-03-032006-11-15清华大学Route searching result cache method based on network processor
CN101035059A (en)*2006-03-082007-09-12中兴通讯股份有限公司Method for improving the classification searching speed of the three-folded content addressable memory message
US7277399B1 (en)*2002-04-082007-10-02Cisco Technology, Inc.Hardware-based route cache using prefix length
US7483430B1 (en)*2003-02-282009-01-27Cisco Technology, Inc.Hierarchical hash method for performing forward route lookup

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN1362822A (en)*2002-02-012002-08-07清华大学High speed routing search system based on content addressable memory
US7277399B1 (en)*2002-04-082007-10-02Cisco Technology, Inc.Hardware-based route cache using prefix length
US7483430B1 (en)*2003-02-282009-01-27Cisco Technology, Inc.Hierarchical hash method for performing forward route lookup
CN1529454A (en)*2003-09-262004-09-15清华大学 Parallel route lookup method and system for eliminating longest prefix match lookup
CN1863169A (en)*2006-03-032006-11-15清华大学Route searching result cache method based on network processor
CN101035059A (en)*2006-03-082007-09-12中兴通讯股份有限公司Method for improving the classification searching speed of the three-folded content addressable memory message

Cited By (2)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN104038416A (en)*2014-06-172014-09-10上海新储集成电路有限公司Network processor
CN104038416B (en)*2014-06-172019-06-25上海新储集成电路有限公司Network processing unit

Also Published As

Publication numberPublication date
CN101895479B (en)2013-03-27

Similar Documents

PublicationPublication DateTitle
CN101141389B (en) Enhanced multi-bit Trie tree search method and device
US9871727B2 (en)Routing lookup method and device and method for constructing B-tree structure
US7630373B2 (en)Packet transfer apparatus
CN101043428B (en)Method and system for route forwarding
US7606236B2 (en)Forwarding information base lookup method
CN101692651B (en)Method and device for Hash lookup table
JP5006472B2 (en) Table search device, table search method, and table search system
CN101620623A (en)Method and device for managing list item of content addressable memory CAM
CN108737278A (en)A kind of look-up method and device
CN102364463A (en) A Method of Finding CAM Based on Hash
EP2314027A2 (en)Switching table in an ethernet bridge
CN101277252A (en)Method for traversing multi-branch Trie tree
WO2025091889A1 (en)Address translation method, computing system, and electronic device
EP2512073B1 (en)Method and apparatus for maintaining a routing table
CN101902401A (en)Search process device and network system
CN104811495B (en)A kind of networking component content storage method and module for wisdom contract network
CN103885890B (en)Replacement processing method and device for cache blocks in caches
WO2015032214A1 (en)High-speed routing lookup method and device simultaneously supporting ipv4 and ipv6
CN115904625A (en)Cross-node multi-virtual machine memory management method, system, terminal and medium
CN101895479B (en)System for increasing speed of route lookup
CN104301227B (en)High-speed low-power-consumption IP route table lookup method based on TCAM
CN107896193B (en)Switch, and creation method and search method of lookup table of switch
CN106302259B (en)Method and router for processing message in network on chip
CN107547454A (en)Message method for dividing and processing in network control chip based on particular communication protocol
CN111865804B (en)Method and system for improving route issuing efficiency through hardware packet issuing mechanism

Legal Events

DateCodeTitleDescription
C06Publication
PB01Publication
C10Entry into substantive examination
SE01Entry into force of request for substantive examination
C14Grant of patent or utility model
GR01Patent grant
CF01Termination of patent right due to non-payment of annual fee

Granted publication date:20130327

Termination date:20150817

EXPYTermination of patent right or utility model

[8]ページ先頭

©2009-2025 Movatter.jp