阅读说明：本技术 一种路径确定方法、设备和存储介质 (Path determining method, device and storage medium ) 是由 胡晓露 顾祺焘 王宇轩 刘德文 于 2019-08-28 设计创作，主要内容包括：本发明公开了一种路径确定方法,获取多个第一域中带宽信息符合预设带宽信息的域,得到多个第二域；确定多个第二域中包括源节点和目的节点的域为多个第三域,并确定多个第二域中除多个第三域外的域为多个第四域；获取多个第三域的与时延关联的第一路由信息,并获取多个第四域的与时延关联的第二路由信息；基于第一路由信息和第二路由信息,从多个第一域中确定从源节点到目的节点的第一目标路径；本发明的实施例同时还公开了一种设备和存储介质；实现域内、域间不同路由策略,使得路径时延尽可能小,同时避免了各域出口处网络拥塞的情况。(The invention discloses a path determining method, which comprises the steps of obtaining a plurality of domains of which the bandwidth information accords with preset bandwidth information in a first domain, and obtaining a plurality of second domains; determining domains including the source node and the destination node among the plurality of second domains as a plurality of third domains, and determining domains other than the plurality of third domains among the plurality of second domains as a plurality of fourth domains; acquiring first routing information associated with time delay of a plurality of third domains and acquiring second routing information associated with time delay of a plurality of fourth domains; determining a first target path from the source node to the destination node from the plurality of first domains based on the first routing information and the second routing information; the embodiment of the invention also discloses a device and a storage medium; different routing strategies in the domain and between the domains are realized, so that the path delay is as small as possible, and the condition of network congestion at the exit of each domain is avoided.)

1. A method for path determination, the method comprising:

acquiring a plurality of domains of which the bandwidth information accords with preset bandwidth information in a first domain to obtain a plurality of second domains;

determining domains including a source node and a destination node among the plurality of second domains as a plurality of third domains, and determining domains other than the plurality of third domains among the plurality of second domains as a plurality of fourth domains;

acquiring first routing information associated with time delay of the plurality of third domains, and acquiring second routing information associated with time delay of the plurality of fourth domains;

determining a first target path from the source node to the destination node from the plurality of first domains based on the first routing information and the second routing information.

2. The method of claim 1, wherein obtaining a plurality of domains in which bandwidth information in the first domains conforms to preset bandwidth information to obtain a plurality of second domains comprises:

acquiring a target bandwidth parameter of an outward inter-domain link of an exit node of each of the plurality of first domains;

determining the domains with the target bandwidth parameters larger than the preset bandwidth parameters in the plurality of first domains as a plurality of second domains; the bandwidth information includes the target bandwidth parameter, and the preset bandwidth information includes the preset bandwidth parameter.

3. The method of claim 1, wherein the first routing information comprises: a first delay of a shortest delay path from the source node to each egress node of each of the plurality of third domains, a second delay of a shortest delay path from the destination node to each egress node of each of the plurality of third domains, a third delay of a shortest delay path between a plurality of egress nodes of the plurality of third domains, and a fourth delay of an inter-domain link outward of an egress of each of the plurality of third domains.

4. The method of claim 3, wherein the second routing information comprises: a fifth delay of a shortest delay path between a plurality of egress nodes of the plurality of fourth domains and a sixth delay of an inter-domain link outward of an egress of each of the plurality of fourth domains.

5. The method of claim 4, wherein determining the first target path from the source node to the destination node from the plurality of first domains based on the first routing information and the second routing information comprises:

determining that a shortest delay path among paths from the source node to the destination node is a second target path based on the first delay, the second delay, the third delay, the fourth delay, the fifth delay and the sixth delay;

acquiring target nodes in the plurality of first domains and target links in the plurality of first domains associated with the second target path;

determining the first target path based on the target node and the target link.

6. An apparatus, characterized in that the apparatus comprises: a processor, a memory, and a communication bus;

the communication bus is used for realizing communication connection between the processor and the memory;

the processor is configured to execute a path determination program in the memory to perform the steps of:

acquiring a plurality of domains of which the bandwidth information accords with preset bandwidth information in a first domain to obtain a plurality of second domains;

determining domains including a source node and a destination node among the plurality of second domains as a plurality of third domains, and determining domains other than the plurality of third domains among the plurality of second domains as a plurality of fourth domains;

acquiring first routing information associated with time delay of the plurality of third domains, and acquiring second routing information associated with time delay of the plurality of fourth domains;

determining a first target path from the source node to the destination node from the plurality of first domains based on the first routing information and the second routing information.

7. The apparatus of claim 6, wherein the processor is configured to execute a path determination program in the memory to perform the steps of:

acquiring a target bandwidth parameter of an outward inter-domain link of an exit node of each of the plurality of first domains;

determining the domains with the target bandwidth parameters larger than the preset bandwidth parameters in the plurality of first domains as a plurality of second domains; the bandwidth information includes the target bandwidth parameter, and the preset bandwidth information includes the preset bandwidth parameter.

8. The apparatus of claim 6, wherein the first routing information comprises: a first delay of a shortest delay path from the source node to each egress node of each of the plurality of third domains, a second delay of a shortest delay path from the destination node to each egress node of each of the plurality of third domains, a third delay of a shortest delay path between a plurality of egress nodes of the plurality of third domains, and a fourth delay of an inter-domain link outward of an egress of each of the plurality of third domains.

9. The apparatus of claim 6, wherein the second routing information comprises: a fifth delay of a shortest delay path between a plurality of egress nodes of the plurality of fourth domains and a sixth delay of an inter-domain link outward of an egress of each of the plurality of fourth domains.

10. A storage medium having stored thereon computer-executable instructions capable, when executed, of carrying out the steps of the path determination method according to any one of claims 1 to 5.

Technical Field

The present invention relates to, but not limited to, the field of network data transmission, and in particular, to a path determination method, device, and storage medium.

Background

Under a Software Defined Network (SDN) architecture, most routing algorithms in the related art design routes based on link states or according to special requirements; however, the routing algorithm in the related art has high computational complexity due to the complexity of the node network, and thus cannot be practically deployed in a large network.

Disclosure of Invention

In view of this, embodiments of the present invention provide a path determining method, a device, and a storage medium, which solve the problem in the related art that a routing algorithm is too complex in a node network to cause high computational complexity, and thus cannot be practically deployed and applied in a large network; different routing strategies in the domain and between the domains are realized, so that the path delay is as small as possible, and the condition of network congestion at the exit of each domain is avoided.

In order to achieve the purpose, the technical scheme of the invention is realized as follows:

a method of path determination, the method comprising:

acquiring a plurality of domains of which the bandwidth information accords with preset bandwidth information in a first domain to obtain a plurality of second domains;

determining domains including a source node and a destination node among the plurality of second domains as a plurality of third domains, and determining domains other than the plurality of third domains among the plurality of second domains as a plurality of fourth domains;

acquiring first routing information associated with time delay of the plurality of third domains, and acquiring second routing information associated with time delay of the plurality of fourth domains;

determining a first target path from the source node to the destination node from the plurality of first domains based on the first routing information and the second routing information.

Optionally, the obtaining of the domains in which the bandwidth information in the plurality of first domains conforms to the preset bandwidth information to obtain a plurality of second domains includes:

acquiring a target bandwidth parameter of an outward inter-domain link of an exit node of each of the plurality of first domains;

determining the domains with the target bandwidth parameters larger than the preset bandwidth parameters in the plurality of first domains as a plurality of second domains; the bandwidth information includes the target bandwidth parameter, and the preset bandwidth information includes the preset bandwidth parameter.

Optionally, the first routing information includes: a first delay of a shortest delay path from the source node to each egress node of each of the plurality of third domains, a second delay of a shortest delay path from the destination node to each egress node of each of the plurality of third domains, a third delay of a shortest delay path between a plurality of egress nodes of the plurality of third domains, and a fourth delay of an inter-domain link outward of an egress of each of the plurality of third domains.

Optionally, the second routing information includes: a fifth delay of a shortest delay path between a plurality of egress nodes of the plurality of fourth domains and a sixth delay of an inter-domain link outward of an egress of each of the plurality of fourth domains.

Optionally, the determining, from the plurality of first domains, a first target path from the source node to the destination node based on the first routing information and the second routing information includes:

determining that a shortest delay path among paths from the source node to the destination node is a second target path based on the first delay, the second delay, the third delay, the fourth delay, the fifth delay and the sixth delay;

acquiring target nodes in the plurality of first domains and target links in the plurality of first domains associated with the second target path;

determining the first target path based on the target node and the target link.

An apparatus, the apparatus comprising: a processor, a memory, and a communication bus;

the communication bus is used for realizing communication connection between the processor and the memory;

the processor is configured to execute a path determination program in the memory to perform the steps of:

acquiring a plurality of domains of which the bandwidth information accords with preset bandwidth information in a first domain to obtain a plurality of second domains;

determining domains including a source node and a destination node among the plurality of second domains as a plurality of third domains, and determining domains other than the plurality of third domains among the plurality of second domains as a plurality of fourth domains;

acquiring first routing information associated with time delay of the plurality of third domains, and acquiring second routing information associated with time delay of the plurality of fourth domains;

determining a first target path from the source node to the destination node from the plurality of first domains based on the first routing information and the second routing information.

Optionally, the processor is configured to execute a path determination program in the memory to implement the following steps:

acquiring a target bandwidth parameter of an outward inter-domain link of an exit node of each of the plurality of first domains;

determining the domains with the target bandwidth parameters larger than the preset bandwidth parameters in the plurality of first domains as a plurality of second domains; the bandwidth information includes the target bandwidth parameter, and the preset bandwidth information includes the preset bandwidth parameter.

Optionally, the first routing information includes: a first delay of a shortest delay path from the source node to each egress node of each of the plurality of third domains, a second delay of a shortest delay path from the destination node to each egress node of each of the plurality of third domains, a third delay of a shortest delay path between a plurality of egress nodes of the plurality of third domains, and a fourth delay of an inter-domain link outward of an egress of each of the plurality of third domains.

Optionally, the second routing information includes: a fifth delay of a shortest delay path between a plurality of egress nodes of the plurality of fourth domains and a sixth delay of an inter-domain link outward of an egress of each of the plurality of fourth domains.

Optionally, the processor is configured to execute a path determination program in the memory to implement the following steps:

determining that a shortest delay path among paths from the source node to the destination node is a second target path based on the first delay, the second delay, the third delay, the fourth delay, the fifth delay and the sixth delay;

acquiring target nodes in the plurality of first domains and target links in the plurality of first domains associated with the second target path;

determining the first target path based on the target node and the target link.

A computer readable storage medium storing one or more programs, the one or more programs being executable by one or more processors to implement the steps of the path determination method as described above.

The method, the device and the storage medium for determining the path provided by the embodiment of the invention comprise the following steps: acquiring a plurality of domains of which the bandwidth information accords with preset bandwidth information in a first domain to obtain a plurality of second domains; determining domains including the source node and the destination node among the plurality of second domains as a plurality of third domains, and determining domains other than the plurality of third domains among the plurality of second domains as a plurality of fourth domains; acquiring first routing information associated with time delay of a plurality of third domains and acquiring second routing information associated with time delay of a plurality of fourth domains; determining a first target path from the source node to the destination node from the plurality of first domains based on the first routing information and the second routing information; the problem that in the related technology, the routing algorithm is too high in computational complexity due to the fact that a node network is complex, and therefore the routing algorithm cannot be practically deployed and applied in a large-scale network is solved; different routing strategies in the domain and between the domains are realized, so that the path delay is as small as possible, and the condition of network congestion at the exit of each domain is avoided.

Drawings

Fig. 1 is a schematic flow chart of a path determination method according to an embodiment of the present invention;

fig. 2 is a schematic flow chart of another path determining method according to an embodiment of the present invention;

fig. 3 is a schematic structural diagram of an apparatus provided in the present invention.

Detailed Description

The present invention will be described in further detail with reference to the accompanying drawings and examples.

The path determination method provided by the embodiment of the invention aims to provide a routing optimization algorithm under a Software Defined Network (SDN) hierarchical Network architecture based on Quality of Service (QoS) constraints, which is used for the conditions of multiple nodes and complex networks, and flexibly realizes different routing strategies in domains and between domains by using a centralized global view of a controller. The path determining method provided by the embodiment of the invention aims to avoid network link congestion at an exit between domains of a cross-domain route by the inter-domain bandwidth limitation aiming at the conditions of intra-domain delay sensitivity and inter-domain bandwidth limitation, further realize different intra-domain and inter-domain routing strategies to ensure that the path delay is as small as possible, and simultaneously avoid network congestion at the exits of each domain.

Here, the background of the SDN is briefly described, and the distributed network architecture of the conventional network has many limitations, which restrict the innovation of the routing algorithm; such as: all nodes are equivalent, and a controller without a center controls all nodes; the nodes need to exchange messages with adjacent nodes to acquire network information, a commonly used Diskstra algorithm for searching the shortest path needs to know the topology information of the global network, and the traditional network is difficult to acquire the topology information of the global network and needs to use a distributed algorithm; the operations of all nodes are executed concurrently; without a global view, it is difficult to determine whether it is an optimal decision. Although there are many proposals in the related art to solve the above limitations, they are often limited to the research stage, and the main reasons for this phenomenon are: most routing protocols in the traditional network are solidified in hardware by manufacturers, and the protocols are difficult to change; secondly, the new protocol is not widely applied, and the compatibility and the expandability are poor, so that the operation and maintenance cost of the equipment is high.

However, SDN differs from the distributed policy of conventional networks in that SDN implements decoupling of data plane and control plane by concentrating the control plane on one remote logical controller. That is, the switching device of the data plane does not need to acquire any network information, and only works according to the command of the controller; the logic controller of the control plane runs a program for managing the network to grasp all network information, is connected with each switch through a control link, and controls the flow table entries in the switches according to a specified protocol to guide the processing of the data packets. Some routing protocol problems existing in the traditional network architecture can be solved under the architecture of centralized control; such as: compared with the traditional network, the SDN centralized controller can acquire network global information in real time to form a consistent network view, and an optimal routing strategy is easier to deploy; the routing protocol is modularly deployed in an SDN control plane, namely a network operating system, and the algorithm can be flexibly updated in an iterative manner.

Further, a hierarchical domain-division architecture of the SDN is briefly introduced, most SDN control planes are composed of single-instance controllers at present, and indexes such as performance and reliability of the SDN control planes are difficult to meet requirements of large-scale deployment. In addition, in the face of different network scenarios, the requirements on the network are greatly different. Therefore, in the SDN network architecture, the network needs to be partitioned into areas according to network functions, and each area is controlled by a respective controller. To better deploy SDN, the industry proposes a hierarchical and domain-partitioned SDN architecture.

In a hierarchical Domain-divided SDN network architecture, a network is composed of a plurality of SDN domains, and a Domain Control Plane (DCP) of each SDN Domain may be composed of a single-instance controller or a distributed controller cluster. The DCP is responsible for network management within the SDN domain, and communication between SDN domains is completed by a higher Control Plane (SCP). The Super Control Plane collects information of each SDN domain and inter-domain link information to complete inter-domain network management. Here, the Domain controller is abbreviated as DC, and the Super controller is abbreviated as SC.

Here, the hierarchical domain-divided SDN network architecture can make the network have a more logical structure, is easy to manage, is beneficial to expansion of network scale, and realizes larger-scale SDN network deployment. For example, in an operator network, there are different network types such as an access network, an aggregation network, and a core network. The service form and the network condition in each network have different models, and specific network application programs need to be operated to manage the network according to specific network scenes. Since necessary information synchronization and the like must be performed between networks, a higher-level SC is also required to perform communication between different networks. In summary, for a large-scale network with numerous network nodes, hierarchical zoning is beneficial to the zoning management of the network, and is a necessary development trend of large-scale deployment of the SDN.

In the related art, the routing problem under QoS constraints is to find a path that satisfies one or more metric parameters. Several QoS metrics commonly used in networks include mainly available bandwidth, end-to-end delay, packet loss rate, jitter and cost, with different metrics having different properties. According to these properties, QoS metrics can be classified into three types, an additivity metric, a multiplicative metric, and a minimum metric. Routing algorithms under the constraint condition of multiple QoS metrics belong to a Non-deterministic problem (NP) of Polynomial complexity, cannot be solved accurately within Polynomial time, and researchers have designed many heuristic algorithms to conduct extensive and intensive research. These algorithms can be classified into the following categories according to the type of problem to be solved and the method of solving it: polynomial non-heuristic, pseudo-polynomial non-heuristic, probe, constrained QoS metric, path subspace search, QoS metric correlation, cost function, and probability solution.

The routing heuristic algorithm and the approximation algorithm under the constraint condition of multiple QoS metrics have the following defects: first, the computational complexity is too high to be practical in a network; secondly, the performance of the algorithm is too low to find the actual existing path; finally, there are also most algorithms that are only directed to certain special cases in the problem of specific QoS requirements.

It should be noted that, most of the conventional network routing algorithms are based on distance, hop count or delay, and are implemented mainly by the shortest-path algorithm. However, the distributed network architecture has a single path selection result and does not consider real-time link state parameters, so that local link congestion is often caused, the utilization rate of the whole link is low, and errors are difficult to eliminate.

Some routing protocol problems existing in the traditional network architecture can be solved under the SDN centralized control architecture; such as: compared with the traditional network, the SDN centralized controller can acquire network global information in real time to form a consistent network view, and an optimal routing strategy is easier to deploy; the routing protocol is modularly deployed in an SDN control plane, namely a network operating system, and the algorithm can be flexibly updated in an iterative manner.

Therefore, hierarchical zoning is beneficial to zoning management of the network and is a necessary development trend of large-scale SDN deployment. For intra-domain routing under the framework, an intra-domain controller can acquire real-time network information to form a global network view, and different routing strategies in the region are flexibly realized. Meanwhile, for cross-domain network communication, routing information in different areas needs cooperative communication management of an inter-domain controller and an intra-domain controller, namely, a distributed network architecture is combined with centralized controller management, so that the complexity of a routing algorithm of a large network can be reduced, and different routing strategies in the intra-domain and the inter-domain can be flexibly realized.

Under the SDN network architecture, most of the route improvement algorithms in the related art design routes based on link states or according to special requirements, such as a multi-path routing algorithm, and provide multiple paths for selection; and dynamically adjusting the routing calculation parameters and adjusting the routing algorithm parameters in real time. For the routing problem under the constraint condition of multiple QoS metrics, the traditional heuristic algorithm and approximation algorithm cannot be practically deployed and applied in a large network because the computation complexity is too high; or that the actual existing path is not found because the algorithm performance is too low.

The path determining method provided by the embodiment of the invention is used for the situation that a plurality of nodes and networks are complex, and flexibly realizes different routing strategies in the domain and between the domains by utilizing the centralized global view of the controller. The method aims at the time delay sensitivity in the domain and the bandwidth limitation between the domains, avoids the network link congestion at the exit between the domains of the cross-domain routing by the bandwidth limitation between the domains, realizes different routing strategies between the domains in the domain, ensures the path time delay to be as small as possible, and simultaneously avoids the network congestion at the exit of each domain.

It should be noted that, in the embodiment of the present invention, the delay refers to transmission delay, queuing delay, and the like. The queuing delay of the existing equipment is relatively small, and the propagation delay is mainly between operators, which is related to the hop count or the transmission distance. Bandwidth refers to the link remaining bandwidth indicator.

Here, the path determination method provided by the embodiment of the method is briefly explained, and the definitions of the related terms are correspondingly explained; in the embodiment of the invention, for the hierarchical domain-divided network, N domains are assumed, and each hierarchical domain-divided network consists of a simple graph N_i＝(V_i,E_i) Is represented by, wherein 0 < i < n, V_iSet of nodes, V, representing domain i_iI represents the number of nodes of the domain i, E_iA set of links representing i, E ═ u, v ∈ E_iBandwidth measurement B (e) and time delay measurement D (e), wherein the measurement values are non-negative numbers; wherein u, v represent network nodes, respectively.

In the embodiment of the invention, the measurement of the bandwidth and the time delay is real-time; the metric is invariant during the implementation of the method provided by the present invention. Based on the method, a routing path between the source node and the destination node is searched, so that the link congestion can be avoided, and the time delay is as small as possible.

Here, a path is defined: p (v)₀,v_k)＝v₀,e₁,v₁,e₂,...v_(k-1),e_k,v_kBy a set of nodes v_jAnd link e_jIn which e_j＝(v_(j-1),v_j)∈E_iRepresents a link e_jIs a node v_(j-1)And v_jJ is more than or equal to 1 and less than or equal to k.

In the embodiment of the present invention, d (e) refers to transmission delay, queuing delay, etc., where propagation delay mainly relates to hop count or transmission distance. Here, the bandwidth and delay metrics are real-time. Each N_iHas n_iAnd the domains are connected through the egress nodes.

Based on the above, here, with the source node s and the destination node d known, the routing path P (s, d) is found with as little delay as possible to avoid inter-domain network congestion. That is, P (s, d) refers to a path from the source node s to the destination node d that satisfies the inter-domain bandwidth constraint while having as little latency as possible. The routing information is maintained and updated in a centralized way by a control plane, and for any two nodes v and w, the following information needs to be maintained in the embodiment of the invention:

delay of the shortest Delay path (LD) from node v to node w: ld _ value (v, w);

the ID of the next node of the LD path from node v to node w;

bandwidth of node v to adjacent node link: bandwidth.

The LD path and LD _ value (v, w) can be obtained from the above information by the global shortest path algorithm at the controller. We assume that all values are up-to-date and that the link cost, link delay, content of the cost vector and content of the delay vector do not change during the execution of the routing algorithm.

For the cross-domain problem, only one source node s and one destination node d are distributed in different domains, and network abstraction and simplification are firstly carried out.

Here, the intra-domain controller, except for the routing mode of the intra-domain node, may report the following information to the SC:

delay from a source node s (or a destination node d) to an LD path of each exit node of the domain (for a cross-domain routing problem, there is only one source node s and one destination node d, but they are distributed in different domains);

the delay of the LD path between the respective exits of the respective domains;

and the bandwidth sc-bandwidth of the outward inter-domain link of each domain exit node.

Here, the inter-domain controller needs to control the cross-domain routing, and needs to obtain connection information between domains and connection information between the exits of the domains, where the information obtained by the inter-domain controller includes:

delay and bandwidth of the link between the inter-domain link nodes; here, the inter-domain link node refers to a node of a link between exits of different domains;

the time delay of the LD path from the source node s in the domain to the exit of the domain by the destination node d;

the delay of the LD path between the different exits of each domain.

Thus, the original complex network diagram can be abstracted to form a new network topology.

It should be noted that the abstracted network node includes: egress nodes, source nodes s and destination nodes d of all domains.

The abstracted network links include: an LD path from a source node s to an exit of the local domain; an LD path from the destination node d to the local domain exit; LD paths between intra-domain exits for all domains; LD paths between different domain exits between domains.

Thus, a network view after abstraction is obtained, which translates the cross-domain routing problem into an "intra-domain" routing problem. Based on the abstracted network view, the SC translates to an intra-domain controller for the new network view. And according to the algorithm, carrying out routing selection in the new network view, and mapping the selected path back to the original hierarchical domain network.

Based on the foregoing, an embodiment of the present invention provides a path determining method, which is applied to a device, where the device may be an inter-domain controller, to implement the steps shown in fig. 1:

step 101, obtaining a plurality of domains in which the bandwidth information in the first domain conforms to the preset bandwidth information, and obtaining a plurality of second domains.

In the embodiment of the invention, the inter-domain controller firstly acquires part of routing information reported by the intra-domain controller, namely the reported sc-bandwidth of each domain exit node.

Further, the inter-domain controller firstly limits the bandwidth threshold according to the sc-bandwidth value, for example, the bandwidth threshold is 50, and if the outward sc-bandwidth value of the domain a exit node reported by a domain (for example, the domain a) is less than 50, the inter-domain link is marked as the inter-domain link which does not meet the requirement of the bandwidth threshold.

In the embodiment of the invention, the inter-domain controller traverses the labeling conditions of all inter-domain links of each domain, and judges that if the inter-domain links of which the outlet of the domain a (the domain a is generally referred to as each domain) is connected with the outside are all marked as the links which do not meet the requirement of the bandwidth threshold, the domain a is marked as a non-standard domain, otherwise, the domain a is marked as a standard domain.

And aiming at the domains where the source node and the destination node are respectively positioned, the inter-domain controller judges according to the determined conditions of the standard domain or the non-standard domain: if the domain of the source node s or the destination node d is a non-standard domain, the subsequent steps are not executed; otherwise, the first target path is determined based on the criteria field.

In the embodiment of the present invention, the inter-domain controller obtains, for a plurality of first domains, domains in which bandwidth information in the plurality of first domains conforms to preset bandwidth information, and obtains a plurality of second domains, where the second domains refer to the standard domains.

Step 102, determining a plurality of domains including the source node and the destination node in the second domains as a plurality of third domains, and determining domains except the plurality of third domains in the second domains as a plurality of fourth domains.

In the embodiment of the invention, after obtaining a plurality of second domains, the inter-domain controller determines that the domains including the source node and the destination node in the plurality of second domains are a plurality of third domains, and determines that the domains except the plurality of third domains in the plurality of second domains are a plurality of fourth domains.

Step 103, obtaining first routing information associated with the time delay of a plurality of third domains, and obtaining second routing information associated with the time delay of a plurality of fourth domains.

In the embodiment of the present invention, after the inter-domain controller divides the plurality of second domains to obtain the plurality of third domains and the plurality of fourth domains, the inter-domain controller obtains first routing information associated with the time delay of the plurality of third domains, and obtains second routing information associated with the time delay of the plurality of fourth domains.

Here, for the domains where the source node and the destination node are both standard domains, the inter-domain controller notifies the intra-domain controller DC of such domains to report the first routing information to the inter-domain controller SC.

For other standard domains outside the domain where the source node and the destination node are located, the inter-domain controller informs the intra-domain controller DC of such a domain to report the second routing information to the inter-domain controller SC.

Step 104, determining a first target path from the source node to the destination node from the plurality of first domains based on the first routing information and the second routing information.

In an embodiment of the present invention, an inter-domain controller determines a first target path from a source node to a destination node from a plurality of first domains based on first routing information and second routing information.

Therefore, under the network architecture of the SDN hierarchical domain, the path determination method provided by the embodiment of the present invention selects 2 QoS metrics: latency and remaining bandwidth. Under a network system architecture with numerous hierarchical domain-divided nodes, an intra-domain controller DC can acquire time delay among the nodes in each domain in real time, and an inter-domain controller selectively acquires link information of the intra-domain network nodes and searches for a routing path which avoids inter-domain network link congestion, load balancing and has the smallest time delay.

According to the path determining method provided by the embodiment of the invention, a plurality of domains with bandwidth information conforming to preset bandwidth information in a first domain are obtained, and a plurality of second domains are obtained; determining domains including the source node and the destination node among the plurality of second domains as a plurality of third domains, and determining domains other than the plurality of third domains among the plurality of second domains as a plurality of fourth domains; acquiring first routing information associated with time delay of a third domain, and acquiring second routing information associated with time delay of a fourth domain; determining a first target path from the source node to the destination node from the plurality of first domains based on the first routing information and the second routing information; the problem that in the related technology, the routing algorithm is too high in computational complexity due to the fact that a node network is complex, and therefore the routing algorithm cannot be practically deployed and applied in a large-scale network is solved; different routing strategies in the domain and between the domains are realized, so that the path delay is as small as possible, and the condition of network congestion at the exit of each domain is avoided.

Based on the foregoing embodiments, an embodiment of the present invention provides a path determining method, which is applied to a device, where the device may be an inter-domain controller, to implement the steps shown in fig. 2:

step 201, obtaining a target bandwidth parameter of an outward inter-domain link of an egress node of each of the plurality of first domains.

Step 202, determining the plurality of domains with the target bandwidth parameter larger than the preset bandwidth parameter in the first domains as a plurality of second domains.

The bandwidth information comprises a target bandwidth parameter, and the preset bandwidth information comprises a preset bandwidth parameter.

Step 203, determining the domains including the source node and the destination node in the plurality of second domains as a plurality of third domains, and determining the domains other than the plurality of third domains in the plurality of second domains as a plurality of fourth domains.

Step 204, obtaining first routing information associated with the time delay of a plurality of third domains, and obtaining second routing information associated with the time delay of a plurality of fourth domains.

Wherein the first routing information includes: the first time delay of the shortest time delay path from the source node to each exit node of each third domain in the plurality of third domains, the second time delay of the shortest time delay path from the destination node to each exit node of each third domain in the plurality of third domains, the third time delay of the shortest time delay path between the plurality of exit nodes of the plurality of third domains and the fourth time delay of the outbound inter-domain link of each domain in the plurality of third domains.

Illustratively, here, the first routing information includes: a delay LD _ value (s, oi) of the LD path from the source node s to each exit node oi in the plurality of third domains; a delay LD _ value (d, oi) of the LD path from the destination node d to each exit node oi in the plurality of third domains; delays LD _ value (o1, o2) of LD paths between respective egress nodes within a plurality of third domains; and a plurality of time delays delay of inter-domain links outbound from respective ones of the plurality of exits within the third domain.

Wherein the second routing information includes: a fifth delay of a shortest delay path between a plurality of egress nodes of the plurality of fourth domains and a sixth delay of an inter-domain link outward of an egress of each of the plurality of fourth domains.

Illustratively, here, the second routing information includes: delays LD _ value (o1, o2) of LD paths between respective egress nodes within a plurality of fourth domains; and a plurality of time delays delay of inter-domain links outbound from respective ones of the plurality of exits within the fourth domain. Based on this, network abstraction is accomplished.

Step 205, determining the shortest delay path in the paths from the source node to the destination node as the second target path based on the first delay, the second delay, the third delay, the fourth delay, the fifth delay and the sixth delay.

The inter-domain controller SC abstracts and simplifies the network according to the first time delay, the second time delay, the third time delay, the fourth time delay, the fifth time delay and the sixth time delay, and according to the time delay information of the links between the abstract network nodes and the shortest path algorithm, the inter-domain controller calculates the shortest time delay path P (s, d) from the source node s to the destination node d based on the abstract network node topology and the link time delay information, namely, the inter-domain cross-domain routing problem is converted into the intra-domain routing problem.

It should be noted that, when calculating the shortest delay path P, because the egress node traffic is large and is likely to be blocked, there is a risk that a link of a certain egress x may be deleted due to the blockage. Therefore, in the embodiment of the present invention, when the shortest delay path P (s, d) from the source node s to the destination node d is obtained, the delay of the LD path from the domain to another domain through another egress node when the link between the egress node oi and another domain is deleted may be determined according to the delay LD _ value (o1, o2) of the LD path between each egress in the third domains and the fourth domains, where i is a positive integer.

Step 206, target nodes in a plurality of first domains associated with the second target path and target links in the plurality of first domains are obtained.

Step 207, determining a first target path based on the target node and the target link.

In the embodiment of the present invention, an inter-domain controller maps P (s, d) from an abstract network to a hierarchical domain network, and specifically, the inter-domain controller issues each LD path of each domain related to the shortest delay path to an intra-domain controller of each domain related to the shortest delay path P (s, d), that is, issues an LD path between each exit in the domain or an LD path from a source node (or a destination node) to an exit node o of the domain, and each intra-domain controller further restores the LD path in each domain to a specific network node according to the LD path issued by the inter-domain controller. The path is composed of nodes and corresponding links, in particular a set of nodes V_iAnd link E_iComposition, Link E_iIs a V_iThe link between the adjacent nodes, specifically, the intra-domain controller restores the node and the link of the abstract network to the node and the link of the original network according to the node and the link of the abstract network related to the issued LD path, that is, the final actual path is formed.

Further, the inter-domain controller abstracts the mapping of the network path P (s, d) to the hierarchical split-domain network end.

In the hierarchical domain-divided SDN, it is assumed that the total number of nodes is a, the number of domains is B, the average number of nodes in each domain is C, that is, a is B × C, the average number of outlets in each domain is D, and D is less than B. In the network view after the path determination method provided by the embodiment of the invention is abstracted, the number of nodes is at most D multiplied by B + 2. Compared with the condition without grading and domain division, the number of the nodes is reduced, and the algorithm complexity is reduced. Meanwhile, the non-standard domain is eliminated by screening according to the inter-domain bandwidth limitation, and compared with the original network, the interactive information transmission quantity between the DCP and the SCP is reduced.

Based on the above content, it can be seen that the path determining method provided in the embodiment of the present invention combines a distributed network architecture with centralized controller management under a network architecture of SDN hierarchical domains, finds a routing algorithm that meets inter-domain bandwidth requirements and optimizes delay as much as possible, and solves the problem that inter-domain links are easy to be congested and delay is sensitive in cross-domain routing. In the related art, the QoS routing problem is mostly a heuristic algorithm, which cannot be deployed in a large network because of high algorithm complexity. The path determining method provided by the embodiment of the invention not only can meet the bandwidth and delay constraints, but also has the following beneficial effects: on one hand, the algorithm complexity is reduced, and the method can be deployed in a complex network with numerous nodes; under the hierarchical domain-division network architecture, the embodiment of the invention aims at the problem of cross-domain routing and finds a routing algorithm which meets the inter-domain bandwidth limitation and has the lowest time delay. The non-standard domain is eliminated by screening according to the inter-domain bandwidth limitation, so that the number of DCP controllers and the number of network nodes are reduced compared with the original network; meanwhile, abstraction is performed based on LD path time delay between nodes in the domain, so that each standard intra-domain controller only uploads time delay information of the shortest time delay LD link between a few nodes to an inter-domain controller, the number of abstract network nodes is reduced, and algorithm complexity is greatly reduced. Compared with the condition without hierarchical domain division, the number of the nodes is reduced, the algorithm complexity is reduced, and the method can be deployed in networks with numerous network nodes.

On the other hand, the amount of mutual information between controllers is reduced: and network link congestion at an outlet between cross-domain routing domains is avoided through inter-domain bandwidth limitation, non-standard domains are screened out, the number of network abstract domains is reduced, and the transmission quantity of interactive information between an intra-domain controller and an inter-domain controller is reduced. Meanwhile, abstraction is carried out based on LD paths among the nodes in the domain, so that the controller in the domain of each standard domain only uploads the time delay information of the LDs among a few nodes to the inter-domain controller, namely the time delay of the LDs among the outlets of each domain, the time delay of the LDs between the source node and the destination node to the outlets of each domain, and the time delay information of the link uploaded to the inter-domain controller by the controller in the domain of each standard domain is reduced.

It should be noted that, for the descriptions of the same steps and the same contents in this embodiment as those in other embodiments, reference may be made to the descriptions in other embodiments, which are not described herein again.

Based on the foregoing embodiments, an embodiment of the present invention provides an apparatus, which is applied to a path determining method provided in the embodiment corresponding to fig. 1-2, and referring to fig. 3, the apparatus 3 includes: a processor 31, a memory 32, and a communication bus 33, wherein:

the communication bus 33 is used for realizing communication connection between the processor 31 and the memory 32;

the processor 31 is configured to execute the path determination program stored in the memory 32 to implement the following steps:

acquiring a plurality of domains of which the bandwidth information accords with preset bandwidth information in a first domain to obtain a plurality of second domains;

determining domains including the source node and the destination node among the plurality of second domains as a plurality of third domains, and determining domains other than the plurality of third domains among the plurality of second domains as a plurality of fourth domains;

acquiring first routing information associated with time delay of a plurality of third domains and acquiring second routing information associated with time delay of a plurality of fourth domains;

a first target path from the source node to the destination node is determined from the plurality of first domains based on the first routing information and the second routing information.

In other embodiments of the present invention, obtaining a plurality of domains in which bandwidth information in the first domain conforms to preset bandwidth information to obtain a plurality of second domains includes:

acquiring a target bandwidth parameter of an outward inter-domain link of an exit node of each of a plurality of first domains;

determining a plurality of domains with target bandwidth parameters larger than preset bandwidth parameters in the first domains as a plurality of second domains; the bandwidth information comprises a target bandwidth parameter, and the preset bandwidth information comprises a preset bandwidth parameter.

In other embodiments of the present invention, the first routing information includes: the first time delay of the shortest time delay path from the source node to each exit node of each third domain in the plurality of third domains, the second time delay of the shortest time delay path from the destination node to each exit node of each third domain in the plurality of third domains, the third time delay of the shortest time delay path between the plurality of exit nodes of the plurality of third domains and the fourth time delay of the outbound inter-domain link of each domain in the plurality of third domains.

In other embodiments of the present invention, the second routing information includes: a fifth delay of a shortest delay path between a plurality of egress nodes of the plurality of fourth domains and a sixth delay of an inter-domain link outward of an egress of each of the plurality of fourth domains.

In other embodiments of the present invention, determining a first target path from a source node to a destination node from a plurality of first domains based on first routing information and second routing information comprises:

determining the shortest delay path in the paths from the source node to the destination node as a second target path based on the first delay, the second delay, the third delay, the fourth delay, the fifth delay and the sixth delay;

acquiring target nodes in a plurality of first domains associated with a second target path and target links in the plurality of first domains;

a first target path is determined based on the target node and the target link.

It should be noted that, for a specific implementation process of the step executed by the processor in this embodiment, reference may be made to an implementation process in the path determining method provided in the embodiment corresponding to fig. 1-2, and details are not described here again.

Based on the foregoing embodiments, embodiments of the invention provide a computer-readable storage medium storing one or more programs, the one or more programs being executable by one or more processors to implement the steps of:

acquiring a plurality of domains of which the bandwidth information accords with preset bandwidth information in a first domain to obtain a plurality of second domains;

determining domains including the source node and the destination node among the plurality of second domains as a plurality of third domains, and determining domains other than the plurality of third domains among the plurality of second domains as a plurality of fourth domains;

acquiring first routing information associated with time delay of a plurality of third domains and acquiring second routing information associated with time delay of a plurality of fourth domains;

a first target path from the source node to the destination node is determined from the plurality of first domains based on the first routing information and the second routing information.

In other embodiments of the present invention, the one or more programs may be executable by the one or more processors to perform the information processing program to perform the steps of:

acquiring a target bandwidth parameter of an outward inter-domain link of an exit node of each of a plurality of first domains;

determining a plurality of domains with target bandwidth parameters larger than preset bandwidth parameters in the first domains as a plurality of second domains; the bandwidth information comprises a target bandwidth parameter, and the preset bandwidth information comprises a preset bandwidth parameter.

In other embodiments of the present invention, the first routing information includes: the first time delay of the shortest time delay path from the source node to each exit node of each third domain in the plurality of third domains, the second time delay of the shortest time delay path from the destination node to each exit node of each third domain in the plurality of third domains, the third time delay of the shortest time delay path between the plurality of exit nodes of the plurality of third domains and the fourth time delay of the outbound inter-domain link of each domain in the plurality of third domains.

In other embodiments of the present invention, the second routing information comprises: a fifth delay of a shortest delay path between a plurality of egress nodes of the plurality of fourth domains and a sixth delay of an inter-domain link outward of an egress of each of the plurality of fourth domains.

In other embodiments of the present invention, the one or more programs may be executable by the one or more processors to perform the information processing program to perform the steps of:

determining a first target path from the source node to the destination node from the plurality of first domains based on the first routing information and the second routing information, comprising:

determining the shortest delay path in the paths from the source node to the destination node as a second target path based on the first delay, the second delay, the third delay, the fourth delay, the fifth delay and the sixth delay;

acquiring target nodes in a plurality of first domains associated with a second target path and target links in the plurality of first domains;

a first target path is determined based on the target node and the target link.

It should be noted that, for a specific implementation process of the step executed by the processor in this embodiment, reference may be made to an implementation process in the path determining method provided in the embodiment corresponding to fig. 1-2, and details are not described here again.

The computer-readable storage medium may be a Read Only Memory (ROM), a Programmable Read Only Memory (PROM), an Erasable Programmable Read Only Memory (EPROM), an Electrically Erasable Programmable Read Only Memory (EEPROM), a magnetic Random Access Memory (FRAM), a Flash Memory (Flash Memory), a magnetic surface Memory, an optical Disc, or a Compact Disc Read-Only Memory (CD-ROM); and may be various electronic devices such as mobile phones, computers, tablet devices, personal digital assistants, etc., including one or any combination of the above-mentioned memories.

It should be noted that, in this document, 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 an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.

The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.

Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which is stored in a storage medium (such as ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (such as a mobile phone, a computer, a server, an air conditioner, or a network device) to execute the method described in the embodiments of the present invention.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.