CN104506440B - The data packet sending method and routing table amending method of router - Google Patents

Abstract

The invention provides a router data packet sending method and a routing table modification method, and relates to the field of electronic information. In the routing table modification method provided by the embodiment of the present invention, multiple sub-routing tables are pre-established, and each sub-routing table is used to provide corresponding access paths to different threads in the router, so that all threads will not access the same routing table at the same time. A sub-routing table, and lock and modify the specified sub-routing table in turn, so that the sub-routing table will not be locked at the same time, that is, all threads in the router will not stop working at the same time, which also makes the modification of the sub-routing table The time for the thread to stop working is divided, even if the routing table is modified, it will not cause the router to reduce the transmission efficiency of the data packet in a certain period of time, and by setting the modification time of the secondary routing table The interval and the number of threads that each secondary routing table receives access to reasonably control the energy efficiency of the router.

Description

Router data packet sending method and routing table modification method

technical field

The invention relates to the field of electronic information, in particular to a data packet sending method and a routing table modification method of a router.

Background technique

Routers are an integral part of today's networks. Routers realize network interconnection by forwarding data packets. The network architecture shown in Figure 1 consists of router A, router B, switches A, B and corresponding computers.

When sending data packets specifically, for example, (1) PC-A wants to send data packets to PC-C, if PC-A does not have the IP address of PC-C, then PC-A will first send a dns request, Router A or the dns analysis server will respond to PC-A with the IP address of PC-C to complete the IP address information, so that PC-A has all the IP address information about the third layer of the data packet: source IP address: PC-A , destination ip address: PC-C.

(2) Next, PC-A needs to know how to reach PC-C, and then, PC-A will send an arp address resolution request, and sending this address resolution request is not to obtain the MAC address of the target host PC-C, but Send the request to router A, and then the MAC address in router A will be sent to the source host PC-A to complete the MAC address information, so that the second layer information of the data packet of PC-A is also complete, the source MAC address: MAC address of PC-A, destination MAC address: MAC address of router A,

(3) Then the data will arrive at switch A. Switch A sees the second-layer destination MAC address of the data packet, which is destined for router A, so it sends the data packet to router A. When router A receives the data packet, it first checks the data If the third layer ip destination address of the packet has a route to PC-C in its own routing table, it means that this is a routable data packet, and the data packet can be sent to PC-C according to the local routing table. The next network node (router B) completes the transmission of the data packet.

The process by which routers perform IP reassembly and packetization. First replace the second-layer header information of this data packet. The router PC-A will go through a wide area network to reach PC-C, where many protocols related to the wide area network will be encapsulated. Its function is also to find information for the next stage. Simultaneously rechecks the second and third layer packets. Send the data over the Internet. Finally, it passes through many network nodes, and finally sends it to the target host PC_C.

In related technologies, when each network node transmits IP packets, multiple threads usually process the routing table serially, resulting in low routing processing efficiency. Wherein, the routing table refers to a table stored on a router or other network nodes, and a path to a specific network terminal is stored in the table.

The routing table will be modified at any time according to the user's situation (such as adding or deleting routing rules). When modifying the routing table, the routing table is locked first, and threads are not allowed to access it, resulting in all threads needing to stop working, etc. After the routing table is modified and released, the thread can access (read and write) the routing table. That is, in the related technology, due to the modification of the routing table, the transmission efficiency of the data packet by the router in a certain period of time will be reduced.

Contents of the invention

The purpose of the present invention is to provide a router data packet sending method and a routing table modification method to solve the above problems.

A data packet sending method of a router is provided in an embodiment of the present invention, including:

Obtain the corresponding data packet through a specified thread;

According to the operation code carried in the data packet, look up the access path corresponding to the operation code in the sub-routing table corresponding to the thread, one router includes multiple sub-routing tables, and each sub-routing table Used to provide corresponding access paths to different threads in the router;

Send the data packet according to the obtained access path.

Preferably, each of the secondary routing tables corresponds to one of the threads, and each of the secondary routing tables only allows one of the threads to query the access path.

Preferably, each of the secondary routing tables corresponds to a plurality of threads, and the multiple threads corresponding to one of the secondary routing tables are used to process transactions of the same type, and each of the secondary routing tables only Multiple threads corresponding to it are allowed to query the access path.

The embodiment of the present invention also provides a routing table modification method, including:

If the command to modify the routing table is received, the specified secondary routing table will be locked in turn, so that the thread corresponding to the locked secondary routing table cannot access it. A router includes multiple secondary routing tables, and each secondary routing table The routing table is used to provide corresponding access paths to different threads in the router;

modifying the locked secondary routing table according to a preset method;

The modified secondary routing table is released so that the thread corresponding to the specified secondary routing table can access it.

Preferably, said locking the specified secondary routing table includes:

Each of the secondary routing tables in the router is sequentially locked according to a preset interval time.

Preferably, the sequentially locking each of the secondary routing tables in the router according to the preset interval time includes:

After one of the secondary routing tables is modified and released, the next secondary routing table is locked in a preset order until each of the secondary routing tables in the router is modified and released.

Preferably, the method further includes: checking whether the instruction to modify the routing table is received every predetermined checking time.

Preferably, it also includes: the predetermined inspection time is 2-5 seconds.

Preferably, each of the secondary routing tables corresponds to one of the threads, and each of the secondary routing tables only allows one of the threads to query the access path.

Preferably, each of the secondary routing tables corresponds to a plurality of threads, and the multiple threads corresponding to one of the secondary routing tables are used to process transactions of the same type, and each of the secondary routing tables only Multiple threads corresponding to it are allowed to query the access path.

The routing table modification method provided by the embodiment of the present invention is different from that in the prior art by first locking the only routing table in a router, so that the threads in the router cannot access the routing table. Compared with the modification of the router table, the modified router cannot perform the work normally, and then the efficiency of data packet transmission is reduced. Compared with it, it establishes multiple sub-routing tables in advance, and each sub-routing table is used to send data to different routing tables in the router. The thread provides the corresponding access path, so that all threads will not access the same sub-routing table at the same time, and lock and modify the specified sub-routing table in turn, so that the sub-routing table will not be locked at the same time, that is, all the sub-routing tables in the router The threads will not stop working at the same time, which also distributes the time for the threads to stop working due to the modification of the secondary routing table. Even if the routing table is modified, it will not cause the router to transmit the data packet in a certain period of time. Efficiency is reduced, thereby solving the deficiencies in the prior art.

Description of drawings

FIG. 1 shows a traditional network architecture including routers in the related art;

Fig. 2 shows the basic flow of the data packet sending method of the router of the embodiment of the present invention;

Fig. 3 shows the basic flow of the routing table modification method of the embodiment of the present invention;

Fig. 4 shows a schematic diagram of the sequence of modifying the primary routing table and the secondary routing table of the routing table modifying method according to the embodiment of the present invention.

detailed description

The present invention will be described in further detail below through specific implementation examples and in conjunction with the accompanying drawings. Embodiment 1 of the present invention provides a data packet sending method of a router, as shown in Figure 2, comprising the following steps:

S101, obtain a corresponding data packet through a designated thread;

S102, according to the operation code carried in the data packet, look up the access path corresponding to the operation code in the sub-routing table corresponding to the thread, a router includes multiple sub-routing tables, and each sub-routing table is used to send to the router Different threads in provide corresponding access paths;

S103. Send the data packet according to the obtained access path.

A thread is a single sequential flow of control within a process. Also known as lightweight processes (lightweightprocesses). A computer science term referring to the scheduling unit of a running program.

A thread, sometimes called a Lightweight Process (LWP), is the smallest unit of program execution flow. A standard thread consists of thread ID, current instruction pointer (PC), register set and stack. In addition, a thread is an entity in a process, and it is the basic unit independently scheduled and dispatched by the system. The thread itself does not own system resources, but only a few resources that are necessary for running. However, it can interact with other resources belonging to the same process Threads share all resources owned by the process. One thread can create and cancel another thread, and multiple threads in the same process can execute concurrently. Due to the mutual restriction between threads, the threads show discontinuity in operation. Threads also have three basic states: ready, blocked, and running. Every program has at least one thread, and if a program has only one thread, it is the program itself.

A thread is a single sequential flow of control in a program. A thread is also the smallest unit that a control can execute. Therefore, when a process is processing a transaction, it is actually completed by multiple smaller threads. If a process does not contain smaller threads, then This process should be considered as the smallest unit to complete a specified transaction in a specific environment. Therefore, the thread referred to in this embodiment should be understood as a control flow that executes a certain function in the router, and the concept of this control flow should include a process or thread in the traditional sense.

In step S101, obtaining the corresponding data packet through a certain thread is the most basic condition for the router to work. When the specified thread processes the data packet, it will execute according to the predetermined steps according to the data in the data packet.

In step S102, it is necessary to pre-set up a sub-routing table for one or more threads, and establish a corresponding relationship between the sub-routing table and threads, and each thread also accesses the sub-routing table corresponding to itself. When establishing the corresponding relationship between the sub-routing table and threads, it can be one-to-one or one-to-many, that is, the sub-routing table can be accessed by one thread or by multiple threads, but one The routing table cannot be accessed by all threads in the same router. The sub-routing table and the routing table in the related art may have a completely corresponding relationship, or a partially corresponding relationship, that is, the content of the sub-routing table may be completely related to the content of the routing table in the related technology, and it is recorded that it is related to the local router. All relevant information for threads to access; it can also be that the content recorded in each sub-routing table is only a part of the content of the routing table in the related technology, such as the information contained in the complete routing table of a router. It is divided into four parts, which are A, B, C and D. The sub-routing table can only carry one, some two, or some three of A, B, C and D, but what needs to be guaranteed is the sub-routing table. The content carried in the routing table is sufficient to provide access to the corresponding thread, that is, the specified thread can obtain necessary information by accessing the sub-routing table corresponding to the thread.

After the auxiliary routing table is prepared, each thread only needs to access the auxiliary routing table corresponding to the thread when it needs to query the access path. In the routing table access method in the related art (there is only one routing table in each router), the routing table in the same router can only access the same routing table, and multiple threads access the routing table in a serial manner , or multiple threads cannot access the routing table at the same time, which will also limit the processing speed of the thread to a certain extent. And the data packet sending method of the router provided by the present invention, because one or more threads are separately configured sub-routing table, therefore, the threads in the same router can visit different sub-routing tables respectively, just make each thread Both can access the corresponding secondary routing table at the same time, and then obtain the corresponding access path, which also makes the thread do not need to wait for the end of the access of other threads when accessing the specified secondary routing table, or the waiting time is greatly reduced. Small, thereby improving the efficiency of the thread to obtain the access path, and also improving the processing efficiency of the thread.

In step S103, each thread obtains a predetermined access path by accessing its corresponding sub-routing table, and only needs to send the data packet to the specified address according to the obtained access path, thus completing the processing of the data packet by the routing table. forwarding work.

Further, considering the specific use environment, it may be that each sub-routing table corresponds to one thread, and each sub-routing table only allows one thread to query the access path.

A corresponding thread is configured for each secondary routing table, so that only this thread can access the secondary routing table. Therefore, when the thread accesses the routing table, it no longer needs to be queued, and the processing efficiency of the thread can be greatly improved.

Specifically, each secondary routing table may be modified according to the original primary routing table in the router. The main routing table mentioned here has the same function as the routing table in the related art, and the main routing table grasps all relevant information such as access paths in the router. After the main routing table receives the modification information and completes the modification, each secondary routing table is modified at a time, that is, the modification of the secondary routing table is based on the modification of the main routing table. As shown in FIG. 4 , after the modification of the main routing table is completed, each secondary routing table is modified sequentially and at predetermined intervals. That is, after the main routing table is modified, the first secondary routing table is modified, and after the first secondary routing table is modified, the second secondary routing table is modified. After the second secondary routing table is modified, the second secondary routing table is modified. The three sub-routing tables are modified until all the sub-routing tables are modified.

However, if there are too many threads in a router, configuring a secondary routing table for each thread will occupy more system resources. In order to overcome this problem, it may be that each sub-routing table corresponds to multiple threads, and the multiple threads corresponding to one sub-routing table are all used to process transactions of the same category, and each sub-routing table only allows The corresponding multiple threads query the access path.

Multiple threads corresponding to a secondary routing table can belong to the same program, so that only the content associated with these threads can be stored in the secondary routing table, and the redundant ones can not be stored, so as to reduce the occupation of system resources . Transactions of the same category can perform similar actions as an application program. Classifying multiple threads in the same router and configuring a sub-routing table for each type of thread can reduce the number of redundant sub-routing tables in the system and improve the processing speed of threads to a certain extent.

Regardless of configuring a sub-routing table for each thread or multiple threads, the number of contents in the sub-routing table can be determined according to the situation of the thread corresponding to the sub-routing table, and the thread corresponding to itself cannot use Content is not stored to reduce system resource usage.

The data packet sending method of the router provided by the present invention pre-sets a plurality of sub-routing tables, and each sub-routing table is used to provide corresponding access paths to different threads in the router, and taking into account specific usage In this case, one sub-routing table corresponds to one thread, or one sub-routing table corresponds to multiple threads, so that when a thread needs to access the corresponding routing table, each thread in the same router can access The corresponding secondary routing table, so that when the thread accesses the routing table, there will be no queuing, which improves the processing speed of the thread.

Embodiment 2 of the present invention provides a routing table modification method, as shown in Figure 3, including the following steps:

S201. If an instruction to modify the routing table is received, then lock the specified secondary routing table in turn, so that threads corresponding to the locked secondary routing table cannot access it. A router includes multiple secondary routing tables, and each A secondary routing table is used to provide corresponding access paths to different threads in the router;

S202, modify the locked secondary routing table in a preset manner;

S203. Release the modified secondary routing table so that threads corresponding to the specified secondary routing table can access it.

The routing table modification method provided in this embodiment is similar to the router data packet sending method provided in Embodiment 1, and also needs to establish a corresponding relationship between the secondary routing table and the thread.

That is, it is necessary to pre-set the sub-routing table for one or more threads, and establish the corresponding relationship between the sub-routing table and the thread, and each thread also accesses the sub-routing table corresponding to itself. When establishing the corresponding relationship between the sub-routing table and threads, it can be one-to-one or one-to-many, that is, the sub-routing table can be accessed by one thread or by multiple threads, but one The routing table cannot be accessed by all threads in the same router. The sub-routing table and the routing table in the related art may have a completely corresponding relationship, or a partially corresponding relationship, that is, the content of the sub-routing table may be completely related to the content of the routing table in the related technology, and it is recorded that it is related to the local router. All relevant information for threads to access; it can also be that the content recorded in each sub-routing table is only a part of the content of the routing table in the related technology, such as the information contained in the complete routing table of a router. It is divided into four parts, which are A, B, C and D. The sub-routing table can only carry one, some two, or some three of A, B, C and D, but what needs to be guaranteed is the sub-routing table. The content carried in the routing table is sufficient to provide access to the corresponding thread, that is, the specified thread can obtain necessary information by accessing the sub-routing table corresponding to the thread. The functions and functions of the secondary routing table in this embodiment are the same as those of the secondary routing table in Embodiment 1, and will not be repeated here.

In related technologies, there is only one routing table in a router. When modifying the routing table, the only routing table needs to be locked and released after modification. That is, the thread that needs to access the routing table is It cannot work when the routing table is locked. This also reduces the processing efficiency of the thread.

In the routing table modification method provided by the present invention, in step S101, since a plurality of sub-routing tables have been set up, when the routing table needs to be modified and the routing table is changed, it is necessary to modify each sub-routing table. The routing table is modified, or the sub-routing table containing the specified content is modified. Every time when modifying all routing tables in a router, it is necessary to lock each routing table separately, and then modify the specific content after locking. The modification process is the same as that in related technologies. Herein ,No longer. However, in order to ensure that multiple threads in the same router will not stop working at the same time, each secondary routing table that needs to be modified can be locked, modified and released in a predetermined order. That is, all secondary routing tables will not be modified at the same time, so that threads in the same router will not stop working at the same time.

Step S102 may modify the secondary routing table in a preset manner.

In step S103, the modified routing table is released so that the thread corresponding to the secondary routing table can access it, that is, the thread corresponding to the routing table resumes normal work.

It should be noted that when the routing table is modified, the modification to the next sub-routing table can be done after the modification of the previous sub-routing table is completed, or it can be modified to a predetermined level in a sub-routing table, or After starting to modify the predetermined time, the next routing table is modified (the modification here includes three actions of locking, modifying and releasing).

Further, in step S201, locking the specified secondary routing table includes:

Lock each secondary routing table in the router in turn according to the preset interval time.

That is, in order to shorten the overall modification time of the routing table, and at the same time, in order to prevent the number of threads in the same router from stopping work at the same time within a certain period of time, each secondary routing table can be modified sequentially according to the preset interval. Modifications.

Further, according to the preset interval time, each secondary routing table in the router is sequentially locked including:

After a secondary routing table is modified and released, the next secondary routing table is locked in a preset order until every secondary routing table in the router is modified and released.

That is, after the modification of a secondary routing table is completed, the modification of the next secondary routing table is started, so that the number of threads that stop working within a period of time can be reasonably controlled.

In order to better check whether there is a routing table modifying instruction, the routing table modifying method provided by the present invention further includes: checking whether a routing table modifying instruction is received every predetermined checking time.

The scheduled inspection time is 2-5 seconds.

As long as a new routing table modification instruction is detected, the secondary routing table can be modified in a predetermined order.

Similar to the routing table provided in Example 1

Considering the specific use environment, it may be that each sub-routing table corresponds to one thread, and each sub-routing table only allows one thread to query the access path.

A corresponding thread is configured for each secondary routing table, so that only this thread can access the secondary routing table. Therefore, when the thread accesses the routing table, it no longer needs to be queued, and the processing efficiency of the thread can be greatly improved.

If there are too many threads in a router, configuring a secondary routing table for each thread will occupy more system resources. In order to overcome this problem, it may be that each sub-routing table corresponds to multiple threads, and the multiple threads corresponding to one sub-routing table are all used to process transactions of the same category, and each sub-routing table only allows The corresponding multiple threads query the access path.

Multiple threads corresponding to a secondary routing table can belong to the same program, so that only the content associated with these threads can be stored in the secondary routing table, and the redundant ones can not be stored, so as to reduce the occupation of system resources . Transactions of the same category can perform similar actions as an application program. Classifying multiple threads in the same router and configuring a sub-routing table for each type of thread can reduce the number of redundant sub-routing tables in the system and improve the processing speed of threads to a certain extent.

Regardless of configuring a sub-routing table for each thread or multiple threads, the number of contents in the sub-routing table can be determined according to the situation of the thread corresponding to the sub-routing table, and the thread corresponding to itself cannot use Content is not stored to reduce system resource usage.

Moreover, considering the specific modification situation, in order to control the number of secondary routing tables that are in the modified state within a certain period of time, and to shorten the overall modification time, it can be determined according to the number of contents in the secondary routing table The modification order of the secondary routing table and the difference between the start modification time points of two adjacent secondary routing tables.

According to the number of threads corresponding to the sub-routing table, or the importance of the threads corresponding to the sub-routing table, the sub-routing table with a large number of corresponding threads can be modified first, or the corresponding thread is more important Modify the secondary routing table.

In the routing table modification method provided by the embodiment of the present invention, multiple sub-routing tables are established in advance, and each sub-routing table is used to provide corresponding access paths to different threads in the router, so that all threads will not access the same routing table at the same time. Sub-routing table, and lock and modify the designated sub-routing table in turn, so that the sub-routing table will not be locked at the same time, that is, all threads in the router will not stop working at the same time, which also makes the modification of the sub-routing table However, the time for the thread to stop working is apportioned, even if the routing table is modified, it will not cause the router to reduce the transmission efficiency of the data packet in a certain period of time, and by setting the modification order and modification of the sub-routing table interval, so that the secondary routing table in the same router can be modified relatively quickly, and the overall modification time is shorter, thereby better solving the shortcomings in the prior art.

Apparently, those skilled in the art should understand that each step of the present invention described above can be realized by a general-purpose computing device, and they can be concentrated on a single computing device, or distributed on a network formed by multiple computing devices. Optionally, they can be implemented with executable program codes of computing devices, thus, they can be stored in storage devices to be executed by computing devices, or they can be made into individual integrated circuit modules, or a plurality of them Modules or steps are implemented as a single integrated circuit module. As such, the present invention is not limited to any specific combination of hardware and software.

The above descriptions are only preferred embodiments of the present invention, and are not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and changes. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present invention shall be included within the protection scope of the present invention.

Claims (10)

1. the data packet sending method of router, it is characterised in that including：

Pass through packet corresponding to specified thread acquisition；

According to entrained operation code in the packet, the operation is searched in the secondary routing table corresponding with the thread Access path corresponding to code, a router includes multiple secondary routing tables, and each secondary routing table is used for the road The access path as corresponding to providing thread different in device；

The packet is transmitted according to the access path got.

2. the data packet sending method of router according to claim 1, it is characterised in that each secondary routing table with One thread is corresponding, and each secondary routing table only allows a thread pool access path.

3. the data packet sending method of router according to claim 1, it is characterised in that each secondary routing table with Multiple threads are corresponding, are used to handle classification identical thing with the corresponding multiple threads of the secondary routing table Business, and each secondary routing table only allows multiple thread pool access path corresponding thereto.

4. routing table amending method, it is characterised in that including：

If receiving modification routing table instruction, the secondary routing table specified is pinned successively, is made relative with the secondary routing table being lockable The thread answered can not be accessed it, and a router includes multiple secondary routing tables, and each secondary routing table is used for the road The access path as corresponding to providing thread different in device；

The secondary routing table pinned is modified according to default mode；

By the secondary routing table release of modified completion, allow the thread corresponding with the secondary routing table specified right It is accessed.

5. routing table amending method according to claim 4, it is characterised in that described to pin the secondary routing table bag specified Include：

According to default interval time, each secondary routing table in the router is pinned successively.

6. routing table amending method according to claim 5, it is characterised in that it is described according to default interval time, according to The secondary each secondary routing table pinned in the router includes：

After changing and discharging a secondary routing table, next secondary routing table is lived according still further to default sequence lock, directly Each secondary routing table into the router is changed and discharged.

7. routing table amending method according to claim 4, it is characterised in that also include：Every the predetermined review time, Check whether to receive the modification routing table instruction.

8. routing table amending method according to claim 7, it is characterised in that also include：The predetermined review time For the 2-5 seconds.

9. routing table amending method according to claim 4, it is characterised in that each secondary routing table with described in one Thread is corresponding, and each secondary routing table only allows a thread pool access path.

10. routing table amending method according to claim 4, it is characterised in that each secondary routing table and multiple institutes State that thread is corresponding, be used to handle classification identical affairs with the corresponding multiple threads of the secondary routing table, and often The individual secondary routing table only allows multiple thread pool access path corresponding thereto.