CN115242656B

CN115242656B - Communication establishment method and device

Info

Publication number: CN115242656B
Application number: CN202210735141.2A
Authority: CN
Inventors: 陈梦骁; 李�昊
Original assignee: New H3C Technologies Co Ltd
Current assignee: New H3C Technologies Co Ltd
Priority date: 2022-06-27
Filing date: 2022-06-27
Publication date: 2023-07-21
Anticipated expiration: 2042-06-27
Also published as: CN115242656A

Abstract

The embodiment of the application provides a communication establishment method and device, wherein the method comprises the following steps: obtaining a physical network topology and a virtual network topology, wherein the virtual network topology comprises at least two connected areas; respectively determining the shortest path between every two connected areas according to the physical network topology; taking each communication area as an area node, and taking the shortest path between every two communication areas as an area path between the corresponding area nodes to obtain a first simplified network topology map; and calculating the minimum connected subgraph of the first simplified network topology graph, thereby realizing the communication for establishing the virtual network topology by realizing efficient energy conservation.

Description

Communication establishment method and device

Technical Field

The present disclosure relates to the field of communications technologies, and in particular, to a communication establishment and apparatus.

Background

Constructing multiple virtual network topologies on a physical network in order to utilize one physical network to the maximum extent to realize multiple network services isolated from each other is currently the most common communication network application technology.

When the virtual network topology is divided from the physical network, the virtual network topology is not connected, for example, in the backbone network safe and reliable routing technology, a mode of distributing trust grades to routers in an autonomous domain and constructing the virtual network topology based on the trust grades of the routers is adopted to provide forwarding services with different security grades for data traffic, and the virtual network topology is divided according to the trust grades and is changed along with the change of the trust grades, so that the situation that the virtual network topology is not connected is likely to occur.

When the virtual network topology is not connected, nodes which are not connected with each other in the virtual network topology cannot access to each other for communication, which would cause abnormal transmission of data traffic, so that it is necessary to provide a connection method to enable the nodes to communicate with each other.

In the related technology, tunnels are established between every two nodes in a non-connected area of the virtual network topology to form a plurality of pairs of node pairs, paths between the non-connected areas are enumerated, and tunnel paths are selected according to the sum of the shortest path costs of all the node pairs. However, in this implementation, there may be cases where a tunnel is unnecessarily established between every two areas.

For example, as shown in fig. 1, in order to realize communication between three areas of A, B, C, tunnels are established between every two areas, and all of the three paths a-B, B-C, A-C need to be established, but in practical application, communication can be realized only by two tunnels a-B and B-C, so that the cost for establishing communication in this way is relatively high, and the efficiency is relatively low while too much unnecessary resources are occupied.

Disclosure of Invention

An object of the embodiments of the present application is to provide a communication establishment method and apparatus, so as to implement efficient source-saving communication for establishing a virtual network topology. The specific technical scheme is as follows:

In a first aspect, an embodiment of the present application provides a communication establishment method, where the method includes:

obtaining a physical network topology and a virtual network topology, wherein the virtual network topology comprises at least two connected areas;

respectively determining the shortest path between every two connected areas according to the physical network topology;

taking each communication area as an area node, and taking the shortest path between every two communication areas as an area path between the corresponding area nodes to obtain a first simplified network topology map;

calculating a minimum connected subgraph of the first simplified network topology graph;

and establishing tunnels between the communication areas according to the minimum communication subgraphs.

In a second aspect, embodiments of the present application further provide another communication establishment method, where the method includes:

for each connected region, abstracting a part corresponding to the connected region into an element node in the physical network topology to obtain a third simplified network topology diagram;

calculating a minimum connected subgraph of the third simplified network topology graph;

Judging whether the minimum connected subgraph meets a preset pruning condition or not;

if the preset pruning conditions are not met, pruning operation is not carried out on the minimum connected subgraph;

and establishing a tunnel between the communication areas according to the minimum communication subgraph.

In a third aspect, an embodiment of the present application further provides a communication establishing apparatus, including:

the system comprises an acquisition module, a communication module and a communication module, wherein the acquisition module is used for acquiring a physical network topology and a virtual network topology, and the virtual network topology comprises at least two connected areas;

the determining module is used for respectively determining the shortest path between every two connected areas according to the physical network topology;

the simplification module is used for taking each communication area as an area node, and taking the shortest path between every two communication areas as an area path between the corresponding area nodes to obtain a first simplified network topological graph;

the calculation module is used for calculating a minimum connected subgraph of the first simplified network topological graph;

the establishing module is used for establishing tunnels between the communication areas according to the minimum communication subgraphs.

In a fourth aspect, embodiments of the present application further provide another communication establishing apparatus, including:

the abstraction module is used for abstracting a part corresponding to each connected region into an element node in the physical network topology to obtain a third simplified network topology diagram;

the calculation module is used for calculating the minimum connected subgraph of the third simplified network topological graph;

the judging module is used for judging whether the minimum connected subgraph meets a preset pruning condition or not;

the pruning module is used for not pruning the minimum connected subgraph if the preset pruning conditions are not met;

the establishing module is used for establishing the tunnel between the communication areas according to the minimum communication subgraph.

The beneficial effects of the embodiment of the application are that:

according to the communication establishment method provided by the embodiment of the application, a physical network topology and a virtual network topology obtained based on physical network topology division are firstly obtained, and the virtual network topology comprises at least two connected areas. And then simplifying the connected areas into an area node in the virtual network topology, adding the shortest path between the connected areas into the area path between the corresponding area nodes, so as to obtain a first simplified network topology diagram, calculating a minimum connected subgraph of the first simplified network topology diagram, and finally establishing tunnels between the connected areas in the virtual network topology according to the minimum connected subgraph, thereby reducing the number of the established tunnels as much as possible, saving resources required for establishing the tunnels, and improving the efficiency of establishing the virtual network topology.

Of course, not all of the above-described advantages need be achieved simultaneously in practicing any one of the products or methods of the present application.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the following description will briefly introduce the drawings that are required to be used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are only some embodiments of the present application, and other embodiments may also be obtained according to these drawings to those skilled in the art.

Fig. 1 is a flow chart of a method for establishing virtual network topology communication in the related art according to an embodiment of the present application;

fig. 2a is a flow chart of a first communication establishment method according to an embodiment of the present application;

fig. 2b is an exemplary diagram of a physical network topology provided in an embodiment of the present application;

FIG. 2c is an exemplary diagram of obtaining a virtual network topology based on physical network topology partitioning according to an embodiment of the present application;

FIG. 3a is a schematic diagram of a possible implementation of step S13 according to an embodiment of the present application;

fig. 3b is an exemplary diagram of metric values of each communication path in a physical network topology according to an embodiment of the present application;

FIG. 4a is an exemplary diagram of a second simplified network topology provided by embodiments of the present application;

FIG. 4b is an exemplary diagram of a first simplified network topology provided by embodiments of the present application;

FIG. 4c is an exemplary diagram of a minimal connected subgraph provided by an embodiment of the present application;

fig. 4d is an exemplary diagram of establishing tunnels between connected areas in a virtual network topology according to a minimal connected subgraph according to an embodiment of the present application;

fig. 5a is a schematic structural diagram of a communication establishing device according to an embodiment of the present application;

FIG. 5b is an exemplary diagram of a minimal connected subgraph of a third simplified network topology provided by embodiments of the present application;

fig. 5c is an exemplary diagram of a pruned minimal connected subgraph according to an embodiment of the present application;

FIG. 6a is a schematic diagram of a possible implementation of step S52 according to an embodiment of the present application;

FIG. 6b is a schematic diagram of a physical network topology including metric values according to an embodiment of the present application;

FIG. 6c is a schematic diagram of a physical network topology that does not include metric values according to an embodiment of the present application;

FIG. 6d is a schematic diagram of a third simplified network topology provided by an embodiment of the present application;

FIG. 6e is a schematic diagram of a minimal connected subgraph of a third simplified network topology provided in an embodiment of the present application;

Fig. 6f is a schematic diagram of a pruned minimal connected subgraph according to an embodiment of the present application;

FIG. 6g is a schematic diagram of a tunnel between connected regions according to an embodiment of the present disclosure;

fig. 7 is a schematic diagram of a communication establishing device according to an embodiment of the present application;

fig. 8 is a schematic diagram of another communication establishment apparatus according to an embodiment of the present application;

fig. 9 is a schematic structural diagram of an electronic device according to an embodiment of the present application.

Detailed Description

The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all, of the embodiments of the present application. Based on the embodiments herein, a person of ordinary skill in the art would be able to obtain all other embodiments based on the disclosure herein, which are within the scope of the disclosure herein.

In order to solve the problems of more resources occupation and lower efficiency in establishing virtual network topology communication in the related art, embodiments of the present application provide a communication establishment method and apparatus, and detailed descriptions of the communication establishment method provided in the embodiments of the present application are provided below through specific embodiments.

The method of the embodiment of the application is applied to the intelligent terminal, and can be implemented through the intelligent terminal, and in the actual use process, the intelligent terminal can be a management computer, a remote server and the like.

In one embodiment of the present application, as shown in fig. 2a, a flow chart of a first communication establishment method is provided, where the method includes:

step S11: and acquiring a physical network topology and a virtual network topology.

The virtual network topology is obtained based on the physical network topology, the virtual network topology comprises at least two connected areas, each connected area comprises at least one virtual node, virtual paths exist between the virtual nodes in the same connected area in the virtual network topology, and virtual paths do not exist between the virtual nodes in different connected areas in the virtual network topology.

In a communication network application, multiple virtual network topologies may be partitioned in the same physical network topology to correspond to different requirements. The physical network topology refers to physical configuration distribution of a real communication network, the physical network topology comprises a plurality of nodes, each node corresponds to each physical node in the real communication network, and edges among the nodes in the physical network topology correspond to real physical communication links among the physical nodes. The virtual network topology is formed by dividing and constructing the physical network topology, and physical network resources are distributed according to different requirements.

The virtual network topology obtained based on the physical network topology division comprises two or more connected areas, wherein the connected areas are areas formed by connecting virtual nodes in the areas, each connected area comprises one or more virtual nodes, the virtual nodes in the same connected area are connected with each other through virtual paths, but different connected areas are not connected, namely virtual paths for connecting the virtual nodes in different connected areas are not formed between different connected areas and between the virtual nodes in different connected areas.

After the physical network topology and the virtual network topology obtained based on the division of the physical network topology are obtained, if the virtual network topology is required to realize communication requirements, there may be communication requirements between all areas in the virtual network topology, so that communication needs to be established on the virtual network topology, that is, connection needs to be established between all areas which are not connected in the virtual network topology, so that the virtual network topology forms overall connection.

For example, as shown in fig. 2b, fig. 2b is an exemplary diagram of a physical network topology provided in an embodiment of the present application, where the example includes A, B, C, D, E, F, G, H eight nodes. Fig. 2C is an exemplary diagram of a virtual network topology based on a physical network topology division provided in the embodiments of the present application, where the virtual network topology includes nodes A, B, C, F, G and communication paths a-B and a-C therebetween, where A, B, C form a communication area (in the communication area, A, B, C may also be referred to as virtual nodes, and communication paths a-B, A-C may also be referred to as virtual paths), F, G are each a communication area, where three communication areas that are not connected to each other exist in the virtual network topology, and where connection needs to be established between the three communication areas, so that the virtual network topology forms an overall communication.

Step S12: and respectively determining the shortest path between every two connected areas according to the physical network topology.

According to the acquired physical network topology, a communication path between each communication area can be determined, and based on the communication path, a shortest path between each communication area is determined, and specifically, the shortest path can be determined based on the physical communication path delay sensitivity, the hardware requirement, the bandwidth requirement and the like between each communication area.

Step S13: and taking each connected region as a region node, and taking the shortest path between every two connected regions as a region path between the corresponding region nodes to obtain a first simplified network topological graph.

In the first simplified network topology, each connected area serves as an area node, specifically: and ignoring the virtual paths communicated among the virtual nodes in the communication area, and reserving the virtual nodes at the edge of the communication area to obtain the first simplified network topology graph.

And simplifying each connected area into each area node, and obtaining the shortest path between every two connected areas, wherein the obtained shortest path is used as the area path between every two area nodes, so that a first simplified network topology graph is obtained.

Step S14: and calculating a minimum connected subgraph of the first simplified network topological graph.

The minimum connected graph is a connected graph that enables all connected areas in the virtual network topology to be connected, and the total number of paths between the connected areas is minimized. And after the first simplified network topology graph is obtained for the added area paths among the area nodes, the minimum connected subgraph of the first simplified network topology graph can be calculated.

The first simplified network topology is simplified into each area node for each connected area, virtual paths among virtual nodes in each connected area are ignored, and the connected paths among the connected areas are reserved, so that a minimum connected subgraph is obtained through calculation of the first simplified network topology.

In one example, in the virtual network topology, the reference value of the physical communication path between the connected areas is the same in both the forward direction and the reverse direction, and the minimum connected subgraph of the first simplified network topology can be calculated. Specifically, if the reference values of the physical communication paths are different in forward and reverse directions in the virtual network topology, the forward and reverse directions are regarded as two physical communication paths, and then the two physical communication paths are approximated, for example, the reference values of the two forward and reverse physical communication paths are taken as larger values, smaller values or average values or the like in the two forward and reverse paths, and then the minimum connected subgraph of the first simplified network topology is calculated based on the reference values. Specifically, the reference value is a value that can represent the demand of the physical communication path based on the delay sensitivity, hardware demand, bandwidth demand, and the like of the physical communication path corresponding to each communication area.

Step S15: and establishing tunnels between the communication areas according to the minimum communication subgraphs.

And establishing tunnels between the connected areas according to the minimum connected subgraphs of the virtual network topology, so that the connection of the connected areas in the virtual network topology can be ensured, and the total number of tunnels is minimum.

From the above, according to the communication establishment method provided by the embodiment of the present application, a physical network topology and a virtual network topology obtained based on the division of the physical network topology are first obtained, where the virtual network topology includes at least two connected areas. And then simplifying the connected areas into an area node in the virtual network topology, adding the shortest path between the connected areas into the area path between the corresponding area nodes, so as to obtain a first simplified network topology diagram, calculating a minimum connected subgraph of the first simplified network topology diagram, and finally establishing tunnels between the connected areas in the virtual network topology according to the minimum connected subgraph, thereby reducing the number of the established tunnels as much as possible, saving resources required for establishing the tunnels, and improving the efficiency of establishing the virtual network topology.

In one possible implementation manner, as shown in fig. 3a, the step S12 of determining, according to the physical network topology, a shortest path between each two connected areas includes:

Step S21: and obtaining the measurement value of each communication path in the physical network topology.

The metric value refers to the link overhead of each communication path, and is calculated from the link bandwidth of each communication path. Specifically, the magnitude of the metric value is inversely proportional to the link bandwidth, i.e., the larger the link bandwidth, the smaller the metric value, and the better the communication path. For example, as shown in fig. 3b, fig. 3b is an exemplary diagram of metric values of each communication path in a physical network topology according to an embodiment of the present application, where numbers on links represent metric values of each communication path.

Step S22: and calculating the shortest path between any two connected areas based on the metric value of each communication path in the physical network topology.

And after the measurement value of each communication path is obtained by calculation, selecting a path with the smallest measurement value from the paths as the shortest path, wherein the shortest path is the optimal link between the two communication areas.

As can be seen from the above, according to the communication establishment method provided by the embodiment of the present application, the shortest path between two communication areas is calculated according to the metric value of each communication path in the physical network topology, so that the finally established tunnel is formed by the path with the smallest metric value, and resources occupied by establishing the tunnel are saved.

In a possible implementation manner, the obtaining the metric value of each communication path in the physical network topology in step S21 includes:

for each communication path in the physical network topology, when the forward and reverse metrics of the communication path are the same, taking the same metric as the metric of the communication path; when the communication path is a communication path with different forward and reverse metric values, the larger metric value of the forward and reverse metric values of the communication path is used as the metric value of the communication path, the smaller metric value of the forward and reverse metric values of the communication path is used as the metric value of the communication path, or the average value of the forward and reverse metric values of the communication path is used as the metric value of the communication path.

When the forward and reverse metric values of each communication path in the physical network topology are the same, the same metric value is used as the metric value of the communication path, and when the communication paths with different forward and reverse metric values exist in the physical network topology, namely the physical network topology is not an undirected network topology, a larger metric value or a smaller metric value or an average value of the forward and reverse metric values in the forward and reverse metric values can be selected as the metric value of the communication path for the communication paths, then subsequent calculation is carried out, and specific selection can be determined according to actual requirements.

As can be seen from the above, in the communication establishment method provided in the embodiment of the present application, when the forward and reverse measurement values of the communication paths are the same, the same measurement value is used as the measurement value of the communication path, but when there are communication paths with different forward and reverse measurement values in the physical network topology, a larger value, a smaller value or an average value of the forward and reverse measurement values can be selected as the measurement value of the communication path, so that the application of the method is not affected by whether the forward and reverse measurement values of the communication paths are the same, and the application scenario of the method is expanded.

In one possible implementation manner, the step S22 calculates, for any two connected areas, a shortest path between the two connected areas based on the metric values of the communication paths in the physical network topology, including:

calculating shortest paths between each virtual node in one communication area and each virtual node in the other communication area in the two communication areas based on the measurement values of each communication path in the physical network topology aiming at any two communication areas, and obtaining the total measurement value of each shortest path; selecting the minimum value of the metric values from the plurality of metric values; and taking the shortest path indicated by the minimum value as the shortest path between the two communication areas.

The above-mentioned method includes that the communication area includes at least one virtual node, there are multiple paths capable of achieving link communication between two communication areas, that is, there are multiple paths capable of achieving link communication between the virtual nodes of two communication areas, the shortest path between two communication areas is calculated, that is, the shortest path is calculated between each virtual node of one communication area and each virtual node of another communication area, and since the communication area includes at least one virtual node, there are also multiple determined shortest paths, and at this time, the path with the smallest metric value is selected as the shortest path between the two communication areas.

As can be seen from the above, according to the communication establishment method provided by the embodiment of the present application, the shortest paths between the communication areas are determined by calculating the shortest paths between the virtual nodes in the communication areas, so that the path with the smallest measurement value that best meets the requirements can be obtained more accurately, and resources occupied when the tunnel is established are saved.

Step one: for each connected region, abstracting a part corresponding to the connected region into an element node in the physical network topology to obtain a second simplified network topology diagram;

wherein communication paths exist between nodes in the physical network topology, so virtual paths also exist between element nodes in the second simplified network topology.

Step two: and calculating the shortest path between any two element nodes, and taking the shortest path as the shortest path between two connected areas corresponding to the two element nodes.

Wherein, for any connected area, even if the connected area only includes one virtual node, the virtual node corresponding to the connected area is still regarded as an element node which abstracts and simplifies the connected area in the second simplified network topology. The second simplified network topology is a network topology in which each connected area is simplified to each element node, and then, for the second simplified network topology, metric values of each virtual path between the simplified element nodes are calculated. Specifically, for each element node, the virtual paths communicated between the virtual nodes in the communication area can be ignored, the virtual paths of the virtual nodes in the communication area and the virtual paths of the external virtual nodes are used as the virtual paths of the element node and the external virtual node, then the metric value of each virtual path between any two element nodes is calculated, and the virtual path with the minimum metric value is selected to be the shortest path between the two element nodes, namely the shortest path between the two communication areas.

For example, as shown in fig. 4a, fig. 4a is a simplified network topology example diagram provided by the embodiment of the present application after simplifying a connected area in a physical network topology into element nodes, where each connected area is regarded as an element node to be abstracted and simplified, and each of F and G is a connected area including only one virtual node. Taking the ABC whole as an element node Y1, F as an element node Y2 and G as an element node Y3, calculating the metric value of each virtual path between the element node Y1 and the element node Y3, and selecting the virtual path with the minimum metric value; calculating the metric value of each virtual path between the element node Y1 and the element node Y2, and selecting the virtual path with the minimum metric value; calculating the metric value of each virtual path between the element node Y3 and the element node Y2, and selecting the virtual path with the minimum metric value; resulting in an exemplary diagram of the shortest path as shown in fig. 4 b. After the shortest path is obtained, the shortest path is taken as the shortest path between the connected areas corresponding to the element nodes, based on the shortest path, an example graph of the minimum connected subgraph shown in fig. 4c can be obtained, namely, the communication between the connected areas in the virtual network topology can be realized only by two paths B-D-F, F-H-G, and then two tunnels B-D-F, F-H-G are established based on the communication paths, so that the example graph of the tunnel between the connected areas in the virtual network topology is established according to the minimum connected subgraph shown in fig. 4D.

As can be seen from the above, in the communication establishment method provided by the embodiment of the present application, by calculating the shortest paths between the element nodes in the second simplified network topology map that simplifies each connected area to each element node, and determining the shortest paths between the connected areas based on the shortest paths, the calculation process of the shortest paths can be improved, the calculation resources occupied during the calculation of the paths are saved, and further the efficiency of establishing virtual network topology communication is improved.

In one embodiment of the present application, the calculating the minimal connected subgraph of the first simplified network topology graph specifically includes: and calculating the minimum connected subgraph of the first simplified network topological graph by using a minimum spanning tree algorithm.

In one embodiment of the present application, the calculating the minimal connected subgraph of the first simplified network topology graph includes: calculating at least one minimal connected subgraph of the first simplified network topology using a spanning tree algorithm; determining a total metric value of each minimum connected subgraph; selecting the minimum value of the total metric values from the plurality of total metric values; and taking the minimum connected subgraph indicated by the minimum value as the minimum connected subgraph of the first simplified network topological graph.

And establishing tunnels among all connected areas in the virtual network topology according to the minimum connected subgraphs of the first simplified network topology graph.

The first simplified network topology map is simplified into each area node for each connected area, virtual paths among virtual nodes in each connected area are ignored, the obtained virtual paths among the connected areas are reserved, and a minimum connected subgraph is obtained by calculating the first simplified network topology map through a minimum spanning tree algorithm.

Specifically, the minimum connected subgraph of the first simplified network topology graph is calculated by using a minimum spanning tree algorithm, and the minimum connected subgraph is the minimum connected subgraph with the minimum sum of the measurement values of all communication paths in the corresponding physical network topology.

From the above, according to the communication establishment method provided by the embodiment of the application, the minimum connected subgraph of the first simplified network topology graph is calculated by using the minimum spanning tree algorithm, and is the minimum connected subgraph with the minimum sum of the measurement values of all the communication paths, and the tunnel is established based on the minimum connected subgraph, so that the communication efficiency of the virtual network topology is improved.

As shown in fig. 5a, the embodiment of the present application further provides a flow chart of a communication establishment method, including:

step S51: and acquiring a physical network topology and a virtual network topology.

Step S52: and abstracting a part corresponding to each connected region into an element node in the physical network topology for each connected region to obtain a third simplified network topology diagram.

Step S53: and calculating the minimum connected subgraph of the third simplified network topological graph.

Step S54: and judging whether the minimum connected subgraph meets a preset pruning condition or not.

Step S55: if the preset pruning conditions are not met, pruning operation is not carried out on the minimum connected subgraph;

step S56: and establishing a tunnel between the communication areas according to the minimum communication subgraph.

In one embodiment of the present application, the method further comprises:

if the preset pruning conditions are met, pruning operation is carried out on the minimal connected subgraph, and a pruned minimal connected subgraph is obtained;

Repeatedly executing the process of judging whether the minimum connected subgraph meets the preset pruning condition or not until the minimum connected subgraph after pruning does not meet the preset pruning condition;

and establishing tunnels between the communication areas according to the minimal connected subgraphs after pruning.

After the minimum connected subgraph of the third simplified network topological graph is obtained, the sum of resources consumed by the simplified paths in the minimum connected subgraph is required to be smaller, so that the waste of resources is reduced, so that whether the minimum connected subgraph meets the preset pruning conditions is judged, specifically, when unnecessary simplified paths consume unnecessary resources in the minimum connected subgraph, the preset pruning conditions are met, namely pruning operation is required, pruning operation is performed on the current minimum connected subgraph, and repeated execution is performed to judge whether the minimum connected subgraph meets the preset pruning conditions is returned until the preset pruning conditions are not met, namely pruning operation is not required; if unnecessary simplified paths are not existed and unnecessary resources are not consumed, the preset pruning conditions are not met, namely pruning operation is not needed. And finally, obtaining a minimum connected subgraph which does not need pruning any more, wherein the minimum connected subgraph represents that the sum of resources consumed by a simplified path in the minimum connected subgraph at the moment is less and cannot be further reduced, so that a tunnel between connected areas is established according to the minimum connected subgraph.

For example, as shown in fig. 5b, fig. 5b shows an example diagram of a minimal connected subgraph of a third simplified network topology, in the diagram, Z1 and Z2 are element nodes after two connected regions are simplified, A, B, C, D are respectively four virtual nodes, and are not connected regions, and only the element nodes Z1 and Z2 are nodes after the connected regions are simplified, so as to determine whether pruning operation is needed for the minimal connected subgraph of the third simplified network topology. In one example, the minimal connected subgraph after pruning may be as shown in fig. 5c, pruning removes the unnecessary simplified path between A, B, C, D and B, C, D compared to the minimal connected subgraph before pruning.

As can be seen from the foregoing, in the communication establishment method provided in the embodiment of the present application, after the minimum connected subgraph of the third simplified network topology is obtained, whether the minimum connected subgraph meets the preset pruning condition is further determined, until a final minimum connected subgraph that does not meet the preset pruning condition, that is, pruning is no longer required, where the sum of resources consumed by the simplified path in the final minimum connected subgraph is less, resource waste is avoided, so that a tunnel between all connected areas in the virtual network topology is established according to the minimum connected subgraph, resources consumed for establishing the tunnel can be saved, and meanwhile, the efficiency of tunnel establishment is improved.

In a possible implementation manner, as shown in fig. 6a, the step S52 calculates a minimum connected subgraph of the third simplified network topology, including:

step S61: acquiring a measurement value of each communication path in the physical network topology;

step S62: determining the metric value of the simplified path in the third simplified network topology according to the metric value of each communication path in the physical network topology;

step S63: and calculating the minimum connected subgraph of the third simplified network topological graph by using a minimum spanning tree algorithm and the metric value of the simplified path.

As can be seen from the above, according to the communication establishing method provided by the embodiment of the present application, the shortest path between two communication areas is calculated according to the metric value of each communication path in the physical network topology, so that the communication tunnel is finally established according to the minimum communicating sub-with the minimum sum of the metric values, so that the number of tunnels established by the virtual network topology communication is ensured to be as small as possible, and resources occupied by establishing the tunnels can be saved.

In a possible implementation manner, the determining whether the current minimal connected subgraph meets the preset pruning condition in step S54 includes:

detecting whether a first type endpoint exists in the minimum connected subgraph, wherein the first type endpoint is a non-element node and has a simplified path;

If yes, determining that the minimum connected subgraph meets the preset pruning condition;

if not, determining that the minimum connected subgraph does not meet the preset pruning condition;

if the preset pruning condition is met, pruning the minimal connected subgraph, specifically including:

and deleting the first class endpoint and a simplified path of the first class endpoint in the minimum connected subgraph.

Detecting whether a first type endpoint exists in endpoint nodes of the current minimum connected subgraph, wherein the first type endpoint is a non-element node in the current minimum connected subgraph and has a simplified path, if the first type endpoint exists, judging that the current minimum connected subgraph meets a preset pruning condition, and if the first type endpoint does not exist, judging that the current minimum connected subgraph does not meet the preset pruning condition.

Clipping the first class endpoint from the current minimum connected subgraph and clipping a simplified path of the first class endpoint.

The first class of endpoints are virtual nodes having one edge (i.e., a reduced path), such as shown in fig. 5B, where the non-element node D and the non-element node B each have only one edge, and thus the non-element node D and the non-element node B are both the first class of endpoints.

In one example, the minimal connected subgraph after pruning the first class endpoint may be as shown in fig. 5c, pruning removes the first class endpoint compared to the minimal connected subgraph before pruning, and has a simplified path.

As can be seen from the foregoing, in the communication establishment method provided in the embodiment of the present application, after the minimum connected subgraph of the third simplified network topology is obtained, whether the minimum connected subgraph meets the preset pruning condition or needs pruning is further determined by detecting whether the first type endpoint exists in the minimum connected subgraph, until a final minimum connected subgraph is obtained, which does not meet the preset pruning condition or needs pruning, without the first type endpoint, and at the moment, the sum of resources consumed by the communication paths in the final minimum connected subgraph is less, so that tunnels between the connected areas in the virtual network topology are established according to the minimum connected subgraph, resources consumed for establishing tunnels can be saved, and meanwhile, the efficiency of tunnel establishment is improved.

As shown in fig. 6b-6g, the embodiment of the present application further provides an application example diagram of a communication establishment method, where fig. 6b and fig. 6c show a physical network topology diagram, where A, B, C, D, E, F, G, H is eight nodes in the network topology, numbers between nodes in fig. 6b represent metric values of a communication path and are the same in forward and reverse directions, and fig. 6c represents A, B, C, G that communication is required. Each connected area is simplified as a whole, that is, ABC may be simplified into one element node Y1, and G is a connected area including only one node and also serves as one element node Y2, so as to obtain a third simplified network topology, as shown in fig. 6 d. Calculating a third simplified network topological graph by utilizing a minimum spanning tree algorithm to obtain a minimum connected subgraph as shown in fig. 6e, pruning the graph 6e to obtain a new minimum connected subgraph by carrying out pruning operation on the to-be-pruned edges B-D, F-H and the first class endpoints D, F and removing B-D, F-H, D, F, pruning the minimum connected subgraph again by carrying out pruning operation on the minimum connected subgraph again and removing G-H, H to obtain a final minimum connected subgraph without pruning as shown in fig. 6f, and establishing a tunnel according to the graph 6f to obtain a result as shown in fig. 6G.

Referring to fig. 7, fig. 7 is a schematic structural diagram of a first communication establishing apparatus according to an embodiment of the present application, where the apparatus includes:

an obtaining module 701, configured to obtain a physical network topology and a virtual network topology, where the virtual network topology includes at least two connected areas;

a determining module 702, configured to determine shortest paths between every two connected areas according to the physical network topology;

a simplifying module 703, configured to take each connected area as an area node, and take a shortest path between every two connected areas as an area path between corresponding area nodes, so as to obtain a first simplified network topology map;

a calculating module 704, configured to calculate a minimal connected subgraph of the first simplified network topology map;

and the establishing module 705 is configured to establish a tunnel between the connected areas according to the minimal connected subgraph.

As can be seen from the above, the communication establishment apparatus provided in the embodiments of the present application first obtains a physical network topology and a virtual network topology obtained based on the division of the physical network topology, where the virtual network topology includes at least two connected areas. Then simplifying the connected area into an area node in the virtual network topology, adding the shortest path between the connected areas into the area path between the corresponding area nodes, thereby obtaining a first simplified network topology graph, calculating the minimum connected subgraph of the first simplified network topology graph, and finally, establishing tunnels among all the connected areas in the virtual network topology according to the minimum connected subgraph, so that the number of the established tunnels is as small as possible, resources required for establishing the tunnels are saved, and meanwhile, the efficiency of establishing the virtual network topology is improved.

In one embodiment of the present application, the determining module 702 includes:

the measurement value acquisition sub-module is used for acquiring measurement values of all communication paths in the physical network topology;

and the path calculation sub-module is used for calculating the shortest path between any two connected areas based on the measurement value of each communication path in the physical network topology.

As can be seen from the above, according to the communication establishment device provided in the embodiment of the present application, the shortest path between two communication areas is calculated according to the metric value of each communication path in the physical network topology, so that the finally established tunnel is formed by the path with the smallest metric value, and resources occupied by establishing the tunnel are saved.

In one embodiment of the present application, the metric value obtaining submodule is specifically configured to:

As can be seen from the above, when the forward and reverse measurement values of the communication paths are the same, the communication establishment device provided in the embodiment of the present application uses the same measurement value as the measurement value of the communication path, but when there are communication paths with different forward and reverse measurement values in the physical network topology, a larger value, a smaller value or an average value of the forward and reverse measurement values may be selected as the measurement value of the communication path, so that the application of the method is not affected by whether the forward and reverse measurement values of the communication paths are the same, and the application scenario of the method is expanded.

In one embodiment of the present application, the path computation submodule is specifically configured to:

calculating shortest paths between each virtual node in one communication area and each virtual node in the other communication area in any two communication areas based on the measurement values of each communication path in the physical network topology, and obtaining total measurement values of each shortest path; selecting the minimum value of the metric values from the plurality of metric values; and taking the shortest path indicated by the minimum value as the shortest path between the two communication areas.

As can be seen from the above, in the communication establishment apparatus provided in the embodiments of the present application, the shortest paths between the communication areas are determined by calculating the shortest paths between the virtual nodes in the communication areas, so that the path with the smallest measurement value that best meets the requirements can be obtained more accurately, thereby saving the resources occupied when the tunnel is established.

for each connected region, abstracting a part corresponding to the connected region into an element node in the physical network topology to obtain a second simplified network topology diagram;

and calculating the shortest path between any two element nodes, and taking the shortest path as the shortest path between two connected areas corresponding to the two element nodes.

As can be seen from the above, in the communication establishment apparatus provided in the embodiments of the present application, by calculating the shortest paths between nodes in the second simplified network topology map that simplifies each connected area to each element node, and determining the shortest paths between connected areas based on the shortest paths, the calculation process of the shortest paths can be improved, the calculation resources occupied when calculating the paths are saved, and further the efficiency of establishing virtual network topology communication is improved.

In one embodiment of the present application, the computing module 704 is specifically configured to:

calculating a minimum connected subgraph of the first simplified network topological graph by utilizing a minimum spanning tree algorithm;

or alternatively;

the computing module 704 is specifically configured to:

Calculating at least one minimal connected subgraph of the first simplified network topology using a spanning tree algorithm;

determining a total metric value of each minimum connected subgraph;

selecting the minimum value of the total metric values from the plurality of total metric values;

and taking the minimum connected subgraph indicated by the minimum value as the minimum connected subgraph of the first simplified network topological graph.

From the above, the communication establishment device provided in the embodiment of the present application calculates, using a minimum spanning tree algorithm, a minimum connected subgraph of the first simplified network topology graph as a minimum connected subgraph with the smallest sum of measurement values of each communication path, and establishes a tunnel based on the minimum connected subgraph, thereby improving virtual network topology communication efficiency.

Referring to fig. 8, fig. 8 is a second communication establishing apparatus provided in an embodiment of the present application, where the apparatus includes:

an obtaining module 801, configured to obtain a physical network topology and a virtual network topology, where the virtual network topology includes at least two connected areas;

an abstraction module 802, configured to abstract, for each connected area, a portion corresponding to the connected area into an element node in the physical network topology, so as to obtain a third simplified network topology map;

A calculating module 803, configured to calculate a minimal connected subgraph of the third simplified network topology map;

a judging module 804, configured to judge whether the minimal connected subgraph meets a preset pruning condition;

pruning module 805, configured to, if the preset pruning condition is not satisfied, not perform pruning operation on the minimal connected subgraph;

and a building module 806, configured to build a tunnel between the connected areas according to the minimal connected subgraph.

In one embodiment of the present application, the apparatus further comprises:

the pruning module is used for pruning the minimal connected subgraph if the preset pruning conditions are met, so as to obtain a pruned minimal connected subgraph;

the step repeated execution module is used for repeatedly executing the process of judging whether the minimum connected subgraph meets the preset pruning conditions or not until the minimum connected subgraph after pruning does not meet the preset pruning conditions;

and the third tunnel establishing module establishes tunnels between the connected areas according to the minimal connected subgraphs after pruning.

As can be seen from the foregoing, in the communication establishment apparatus provided in the embodiment of the present application, after the minimum connected subgraph of the third simplified network topology is obtained, whether the minimum connected subgraph meets the preset pruning condition is further determined, until a final minimum connected subgraph that does not meet the preset pruning condition, that is, pruning is no longer required, where the sum of resources consumed by the simplified path in the final minimum connected subgraph is less, resource waste is avoided, so that a tunnel between all connected areas in the virtual network topology is established according to the minimum connected subgraph, resources consumed for establishing the tunnel can be saved, and meanwhile, efficiency of tunnel establishment is improved.

In one embodiment of the present application, the calculating module 803 is specifically configured to:

acquiring a measurement value of each communication path in the physical network topology;

determining the metric value of each communication path in the third simplified network topology according to the metric value of each communication path in the physical network topology;

and calculating the minimum connected subgraph of the third simplified network topological graph by using a minimum spanning tree algorithm and the metric value of the simplified path.

As can be seen from the above, according to the communication establishment device provided by the embodiment of the present application, the shortest path between two communication areas is calculated according to the metric values of each communication path in the physical network topology, so that the communication tunnel is finally established according to the minimum communicating sub-with the smallest sum of the metric values, so that the number of tunnels established by the virtual network topology communication is ensured to be as small as possible, and resources occupied by establishing the tunnels can be saved.

In one embodiment of the present application, the determining module 804 is specifically configured to:

detecting whether a first type endpoint exists in the minimum connected subgraph, wherein the first type endpoint is a non-element node and has a simplified path; if yes, determining that the minimum connected subgraph meets the preset pruning condition; if not, determining that the minimum connected subgraph does not meet the preset pruning condition;

The pruning module is specifically configured to:

As can be seen from the foregoing, in the communication establishment apparatus provided in the embodiment of the present application, after the minimum connected subgraph of the third simplified network topology is obtained, whether the minimum connected subgraph meets the preset pruning condition or needs pruning is further determined by detecting whether the first type endpoint exists in the minimum connected subgraph, until a final minimum connected subgraph is obtained, which does not meet the preset pruning condition or needs pruning, without the first type endpoint, and at this time, the sum of resources consumed by the communication paths in the final minimum connected subgraph is less, so that tunnels between the communication areas in the virtual network topology are established according to the minimum connected subgraph, resources consumed for establishing tunnels can be saved, and meanwhile, the efficiency of tunnel establishment is improved.

The embodiment of the present application further provides an electronic device, as shown in fig. 9, including a processor 901, a communication interface 902, a memory 903, and a communication bus 904, where the processor 901, the communication interface 902, and the memory 903 perform communication with each other through the communication bus 904,

A memory 903 for storing a computer program;

the processor 901 is configured to implement any of the above-described communication establishment method steps when executing the program stored in the memory 903.

The communication bus mentioned above for the electronic devices may be a peripheral component interconnect standard (Peripheral Component Interconnect, PCI) bus or an extended industry standard architecture (Extended Industry Standard Architecture, EISA) bus, etc. The communication bus may be classified as an address bus, a data bus, a control bus, or the like. For ease of illustration, the figures are shown with only one bold line, but not with only one bus or one type of bus.

The communication interface is used for communication between the electronic device and other devices.

The Memory may include random access Memory (Random Access Memory, RAM) or may include Non-Volatile Memory (NVM), such as at least one disk Memory. Optionally, the memory may also be at least one memory device located remotely from the aforementioned processor.

The processor may be a general-purpose processor, including a central processing unit (Central Processing Unit, CPU), a network processor (Network Processor, NP), etc.; but also digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), field programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.

In yet another embodiment provided herein, there is also provided a computer readable storage medium having stored therein a computer program which when executed by a processor implements the steps of the method of establishing any of the virtual network topology communications described above.

In yet another embodiment provided herein, there is also provided a computer program product containing instructions that, when run on a computer, cause the computer to perform the method of establishing virtual network topology communication of any of the above embodiments.

In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, produces a flow or function in accordance with embodiments of the present application, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. The computer instructions may be stored in or transmitted from one computer-readable storage medium to another, for example, by wired (e.g., coaxial cable, optical fiber, digital Subscriber Line (DSL)), or wireless (e.g., infrared, wireless, microwave, etc.). The computer readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that contains an integration of one or more available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid State Disk (SSD)), etc.

It is noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.

In this specification, each embodiment is described in a related manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for an apparatus, an electronic device, a computer readable storage medium, a computer program product embodiment, the description is relatively simple, as it is substantially similar to the method embodiment, as relevant see the partial description of the method embodiment.

The foregoing description is only of the preferred embodiments of the present application and is not intended to limit the scope of the present application. Any modifications, equivalent substitutions, improvements, etc. that are within the spirit and principles of the present application are intended to be included within the scope of the present application.

Claims

1. A method of communication establishment, the method comprising:

obtaining a physical network topology and a virtual network topology, wherein the virtual network topology is obtained based on the division of the physical network topology, and the virtual network topology comprises at least two connected areas;

2. The method according to claim 1, wherein determining the shortest path between each two connected areas according to the physical network topology comprises:

and calculating the shortest path between any two connected areas based on the metric value of each communication path in the physical network topology.

3. The method according to claim 2, wherein the obtaining the metric value of each communication path in the physical network topology specifically includes:

for each communication path in the physical network topology, when the forward and reverse metrics of the communication path are the same, taking the same metric as the metric of the communication path;

when the communication path is a communication path with different forward and reverse metric values, the larger metric value of the forward and reverse metric values of the communication path is used as the metric value of the communication path, the smaller metric value of the forward and reverse metric values of the communication path is used as the metric value of the communication path, or the average value of the forward and reverse metric values of the communication path is used as the metric value of the communication path.

4. The method according to claim 2, wherein for any two connected areas, calculating the shortest path between the two connected areas based on the metric value of each communication path in the physical network topology specifically includes:

Calculating shortest paths between each virtual node in one communication area and each virtual node in the other communication area in the two communication areas based on the measurement values of each communication path in the physical network topology aiming at any two communication areas, and obtaining the measurement value of each shortest path;

selecting the minimum value of the metric values from the plurality of metric values;

and taking the shortest path indicated by the minimum value as the shortest path between the two communication areas.

5. The method according to claim 2, wherein for any two connected areas, calculating the shortest path between the two connected areas based on the metric value of each communication path in the physical network topology specifically includes:

6. The method according to claim 2, wherein said calculating a minimal connected subgraph of said first simplified network topology, in particular comprises:

Calculating a minimum connected subgraph of the first simplified network topological graph by using a minimum spanning tree algorithm;

or alternatively;

the calculating the minimal connected subgraph of the first simplified network topology graph includes:

determining a total metric value of each minimum connected subgraph;

7. A method of communication establishment, the method comprising:

8. The method of claim 7, wherein the method further comprises:

9. The method according to claim 7, wherein said calculating a minimal connected subgraph of said third simplified network topology, in particular comprises:

determining the metric value of the simplified path in the third simplified network topology according to the metric value of each communication path in the physical network topology;

10. The method of claim 8, wherein the determining whether the minimal connected subgraph meets a preset pruning condition specifically comprises:

11. A communication establishment apparatus, the apparatus comprising:

the system comprises an acquisition module, a communication module and a communication module, wherein the acquisition module is used for acquiring a physical network topology and a virtual network topology, the virtual network topology is obtained based on the division of the physical network topology, and the virtual network topology comprises at least two connected areas;

12. A communication establishment apparatus, the apparatus comprising: