Power communication service routing configuration method based on double-dimensional matching and related equipment

Abstract

The application provides a power communication service routing configuration method based on double-dimensional matching and related equipment, which adopts a double-dimensional matching method, that is, closely coupling the resource configuration dimension and the routing supply-demand relationship dimension to complete routing calculation for massive service demands. The basic idea is to generate a hierarchical service demand model according to network service demands; in the resource configuration dimension, topological resources and bandwidth resources are deeply matched to obtain the optimal configuration of throughput resources; in the supply-demand relationship dimension, further pipeline analysis and quantitative matching are completed to realize efficient routing for massive service demands. While improving network throughput, the routing calculation times and routing calculation time can be reduced, the problems of poor throughput performance and poor routing timeliness of the power communication network routing algorithm are solved, and the throughput performance and routing timeliness performance of the power communication network routing algorithm are improved.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a method and related equipment for configuring power communication service routing based on two-dimensional matching. Background Technology

[0002] Power communication networks are the communication networks that support the normal operation of power systems. In recent years, the rapid development of large-scale distribution network automation, low-voltage centralized meter reading, distributed energy access, and two-way user interaction in power systems has led to an explosive growth in communication demands from various power grid equipment, power terminals, and electricity customers, placing increasingly higher demands on advanced, reliable, and efficient communication technologies. With the development of power Internet of Things (IoT) and smart substation services, such as transmission line video surveillance, power tunnel environment and video surveillance, mobile operations / inspections, and the gradual emergence of new multimedia and IoT-related communication services (including production, safety supervision, market, and materials), power communication services are characterized by large scale, differentiation, and multi-granularity (level of detail). How to provide communication channels for massive amounts of multi-granular services is a problem that current power communication networks urgently need to solve. Summary of the Invention

[0003] In view of this, the purpose of this application is to propose a two-dimensional matching-based power communication service routing configuration method and related equipment to solve the problem of poor throughput performance of existing routing algorithms.

[0004] To achieve the above objectives, the first aspect of this application provides a power communication service routing configuration method based on two-dimensional matching, comprising:

[0005] Obtain the set of network service requirements, and summarize and hierarchically sort the service requirements set to obtain a hierarchical service requirement model.

[0006] Obtain the resource information of the network and construct a virtual topology based on the resource information;

[0007] Calculate the link traffic of each link in the virtual topology to obtain the traffic configuration result;

[0008] The communication pipeline is analyzed based on the traffic configuration results;

[0009] Based on the hierarchical business requirement model and the communication pipeline, perform quantitative matching between the business requirement dimension and the pipeline resource dimension;

[0010] Configure the communication pipeline based on the service routing pipeline allocation result obtained from the matching.

[0011] Optionally, the step of summarizing and hierarchically sorting the set of business requirements to obtain a hierarchical business requirement model includes:

[0012] Each business in the set of business requirements is assigned a number to obtain a list of business requirements, wherein each business corresponds to a business number;

[0013] Based on the access node and destination node of each service, the service requirements are summarized to obtain the service requirement summary result, wherein the service requirement summary result includes at least one level, and each level corresponds to a level number.

[0014] The service requirements model is obtained by hierarchically sorting the service summarization results according to the bandwidth attributes of each service.

[0015] Optionally, the step of hierarchically sorting the service summarization results according to the bandwidth attribute of each service to obtain the hierarchical service demand model includes:

[0016] Determine the bandwidth attributes for each of the services;

[0017] Based on the attribute value of the bandwidth attribute and the service number, the services within the same level in the service summary result are sorted to obtain a hierarchical sorting result;

[0018] Based on the hierarchical sorting result, the services within the same level are integrated according to the attribute values ​​and the service numbers to obtain the hierarchical service requirement model.

[0019] Optionally, obtaining the network's resource information and constructing a virtual topology based on the resource information includes:

[0020] Obtain the number of nodes in the network and the connection relationships between the nodes;

[0021] Construct a network topology based on the connection relationships and the number of nodes;

[0022] Add virtual input nodes and virtual output nodes to the network topology to obtain the virtual topology.

[0023] Optionally, calculating the link traffic of each link in the virtual topology to obtain the traffic configuration result includes:

[0024] The bandwidth resource information is obtained by statistically analyzing the link bandwidth resources between each node in the network topology.

[0025] Based on the bandwidth resource information, the link traffic of each link in the virtual topology is calculated using a network traffic algorithm when the network reaches its optimal throughput, thus obtaining the traffic configuration result.

[0026] Optionally, the step of parsing the communication pipe based on the traffic configuration result includes:

[0027] Calculate the shortest path between the virtual input node and the virtual output node;

[0028] The link resource value of each hop in the shortest path is determined based on the traffic configuration results;

[0029] The minimum link resource value is determined as the pipe bandwidth resource value of the communication pipe corresponding to the shortest path;

[0030] The pipeline bandwidth resource value is deleted from the traffic configuration result, and a new shortest path between the virtual input node and the virtual output node is recalculated to obtain a new pipeline bandwidth resource value. This process continues until no new shortest path can be obtained, resulting in multiple communication pipelines and the pipeline bandwidth resource value corresponding to each communication pipeline.

[0031] Optionally, the step of quantitatively matching the service requirement dimension with the pipeline resource dimension based on the hierarchical service requirement model and the communication pipeline includes:

[0032] The corresponding target communication channel is determined based on the access node and the destination node in the hierarchical service requirement model.

[0033] By comparing the bandwidth resource value of the target communication pipe with the hierarchical bandwidth resource value in the hierarchical service requirement model, the target service that the target communication pipe can carry is determined.

[0034] Once the target services that can be carried by all communication channels have been confirmed, the service routing channel allocation result is obtained.

[0035] Based on the same inventive concept, a second aspect of this application provides a power communication service routing configuration device based on two-dimensional matching, comprising:

[0036] The service integration module is configured to: acquire a set of network service requirements, and perform service requirement summarization and hierarchical sorting on the set of service requirements to obtain a hierarchical service requirement model;

[0037] The resource configuration module is configured to: acquire the resource information of the network and construct a virtual topology based on the resource information;

[0038] Calculate the link traffic of each link in the virtual topology to obtain the traffic configuration result;

[0039] The quantization route extraction module is configured to: parse the communication pipeline based on the traffic configuration result;

[0040] Based on the hierarchical business requirement model and the communication pipeline, perform quantitative matching between the business requirement dimension and the pipeline resource dimension;

[0041] Configure the communication pipeline based on the service routing pipeline allocation result obtained from the matching.

[0042] Based on the same inventive concept, a third aspect of this application provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the method described in the first aspect of this application.

[0043] Based on the same inventive concept, a fourth aspect of this application provides a non-transitory computer-readable storage medium storing computer instructions for causing a computer to perform the method provided in the first aspect of this application.

[0044] As can be seen from the above, the power communication service routing configuration method and related equipment based on two-dimensional matching provided in this application can summarize and hierarchically sort the service requirement set to obtain a hierarchical service requirement model. By sorting and integrating the services, massive multi-granularity service requirements are summarized into different levels and hierarchically sorted and merged. While ensuring the authenticity of service requirements, the amount of data to be processed during routing configuration is reduced, achieving flexible adaptation to massive services. The method involves acquiring network resource information and constructing a virtual topology based on the resource information; calculating the link traffic of each link in the virtual topology to obtain traffic configuration results; achieving optimal configuration of network throughput resources based on the network topology resource characteristics and bandwidth resource status; parsing communication channels based on the traffic configuration results; performing quantitative matching between the service requirement dimension and the channel resource dimension based on the hierarchical service requirement model and communication channels; and configuring communication channels based on the matched service routing channel allocation results. Through two-dimensional quantitative matching between the service requirement dimension and the channel resource dimension, efficient routing configuration for massive service requirements is achieved, improving network resource utilization and increasing network throughput performance by reducing the number of calculations. Attached Figure Description

[0045] To more clearly illustrate the technical solutions in this application or related technologies, the drawings used in the description of the embodiments or related technologies will be briefly introduced below. Obviously, the drawings described below are only embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0046] Figure 1 This is a schematic diagram of the results of a classic route calculation scheme in an embodiment of this application;

[0047] Figure 2 This is a flowchart of a power communication service routing configuration method based on two-dimensional matching, as described in an embodiment of this application.

[0048] Figure 3 This is a block diagram of a power communication service routing configuration method based on two-dimensional matching, according to an embodiment of this application.

[0049] Figure 4 A flowchart illustrating the business integration of embodiments of this application;

[0050] Figure 5 A flowchart illustrating the construction of a virtual topology for embodiments of this application;

[0051] Figure 6 This is a schematic diagram of the network topology in an embodiment of this application;

[0052] Figure 7 This is a schematic diagram of the virtual topology in an embodiment of this application;

[0053] Figure 8 This is a flowchart illustrating resource configuration in an embodiment of this application.

[0054] Figure 9 This is a schematic diagram illustrating the throughput resource configuration results of an embodiment of this application;

[0055] Figure 10 This is a schematic diagram of the communication pipe parsing results in an embodiment of this application;

[0056] Figure 11 This is a schematic diagram of the power communication service routing configuration device based on two-dimensional matching, as described in an embodiment of this application.

[0057] Figure 12 This is a schematic diagram of the structure of an electronic device according to an embodiment of this application. Detailed Implementation

[0058] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with specific embodiments and the accompanying drawings.

[0059] It should be noted that, unless otherwise defined, the technical or scientific terms used in the embodiments of this application should have the ordinary meaning understood by one of ordinary skill in the art to which this application pertains. The terms "first," "second," and similar terms used in the embodiments of this application do not indicate any order, quantity, or importance, but are merely used to distinguish different components. Terms such as "comprising" or "including" mean that the element or object preceding the word encompasses the elements or objects listed after the word and their equivalents, without excluding other elements or objects. Terms such as "connected" or "linked" are not limited to physical or mechanical connections, but can include electrical connections, whether direct or indirect. Terms such as "upper," "lower," "left," and "right" are only used to indicate relative positional relationships; when the absolute position of the described object changes, the relative positional relationship may also change accordingly.

[0060] In this article, it is important to understand that any number of elements in the accompanying figures is for illustrative purposes and not for limitation, and any naming is for distinction only and has no limiting meaning.

[0061] Based on the above background description, the following situations also exist in the related technologies:

[0062] In power communication networks, the communication channels for services are relatively fixed, making it difficult to cope with changes in the number and demands of services. Currently, the industry commonly uses dynamic routing algorithms to calculate communication channels for changing service requirements. A typical dynamic routing algorithm first calculates the communication path for the service and then allocates corresponding bandwidth resources to meet the service's communication needs. For multiple service demands existing simultaneously in the network, a typical dynamic routing algorithm will calculate routing paths and allocate service resources sequentially. In this method, to enable the network to carry as many services as possible and provide appropriate bandwidth resources for each service, a minimum-weight routing algorithm is often used. This involves setting different link weights for network links, directly using Dijkstra's algorithm to calculate the minimum-weight path for the service, allocating bandwidth, and updating network link weights to obtain the communication channel for the service. However, in practical networks, this approach leads to poor network throughput when handling multiple service demands, making it difficult to guarantee the carrying capacity of massive services. Furthermore, due to the high algorithm complexity and numerous calculations, the routing process has poor timeliness, significantly increasing the design requirements and difficulty for network information synchronization and control information distribution mechanisms, resulting in an inability to provide timely service channels for massive, multi-granular services.

[0063] like Figure 1As shown, the classic routing calculation schemes commonly used in related technologies employ optimal weight routing algorithms for route calculation. These optimal weight routing algorithms are primarily derived from several typical shortest path algorithms, such as Bellman-Ford and Dijkstra's. Different weights (static or dynamic weights) are assigned to the algorithm to calculate the path for different optimization requirements (hop count, latency, bandwidth, etc.). When a service request arrives at the control end of the communication network, the control end uses the optimal weight routing algorithm to calculate a service path from the service source node to the service destination node, thereby guiding the transmission and forwarding of service data. For example... Figure 1 As shown, for multiple business requests with different requirements, the control terminal will calculate the business path and allocate transmission resources one by one.

[0064] However, in classic routing calculation methods, routing algorithms based on optimal weights can lead to unreasonable network resource allocation due to differences in the order of path calculation and resource allocation when calculating paths for multiple services. This can result in situations where network throughput is low and available resources exist, but the required service path cannot be determined, leading to low network resource utilization. Furthermore, classic methods require multiple calculations for service requests with non-overlapping source and destination nodes. In large-scale networks with a large number of service requests, this approach results in lengthy routing calculation times, making it difficult to meet the demands of service agility.

[0065] The root cause of this problem is: (1) In order to achieve reliable transmission of communication services, a forwarding path needs to be calculated and configured for each service before service forwarding. The computational complexity of traditional routing optimization algorithms will increase exponentially with the increase of the number of nodes. For networks with more than a thousand nodes, the time consumed by a single routing calculation is long. (2) For multiple service requirements, if the source and destination nodes of the services are different, the routing algorithm needs to be used for calculation multiple times. For example, for 100 service requests, 100 routing calculations are required (not considering the case of overlapping service source and destination). The number of calculations is large and the throughput performance is poor.

[0066] As can be seen from the above, existing routing calculation methods for communication networks suffer from problems such as numerous calculations, long calculation times, and poor optimization effects, making it difficult to achieve the expected routing calculation results and posing significant challenges to network planning and management.

[0067] The power communication service routing configuration method based on two-dimensional matching provided in this application can summarize and hierarchically sort a set of service requirements to obtain a hierarchical service requirement model. By sorting and integrating the services, massive multi-granularity service requirements are summarized into different levels and hierarchically sorted and merged. While ensuring the authenticity of service requirements, the amount of data to be processed during routing configuration is reduced, achieving flexible adaptation to massive services. The method involves acquiring network resource information and constructing a virtual topology based on this information; calculating the link traffic of each link in the virtual topology to obtain traffic configuration results; optimizing network throughput resources based on the network's topology resource characteristics and bandwidth resource status; parsing communication channels based on the traffic configuration results; quantitatively matching the service requirement dimension with the channel resource dimension according to the hierarchical service requirement model and the communication channels; and configuring the communication channels based on the matched service routing channel allocation results. Through two-dimensional quantitative matching of the service requirement dimension and the channel resource dimension, efficient routing configuration for massive service requirements is achieved, improving network resource utilization and increasing network throughput performance by reducing the number of calculations, thus greatly facilitating network planning and management.

[0068] The following description, in conjunction with the accompanying drawings, describes a power communication service routing configuration method based on two-dimensional matching according to an exemplary embodiment of this application. It should be noted that the above application scenarios are shown only to facilitate understanding of the spirit and principles of this application, and the embodiments of this application are not limited in any way. Rather, the embodiments of this application can be applied to any applicable scenario.

[0069] In some embodiments, such as Figure 2 As shown, a power communication service routing configuration method based on two-dimensional matching includes:

[0070] Step 201: Obtain the set of network service requirements, and summarize and hierarchically sort the service requirements to obtain a hierarchical service requirement model.

[0071] In specific implementation, such as Figure 3As shown, the first step is to integrate the massive amount of business requirements, which includes three stages: business requirement acquisition, business requirement summarization, and hierarchical sorting. Specifically, the first step is to acquire the set of network business requirements and assign numbers to them. By analyzing this set, the various attribute sets of each business requirement (business access node, business destination node, pipeline bandwidth, latency requirements, etc.) are determined and used as a set of candidate index names for the business integration process. Based on the routing requirements of the real network, one or more index names are selected from the candidate set, and the selected index names are sorted to obtain an index name set, which serves as the basis for summarizing business requirements. Based on the content and order of the index name set, the business requirements in the business requirement set are hierarchically sorted. Business requirements with the same index name are merged according to the needs of the real network to obtain a hierarchical business requirement model, providing a calculation basis for quantitative route extraction.

[0072] Step 202: Obtain network resource information and construct a virtual topology based on the resource information.

[0073] In specific implementation, such as Figure 3 As shown, after the integration of massive services, throughput resource configuration is required, including three stages: acquiring resource information, generating a virtual topology, and calculating link traffic. Specifically, the stage of acquiring resource information and generating a virtual topology includes: acquiring node information and link information between nodes in the power communication network to form the network topology; different nodes in the network topology have different values ​​of link bandwidth resources, and by statistically analyzing the link bandwidth resource information, the bandwidth resource information that each link can provide can be obtained. Based on the topology pattern of the power communication network, virtual input nodes and virtual output nodes are added, and the virtual input nodes and virtual output nodes are connected to the network topology to form the virtual topology of the power communication network. The virtual topology is based on the topology paradigm of the power communication network and contains global topology resource information and link resource information.

[0074] Step 203: Calculate the link traffic of each link in the virtual topology to obtain the traffic configuration result.

[0075] In specific implementation, the corresponding link traffic calculation stage includes: using network flow algorithms to calculate the link traffic of each link in the virtual topology that enables the network to achieve optimal throughput, obtaining traffic configuration results, and providing a calculation basis for quantitative route extraction.

[0076] Step 204: Parse the communication pipeline based on the traffic configuration results.

[0077] In specific implementation, such as Figure 3As shown, after the throughput resources are configured, quantitative route extraction is required, which includes three stages: parsing communication channels, matching supply and demand dimensions, and configuring service routes. Specifically, parsing communication channels based on traffic configuration results includes: based on the link traffic configuration results, parsing all communication channels from the virtual input terminal to the virtual output terminal, determining the shortest path between the virtual input node and the virtual output node, calculating the link resource value corresponding to each hop in the shortest path, taking the minimum link resource value as the channel bandwidth resource value of the communication channel corresponding to the shortest path, and deleting the channel bandwidth resource value of the communication channel in the traffic configuration results so that the communication channel will not be used as the shortest path again in the next shortest path calculation. Then, the new shortest path between the virtual input node and the virtual output node is recalculated continuously to obtain a new channel bandwidth resource value until no new shortest path can be obtained, that is, all communication channels have been analyzed, resulting in multiple communication channels and the channel bandwidth resource value corresponding to each communication channel.

[0078] Step 205: Perform quantitative matching of business requirement dimensions and pipeline resource dimensions based on the hierarchical business requirement model and communication pipeline.

[0079] In practical implementation, the corresponding supply and demand matching stage includes: First, based on the access node and destination node in the hierarchical business demand model, the corresponding target communication pipeline needs to be determined; then, by comparing the pipeline bandwidth resource value of the target communication pipeline with the hierarchical bandwidth resource value in the hierarchical business demand model, the target services that the target communication pipeline can carry are determined. The pipeline bandwidth resource value is the maximum bandwidth value of the target communication pipeline, representing the maximum transmission volume of the target communication pipeline at the same time; the hierarchical bandwidth resource value is the minimum bandwidth value required for the simultaneous transmission of all services at each level, representing the minimum transmission volume required for the target communication pipeline to transmit all services at that level at the same time. When the hierarchical bandwidth resource value is greater than the pipeline bandwidth resource value, the transmission of at least one service needs to be temporarily abandoned (generally, the service with the smallest bandwidth value is abandoned first) to ensure the smooth operation of the target communication pipeline and the transmission of services.

[0080] Step 206: Configure the communication pipeline based on the service routing pipeline allocation results obtained from the matching.

[0081] In specific implementation, the corresponding service routing configuration stage includes: after all the target services that can be carried by all communication channels are confirmed, the service routing channel allocation result is obtained. Then, based on the service routing channel allocation result obtained by supply and demand matching, the service communication channel is configured, the corresponding communication channel is allocated to the transmissible services in the hierarchical service requirement model, and the channel bandwidth resources in the communication channel are allocated to the corresponding services to complete the service routing configuration of the communication channel and achieve efficient routing of massive service requirements.

[0082] In summary, the power communication service routing configuration method based on two-dimensional matching provided in this application adopts a two-dimensional matching approach, tightly coupling the resource configuration dimension with the routing supply and demand dimension to complete the routing calculation for massive service demands. Its basic idea is to generate a hierarchical service demand model based on network service requirements; in the resource configuration dimension, it deeply matches topology resources and bandwidth resources to obtain the optimal configuration of throughput resources; in the supply and demand dimension, it further completes pipeline parsing and quantitative matching to finally obtain the service route. Through service integration, massive multi-granularity service demands are summarized into different levels and hierarchically sorted and merged, reducing the amount of data processed by the routing method while ensuring the authenticity of service demands, thus achieving flexible adaptation of the network routing method to massive services; through the throughput resource optimization algorithm, it comprehensively considers the topology resource characteristics and bandwidth resource status of the power communication network to optimize link bandwidth configuration and achieve the optimal configuration of network throughput resources; through the route extraction method, it parses the end-to-end communication pipeline based on hierarchical service demands, completes the quantitative matching of the service demand dimension and the pipeline resource dimension, and achieves efficient routing of massive service demands. It can improve network throughput while reducing the number of routing calculations and the routing calculation time, solving problems such as poor throughput performance and poor routing timeliness of routing algorithms in power communication networks, and improving the throughput performance and routing timeliness performance of routing algorithms in power communication networks.

[0083] In some embodiments, such as Figure 4 As shown, the business requirement set is summarized and hierarchically ordered to obtain a hierarchical business requirement model, including:

[0084] Step 401: Number each business in the business requirement set to obtain a business requirement list, where each business corresponds to a business number.

[0085] In practice, after obtaining the set of business requirements, each business requirement in the set needs to be numbered. However, the requirements are not sorted in ascending order based on the number. For example, if the set contains 14 business requirements, after numbering and sorting in ascending order, the following business requirement list will be obtained: (Table 1 is an example of the process.)

[0086] Table 1 List of Business Requirements

[0087]

[0088]

[0089] By analyzing the various business requirements in Table 1, the set of attributes for the current business requirements is summarized as: "access node", "destination node" and "bandwidth". The summarized results will be used as the set of alternative index names required for the business integration process.

[0090] Step 402: Summarize the business requirements based on the access node and destination node of each service to obtain the business requirement summary result. The business requirement summary result includes at least one level, and each level corresponds to a level number.

[0091] In practical implementation, the matching relationship between the access node and destination node of a service is an important constraint during network service routing calculation. The "access node" and "destination node" are selected from the candidate index names and used as the summarization names for service requirements. The service requirement summarization process traverses all service requirements, summarizing them into multiple "levels" and assigning them numbers based on the selected index names. Service requirements within a "level" will have the same summarization name, meaning that the access node and destination node of services within the same level are the same. The resulting service requirement summarization results are shown in Table 2.

[0092] Table 2 Summary of Business Requirements

[0093]

[0094]

[0095] The business requirement summarization process resulted in six levels, each corresponding to a level number. Each level contains different services, and services within a single level share the same access node and destination node. Services between any two levels are unique. Taking level 2 in Table 2 as an example, level 2 includes service requirements 3, 4, and 5. The access node for all services in level 2 is V8, and the destination node is V1. Since the "bandwidth" attribute is not used as a summarization name in this embodiment, the bandwidth of the services in level 2 varies, being 0.2GB, 0.4GB, and 0.4GB respectively.

[0096] Step 403: Sort the service summary results hierarchically according to the bandwidth attributes of each service to obtain a hierarchical service demand model.

[0097] In practical implementation, in the network scenario corresponding to this application embodiment, the routing process needs to prioritize service requirements with larger "bandwidth" attribute values. Therefore, in this application embodiment, the "bandwidth" attribute is selected to perform hierarchical sorting of services in each layer. For example, the hierarchical sorting is based on all layers listed in Table 2. Service requirements within each layer are sorted in descending order of their "bandwidth" attribute values. If two service requirements within a layer have the same "bandwidth" attribute value during the sorting process, they are sorted in ascending order based on their "service number". The hierarchical sorting results are shown in Table 3.

[0098] Table 3 Hierarchical sorting results

[0099]

[0100]

[0101] In this table, services in Layer 1 have the same "bandwidth" attribute value, so their order remains unchanged compared to Table 2. Services in Layer 2 have different "bandwidth" attribute values. After hierarchical sorting, the service requirement with sequence number 3 is placed last, and the service numbers within Layer 2 are 4, 5, and 3 respectively. Then, the results in Table 3 are integrated according to the layer numbering, and the layer bandwidth resource value for simultaneously transmitting all services within each layer is calculated, resulting in the hierarchical service requirement model shown in Table 4.

[0102] Table 4 Hierarchical Business Requirements Model

[0103]

[0104] The resulting hierarchical service requirement model includes six levels of service requirements. Each level has different "access nodes", "destination nodes", "hierarchical bandwidth", "service number" and "service bandwidth". The "hierarchical bandwidth" in each level is the sum of the service bandwidth attribute values ​​of the services contained in that level, which is the hierarchical bandwidth resource value.

[0105] In some embodiments, step 403 includes:

[0106] Step 4031: Determine the bandwidth attributes of each service.

[0107] In practice, taking the business demand summary results in Table 2 as an example, each business bandwidth attribute corresponds to a bandwidth value. For example, the bandwidth attribute of the business with service number 1 is 0.5GB.

[0108] Step 4032: Sort the services within the same level in the service summary results according to the attribute value of the bandwidth attribute and the service number to obtain the hierarchical sorting result.

[0109] In practice, the bandwidth attribute of each service in Table 2 is used to hierarchically sort the services in each layer. If two services within a layer have the same bandwidth attribute value, they are sorted in ascending order according to their service number. For example, taking the hierarchical sorting of Table 2 as an example, services 1 and 2 in layer 1 have the same bandwidth attribute, so they are sorted according to their service number, resulting in a final sorting of 1 and 2. In layer 2, services 4 and 5 have a bandwidth attribute of 0.4, which is greater than the bandwidth attribute of service 3 (0.2), so services 4 and 5 are sorted according to their service number and then placed above service 3, resulting in a final sorting of 4, 5, and 3. In layer 3, service 8 has a maximum bandwidth attribute of 0.5, while service 7 has a maximum bandwidth attribute of 0.5. Next, the bandwidth attribute is 0.3. Then, services 6 and 9 have the same bandwidth attribute and the smallest value, 0.1. Services 6 and 9 are sorted in ascending order according to their service numbers, so the final sorting result in layer 3 is 8, 7, 6, 9. Layers 4 and 5 each have only one service and do not require sorting. In layer 6, service 13 has the largest bandwidth attribute of 0.6, service 14 has the next largest bandwidth attribute of 0.3, and service 12 has the smallest bandwidth attribute of 0.2. Therefore, the final sorting result in layer 6 is 13, 14, 12. After performing hierarchical sorting on Table 2, the hierarchical sorting result is shown in Table 3.

[0110] Step 4033: Based on the hierarchical sorting results, integrate the businesses within the same level according to the attribute values ​​and business numbers to obtain the hierarchical business requirement model.

[0111] In practical implementation, services within the same level are integrated, and the content of "level bandwidth" is added. The value in level bandwidth is the level bandwidth resource value of that level. This level bandwidth resource value is the sum of the bandwidth attribute values ​​of all services within the level. For example, taking level 6 as an example, its level bandwidth resource value is the sum of the bandwidth value of service number 13 (0.6), the bandwidth value of service number 14 (0.3), and the bandwidth value of service number 12 (0.2), which is 1.1. Then, the service numbers within the same level are integrated and summarized to obtain the level service requirement model shown in Table 4.

[0112] In some embodiments, such as Figure 5 As shown, the process involves acquiring network resource information and constructing a virtual topology based on that information, including:

[0113] Step 501: Obtain the number of nodes in the network and the connection relationships between the nodes.

[0114] In practice, the first step is to obtain the number of nodes in the power communication network and the link connections between them, such as... Figure 6As shown, the power communication network consists of 12 network communication nodes, including 1 smart substation node, 2 primary optical switching nodes, 3 secondary optical switching nodes, and 6 access nodes. The nodes are connected via bidirectional communication links. By statistically analyzing resource information, the bandwidth resource value provided by each link is obtained. The bandwidth resource value (GB) of each link is shown below. Figure 6 As shown, taking the link from node V12 to node V6 as an example, as follows... Figure 6 As shown, the bandwidth resource value of its link is 1GB.

[0115] Step 502: Construct the network topology based on the connection relationships and the number of nodes.

[0116] In practical implementation, a network communication structure is constructed based on the 12 network communication nodes of the power communication network and the connection relationships between the nodes, as follows: Figure 6 The network topology shown is represented by a graph G = (V, E), and the set of network nodes is denoted as V = {v1, v2, ..., v}. 12 The set of network links is denoted as} e i,j Indicates v in the network i node to v j A bidirectional link between nodes. This application embodiment uses |e i,j | Indicates link e i，j The bandwidth resource value.

[0117] Step 503: Add virtual input nodes and virtual output nodes to the network topology to obtain a virtual topology.

[0118] In practice, without changing the connection relationships between various nodes in the network topology, a virtual input node v is added. s and virtual output node v t , will virtual input node v s and virtual output node v t Connect to the existing network topology and configure the link bandwidth (the link bandwidth can be set to infinity, i.e., v). t Between v1 and v2, v s Compared to v7, v8, v9, v 10 v 11 v 12 Given that the bandwidth resources between them are infinite, the virtual topology of the power communication network, G′=(V′,E′), is obtained. The structure of the virtual topology is as follows: Figure 7 As shown. The virtual topology is based on the topology pattern of the power communication network that converges step by step, and includes the topology resource information and bandwidth resource information of the original network topology.

[0119] In some embodiments, such as Figure 8As shown, the link traffic of each link in the virtual topology is calculated to obtain the traffic configuration results, including:

[0120] Step 801: Calculate the link bandwidth resources between each node in the network topology to obtain bandwidth resource information.

[0121] Step 802: Based on the bandwidth resource information, calculate the link traffic of each link in the virtual topology when the network reaches its optimal throughput using a network traffic algorithm, and obtain the traffic configuration result.

[0122] In practical implementation, to enable the network to carry as many service demands as possible, the Edmonds-Karp algorithm is used to calculate the virtual input node v in the virtual topology G′=(V′,E′). s and virtual output node v t Maximum traffic C and link traffic configuration GF.

[0123] (C, GF) = Compute Edmonds-Karp (v s v t ,G′)#(1)

[0124] Wherein, the maximum traffic C is the matching relationship based on the current virtual network topology and link resources, which can be generated by the virtual input node v. s To virtual output node v t Maximum traffic capacity, link traffic configuration f represents the service traffic value carried by each link in the network when the network reaches its maximum traffic C. i，j For link e i，j The corresponding business traffic value, maximum traffic In this embodiment of the application, the traffic configuration results of the links in the virtual topology are as follows: Figure 9 As shown, the access nodes are v7, v8, v9, and v 10 v 11 v 12 Each of the two optical crossover nodes has a bandwidth resource value of 1GB, so the maximum throughput is 6GB.

[0125] In some embodiments, step 204 includes:

[0126] Step 2041: Calculate the shortest path between the virtual input node and the virtual output node;

[0127] Step 2042: Determine the link resource value of each hop in the shortest path based on the traffic configuration results;

[0128] Step 2043: Determine the minimum link resource value as the pipe bandwidth resource value of the communication pipe corresponding to the shortest path;

[0129] Step 2044: Delete the pipeline bandwidth resource value in the traffic configuration result, and recalculate the new shortest path between the virtual input node and the virtual output node to obtain a new pipeline bandwidth resource value, until no new shortest path can be obtained, thus obtaining multiple communication pipelines and the pipeline bandwidth resource value corresponding to each communication pipeline.

[0130] In specific implementation, (1) multiple paths between virtual input nodes and virtual output nodes are obtained, corresponding to an equal number of multiple communication channels, for example, v s v7, v4, v2, v1, v t It can be used as a communication channel; (2) in multiple input-to-output communication channels, such as Figure 7 Taking the virtual topology shown as an example, in the virtual topology G′={V′,E′}, Dijkstra's algorithm is used to compute a path consisting of virtual input node v s To virtual output node v t The shortest path p1 = {l1, l2, ..., l |p1|}, the shortest path corresponds to a communication pipeline, where l i Represents the i-th hop link in path p1, |l i | represents the link resource value corresponding to the link; (3) Calculate the link resource configuration corresponding to each hop link in the shortest path p1 | l i | and take the minimum value among them as the pipe bandwidth resource value of the communication pipe corresponding to the shortest path. (4) Remove the pipe bandwidth resource value t1 corresponding to communication pipe p1 from the traffic configuration result; (5) Repeat the above operations (2) to (4) until no new shortest path can be obtained in step (2), stop parsing the communication pipe, and finally obtain the connection pipe P = {p1, p2, ..., p1} from the virtual input node to the virtual output node in the network. |P|}, where the communication pipe p i Let p be the communication pipe connecting the i-th virtual input node to the virtual output node. i The corresponding pipeline bandwidth resource value is t. i For example, such as Figure 10 As shown, we obtain p1 = {v s v7, v4, v2, v1, v t}, p2={v s v8, v4, v2, v1, v t}, p3={v s v9, v5, v2, v1, vt}, p4 = {vs, v 10 v5, v2, v1, v t}, p5={v s v 11 v5, v3, v1, v t}, p6={v s v 12 v5, v3, v1, v t There are six communication channels, which can be represented as P = {p1, p2, ..., p6}, where the bandwidth resource value of each communication channel is 1GB.

[0131] In some embodiments, step 205 includes:

[0132] Step 2051: Determine the corresponding target communication channel based on the access node and destination node in the hierarchical service requirement model;

[0133] Step 2052: By comparing the bandwidth resource value of the target communication pipe with the hierarchical bandwidth resource value in the hierarchical service requirement model, determine the target service that the target communication pipe can carry;

[0134] Step 2053: In response to the confirmation of the target services that can be carried by all communication channels, the service routing channel allocation result is obtained.

[0135] In specific implementation, based on the hierarchical service requirement model obtained in step 201, the quantitative matching of service requirement dimensions and pipeline resource dimensions is completed. 1) Based on the access node and destination node in the hierarchy, find the corresponding target communication pipeline; 2) Compare the pipeline bandwidth resource value of the target communication pipeline with the hierarchical bandwidth resource value in the hierarchical service requirement model; 3) Determine the target service that the target communication pipeline can carry. 4) Repeat the above operations 1) to 3) until all entries in the hierarchical service requirement model have been processed. Taking hierarchy 1 in Table 4 as an example, the service corresponding to hierarchy 1 needs to flow from access node V7 to destination node V1, corresponding to communication pipeline p1; the hierarchical bandwidth resource value of this communication pipeline is 1GB, and the pipeline bandwidth resource value corresponding to the communication pipeline is also 1GB. The service will occupy 100% of the bandwidth resource for carrying, and the transmission of services 1 to 3 can be completed simultaneously. The processing results of hierarchy 2 to 5 are similar to the operation of hierarchy 1. The service corresponding to Layer 6 requires traffic from access node V12 to V1, corresponding to communication pipe p6. However, the layer bandwidth resource value is 1.1GB, which is greater than the current communication pipe bandwidth resource value of 1GB. According to the service order in the layer service requirement model, only the transmission requirements of services 13 and 14 can be completed. At this time, the pipe resource utilization rate is 90%. Specifically, the service routing pipe allocation results are shown in Table 5:

[0136] Table 5. Routing and Pipeline Allocation Results

[0137]

[0138] Based on the service routing pipeline allocation results shown in Table 5, corresponding communication pipelines are configured for the transmissible services in the hierarchical service requirement model, and the pipeline bandwidth resources in the communication pipelines are allocated to the corresponding services. The routing allocation results of the service communication pipelines are shown in Table 6:

[0139] Table 6. Routing Allocation Results for Service Communication Pipelines

[0140]

[0141]

[0142] Among them, services 1 to 11 and services 13 to 14 have obtained communication channels for service routing. Network services will realize communication from the actual input end to the actual output end based on the corresponding communication channels. For service 12, delayed transmission can be selected.

[0143] In summary, the power communication service routing configuration method based on two-dimensional matching provided in this application adopts a two-dimensional matching approach, tightly coupling the resource configuration dimension with the routing supply and demand dimension to complete the routing calculation for massive service demands. Its basic idea is to generate a hierarchical service demand model based on network service requirements; in the resource configuration dimension, it deeply matches topology resources and bandwidth resources to obtain the optimal configuration of throughput resources; in the supply and demand dimension, it further completes pipeline parsing and quantitative matching to finally obtain the service route. Through service integration, massive multi-granularity service demands are summarized into different levels and hierarchically sorted and merged, reducing the amount of data processed by the routing method while ensuring the authenticity of service demands, thus achieving flexible adaptation of the network routing method to massive services; through the throughput resource optimization algorithm, it comprehensively considers the topology resource characteristics and bandwidth resource status of the power communication network to optimize link bandwidth configuration and achieve the optimal configuration of network throughput resources; through the route extraction method, it parses the end-to-end communication pipeline based on hierarchical service demands, completes the quantitative matching of the service demand dimension and the pipeline resource dimension, and achieves efficient routing of massive service demands. It can improve network throughput while reducing the number of routing calculations and the routing calculation time, solving problems such as poor throughput performance and poor routing timeliness of routing algorithms in power communication networks, and improving the throughput performance and routing timeliness performance of routing algorithms in power communication networks.

[0144] It should be noted that the method in this embodiment can be executed by a single device, such as a computer or server. The method can also be applied in a distributed scenario, where multiple devices cooperate to complete the task. In such a distributed scenario, one of these devices may execute only one or more steps of the method in this embodiment, and the multiple devices will interact with each other to complete the method described.

[0145] It should be noted that the above description describes some embodiments of this application. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims can be performed in a different order than that shown in the above embodiments and still achieve the desired result. Furthermore, the processes depicted in the drawings do not necessarily require a specific or sequential order to achieve the desired result. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0146] Based on the same inventive concept, and corresponding to any of the above embodiments, this application also provides a power communication service routing configuration device based on two-dimensional matching.

[0147] refer to Figure 11 The power communication service routing configuration device based on two-dimensional matching includes:

[0148] The service integration module 10 is configured to: acquire the set of service requirements of the network, and summarize and hierarchically sort the service requirements to obtain a hierarchical service requirement model.

[0149] Resource configuration module 20 is configured to: acquire network resource information and construct a virtual topology based on the resource information;

[0150] Calculate the link traffic of each link in the virtual topology to obtain the traffic configuration result;

[0151] The quantization route extraction module 30 is configured to: parse the communication pipeline based on the traffic configuration result;

[0152] Quantitative matching of business requirement dimensions and pipeline resource dimensions is performed based on the hierarchical business requirement model and communication pipeline.

[0153] Configure the communication pipeline based on the matching service routing pipeline allocation results.

[0154] For ease of description, the above devices are described in terms of function, divided into various modules. Of course, in implementing this application, the functions of each module can be implemented in one or more software and / or hardware.

[0155] The apparatus in the above embodiments is used to implement the corresponding two-dimensional matching-based power communication service routing configuration method in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0156] Based on the same inventive concept, corresponding to the methods of any of the above embodiments, this application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, it implements the power communication service routing configuration method based on two-dimensional matching as described in any of the above embodiments.

[0157] Figure 12 This embodiment illustrates a more specific hardware structure of an electronic device, which may include a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, memory 1020, input / output interface 1030, and communication interface 1040 are interconnected internally via the bus 1050.

[0158] The processor 1010 can be implemented using a general-purpose CPU (Central Processing Unit), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.

[0159] The memory 1020 can be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage device, dynamic storage device, etc. The memory 1020 can store the operating system and other applications. When the technical solutions provided in the embodiments of this specification are implemented by software or firmware, the relevant program code is stored in the memory 1020 and is called and executed by the processor 1010.

[0160] The input / output interface 1030 is used to connect input / output modules to realize information input and output. Input / output modules can be configured as components within the device (not shown in the figure) or externally connected to the device to provide corresponding functions. Input devices may include keyboards, mice, touchscreens, microphones, various sensors, etc., while output devices may include displays, speakers, vibrators, indicator lights, etc.

[0161] The communication interface 1040 is used to connect a communication module (not shown in the figure) to enable communication between this device and other devices. The communication module can communicate via wired means (such as USB, Ethernet cable, etc.) or wireless means (such as mobile network, WIFI, Bluetooth, etc.).

[0162] Bus 1050 includes a pathway for transmitting information between various components of the device, such as processor 1010, memory 1020, input / output interface 1030, and communication interface 1040.

[0163] It should be noted that although the above-described device only shows the processor 1010, memory 1020, input / output interface 1030, communication interface 1040, and bus 1050, in specific implementations, the device may also include other components necessary for normal operation. Furthermore, those skilled in the art will understand that the above-described device may only include the components necessary for implementing the embodiments of this specification, and not necessarily all the components shown in the figures.

[0164] The electronic devices described above are used to implement the corresponding two-dimensional matching-based power communication service routing configuration method in any of the foregoing embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0165] Based on the same inventive concept, corresponding to the methods of any of the above embodiments, this application also provides a non-transitory computer-readable storage medium storing computer instructions for causing the computer to execute the power communication service routing configuration method based on two-dimensional matching as described in any of the above embodiments.

[0166] The computer-readable medium of this embodiment includes permanent and non-permanent, removable and non-removable media, and information storage can be implemented by any method or technology. Information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transfer medium that can be used to store information accessible by a computing device.

[0167] The computer instructions stored in the storage medium of the above embodiments are used to cause the computer to execute the power communication service routing configuration method based on two-dimensional matching as described in any of the above embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0168] Those skilled in the art should understand that the discussion of any of the above embodiments is merely exemplary and is not intended to imply that the scope of this application (including the claims) is limited to these examples; within the framework of this application, the technical features of the above embodiments or different embodiments can also be combined, the steps can be implemented in any order, and there are many other variations of different aspects of the embodiments of this application as described above, which are not provided in the details for the sake of brevity.

[0169] Additionally, to simplify the description and discussion, and to avoid obscuring the embodiments of this application, the well-known power / ground connections to integrated circuit (IC) chips and other components may or may not be shown in the provided drawings. Furthermore, the apparatus may be shown in block diagram form to avoid obscuring the embodiments of this application, and this also takes into account the fact that the details of the implementation of these block diagram apparatuses are highly dependent on the platform on which the embodiments of this application will be implemented (i.e., these details should be fully understood by those skilled in the art). While specific details (e.g., circuits) have been set forth to describe exemplary embodiments of this application, it will be apparent to those skilled in the art that the embodiments of this application can be implemented without these specific details or with variations thereof. Therefore, these descriptions should be considered illustrative rather than restrictive.

[0170] Although this application has been described in conjunction with specific embodiments thereof, many substitutions, modifications, and variations of these embodiments will be apparent to those skilled in the art from the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may be used with the embodiments discussed.

[0171] The embodiments of this application are intended to cover all such substitutions, modifications, and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the embodiments of this application should be included within the protection scope of this application.

Claims

1. A method for configuring power communication service routing based on two-dimensional matching, characterized in that, include: Obtain the set of network service requirements, and summarize and hierarchically sort the service requirements set to obtain a hierarchical service requirement model. The step of summarizing and hierarchically sorting the set of business requirements to obtain a hierarchical business requirement model includes: Each service in the service requirement set is numbered to obtain a service requirement list, where each service corresponds to a service number; the service requirements are summarized according to the access node and destination node of each service to obtain a service requirement summary result, wherein the service requirement summary result includes at least one level, the access node and destination node of services within the same level are the same, and each level corresponds to a level number; the service requirement summary result is hierarchically sorted according to the bandwidth attribute of each service to obtain the hierarchical service requirement model; Obtain the resource information of the network and construct a virtual topology based on the resource information; Calculate the link traffic of each link in the virtual topology to obtain the traffic configuration result; The communication pipeline is analyzed based on the traffic configuration results; Based on the hierarchical business requirement model and the communication pipeline, perform quantitative matching between the business requirement dimension and the pipeline resource dimension; Configure the communication pipeline based on the service routing pipeline allocation result obtained from the matching.

2. The method according to claim 1, characterized in that, The step of hierarchically sorting the service demand summarization results based on the bandwidth attributes of each service to obtain the hierarchical service demand model includes: Determine the bandwidth attributes for each of the services; Based on the attribute value of the bandwidth attribute and the service number, the services within the same level in the service demand summary result are sorted to obtain a hierarchical sorting result; Based on the hierarchical sorting result, the services within the same level are integrated according to the attribute values ​​and the service numbers to obtain the hierarchical service requirement model.

3. The method according to claim 2, characterized in that, The step of acquiring the network's resource information and constructing a virtual topology based on the resource information includes: Obtain the number of nodes in the network and the connection relationships between the nodes; Construct a network topology based on the connection relationships and the number of nodes; Add virtual input nodes and virtual output nodes to the network topology to obtain the virtual topology.

4. The method according to claim 3, characterized in that, The calculation of link traffic for each link in the virtual topology to obtain traffic configuration results includes: The bandwidth resource information is obtained by statistically analyzing the link bandwidth resources between each node in the network topology. Based on the bandwidth resource information, the link traffic of each link in the virtual topology is calculated using a network traffic algorithm when the network reaches its optimal throughput, thus obtaining the traffic configuration result.

5. The method according to claim 4, characterized in that, The process of parsing the communication pipeline based on the traffic configuration result includes: Calculate the shortest path between the virtual input node and the virtual output node; The link resource value of each hop in the shortest path is determined based on the traffic configuration results; The minimum link resource value is determined as the pipe bandwidth resource value of the communication pipe corresponding to the shortest path; The pipeline bandwidth resource value is deleted from the traffic configuration result, and a new shortest path between the virtual input node and the virtual output node is recalculated to obtain a new pipeline bandwidth resource value. This process continues until no new shortest path can be obtained, resulting in multiple communication pipelines and the pipeline bandwidth resource value corresponding to each communication pipeline.

6. The method according to claim 5, characterized in that, The quantitative matching of service requirement dimensions and pipeline resource dimensions based on the hierarchical service requirement model and the communication pipeline includes: The corresponding target communication channel is determined based on the access node and the destination node in the hierarchical service requirement model. By comparing the bandwidth resource value of the target communication pipe with the hierarchical bandwidth resource value in the hierarchical service requirement model, the target service that the target communication pipe can carry is determined. Once the target services that can be carried by all communication channels have been confirmed, the service routing channel allocation result is obtained.

7. A power communication service routing configuration device based on two-dimensional matching, characterized in that, include: The service integration module is configured to: acquire a set of network service requirements, and perform service requirement summarization and hierarchical sorting on the set of service requirements to obtain a hierarchical service requirement model; The step of summarizing and hierarchically sorting the set of business requirements to obtain a hierarchical business requirement model includes: Each service in the service requirement set is numbered to obtain a service requirement list, where each service corresponds to a service number; the service requirements are summarized according to the access node and destination node of each service to obtain a service requirement summary result, wherein the service requirement summary result includes at least one level, the access node and destination node of services within the same level are the same, and each level corresponds to a level number; the service requirement summary result is hierarchically sorted according to the bandwidth attribute of each service to obtain the hierarchical service requirement model; The resource configuration module is configured to: acquire the resource information of the network and construct a virtual topology based on the resource information; Calculate the link traffic of each link in the virtual topology to obtain the traffic configuration result; The quantization route extraction module is configured to: parse the communication pipeline based on the traffic configuration result; Based on the hierarchical business requirement model and the communication pipeline, perform quantitative matching between the business requirement dimension and the pipeline resource dimension; Configure the communication pipeline based on the service routing pipeline allocation result obtained from the matching.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the program, implements the method as claimed in any one of claims 1 to 6.

9. A non-transitory computer-readable storage medium storing computer instructions for causing a computer to perform the method of any one of claims 1 to 6.

Images