Intelligent networking method of routers based on Internet of Things

By obtaining the network routing task queue and calculating the routing task allocation recommendation coefficient of the virtual machine, and optimizing the routing task allocation, the network congestion problem caused by unreasonable allocation of routing virtual machine tasks in the Internet of Things router is solved, and the processing efficiency of routing tasks is improved.

CN118714076BActive Publication Date: 2024-12-03DONGGUAN CITY JIANG LIN HARDWARE IND CO LTD
View PDF 6 Cites 0 Cited by

Patent Information

Application Number
CN202411177950.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-08-27
Publication Date
2024-12-03
Estimated Expiration
2044-08-27

AI Technical Summary

Technical Problem

Internet of Things routers face serious network congestion when routing, mainly due to unreasonable assignment of tasks of routing virtual machines, resulting in inefficient routing.

Method used

By obtaining the network routing task queue, the virtual machine's routing task allocation recommendation coefficient is calculated based on the processing priority of the routing task and the processing efficiency of the virtual machine, the routing task allocation is reasonably allocated, the virtual machine's task allocation is optimized, and the routing task processing efficiency is improved. .

Benefits of technology

By optimizing the allocation of routing tasks, it slows down the occurrence of network congestion, improves the processing efficiency of routing task data, and makes the task allocation of virtual machines more balanced and reasonable.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118714076B_ABST
    Figure CN118714076B_ABST
Patent Text Reader

Abstract

The present application relates to the field of data communication technology, and specifically to a method for intelligent networking of routers based on the Internet of Things. The method comprises: obtaining a network routing task queue; optimizing task allocation for virtual machines according to routing tasks in the routing task queue, and obtaining a recommended coefficient for routing task allocation of the virtual machine; and allocating the routing tasks in the routing task queue according to the recommended coefficient for routing task allocation of the virtual machine. The embodiment of the present application optimizes routing resources for the acquired routing tasks, obtains the recommended coefficient for routing task allocation of the virtual machine, and then reasonably configures the routing tasks of the routing virtual machine according to the recommended coefficient for routing task allocation, so that the routing task allocation of the virtual machine is resource optimized, more balanced and reasonable, and improves the processing efficiency of routing task data, thereby reducing the occurrence of network congestion.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application belongs to the field of data communication technology, and specifically relates to a router intelligent networking method based on the Internet of Things. Background Art

[0002] With the development of the Internet era, more and more users are using the Internet, resulting in an explosive increase in network information. Faced with the rapid increase in network information, IoT routers will face serious network congestion when routing. This phenomenon is further aggravated by the unreasonable allocation of routing tasks of routing virtual machines. Summary of the invention

[0003] In order to solve the above problems, an embodiment of the present application provides a router intelligent networking method based on the Internet of Things, the method comprising:

[0004] Get the network routing task queue;

[0005] Performing task optimization allocation for virtual machines according to the routing tasks in the routing task queue to obtain a routing task allocation recommendation coefficient for the virtual machines;

[0006] The routing tasks in the routing task queue are allocated according to the routing task allocation recommendation coefficient of the virtual machine.

[0007] Optionally, performing task optimization allocation on the virtual machines according to the routing tasks in the routing task queue to obtain a routing task allocation recommendation coefficient for the virtual machines includes:

[0008] Obtaining the processing priority of the routing task;

[0009] According to the processing priority of the routing task, a recommended coefficient for allocating the routing task to the virtual machine is obtained.

[0010] Optionally, obtaining the processing priority of the routing task includes:

[0011] Obtaining the task importance of the routing task;

[0012] Obtaining the processing efficiency of the routing task in the virtual machine;

[0013] The processing priority of the routing task is obtained according to the task importance of the routing task and the processing efficiency of the virtual machine.

[0014] Optionally, obtaining the task importance of the routing task includes:

[0015] Obtaining the waiting time of the routing task in the routing task queue;

[0016] Obtaining the total number of routing tasks in the routing task queue and the number of similar tasks of similar tasks to the routing task;

[0017] The task importance of the routing task is acquired according to the waiting time, the total number and the number of similar tasks.

[0018] Optionally, obtaining the processing efficiency of the routing task in the virtual machine includes:

[0019] Obtain a task set of similar tasks to the routing task;

[0020] Obtaining a first number of the similar tasks in the task set;

[0021] Obtaining a second number of the similar tasks in the task set in the virtual machine;

[0022] Obtaining a processing time of the similar task in the virtual machine and a variance of the processing time;

[0023] The processing efficiency of the routing task in the virtual machine is obtained according to the first number, the second number, the processing time, and the variance of the processing time.

[0024] Optionally, the acquiring a task set of similar tasks to the routing task includes:

[0025] Obtaining the similarity between any two routing tasks in the routing task queue;

[0026] The routing tasks whose similarity is greater than a preset threshold are classified into a task set of similar tasks to the routing tasks.

[0027] Optionally, obtaining the similarity between any two routing tasks in the routing task queue includes:

[0028] Obtaining task vectors of any two routing tasks in the routing task queue;

[0029] According to the difference of the task vectors, the similarity between any two routing tasks in the routing task queue is obtained.

[0030] Optionally, acquiring the processing priority of the routing task according to the task importance of the routing task and the processing efficiency of the virtual machine includes:

[0031] Obtain the shortest processing time of the routing task in all virtual machines;

[0032] Obtaining the mean and variance of the processing efficiency of the routing task in all virtual machines;

[0033] The processing priority of the routing task is obtained according to the task importance, the shortest processing time, and the mean and variance of the processing efficiency.

[0034] Optionally, acquiring a recommended coefficient for allocating routing tasks to the virtual machine according to the processing priority of the routing tasks includes:

[0035] Obtaining the remaining processing capacity of the virtual machine;

[0036] According to the processing priority of the routing task, obtaining the minimum priority difference of the routing task in the virtual machine;

[0037] A routing task allocation recommendation coefficient of the virtual machine is obtained according to the remaining processing capacity, the minimum priority difference, and the processing efficiency of the virtual machine.

[0038] Optionally, allocating the routing task in the routing task queue according to the routing task allocation recommendation coefficient of the virtual machine includes:

[0039] The routing tasks in the routing task queue are allocated in descending order according to the numerical values ​​of the routing task allocation recommendation coefficients.

[0040] In summary, the embodiment of the present application provides a method for intelligent networking of routers based on the Internet of Things, the method comprising: obtaining a network routing task queue; optimizing task allocation for virtual machines according to the routing tasks in the routing task queue, and obtaining a recommended coefficient for routing task allocation of the virtual machine; and allocating the routing tasks in the routing task queue according to the recommended coefficient for routing task allocation of the virtual machine. The embodiment of the present application optimizes routing resources for the acquired routing tasks to obtain a recommended coefficient for routing task allocation of the virtual machine, and then reasonably configures the routing tasks of the routing virtual machine according to the recommended coefficient for routing task allocation, so that the routing task allocation of the virtual machine is resource optimized, more balanced and reasonable, and the processing efficiency of routing task data is improved, thereby reducing the occurrence of network congestion. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] In order to more clearly illustrate the implementation scheme of the present application, the drawings required for use in the implementation scheme will be briefly introduced below. It should be understood that the drawings only show certain implementation schemes of the present application and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other relevant drawings can be obtained based on the drawings without paying creative work.

[0042] Figure 1 is a flow chart of a method for intelligent networking of routers based on the Internet of Things according to an exemplary embodiment;

[0043] Figure 2 is a flow chart showing a method for obtaining a recommended coefficient for routing task allocation of a virtual machine according to an exemplary embodiment;

[0044] Figure 3 is a flowchart of a method for obtaining a processing priority of a routing task according to an exemplary embodiment;

[0045] Figure 4 is a flow chart showing a method for obtaining task importance of a routing task according to an exemplary embodiment;

[0046] Figure 5 is a flow chart showing a method for obtaining processing efficiency of a routing task in a virtual machine according to an exemplary embodiment;

[0047] Figure 6 is a flowchart of a method for obtaining a task set of similar tasks to a routing task according to an exemplary embodiment;

[0048] Figure 7 is a flow chart showing a method for obtaining the similarity of any two routing tasks in a routing task queue according to an exemplary embodiment;

[0049] Figure 8 is a flowchart of another method for obtaining the processing priority of a routing task according to an exemplary embodiment;

[0050] Fig. 9 is a flowchart of another method for obtaining a recommended coefficient of routing task allocation of a virtual machine according to an exemplary embodiment;

[0051] Fig.10 The invention is a flowchart showing a method for allocating routing tasks in a routing task queue according to an exemplary embodiment. DETAILED DESCRIPTION

[0052] In order to clearly illustrate the technical features of the present solution, the present application is described in detail below through specific implementation methods and in conjunction with the accompanying drawings.

[0053] The embodiments of the present application will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present application are shown in the accompanying drawings, it should be understood that the present application can be implemented in various forms and should not be construed as being limited to the embodiments described herein. Instead, these embodiments are provided to provide a more thorough and complete understanding of the present application. It should be understood that the drawings and embodiments of the present application are only for exemplary purposes and are not intended to limit the scope of protection of the present application.

[0054] It should be understood that the various steps described in the method implementation of the present application can be performed in different orders and / or performed in parallel. In addition, the method implementation may include additional steps and / or omit the steps shown. The scope of the present application is not limited in this respect.

[0055] The term "including" and its variations used herein are open inclusions, i.e., "including but not limited to". The term "based on" means "based at least in part on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". The relevant definitions of other terms will be given in the following description.

[0056] It should be noted that the concepts such as "first" and "second" mentioned in this application are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.

[0057] It should be noted that the modifications of "one" and "multiple" mentioned in this application are illustrative rather than restrictive. Those skilled in the art should understand that unless otherwise clearly indicated in the context, they should be understood as "one or more". In the description of this application, unless otherwise specified, "multiple" means two or more than two, and other quantifiers are similar; "at least one item", "one or more items" or similar expressions refer to any combination of these items, including any combination of single items or plural items. For example, at least one item a can represent any number of a; for another example, one or more items of a, b and c can represent: a, b, c, ab, ac, bc, or abc, where a, b, c can be single or multiple; "and / or" is a kind of association relationship that describes the associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural.

[0058] Although the operations or steps are described in a specific order in the drawings in the embodiments of the present application, it should not be understood that it is required to perform these operations or steps in the specific order shown or in a serial order, or to perform all the operations or steps shown to obtain the desired results. In the embodiments of the present application, these operations or steps can be performed in series; these operations or steps can also be performed in parallel; or some of these operations or steps can be performed.

[0059] At the same time, it is understandable that the data involved in this technical solution (including but not limited to the data itself, the acquisition or use of the data) shall comply with the requirements of relevant laws, regulations and relevant provisions.

[0060] First, the application scenario of the present application is described. When distributing router network data, the router obtains network requests from its own downstream users, such as refreshing web pages, querying, downloading resources, etc. These network data requests can be set as different routing task sets, and different routing tasks (data) in the routing task set are scheduled to different routing virtual machine resource nodes, and then distributed to different physical server nodes by different routing virtual machine resource nodes, thereby completing the routing task of network data.

[0061] When allocating routing tasks on the Internet, the random allocation of tasks will lead to uneven distribution of task loads of routing virtual machines, seriously affecting routing efficiency. When the Internet of Things router optimizes network routing resources, the routing tasks obtained by the router itself are diverse. In order to improve the task processing efficiency of the router, the processing time of routing data tasks in different virtual machines and the task load of the corresponding virtual machines can be analyzed to optimize the allocation of network routing resources (virtual machines) when routing tasks are connected to the Internet. The present application is described below in conjunction with specific embodiments.

[0062] Figure 1 FIG. 1 is a flow chart of a method for intelligently networking a router based on the Internet of Things according to an exemplary embodiment. Figure 1 As shown, the embodiment of the present application provides a router intelligent networking method based on the Internet of Things, which may include the following steps:

[0063] In step S10, a network routing task queue is obtained.

[0064] In this step, a network routing task queue is obtained. Exemplarily, the network routing tasks in the network routing task queue may be network request data initiated by network users, such as refreshing a web page, querying, downloading resources, and the like.

[0065] In step S20, tasks are optimally allocated to the virtual machines according to the routing tasks in the routing task queue to obtain a recommended coefficient for routing task allocation of the virtual machines.

[0066] In this step, the virtual machine is optimally assigned tasks according to the routing tasks in the routing task queue to obtain the routing task assignment recommendation coefficient of the virtual machine. Exemplarily, the processing priority of the routing task can be obtained first, and then the routing task assignment recommendation coefficient of the virtual machine can be obtained according to the processing priority of the routing task.

[0067] In step S30, the routing tasks in the routing task queue are allocated according to the routing task allocation recommendation coefficient of the virtual machine.

[0068] In this step, the routing tasks in the routing task queue are allocated according to the routing task allocation recommendation coefficient of the virtual machine. Exemplarily, the corresponding routing tasks in the routing task queue can be allocated in descending order according to the numerical value of the routing task allocation recommendation coefficient.

[0069] In summary, the embodiment of the present application provides a method for intelligent networking of routers based on the Internet of Things, the method comprising: obtaining a network routing task queue; optimizing task allocation for virtual machines according to the routing tasks in the routing task queue, and obtaining a recommended coefficient for routing task allocation of the virtual machine; and allocating the routing tasks in the routing task queue according to the recommended coefficient for routing task allocation of the virtual machine. The embodiment of the present application optimizes routing resources for the acquired routing tasks to obtain a recommended coefficient for routing task allocation of the virtual machine, and then reasonably configures the routing tasks of the routing virtual machine according to the recommended coefficient for routing task allocation, so that the routing task allocation of the virtual machine is resource optimized, more balanced and reasonable, and the processing efficiency of routing task data is improved, thereby reducing the occurrence of network congestion.

[0070] Figure 2 FIG. 1 is a flow chart showing a method for obtaining a routing task allocation recommendation coefficient of a virtual machine according to an exemplary embodiment. Figure 2 As shown, the optimizing task allocation for the virtual machine according to the routing tasks in the routing task queue to obtain the routing task allocation recommendation coefficient of the virtual machine may include the following steps:

[0071] In step S201, the processing priority of the routing task is obtained.

[0072] In this step, the processing priority of the routing task is obtained. Exemplarily, the task importance of the routing task can be obtained first, and then the processing efficiency of the routing task in the virtual machine can be obtained, and then the processing priority of the routing task can be obtained according to the task importance of the routing task and the processing efficiency of the virtual machine.

[0073] In step S202, a recommended coefficient for allocating routing tasks to the virtual machine is obtained according to the processing priority of the routing tasks.

[0074] In this step, according to the processing priority of the routing task, the routing task allocation recommendation coefficient of the virtual machine is obtained. Exemplarily, the remaining processing capacity of the virtual machine can be obtained, and then the minimum priority difference of the routing task in the virtual machine can be obtained, and then the routing task allocation recommendation coefficient of the virtual machine can be obtained according to the remaining processing capacity, the minimum priority difference and the processing efficiency of the virtual machine.

[0075] Figure 3 FIG. 1 is a flow chart showing a method for obtaining a processing priority of a routing task according to an exemplary embodiment. Figure 3 As shown, the obtaining of the processing priority of the routing task may include the following steps:

[0076] In step S2011, the task importance of the routing task is obtained.

[0077] In this step, the task importance of the routing task is obtained. Exemplarily, the waiting time of the routing task in the routing task queue can be obtained first, and then the total number of routing tasks in the routing task queue and the number of similar tasks of similar tasks of the routing task are obtained, and then the task importance of the routing task is obtained according to the waiting time, the total number and the number of similar tasks.

[0078] In step S2012, the processing efficiency of the routing task in the virtual machine is obtained.

[0079] In this step, the processing efficiency of the routing task in the virtual machine is obtained. Exemplarily, a task set of similar tasks to the routing task may be obtained first, then a first number of similar tasks in the task set may be obtained, then a second number of similar tasks in the task set in the virtual machine may be obtained, then a processing time of the similar tasks in the virtual machine and a variance of the processing time may be obtained, and then the processing efficiency of the routing task in the virtual machine may be obtained based on the first number, the second number, the processing time and the variance of the processing time.

[0080] In step S2013, the processing priority of the routing task is obtained according to the task importance of the routing task and the processing efficiency of the virtual machine.

[0081] In this step, the processing priority of the routing task is obtained according to the task importance of the routing task and the processing efficiency of the virtual machine. Exemplarily, the shortest processing time of the routing task in all virtual machines can be obtained first, and then the mean and variance of the processing efficiency of the routing task in all virtual machines can be obtained, and then the processing priority of the routing task can be obtained according to the task importance, the shortest processing time, the mean and variance of the processing efficiency.

[0082] Figure 4 FIG. 1 is a flow chart showing a method for obtaining the task importance of a routing task according to an exemplary embodiment. Figure 4 As shown, the obtaining of the task importance of the routing task may include the following steps:

[0083] In step S20111, the waiting time of the routing task in the routing task queue is obtained.

[0084] In this step, get the waiting time of routing task i in the routing task queue .

[0085] In step S20112, the total number of routing tasks in the routing task queue and the number of similar tasks of similar tasks to the routing task are obtained.

[0086] In this step, get the total number of routing tasks in the routing task queue , and the number of similar tasks of similar tasks of routing task i .

[0087] In step S20113, the task importance of the routing task is obtained according to the waiting time, the total number and the number of similar tasks.

[0088] In this step, based on the waiting time , Total number of tasks And the number of similar tasks , get the task importance of routing task i For example, the task importance of routing task i is It can be obtained by the following formula:

[0089] Formula 1

[0090] in, is the task importance of routing task i, is the number of routing tasks similar to routing task i, is the total number of routing tasks, is the waiting time of routing task i in the routing task queue, For normalization processing.

[0091] The larger the ratio, the greater the proportion of routing task i in the routing task queue, which also indicates that routing task i is more important in the routing task queue. The waiting time for routing task i is longer. The smaller it is, the more important the routing task i is.

[0092] Figure 5 FIG. 1 is a flow chart showing a method for obtaining the processing efficiency of a routing task in a virtual machine according to an exemplary embodiment. Figure 5 As shown, obtaining the processing efficiency of the routing task in the virtual machine may include the following steps:

[0093] In step S20121, a task set of similar tasks to the routing task is obtained.

[0094] In this step, a task set of similar tasks to the routing task is obtained. Exemplarily, the similarity between any two routing tasks in the routing task queue can be obtained first, and then routing tasks with similarity greater than a preset threshold are classified into the task set of similar tasks to the routing task.

[0095] In step S20122, a first number of the similar tasks in the task set is obtained.

[0096] In this step, get the first number of similar tasks of task i in the task set .

[0097] In step S20123, a second number of the similar tasks in the task set in the virtual machine is obtained.

[0098] In this step, the second number of similar tasks in the task set in virtual machine A is obtained. .

[0099] In step S20124, the processing time of the similar task in the virtual machine and the variance of the processing time are obtained.

[0100] In this step, the processing time of similar task Z in the virtual machine is obtained , and the variance of the processing time of all similar tasks .

[0101] In step S20125, the processing efficiency of the routing task in the virtual machine is obtained according to the first number, the second number, the processing time, and the variance of the processing time.

[0102] In this step, according to the first quantity , the second quantity , Processing time And the variance of processing time , obtain the processing efficiency of routing task i in virtual machine A For example, the processing efficiency of routing task i in virtual machine A is It can be obtained by the following formula:

[0103] Formula 2

[0104] in, is the processing efficiency of routing task i in virtual machine A, is the number of similar tasks to task i in the task set (the first number), is the number of similar tasks in virtual machine A (the second number), is the processing time of similar task Z in the virtual machine, is the variance of the processing time of all similar tasks of routing task i in virtual machine A, is an exponential function with a natural constant as its base.

[0105] This formula can determine the processing efficiency of virtual machine A for task i by calculating the ratio of the average processing time of similar tasks of routing task i in virtual machine A to the average processing time of similar tasks of routing task i in different virtual machines. The smaller the ratio, the shorter the processing time of task i in virtual machine A, and the higher the processing efficiency. At the same time, the variance of the processing time of all similar tasks of routing task i in virtual machine A is also taken into account. The smaller the variance, the more stable the corresponding processing effect and the higher the processing efficiency. It should be noted that according to experience, the variance is not zero.

[0106] Figure 6 FIG. 1 is a flowchart of a method for obtaining a task set of similar tasks to a routing task according to an exemplary embodiment. Figure 6 As shown, the task set of obtaining similar tasks to the routing task may include the following steps:

[0107] In step S201211, the similarity between any two routing tasks in the routing task queue is obtained.

[0108] In this step, the similarity between any two routing tasks in the routing task queue is obtained. Exemplarily, the task vectors of any two routing tasks in the routing task queue can be obtained first, and then the similarity between any two routing tasks in the routing task queue can be obtained based on the difference between the task vectors.

[0109] In step S201212, the routing tasks whose similarity is greater than a preset threshold are classified into a task set of similar tasks to the routing tasks.

[0110] In this step, routing tasks with similarity greater than a preset threshold are classified into a task set of similar tasks to the routing tasks. Exemplarily, the preset threshold may be 0.7.

[0111] Figure 7 FIG. 1 is a flow chart showing a method for obtaining the similarity of any two routing tasks in a routing task queue according to an exemplary embodiment. Figure 7 As shown, the obtaining of the similarity of any two routing tasks in the routing task queue may include the following steps:

[0112] In step S2012111, the task vectors of any two routing tasks in the routing task queue are obtained.

[0113] In this step, get the task vectors of any two routing tasks in the routing task queue and .

[0114] In step S2012112, the similarity between any two routing tasks in the routing task queue is obtained according to the difference between the task vectors.

[0115] In this step, according to the difference of the task vector The modulus value of gets the similarity between any two routing tasks in the routing task queue, routing task i and routing task a For example, the similarity between routing task i and routing task a is It can be obtained by the following formula:

[0116] Formula 3

[0117] in, is the similarity between routing task i and routing task a, and is the task vector of any two routing tasks in the routing task queue, is the modulus of the difference between the two task vectors, is an exponential function with a natural constant as its base.

[0118] Figure 8 FIG. 1 is a flowchart of another method for obtaining the processing priority of a routing task according to an exemplary embodiment. Figure 8 As shown, obtaining the processing priority of the routing task according to the task importance of the routing task and the processing efficiency of the virtual machine may include the following steps:

[0119] In step S20131, the shortest processing time of the routing task in all virtual machines is obtained.

[0120] In this step, the shortest processing time (maximum processing efficiency) of the routing task in all virtual machines is obtained. .

[0121] In step S20132, the mean and variance of the processing efficiency of the routing task in all virtual machines are obtained.

[0122] In this step, the average processing efficiency of routing tasks in all virtual machines is obtained. and variance .

[0123] In step S20133, the processing priority of the routing task is obtained according to the task importance, the shortest processing time, and the mean and variance of the processing efficiency.

[0124] In this step, according to the importance of the task , Shortest processing time , the mean of processing efficiency and variance , get the processing priority of routing task i . Exemplarily, the processing priority of routing task i It can be obtained by the following formula:

[0125] Formula 4

[0126] in, is the processing priority of routing task i, is the task importance of routing task i, is the shortest processing time (maximum processing efficiency) of routing task i in different virtual machines, is the mean processing efficiency of routing task i in different virtual machines, is the variance of the processing efficiency of routing task i in different virtual machines. It should be noted that, according to experience, this variance is not zero.

[0127] This formula comprehensively considers the task importance of routing task i, the shortest processing time of routing task i in different virtual machines, and the ratio of the mean to the variance of the processing efficiency of routing task i in different virtual machines to obtain the processing priority of routing task i. That is, the greater the task importance, the greater the maximum processing efficiency, and the greater the ratio of the mean to the variance of the processing efficiency, the higher the processing priority of routing task i.

[0128] Fig. 9 FIG. 1 is a flow chart showing another method for obtaining a recommended coefficient for routing task allocation of a virtual machine according to an exemplary embodiment. Fig. 9 As shown, obtaining the recommended coefficient for allocating the routing task of the virtual machine according to the processing priority of the routing task may include the following steps:

[0129] In step S2021, the remaining processing capacity of the virtual machine is obtained.

[0130] In this step, obtain the remaining processing capacity of virtual machine A Among them, the remaining processing capacity can be understood as idle processing capacity.

[0131] In step S2022, according to the processing priority of the routing task, the minimum priority difference of the routing task in the virtual machine is obtained.

[0132] In this step, the minimum priority difference between routing task i and other routing tasks in the virtual machine is obtained. , calculate the absolute value of the difference between the processing priority of routing task i and the processing priority of other routing tasks, and take the minimum absolute value of the difference as the minimum priority difference.

[0133] In step S2023, a routing task allocation recommendation coefficient of the virtual machine is obtained according to the remaining processing capacity, the minimum priority difference, and the processing efficiency of the virtual machine.

[0134] In this step, the remaining processing capacity , minimum priority difference and the processing efficiency of virtual machines , get the recommended coefficient of routing task allocation of routing task i relative to virtual machine A For example, the recommended coefficient of routing task allocation for routing task i relative to virtual machine A is It can be obtained by the following formula:

[0135] Formula 5

[0136] in, Assign a recommended coefficient to routing task i relative to the routing task of virtual machine A, is the remaining processing capacity of virtual machine A, is the minimum priority difference between routing task i and other routing tasks in the virtual machine, is the processing efficiency of routing task i in virtual machine A, For normalization processing.

[0137] This formula obtains the recommended task allocation coefficient of task i in virtual machine A by judging the remaining utilization (remaining processing capacity) of virtual machine A. The higher the remaining utilization, the more computing power virtual machine A has to support routing task processing. Therefore, the higher the recommended task allocation coefficient for task i configured in virtual machine A is. The smaller the difference in minimum priority between routing task i and other routing tasks in virtual machine A is, the more similar tasks to task i are in the task queue. Then task i should not be configured in virtual machine A, and the lower the recommended task allocation coefficient for task i configured in virtual machine A is. The higher the processing efficiency of routing task i in virtual machine A is, the more it should be configured in virtual machine A, and the higher the recommended task allocation coefficient for task i configured in virtual machine A is.

[0138] Fig.10 FIG. 1 is a flow chart showing a method for allocating routing tasks in a routing task queue according to an exemplary embodiment. Fig.10 As shown, allocating the routing tasks in the routing task queue according to the routing task allocation recommendation coefficient of the virtual machine may include the following steps:

[0139] In step S301, the routing tasks in the routing task queue are allocated in descending order according to the numerical values ​​of the routing task allocation recommendation coefficients.

[0140] In this step, the recommendation coefficient is assigned according to the routing task The value of is assigned in descending order to the routing task i in the routing task queue to the virtual machine A for routing processing. In this way, the balance of network routing resources can be improved, the network routing resources can be used to the maximum extent, the routing efficiency can be improved, and the probability of network congestion can be reduced.

[0141] In summary, the embodiment of the present application provides a method for intelligent networking of routers based on the Internet of Things, the method comprising: obtaining a network routing task queue; optimizing task allocation for virtual machines according to the routing tasks in the routing task queue, and obtaining a recommended coefficient for routing task allocation of the virtual machine; and allocating the routing tasks in the routing task queue according to the recommended coefficient for routing task allocation of the virtual machine. The embodiment of the present application optimizes routing resources for the acquired routing tasks to obtain a recommended coefficient for routing task allocation of the virtual machine, and then reasonably configures the routing tasks of the routing virtual machine according to the recommended coefficient for routing task allocation, so that the routing task allocation of the virtual machine is resource optimized, more balanced and reasonable, and the processing efficiency of routing task data is improved, thereby reducing the occurrence of network congestion.

[0142] The present application also provides a computer-readable storage medium on which computer program instructions are stored. When the program instructions are executed by a processor, the steps of the router intelligent networking method based on the Internet of Things provided by the present application are implemented.

[0143] In another exemplary embodiment, a computer program product is also provided, which includes a computer program that can be executed by a programmable electronic device, and the computer program has a code portion for executing the above-mentioned IoT-based router intelligent networking method when executed by the programmable electronic device.

[0144] The above-mentioned embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for ordinary technicians in this field, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application.

Claims

1. A router intelligent networking method based on the Internet of Things, characterized in that: The method comprises: Get the network routing task queue; Performing task optimization allocation for virtual machines according to the routing tasks in the routing task queue to obtain a routing task allocation recommendation coefficient for the virtual machines; Allocate the routing task in the routing task queue according to the routing task allocation recommendation coefficient of the virtual machine; The step of optimizing the task allocation for the virtual machine according to the routing tasks in the routing task queue to obtain the routing task allocation recommendation coefficient for the virtual machine includes: Obtaining the processing priority of the routing task; According to the processing priority of the routing task, obtaining the routing task allocation recommendation coefficient of the virtual machine; The obtaining of the processing priority of the routing task includes: Obtaining the task importance of the routing task; Obtaining the processing efficiency of the routing task in the virtual machine; Obtaining a processing priority of the routing task according to the task importance of the routing task and the processing efficiency of the virtual machine; The obtaining the task importance of the routing task includes: Obtaining the waiting time of the routing task in the routing task queue; Obtaining the total number of routing tasks in the routing task queue and the number of similar tasks of similar tasks to the routing task; Obtaining the task importance of the routing task according to the waiting time, the total number and the number of similar tasks; The obtaining the processing efficiency of the routing task in the virtual machine includes: Obtain a task set of similar tasks to the routing task; Obtaining a first number of the similar tasks in the task set; Obtaining a second number of the similar tasks in the task set in the virtual machine; Obtaining a processing time of the similar task in the virtual machine and a variance of the processing time; Obtaining a processing efficiency of the routing task in the virtual machine according to the first number, the second number, the processing time, and a variance of the processing time; The obtaining the processing priority of the routing task according to the task importance of the routing task and the processing efficiency of the virtual machine includes: Obtain the shortest processing time of the routing task in all virtual machines; Obtaining the mean and variance of the processing efficiency of the routing task in all virtual machines; The processing priority of the routing task is obtained according to the task importance, the shortest processing time, and the mean and variance of the processing efficiency.

2. The method for intelligent networking of routers based on the Internet of Things according to claim 1, characterized in that: The step of obtaining a task set of similar tasks to the routing task includes: Obtaining the similarity between any two routing tasks in the routing task queue; The routing tasks whose similarity is greater than a preset threshold are classified into a task set of similar tasks to the routing tasks.

3. The method for intelligent networking of routers based on the Internet of Things according to claim 2, characterized in that: The obtaining the similarity of any two routing tasks in the routing task queue includes: Obtaining task vectors of any two routing tasks in the routing task queue; According to the difference of the task vectors, the similarity between any two routing tasks in the routing task queue is obtained.

4. The method for intelligent networking of routers based on the Internet of Things according to claim 1, characterized in that: The obtaining, according to the processing priority of the routing task, a recommended coefficient for allocating the routing task to the virtual machine includes: Obtaining the remaining processing capacity of the virtual machine; According to the processing priority of the routing task, obtaining the minimum priority difference of the routing task in the virtual machine; A routing task allocation recommendation coefficient of the virtual machine is obtained according to the remaining processing capacity, the minimum priority difference, and the processing efficiency of the virtual machine.

5. The method for intelligent networking of routers based on the Internet of Things according to claim 1, characterized in that: The allocating the routing task in the routing task queue according to the routing task allocation recommendation coefficient of the virtual machine includes: The routing tasks in the routing task queue are allocated in descending order according to the numerical values ​​of the routing task allocation recommendation coefficients.

Citation Information

Patent Citations

  • Task processing method and device, electronic equipment and computer readable storage medium

    CN114327767A

  • Data processing system of cloud computing data center

    CN115167973A

  • Resource scheduling method and device, computer equipment and storage medium

    CN115658292A

  • Clustering-based workflow scheduling method, equipment and system in IoT (Internet of Things) environment

    CN117032921A

  • Backpressure from an external processing system transparently connected to a router

    US20210250308A1