Method and device for acquiring routing information

A routing and acquisition unit technology, applied in digital transmission systems, data exchange networks, electrical components, etc., can solve problems such as waste of memory resources, reduce resource consumption, improve processing efficiency, and reduce memory usage.

Active Publication Date: 2011-04-27

ZTE CORP

3 Cites 18 Cited by

AI-Extracted Technical Summary

Problems solved by technology

[0005] However, in IPv6 routing entries, there are a lot of situations where the relationship between routing and next-hop information is many-to-one, tha...

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

Method used

In practical application, can send to the routing equipment of IPv6 by tester and include many 10000 routing entries that next hop information is identical, to verify the superiority of the storage method of the present invention, specifically, adopt the method of the present invention to store The...

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

Abstract

The invention discloses a method for acquiring routing information. The method comprises the following steps of: establishing and real-time updating a routing table containing the routing information and a corresponding next hop pointer and a next hop table containing next hop information and a corresponding quoting count value; and when a data packet needs sending, acquiring the next hop information according to the routing table and the next hop table. The invention discloses a device for acquiring the routing information at the same time. The method and the device can effectively reduce the occupation of a memory, and further can reduce the consumption of resources.

Application Domain

Data switching networks

Technology Topic

Reference countingDistributed computing +2

Image

Examples

Experimental program(2)

Example Embodiment

[0059] Embodiment one

[0060] In this embodiment, aiming at the situation of adding a new routing entry, the processing flow for updating the routing table and the next hop table of the routing device is described. The implementation process is as follows: Figure 4 shown, including the following steps:

[0061] Step 401: After obtaining the new routing entry, insert a new node into the routing table, and write the routing information of the new routing entry into the new node, and then perform step 402;

[0062] Here, the way for the routing device to obtain the routing entry is exactly the same as the way for the routing device to obtain the routing entry in the prior art, for example: the routing device can obtain the routing entry according to the routing configuration information of the network management, and the routing device can also obtain the routing entry according to the routing protocol , by learning the routing entries, the routing device can also receive the routing entries broadcast by the network system, etc.;

[0063] Each node corresponds to an entry in the routing table.

[0064] Step 402: extract the next hop information from the new routing entry, and then execute step 403;

[0065] Here, the new routing entry includes routing information and next hop information.

[0066] Step 403: Determine whether the next hop information exists in the next hop table, if yes, execute step 405, otherwise, execute step 404;

[0067] Here, the determining whether the next hop information exists in the next hop table is specifically:

[0068] Check whether the next hop information exists in the next hop table according to the next hop IP address in the next hop information.

[0069] Step 404: Insert a new node into the next hop table, write the next hop information into the new node, and initialize the corresponding reference count value to 0, and then execute step 405.

[0070] Step 405: Add 1 to the corresponding reference count value, and then execute Step 406.

[0071] Step 406: Insert the next hop pointer pointing to the next hop information into the corresponding node in the routing table, and end the current processing flow.

Example Embodiment

[0072] Embodiment two:

[0073] This embodiment describes the processing flow of updating the routing table and the next hop table of the routing device for the situation of deleting the routing entry. The implementation process is as follows: Figure 5 shown, including the following steps:

[0074] Step 501: When a routing entry needs to be deleted, determine whether there is a routing entry corresponding to the routing entry that needs to be deleted in the routing table, if yes, perform step 502, otherwise, perform step 507;

[0075] Here, the timing to delete a certain routing entry is exactly the same as the timing for deleting a routing entry in the prior art. For example, if the network manager needs to delete a routing entry, the configuration information of the routing entry will be deleted. According to the deleted configuration information, the routing entries that need to be deleted can be obtained. The routing device can also obtain the routing entries that need to be deleted through learning according to the routing protocol. The routing device can also obtain the routing entries that need to be deleted according to the broadcast received from the network system, etc. Wait;

[0076] Said judging whether there is a routing entry corresponding to the routing entry that needs to be deleted in the routing table, specifically:

[0077] According to the destination IP address in the routing entry to be deleted, check whether there is a corresponding routing entry in the routing table.

[0078] Step 502: Judging whether the routing entry has an associated next-hop entry, if yes, execute step 503, otherwise, execute step 506;

[0079] Here, the judging whether the routing entry has an associated next-hop entry is specifically:

[0080] Judging whether the next hop pointer in the routing table item is zero, if it is zero, then it is considered that the routing table item has no associated next hop table item, if it is not zero, then it is considered that the routing table item has an associated next hop entry;

[0081] Wherein, the next hop pointer is the initial storage address of the next hop entry, and in actual application, zero address is not used to store the next hop entry, therefore, it can be judged whether the next hop pointer in the routing entry is is zero to determine whether the routing entry has an associated next-hop entry.

[0082] Step 503: Decrease the reference count value in the corresponding next hop entry by 1, and then execute step 504.

[0083] Step 504: judge whether the reference count value in the corresponding next-hop entry is 0, if yes, execute step 505, otherwise, execute step 506;

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

Description & Claims & Application Information

We can also present the details of the Description, Claims and Application information to help users get a comprehensive understanding of the technical details of the patent, such as background art, summary of invention, brief description of drawings, description of embodiments, and other original content. On the other hand, users can also determine the specific scope of protection of the technology through the list of claims; as well as understand the changes in the life cycle of the technology with the presentation of the patent timeline. Login to view more.

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