Message processing method and system for overload node
By identifying overload nodes in the Internet of Vehicles environment and transferring their messages to available nodes for processing, the problem of long service waiting time caused by message delivery in the overload area in the Internet of Vehicles environment is solved, and the utilization rate of service resources and the processing speed of important messages is improved.
Patent Information
- Application Number
- CN202411905879.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-23
- Publication Date
- 2025-03-28
AI Technical Summary
In the Internet of Vehicles environment, especially in overload areas, message delivery faces high-density device connection, high-frequency message generation and high real-time requirements, resulting in the problems of too long service waiting time and too long secure messages waiting.
By identifying nodes with insufficient remaining service resources in the area as overload nodes and transferring their messages to available nodes with sufficient remaining service resources for processing, the existing resources are used to improve the utilization rate of service resources.
It realizes that in the case of overloading nodes, the existing resources are fully utilized, the utilization rate of service resources is improved, the service waiting time is reduced, and the timely processing of important messages is ensured.
Smart Images
Figure CN119729371A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the technical field of Internet of Vehicles, and more specifically, to a message processing method and system for an overloaded node. Background Art
[0002] In the Internet of Vehicles environment, especially in overloaded areas, message delivery faces challenges such as high-density device connections, high-frequency message generation, and high real-time requirements.
[0003] For roads with overloaded services (such as roads with heavy traffic during rush hour), the Internet of Vehicles messages are dense, resulting in problems such as long waiting times for services and long waiting times for messages involving safety. Summary of the invention
[0004] The present application provides a method and system for processing messages of an overloaded node, which transfers messages of a service overloaded node to available nodes with sufficient remaining service resources for processing, thereby making full use of existing resources and improving the utilization rate of service resources.
[0005] The present application provides a message processing method for an overloaded node, comprising:
[0006] Identify nodes with insufficient remaining service resources in the area as overloaded nodes, and identify nodes with sufficient remaining service resources in the area as available nodes;
[0007] Determine the service transfer priority of multiple overloaded nodes;
[0008] Determine the optimal service transfer route combination for transferring the to-be-transferred messages of all overloaded nodes in the area to available nodes;
[0009] The to-be-transferred messages of each overloaded node are transferred according to the optimal service transfer route combination and service transfer priority.
[0010] Preferably, a load determination coefficient determined by the current processing capacity and the maximum processing capacity of each node is used to identify whether the node is an overloaded node or an available node.
[0011] Preferably, determining the service transfer priority order of multiple overloaded nodes specifically includes:
[0012] Determine the waiting priority vector for each overloaded node;
[0013] The priority of the overloaded node is calculated based on the message level and waiting priority vector of each message in the overloaded node; wherein the message level indicates the importance of the message;
[0014] Sort the priorities of all overloaded nodes to obtain the service transfer priority.
[0015] Preferably, determining the optimal service transfer route combination for transferring the to-be-transferred messages of all overloaded nodes in the area to available nodes specifically includes:
[0016] Calculate the total service cost of at least one service transfer route combination for transferring the to-be-transferred messages of all overloaded nodes to available nodes;
[0017] A service transfer route combination with a total service cost less than the total service capacity of all available nodes is selected as a candidate route;
[0018] The candidate route with the smallest total service cost is taken as the optimal service transfer route combination.
[0019] Preferably, the transfer request of the overloaded node includes the message level of each message in the overloaded node, the delay limit of the overloaded node and the number of messages to be transferred.
[0020] Preferably, the delay limit and the number of messages to be transferred are used to calculate the total service cost of a combination of service transfer routes for transferring messages to be transferred from all overloaded nodes in the region to available nodes.
[0021] The present application also provides a message processing system for an overloaded node, including an identification module, a sequence determination module, a route determination module, and a transfer module;
[0022] The identification module is used to identify nodes with insufficient remaining service resources in the area as overloaded nodes, and to identify nodes with sufficient remaining service resources in the area as available nodes;
[0023] The order determination module is used to determine the service transfer priority order of multiple overloaded nodes;
[0024] The route determination module is used to determine the optimal service transfer route combination for transferring the to-be-transferred messages of all overloaded nodes in the area to available nodes;
[0025] The transfer module is used to transfer the to-be-transferred message of each overloaded node according to the optimal service transfer route combination and the service transfer priority order.
[0026] Preferably, the identification module is used to identify whether the node is an overloaded node or an available node by using a load determination coefficient determined by the current processing capacity and the maximum processing capacity of each node.
[0027] Preferably, the sequence determination module includes a vector determination module, a node priority calculation module and a sorting module;
[0028] The vector determination module is used to determine the waiting priority vector of each overloaded node;
[0029] The node priority calculation module is used to calculate the priority of the overloaded node according to the message level and waiting priority vector of each message in the overloaded node; wherein the message level indicates the importance of the message;
[0030] The sorting module is used to sort the priorities of all overloaded nodes and obtain the service transfer priority.
[0031] Preferably, the route determination module includes a service cost calculation module, a candidate route determination module and a comparison module;
[0032] The service cost calculation module is used to calculate the total service cost of at least one service transfer route combination for transferring the to-be-transferred messages of all overloaded nodes to available nodes;
[0033] The candidate route determination module is used to combine the service transfer routes whose total service cost is less than the total service capacity of all available nodes as the candidate route;
[0034] The comparison module is used to take the candidate route with the smallest total service cost as the optimal service transfer route combination.
[0035] Preferably, the transfer request of the overloaded node includes the message level of each message in the overloaded node, the delay limit of the overloaded node and the number of messages to be transferred.
[0036] Preferably, the delay limit and the number of messages to be transferred are used to calculate the total service cost of a combination of service transfer routes for transferring messages to be transferred from all overloaded nodes in the region to available nodes.
[0037] Other features and advantages of the present application will become apparent from the following detailed description of exemplary embodiments of the present application with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS
[0038] The accompanying drawings, which are incorporated in and constitute a part of the specification, illustrate embodiments of the application and, together with the description, serve to explain the principles of the application.
[0039] Figure 1 A flowchart of the message processing method of the overloaded node provided by this application;
[0040] Figure 2 This is a structural diagram of the message processing system for the overloaded node provided in this application. DETAILED DESCRIPTION
[0041] Various exemplary embodiments of the present application will now be described in detail with reference to the accompanying drawings. It should be noted that unless otherwise specifically stated, the relative arrangement of components and steps, numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present application.
[0042] The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the present application, its application, or uses.
[0043] Technologies, methods, and equipment known to ordinary technicians in the relevant art may not be discussed in detail, but where appropriate, the technologies, methods, and equipment should be considered part of the specification.
[0044] In all examples shown and discussed herein, any specific values should be interpreted as merely exemplary and not as limiting. Therefore, other examples of the exemplary embodiments may have different values.
[0045] The present application provides a message processing method and system for an overloaded node, which transfers the messages of the service overloaded node to available nodes with sufficient remaining service resources for processing, making full use of existing resources and improving the utilization rate of service resources. In addition, the present application also sorts the service transfer priorities according to the service requirements of the overloaded node, thereby improving the processing speed of important messages.
[0046] It should be noted that this application does not limit the type of "message", which can be a vehicle networking message or a message for other specific demand networks, such as the Internet of Things. On this basis, this application does not limit the division method of "areas", one of which is to divide the area based on roads, and a road area includes several adjacent roads, for example, for transmitting vehicle networking messages. It can be understood that areas can also be divided according to administration, housing, etc. Therefore, this application has a high universality.
[0047] like Figure 1 As shown, the message processing method of the overloaded node provided by the present application includes:
[0048] S110: Identify nodes with insufficient remaining service resources in the area as overloaded nodes R over , and identify the nodes with sufficient remaining service resources in the area as available nodes R can .
[0049] As an example, the current processing capacity of each node and maximum processing capacity The determined load determination coefficient K identifies whether the node is an overloaded node or an available node:
[0050]
[0051] If K>1, the node has no available service resources and is recorded as an overloaded node R over If K<1, the node has available service resources, which is recorded as available node R can Among them, the area R overThe number of o, R can The message transfer of the overloaded node can only be performed when the number of o≤c is c.
[0052] S120: Determine the service transfer priority order of multiple overloaded nodes.
[0053] As an embodiment, determining the service transfer priority order of multiple overloaded nodes specifically includes:
[0054] S1201: Determine each overload node R over Waiting priority vector
[0055] Define the online waiting time of the kth overloaded node as T k , the waiting priority delay (calculating the waiting time threshold of the waiting priority vector) is T good , then the waiting priority vector of the kth overloaded node is for:
[0056]
[0057] As an embodiment, the transfer request M of the overloaded node includes a message level A, a delay limit B, and a number of messages to be transferred C, that is, M={A, N, C}. The message level A indicates the importance of each message in the overloaded node.
[0058] As an example, message level A includes generally important, important, and very important.
[0059] As an embodiment, the delay limit B and the number of messages to be transferred C are used to calculate the total service cost of the service transfer route combination for transferring the messages to be transferred from all overloaded nodes in the area to available nodes, as described below.
[0060] S1202: Calculate the priority of the overloaded node according to the message level and waiting priority vector of each message in the overloaded node.
[0061] As an embodiment, the priority of a message is calculated using the following formula:
[0062]
[0063] Among them, α k represents the priority of the kth overloaded node, G 1 , G 2 , G 3 They represent the total number of generally important, important and very important messages in the kth overloaded node, and γ represents the weight factor.
[0064] S1203: Sort the priorities of all overloaded nodes to obtain a service transfer priority order.
[0065] As an example, α k The size of α determines the order of service. k The larger the value is, the earlier the overloaded node will be served. k When the values are the same, The service priority of the overloaded node is higher than The service priority of the overloaded node. If they are the same, they will be assigned randomly.
[0066] S130: Determine an optimal service transfer route combination for transferring the to-be-transferred messages of all overloaded nodes in the area to available nodes.
[0067] As an embodiment, determining the optimal service transfer route combination for transferring the to-be-transferred messages of all overloaded nodes in the area to available nodes specifically includes:
[0068] S1301: Calculate the total service cost of at least one service transfer route combination for transferring all the to-be-transferred messages of all overloaded nodes to the available nodes, wherein each service transfer route combination includes a transfer route between each overloaded node and the corresponding available node in the region, and the total service cost includes the service cost for transferring all the to-be-transferred messages of each overloaded node in the region to the corresponding available node.
[0069] As an embodiment, all overloaded nodes R in the region are defined over The pending messages are transmitted to the available node R can The total service cost model for the process is f(R over ,R can ).
[0070] For each service transfer route combination, when calculating the total service cost, first calculate each overload node R over The total transmission delay required for all messages is:
[0071]
[0072] Among them, C k is the number of messages to be transferred at the kth overloaded node, v is the message transmission speed, is the distance between the kth overloaded node and the corresponding available node, Δ k (R over ,R can ) is the total transmission delay required for all messages of the kth overloaded node.
[0073] Then, the total service cost of the service transfer route combination is calculated based on the total transmission delay of all overloaded nodes:
[0074]
[0075] Where b is the correction factor.
[0076] S1302: The total service cost is less than the total service capacity of all available nodes |g(R can ,R over )|'s service transfer route combination is used as the candidate route.
[0077] That is, |f(R over ,R can )|≤|g(R can ,R over )| service transfer route combination can be used as a candidate route.
[0078] S1303: Taking the candidate route with the smallest total service cost as the optimal service transfer route combination.
[0079] S140: Transfer the to-be-transferred message of each overloaded node according to the optimal service transfer route combination and service transfer priority order.
[0080] Based on the above, the present application also provides a message processing system for an overloaded node. Figure 2 As shown, the message processing system includes an identification module 210 , a sequence determination module 220 , a route determination module 230 and a transfer module 240 .
[0081] The identification module 210 is used to identify nodes with insufficient remaining service resources in the area as overloaded nodes, and simultaneously identify nodes with sufficient remaining service resources in the area as available nodes.
[0082] The order determination module 220 is used to determine the service transfer priority order of multiple overloaded nodes.
[0083] The route determination module 230 is used to determine the optimal service transfer route combination for transferring the to-be-transferred messages of all overloaded nodes in the area to available nodes.
[0084] The transfer module 240 is used to transfer the to-be-transferred message of each overloaded node according to the optimal service transfer route combination and the service transfer priority order.
[0085] Preferably, the identification module 210 is used to identify whether the node is an overloaded node or an available node by using a load determination coefficient determined by the current processing capacity and the maximum processing capacity of each node.
[0086] Preferably, the sequence determination module 220 includes a vector determination module 2201 , a node priority calculation module 2202 and a sorting module 2203 .
[0087] The vector determination module 2201 is used to determine the waiting priority vector of each overloaded node.
[0088] The node priority calculation module 2202 is used to calculate the priority of the overloaded node according to the message level and waiting priority vector of each message in the overloaded node.
[0089] The sorting module 2203 is used to sort the priorities of all overloaded nodes to obtain a service transfer priority order.
[0090] Preferably, the route determination module 230 includes a service cost calculation module 2301 , a candidate route determination module 2302 and a comparison module 2303 .
[0091] The service cost calculation module 2301 is used to calculate the total service cost of at least one service transfer route combination for transferring the to-be-transferred messages of all overloaded nodes to available nodes.
[0092] The candidate route determination module 2302 is used to combine service transfer routes whose total service cost is less than the total service capacity of all available nodes as candidate routes.
[0093] The comparison module 2303 is used to select the candidate route with the smallest total service cost as the optimal service transfer route combination.
[0094] Although some specific embodiments of the present application have been described in detail by way of example, it should be understood by those skilled in the art that the above examples are only for illustration, not for limiting the scope of the present application. It should be understood by those skilled in the art that the above embodiments may be modified without departing from the scope and spirit of the present application. The scope of the present application is defined by the appended claims.
Claims
1. A message processing method for an overloaded node, characterized in that: include: Identify nodes with insufficient remaining service resources in the area as overloaded nodes, and identify nodes with sufficient remaining service resources in the area as available nodes; Determine the service transfer priority of multiple overloaded nodes; Determine the optimal service transfer route combination for transferring the to-be-transferred messages of all overloaded nodes in the area to available nodes; The to-be-transferred message of each overloaded node is transferred according to the optimal service transfer route combination and the service transfer priority order.
2. The message processing method of an overloaded node according to claim 1, characterized in that: The load determination coefficient determined by the current processing capacity and the maximum processing capacity of each node identifies whether the node is an overloaded node or an available node.
3. The message processing method of an overloaded node according to claim 1, characterized in that: Determine the service transfer priority of multiple overloaded nodes, including: Determine the waiting priority vector for each overloaded node; Calculating the priority of the overloaded node according to the message level of each message in the overloaded node and the waiting priority vector; wherein the message level indicates the importance of the message; Sort the priorities of all overloaded nodes to obtain the service transfer priority.
4. The message processing method of an overloaded node according to claim 3, characterized in that: The transfer request of the overloaded node includes the message level of each message in the overloaded node, the delay limit of the overloaded node and the number of messages to be transferred.
5. The message processing method of an overloaded node according to claim 4, characterized in that: The delay limit and the number of messages to be transferred are used to calculate the total service cost of a combination of service transfer routes for transferring messages to be transferred from all overloaded nodes in the area to available nodes.
6. A message processing system for an overloaded node, characterized in that: It includes an identification module, a sequence determination module, a route determination module and a transfer module; The identification module is used to identify nodes with insufficient remaining service resources in the area as overloaded nodes, and to identify nodes with sufficient remaining service resources in the area as available nodes; The order determination module is used to determine the service transfer priority order of multiple overloaded nodes; The route determination module is used to determine the optimal service transfer route combination for transferring the to-be-transferred messages of all overloaded nodes in the area to available nodes; The transfer module is used to transfer the to-be-transferred message of each overloaded node according to the optimal service transfer route combination and the service transfer priority order.
7. The message processing system for an overloaded node according to claim 6, characterized in that: The identification module is used to identify whether the node is an overloaded node or an available node through a load determination coefficient determined by the current processing capacity and the maximum processing capacity of each node.
8. The message processing system for overloaded nodes according to claim 6, characterized in that: The sequence determination module includes a vector determination module, a node priority calculation module and a sorting module; The vector determination module is used to determine the waiting priority vector of each overloaded node; The node priority calculation module is used to calculate the priority of the overloaded node according to the message level of each message in the overloaded node and the waiting priority vector; wherein the message level indicates the importance of the message; The sorting module is used to sort the priorities of all overloaded nodes to obtain a service transfer priority order.
9. The message processing system for overloaded nodes according to claim 8, characterized in that: The transfer request of the overloaded node includes the message level of each message in the overloaded node, the delay limit of the overloaded node and the number of messages to be transferred.
10. The message processing system for overloaded nodes according to claim 9, characterized in that: The delay limit and the number of messages to be transferred are used to calculate the total service cost of a combination of service transfer routes for transferring messages to be transferred from all overloaded nodes in the area to available nodes.