CN113905291A - Connection establishing method, device and storage medium - Google Patents

Connection establishing method, device and storage medium Download PDF

Info

Publication number
CN113905291A
CN113905291A CN202010576346.1A CN202010576346A CN113905291A CN 113905291 A CN113905291 A CN 113905291A CN 202010576346 A CN202010576346 A CN 202010576346A CN 113905291 A CN113905291 A CN 113905291A
Authority
CN
China
Prior art keywords
node
target
determining
resource
affected service
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202010576346.1A
Other languages
Chinese (zh)
Inventor
李晓建
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Priority to CN202010576346.1A priority Critical patent/CN113905291A/en
Publication of CN113905291A publication Critical patent/CN113905291A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062—Network aspects
    • H04Q11/0067—Provisions for optical access or distribution networks, e.g. Gigabit Ethernet Passive Optical Network (GE-PON), ATM-based Passive Optical Network (A-PON), PON-Ring
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0005—Switch and router aspects
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0005—Switch and router aspects
    • H04Q2011/0037—Operation
    • H04Q2011/0043—Fault tolerance
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062—Network aspects
    • H04Q2011/0073—Provisions for forwarding or routing, e.g. lookup tables
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062—Network aspects
    • H04Q2011/0079—Operation or maintenance aspects

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The embodiment of the invention discloses a connection establishing method, equipment and a storage medium, belonging to the technical field of communication. The method comprises the following steps: when the network is determined to have a fault, determining a target route of the affected service according to the route determination information, determining a mapping relation between each available resource in the network and a parameter in the first set, determining a first target parameter corresponding to the characteristic quantity in the first set according to the characteristic quantity of the first node of the affected service, determining a target available resource corresponding to the first target parameter in each available resource according to the mapping relation, and establishing connection for the affected service according to the target route and the target available resource. The connection establishing method can determine the target available resource of the affected service in each available resource in the network according to the characteristic quantity of the first node of the affected service, and the global uniqueness of the target available resource is ensured to the greatest extent, so that resource conflict is avoided.

Description

Connection establishing method, device and storage medium
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a connection establishment method, device, and storage medium.
Background
An Optical Transport Network (OTN) technology is a novel Optical Transport technology system. The OTN technology inherits the advantages of a Synchronous Digital Hierarchy (SDH) network and a Wavelength Division Multiplexing (WDM) network, and has the advantages of large capacity and a good management and control mechanism. The OTN technology can implement functions of transmission, exchange, multiplexing, etc. of signals of various granularities. Meanwhile, the OTN technology can support various upper layer services and protocols, and is an important networking technology for carrying an optical network. The Automatic Switched Optical Network (ASON) technology realizes the functions of automatic path calculation, establishment, restoration, and the like in the OTN Network. With the continuous development of ASON technology, more and more service providers begin to build networks by using optical network devices, and implement automatic path calculation of calls and connection establishment by loading control planes inside nodes. Since the management of the service state in the distributed ASON system is all on the first node of the service, when the optical fiber in the network fails, the first node of the affected service initiates the restoration of the service connection.
Currently, the first node of each affected service is only responsible for the path calculation and resource determination of the node where the affected service is located, and connection is established according to the calculated path and resource.
However, in the above process, when the first nodes of the affected services establish connections simultaneously, the paths calculated by the first nodes may use the same network resource, such as the same link wavelength or the same timeslot, and resource collision occurs. This results in that only the first connection using the resource will be established successfully and the connections of other affected services will be established unsuccessfully.
Disclosure of Invention
The embodiments of the present invention mainly aim to provide a connection establishment method, device, and storage medium, which aim to implement a function that resource conflict does not occur when a connection is reestablished after a network failure occurs.
In order to achieve the above object, an embodiment of the present invention provides a connection establishment method, where the method includes:
when the network is determined to have a fault, determining a target route of the affected service according to the route determination information;
determining a mapping relation between each available resource in the network and the parameters in the first set;
determining a first target parameter corresponding to the characteristic quantity in the first set according to the characteristic quantity of the head node of the affected service;
determining a target available resource corresponding to the first target parameter in each available resource according to the mapping relation;
and establishing connection for the affected service according to the target route and the target available resource.
To achieve the above object, an embodiment of the present invention further provides a connection establishing apparatus, which includes a memory, a processor, a program stored on the memory and executable on the processor, and a data bus for implementing connection communication between the processor and the memory, where the program implements the steps of the foregoing method when executed by the processor.
To achieve the above object, an embodiment of the present invention provides a storage medium for a computer-readable storage, the 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 foregoing method.
The connection establishing method, device and storage medium provided by the embodiment include: when the network is determined to have a fault, determining a target route of the affected service according to the route determination information, determining a mapping relation between each available resource in the network and a parameter in the first set, determining a first target parameter corresponding to the characteristic quantity in the first set according to the characteristic quantity of the first node of the affected service, determining a target available resource corresponding to the first target parameter in each available resource according to the mapping relation, and establishing connection for the affected service according to the target route and the target available resource. The connection establishing method can determine target available resources of the affected services in the available resources in the network from the mapping relation between the available resources in the network and the parameters in the first set according to the characteristic quantity of the first node of the affected services, and because the mapping relation determined by the first nodes of a plurality of affected services in the global is the same and the characteristic quantity of the first node of each affected service is globally unique, the target available resources determined by the characteristic quantity of the first node of the affected services based on the mapping relation are also related to the characteristic quantity of the first node of the affected services, namely, the global uniqueness of the determined target available resources is ensured to the greatest extent, so that resource conflict is avoided, and the success rate of connection establishment is improved.
Drawings
Fig. 1 is a flowchart of a connection establishment method according to an embodiment;
FIG. 2 is a schematic diagram of a network topology;
fig. 3 is a flowchart of a connection establishment method according to another embodiment;
FIG. 4 is another schematic diagram of a network topology;
FIG. 5 is yet another schematic diagram of a network topology;
fig. 6 is a schematic structural diagram of a connection establishment apparatus according to an embodiment;
fig. 7 is a schematic structural diagram of a connection establishment apparatus according to another embodiment;
fig. 8 is a schematic structural diagram of a connection establishment apparatus according to an embodiment.
Detailed Description
It should be understood that the specific embodiments described herein are merely illustrative of the embodiments of the invention and are not limiting of the embodiments of the invention.
In the following description, suffixes such as "module", "component", or "unit" used to denote elements are used only for facilitating the description of the embodiments of the present invention, and have no peculiar meaning by themselves. Thus, "module", "component" or "unit" may be used mixedly. It should be noted that the terms "first", "second", and the like in the embodiments of the present invention are only used for distinguishing different parameters, devices, modules, or units, and are not used for limiting the order or interdependence of the functions performed by the parameters, devices, modules, or units.
In a distributed ASON system, when an optical fiber in the network fails, the first node of the affected service initiates restoration of the connection of the service. In the recovery process of service connection, the first node of each affected service is only responsible for the path calculation and resource determination of the node where the affected service is located, and connection is established according to the calculated path and resource. However, this approach may suffer from resource conflicts, resulting in connection establishment failures.
The embodiment of the invention provides a connection establishing method, which comprises the following steps: when the network is determined to have a fault, determining a target route of the affected service according to the route determination information, determining a mapping relation between each available resource in the network and a parameter in the first set, determining a first target parameter corresponding to the characteristic quantity in the first set according to the characteristic quantity of the first node of the affected service, determining a target available resource corresponding to the first target parameter in each available resource according to the mapping relation, and establishing connection for the affected service according to the target route and the target available resource. The connection establishing method can determine target available resources of the affected services in the available resources in the network from the mapping relation between the available resources in the network and the parameters in the first set according to the characteristic quantity of the first node of the affected services, and because the mapping relation determined by the first nodes of a plurality of affected services in the global is the same and the characteristic quantity of the first node of each affected service is globally unique, the target available resources determined by the characteristic quantity of the first node of the affected services based on the mapping relation are also related to the characteristic quantity of the first node of the affected services, namely, the global uniqueness of the determined target available resources is ensured to the greatest extent, so that resource conflict is avoided, and the success rate of connection establishment is improved.
Fig. 1 is a flowchart of a connection establishment method according to an embodiment. The embodiment is suitable for a scene that the first node of the affected service reestablishes the connection for the service after the network fails in the network with the distributed architecture. The present embodiment may be performed by a connection establishing means, which may be implemented in software and/or hardware, which may be integrated in the head node of the affected service. As shown in fig. 1, the connection establishing method provided in this embodiment includes the following steps:
step 101: and when the network is determined to have a fault, determining the target route of the affected service according to the route determination information.
In one embodiment, the route determination information is information associated with computing a route. Illustratively, the route determination information may include: failed link information, network topology, and routing algorithms.
In one embodiment, the failed link information may include: the identifier of the node corresponding to the failed link, the port identifier related to the affected service in the node corresponding to the failed link, and the like. Exemplarily, assuming that a link between a node a and a node B fails, and the a node is an upstream node and the B node is a downstream node, the failed link information may include: the identity of node a and the identity of the port in node a associated with the affected traffic. The downstream node in this embodiment receives data from the upstream node.
The network failure here may be a fiber break in the network. The affected service in this embodiment refers to a service that cannot be normally transmitted due to the failure of the network, which causes the failure of the original transmission path.
In one embodiment, the head node of the affected service refers to the source node that originated the affected service. The node in this embodiment refers to a network element node that can independently complete path calculation, connection establishment, and data transmission.
When the first node of the affected service transmits the affected service and a certain link fails to transmit, it can be determined that the network fails. The first node of the affected service may obtain the failed link information. The network topology may be preset in the first node of the affected service, acquired by the first node of the affected service, or sent to the first node of the affected service by other nodes. Then, the first node of the affected service can determine the target route of the affected service according to the fault link information, the network topology and the routing algorithm. The target route in this embodiment refers to a route that satisfies the routing policy and the user constraint and is determined again for the affected service after the network fails. Illustratively, the target route may be: node A-node B-node C-node D.
More specifically, components such as a Connection Controller (CC) and a Path Computation Element (PCE) and a Traffic Engineering Database (TED) are generally used in the ASON control plane to implement relevant important functions. Wherein the PCE is responsible for completing the computation of the entire call path. The CC is used as a requester of path calculation service and a controller of service establishment, and the establishment of the whole connection is completed by issuing label reservation and cross establishment at each node along the path according to the calculation result of the PCE. The TED generates a stable topology by collecting Traffic Engineering (TE) links generated by optical fiber connections between nodes and configured transmission ports, and TE links between nodes flooded in the network by an Open Shortest Path First inter Gateway Protocol (OSPF), and provides a network basis for routing computation to the PCE.
That is, the head node of the affected service includes: CC. PCE and TED. The specific implementation process of step 101 is as follows: when determining that a network fails, a CC in a first node of an affected service sends a path calculation request to a PCE in the first node of the affected service, wherein the path calculation request comprises failure link information; after receiving the route calculation request, a PCE in the first node of the influenced service acquires a network topology from a TED of the first node of the influenced service; and the PCE in the first node of the affected service determines the target route of the affected service according to the fault link information, the network topology and the routing algorithm.
Step 102: a mapping of the available resources in the network to the parameters in the first set is determined.
In an embodiment, the first node of the affected service may obtain each available resource in the current network, and then determine a mapping relationship between each available resource and the parameter in the first set. The available resources in the network here are available resources from end to end in the network.
Optionally, the target route in this embodiment may include the head node of the affected service and a plurality of downstream nodes of the head node of the affected service. Each available resource may be a sequence of multiple available sub-resources, each of which may correspond to a node on the target route. Examples of the inventionIllustratively, the target route includes three nodes of A node-B node-C node, wherein one available resource can be (lambda)a、λb、λc)，λaFor available sub-resources corresponding to node A, λbFor available sub-resources corresponding to B nodes, λcIs an available sub-resource corresponding to the C node.
In an embodiment, the first node of the affected service numbers each available resource in the network in a proper ordering manner, and identifies each available resource by using a globally unique key, and simultaneously ensures that the keys can be uniquely mapped to the parameters of the first set U. Illustratively, to improve processing efficiency, the first set U is a certain interval of consecutive positive integers, for example, U ═ (1,2,3,4,5, … …).
End-to-end on the target route refers from the head node of the affected traffic to the tail node of the affected traffic. Wherein, the tail node of the affected service refers to the destination node of the affected service.
In another embodiment, a first set is preset, and after each available resource is determined, a mapping relationship between each available resource and a parameter in the first set may be determined according to an identifier of the available resource.
For example, assume that each available resource is 5 wavelength resources, λ1、λ2、λ3、λ4And λ5And the first set is U ═ 1,2,3,4,5, where 1,2,3,4, and 5 are parameters in the first set, and the determined mapping relationship may be: lambda [ alpha ]1Corresponds to 1, lambda2Corresponds to 2, lambda3Corresponding to 3, lambda4Corresponds to 4 and lambda5Corresponding to 5.
It should be noted that the parameters in the first set may be various types of parameters such as numerical values, letters, matrices, or vectors, or combinations of various types of parameters, which is not limited in this embodiment.
If there are multiple first nodes of affected services globally, because the available resources in the current network are the same, the mapping relationships between the available resources determined by the first nodes of the affected services and the parameters in the first set are the same.
Step 103: and determining a first target parameter corresponding to the characteristic quantity in the first set according to the characteristic quantity of the first node of the influenced service.
In one embodiment, the feature quantity of the head node of the affected service refers to a quantity that can characterize the features and attributes of the head node of the affected service. The expression of the characteristic amount may be at least one of: numerical values, vectors or matrices, etc.
Optionally, the feature quantity of the head node of the affected service includes at least one of: the identifier of the first node of the affected service, the internal resource port address of the first node of the affected service and the serial number of the link port.
More specifically, the characteristic quantity of the first node of the affected service may be a combination of an identifier of the first node of the affected service, an internal resource port address of the first node of the affected service, and a link port number.
In this embodiment, the feature quantity of the head node of the affected service may be mapped to the first set through a suitable mapping function, and a first target parameter corresponding to the feature quantity in the first set is determined.
In an embodiment, the first target parameter corresponding to the feature quantity in the first set may be determined according to the feature quantity of the head node of the affected service and a hash function.
That is, the formula u ═ Hr (K) can be givenset) A first target parameter corresponding to the feature quantity in the first set is determined.
Wherein, KsetThe characteristic quantity of the first node of the affected service, which has the uniqueness of the whole network, may at least include a network node identifier, a number of all link ports, a combination of node internal resource port addresses, and the like. The Hr function is a suitable hash (hash) function. And U is obtained by calculation, belongs to U, wherein U is a first set, and U represents a first target parameter corresponding to the characteristic quantity in the first set.
Step 104: and determining the target available resource corresponding to the first target parameter in each available resource according to the mapping relation.
In an embodiment, after the first target parameter is determined, according to the mapping relationship determined in step 102, the available resource corresponding to the first target parameter in the mapping relationship is determined as the target available resource.
Based on the example in step 102, assuming that the determined first target parameter is 4, the target available resource is the wavelength resource λ4。
Alternatively, steps 101 to 104 may be performed by a PCE in the head node of the affected service.
Step 105: and establishing connection for the affected service according to the target route and the target available resource.
In an embodiment, after determining the target route and the target available resource, the first node of the affected service may reestablish the connection for the affected service according to the target route and the target available resource.
Since the target available resource in this embodiment is determined from the available resources in the network according to the feature quantity of the first node of the affected service and the mapping relationship in step 102, since the mapping relationships determined by the first nodes of the affected services in the global environment are the same, and the feature quantity of the first node of the affected service has the uniqueness across the network, the target available resource determined by using the feature quantity of the first node of the affected service based on the mapping relationship is also related to the feature quantity of the first node of the affected service, and the determined target available resource is guaranteed to have the uniqueness across the network as much as possible, thereby avoiding resource conflict when reestablishing connection for the affected service, and improving the success rate of connection establishment.
In an embodiment, based on the implementation manner of the target route in step 102, which may include the head node of the affected service and a plurality of downstream nodes of the head node of the affected service, correspondingly, the target available sub-resources may include a target available sub-resource corresponding to the head node of the affected service and a target available sub-resource corresponding to each downstream node. The implementation process of step 105 may specifically be: according to the target route, applying for corresponding target available sub-resources and corresponding cross configuration to nodes included in the target route hop by hop; when determining that both the target available sub-resource and the cross configuration are successfully applied, determining that the connection is successfully established; and when determining that any one of the target available sub-resources corresponding to the first node and the corresponding cross configuration fails to apply, determining that the connection establishment fails.
The cross configuration in this embodiment refers to cross configuration information between ports in a node. For example, configuration information between a receiving port and a transmitting port within a node.
The first node in this embodiment refers to a node that fails to apply for any of the target available sub-resources and the corresponding cross configurations. The first node may be the first node of the affected service or may be any downstream node.
In an embodiment, before applying for a corresponding target available sub-resource and a corresponding cross configuration to a node included in a target route hop by hop according to the target route, a PCE of a first node of an affected service sends the target route and the target available resource to a CC of the first node of the affected service, and the CC of the first node of the affected service receives the target route and the target available resource. And then, the CC of the first node of the affected service applies for corresponding target available sub-resources and corresponding cross configuration to the nodes included in the target route hop by hop according to the target route.
For example, assuming the target route includes three nodes, X node-Y node-Z node, the target available resource may be (λ)x、λy、λz)，λxFor the target available sub-resource corresponding to the X node, λyFor the target available sub-resource corresponding to the Y node, λzIs an available sub-resource corresponding to the Z node.
In one implementation, when establishing a connection, the CC of the first node of the affected service first applies for λ from the X nodexAnd cross configuration corresponding to the X node, and after the X node is successfully applied, the X node applies for lambda to the Y nodeyAnd cross configuration corresponding to the Y node, and after the Y node is successfully applied, the Y node applies lambda to the Z nodezAnd cross configuration corresponding to the Z node, and determining connection after the Z node is successfully appliedThe establishment is successful.
In another implementation, when connection is established, the CC of the first node of the affected service first applies for λ from the X nodexAnd cross configuration corresponding to the X node, and after the X node is successfully applied, the X node applies for lambda to the Y nodeyAnd the cross configuration corresponding to the Y node, assuming the lambda applied by the Y nodeyThe application fails, and the reason for the failure may be the λyAlready occupied by other nodes. In this implementation, the Y node is the first node.
After the connection establishment fails, the connection may be established again after the collision process, and the process of establishing connection again will be described in detail later.
The embodiment ensures that the same resource is avoided as much as possible even if routes calculated by different nodes pass through the same link, thereby avoiding resource conflict.
The following describes the implementation of the present embodiment with a specific example. Fig. 2 is a schematic diagram of a network topology. As shown in fig. 2, the network topology is composed of an a node, a B node, a C node, a D node, and an E node. At present, there are two services on the network topology, which are respectively:
service 1: the path is A-C, the original route is represented by a thick solid line, and the node A is the first node of the service 1;
service 2: the path is B-a-C-D, the original route is identified by a thin solid line, and the node B is the first node of service 2.
Now, when the link a-C is interrupted, the service 1 and the service 2 are both affected services, and connection recovery is initiated.
Step 1: and the CC on the node A and the node B respectively initiates a path calculation request to the PCE in the node according to the fault link information.
Step 2: the PCE of the node A uses a proper routing algorithm, network topology and fault link information to calculate a target route which meets a routing strategy and user constraints, and the target route is A-B-D-C and is shown by a thick dotted line in FIG. 2; the PCE of the node B uses the appropriate routing algorithm, network topology, and failed link information to compute a target route, B-D, that satisfies the computational routing policy and user constraints, as indicated by the thin dashed lines in fig. 2.
It should be noted that, after receiving the routing computation request, the PCE of the node in fig. 2 may obtain the network topology from the TED of the node.
And step 3: the PCE of the node A determines the mapping relation between each available resource in the network and the parameters in the first set; the PCE of the node B determines a mapping of the available resources in the network to the parameters in the first set.
And 4, step 4: the PCE of the node A uses the characteristic quantity of the node with the uniqueness of the whole network as a key word and uses a proper hash function Hr to determine a first target parameter of the characteristic quantity of the node A in a corresponding first set; the PCE of the node B uses the characteristic quantity of the node with the uniqueness of the whole network as a key and uses a proper hash function Hr to determine a first target parameter of the characteristic quantity of the node B in a corresponding first set.
And 5: the PCE of the node A determines that the end-to-end target available resource of the number a is the wavelength resource lambda according to the first target parametera(ii) a The PCE of the node B determines the end-to-end target available resource of the number B as the wavelength resource lambda according to the first target parameterb。
Step 6: PCE of the A node sends corresponding target route and wavelength resource lambdaaThe CC sent to the A node; PCE of node B sends corresponding target route and wavelength resource lambdabA CC sent to the node B.
And 7: the CC of the A node is according to the corresponding target route and the wavelength resource lambdaaConnection establishment is performed due to wavelength resource lambdaaIs not occupied, and therefore, the connection is established successfully; the CC of the node B according to the corresponding target route and the wavelength resource lambdabConnection establishment is performed due to wavelength resource lambdabAnd is not occupied, and therefore the connection establishment is successful.
The embodiment of the invention provides a connection establishing method, which comprises the following steps: when the network is determined to have a fault, determining a target route of the affected service according to the route determination information, determining a mapping relation between each available resource in the network and a parameter in the first set, determining a first target parameter corresponding to the characteristic quantity in the first set according to the characteristic quantity of the first node of the affected service, determining a target available resource corresponding to the first target parameter in each available resource according to the mapping relation, and establishing connection for the affected service according to the target route and the target available resource. The connection establishing method can determine target available resources of the affected services in the available resources in the network from the mapping relation between the available resources in the network and the parameters in the first set according to the characteristic quantity of the first node of the affected services, and because the mapping relation determined by the first nodes of a plurality of affected services in the global is the same and the characteristic quantity of the first node of each affected service is globally unique, the target available resources determined by the characteristic quantity of the first node of the affected services based on the mapping relation are also related to the characteristic quantity of the first node of the affected services, namely, the global uniqueness of the determined target available resources is ensured to the greatest extent, so that resource conflict is avoided, and the success rate of connection establishment is improved.
Fig. 3 is a flowchart of a connection establishment method according to another embodiment. The connection establishment method provided in this embodiment describes in detail the process of performing collision processing and re-establishing connection after the connection establishment fails in step 105 on the basis of the embodiment shown in fig. 1 and various optional implementation schemes. As shown in fig. 3, the connection establishing method provided in this embodiment includes the following steps:
step 301: and when the network is determined to have a fault, determining the target route of the affected service according to the route determination information.
Optionally, the route determination information includes: failed link information, network topology, and routing algorithms.
Step 302: a mapping of the available resources in the network to the parameters in the first set is determined.
Step 303: and determining a first target parameter corresponding to the characteristic quantity in the first set according to the characteristic quantity of the first node of the influenced service.
Step 304: and determining the target available resource corresponding to the first target parameter in each available resource according to the mapping relation.
The implementation processes and technical principles of step 301 and step 101, step 302 and step 102, step 303 and step 103, and step 304 and step 104 are similar and will not be described herein again.
Step 305: and according to the target route, applying for corresponding target available sub-resources and corresponding cross configuration to nodes included in the target route hop by hop.
The target route in this embodiment includes the head node of the affected service and a plurality of downstream nodes of the head node of the affected service. The target available resources comprise target available sub-resources corresponding to the head node of the affected service and target available sub-resources corresponding to each downstream node.
Step 306: and when the target available sub-resources and the cross configuration are determined to be applied successfully, determining that the connection is established successfully.
Step 307: and when determining that any one of the target available sub-resources corresponding to the first node and the corresponding cross configuration fails to apply, determining that the connection establishment fails.
In an embodiment, when determining that the connection establishment fails, the CC in the first node of the affected service sends a routing request to the PCE in the first node of the affected service again. The route calculation request includes information about a failed link, and also includes the number of attempts to establish a connection and the reason why the connection was established last time in failure. For example, the identity of the first node and the identity of the port in the first node associated with the affected traffic. The reasons for the last connection establishment failure may include: and the target available sub-resource application corresponding to the first node fails and/or the cross configuration application corresponding to the first node fails. The number of attempts to establish a connection refers to the number of attempts to restore the connection after the current affected service is interrupted. The way calculation request may further include other multiple items of critical failure information, which is not limited in this embodiment.
It should be noted that, because the link and resource states in the topology may change each time a routing request arrives, the PCE in the head node of the affected service acquires the network topology from the TED in the head node of the affected service after receiving the routing request each time.
Step 308: and when the reason for determining that the connection establishment fails is that the target available sub-resource application corresponding to the first node fails, determining a second target parameter corresponding to the characteristic quantity in the second set according to the characteristic quantity of the first node of the affected service.
In an embodiment, there is more than one reason for the connection establishment failure, and the embodiment may handle the resource conflict in the scenario that the reason for the connection establishment failure is the target available sub-resource application failure corresponding to the first node. Therefore, when it is determined that the reason for the connection establishment failure is that the target available sub-resource application corresponding to the first node fails, step 308 is executed to perform subsequent collision processing and reestablish the connection. The processing method can save network resources, and avoids the situation that subsequent conflict processing and connection reestablishment are carried out under the situation that the reason for the connection reestablishment failure is not the target available sub-resource application failure corresponding to the first node, but the network resources cannot be wasted due to successful establishment.
Optionally, based on the implementation manner in step 307, the PCE of the head node of the affected service receives the path computation request sent by the CC; and the PCE of the first node of the affected service determines whether the reason of the connection establishment failure is the target available sub-resource application failure corresponding to the first node according to the path calculation request.
And when the PCE of the first node of the affected service determines that the reason of the failure of the connection establishment is the failure of the application of the target available sub-resources corresponding to the first node, determining a second target parameter corresponding to the characteristic quantity in the second set according to the characteristic quantity of the first node of the affected service.
The implementation manner of the feature quantity of the first node of the affected service is shown in the embodiment and various optional manners shown in fig. 1, and is not described herein again.
In an embodiment, the second target parameter corresponding to the feature quantity in the second set may be determined according to the feature quantity of the head node of the affected service and a hash function.
I.e. can be according toFormula d ═ Ht (K)set) And determining a second target parameter corresponding to the characteristic quantity in the second set.
Wherein, KsetThe characteristic quantity of the first node of the affected service with the uniqueness of the whole network includes but is not limited to network node identification, all link port numbers, combination of node internal resource port addresses and the like. The Ht function is a suitable hash function. And D ∈ D obtained through calculation, wherein D is a second set, and D represents a second target parameter corresponding to the characteristic quantity in the second set.
The second set in this embodiment may be any set different from the first set.
More specifically, for computational convenience, the parameters in the second set may be positive integers.
Step 308 may be performed by the PCE of the head node of the affected traffic.
Step 309: and determining the delay time length according to the second target parameter and the number of attempts to establish the connection.
In one embodiment, a formula is used
Figure BDA0002551136700000081
Calculating the delay time length TdelayIn the formula
Figure BDA0002551136700000082
And the delay coefficient can be adjusted manually or automatically according to the network scale or other factors, t represents the number of attempts to establish the connection, and d represents a second target parameter corresponding to the characteristic quantity of the first node of the affected service in the second set.
Step 309 may be performed by the PCE of the head node of the affected traffic.
Step 310: and after the delay time, taking the fault link information corresponding to the first node as new fault link information, and returning to execute the step of determining the target route of the affected service according to the fault link information, the network topology and the routing algorithm.
In an embodiment, the start time of the first node of the affected service is TdelayWhen the timer is upAnd then, taking the fault link information corresponding to the first node as new fault link information, and returning to the step of determining the target route of the affected service according to the fault link information, the network topology and the routing algorithm in the step 301.
Thereafter, steps 302-305 are performed sequentially. If the target available sub-resources and the cross configuration are both applied successfully after the step 305 is executed, the step 306 is executed, and the connection is established successfully; if after step 305 is executed, when it is determined that any one of the target available sub-resources corresponding to the first node and the corresponding cross configuration fails to apply for, step 307 is executed. Then, after steps 308 to 310 are executed, the step of determining the target route of the affected service according to the route determination information in step 301 is returned to again be executed until the connection establishment is successful, or until the number of attempts to establish the connection reaches the threshold value, the establishment fails.
More specifically, step 310 may be a PCE execution of a head node of the affected traffic.
Since the faulty link information corresponding to the first node is used as new faulty link information when the step 301 is executed back, the execution is returned, so that in the process of executing the steps 301 to 304 again, the target route and the target available resource are determined again and are different from the previous time, and in the process of reconnection, the last resource which conflicts is avoided, and the connection is ensured to be established successfully.
In one embodiment, the second set D is a set of arithmetic progression with a tolerance greater than a predetermined threshold. I.e., D ═ D0,d0+δ,d0+2δ,d0+3 δ. For example, {10,20,30, }, where δ takes the value 10, d010. The second set is set as an arithmetic progression with a tolerance larger than a preset threshold value, so that a larger interval of delay time can be ensured in the retry process after failure, and different nodes can avoid simultaneous calculation and recovery as much as possible.
The processes of conflict processing and connection reestablishment in this embodiment ensure that, to the greatest extent, in the retry process after a failure, different nodes can avoid simultaneous route calculation recovery, so that resource changes can be updated to nodes that have not started calculation in time, thereby ensuring that used resources are not calculated any more, and avoiding the occurrence of conflicts.
The above process is described below in two specific examples.
Fig. 4 is another schematic diagram of a network topology. In the scene, after fibers of multiple services are broken, distributed service recovery is initiated, wherein resource conflict occurs in one recovery, and the delay recovery is successful after recalculation. As shown in fig. 4, the network topology is composed of an a node, a B node, a C node, a D node, and an E node. At present, there are two services on the network topology, which are respectively:
service 1: the path is A-C, the original route is represented by a thick solid line, and the node A is the first node of the service 1;
service 2: the path is B-a-C-D, the original route is identified by a thin solid line, and the node B is the first node of service 2.
Now, when the link a-C is interrupted, the service 1 and the service 2 are both affected services, and connection recovery is initiated.
Step 1: and the CC on the node A and the node B respectively initiates a path calculation request to the PCE in the node according to the fault link information.
Step 2: the PCE of the node A uses a proper routing algorithm, network topology and fault link information to calculate a target route which meets a routing strategy and user constraints, namely A-B-D-C, as shown by a thick dotted line in FIG. 4; the PCE of the node B uses the appropriate routing algorithm, network topology, and failed link information to compute a target route, B-D, that satisfies the computational routing policy and user constraints, as indicated by the thin dashed lines in fig. 4.
And step 3: the PCE of the node A determines the mapping relation between each available resource in the network and the parameters in the first set; the PCE of the node B determines a mapping of the available resources in the network to the parameters in the first set.
And 4, step 4: the PCE of the node A uses the characteristic quantity of the node with the uniqueness of the whole network as a key word and uses a proper hash function Hr to determine a first target parameter of the characteristic quantity of the node A in a corresponding first set; the PCE of the node B uses the characteristic quantity of the node with the uniqueness of the whole network as a key and uses a proper hash function Hr to determine a first target parameter of the characteristic quantity of the node B in a corresponding first set.
And 5: the PCE of the node A determines that the end-to-end target available resource of the number a is the wavelength resource lambda according to the first target parametera(ii) a The PCE of the node B also determines the end-to-end target available resource with the number a as the wavelength resource lambda according to the first target parametera。
Step 6: PCE of the A node sends corresponding target route and wavelength resource lambdaaThe CC sent to the A node; PCE of node B sends corresponding target route and wavelength resource lambdaaA CC sent to the node B.
Assuming that the connection establishment of the node a is successful, the node B fails to recover because the same wavelength resource as the point a service is used on the link B-D.
And 7: the service of the node B initiates a path computation request again to the PCE of the node B because the CC resource application of the node B fails, and the path computation request carries the reason of the last failure, where the path computation request includes, but is not limited to, 1 time of attempt time t for establishing a connection, a specific failed link, a failed resource, and the like.
And 8: and the PCE of the node B analyzes the path calculation request sent by the CC in the step, and when the path calculation request is analyzed to be the last resource failure, the characteristic quantity of the node with the network-wide uniqueness is used as a key word, and a proper hash function Ht is used for calculating a unique value D of a value range in a given set D, namely a second target parameter. Wherein the elements in set D are a set of equal-difference positive integers {10,20, 30. }, stepped by δ of 10, using the formula TdelayCalculating to obtain the delay time length Tdelay。
And step 9: the PCE starting time of the node B is TdelayWhen the timer is up, the failed link information corresponding to the first node (assumed to be node B) is used as new failed link information, the operation executed by the node B in the step 2 to the step 6 is returned to be executed, the target route B-E-D is calculated, the graph is represented by a chain line, and the target available resource is calculated as the wavelength resource lambdabReturning the result to the CC of the node BThe re-business is successful.
Fig. 5 is yet another schematic diagram of a network topology. In the scene, distributed service recovery is initiated after fibers of multiple services are broken, wherein resource conflict occurs in one recovery, and the service recovery is finally carried out after multiple recovery calculations. As shown in fig. 5, the network topology is composed of an a node, a B node, a C node, a D node, and an E node. At present, there are two services on the network topology, which are respectively:
service 1: the path is A-C, the original route is represented by a thick solid line, and the node A is the first node of the service 1;
service 2: the path is B-a-C-D, the original route is identified by a thin solid line, and the node B is the first node of service 2.
Now, when the link a-C is interrupted, the service 1 and the service 2 are both affected services, and connection recovery is initiated.
Step 1: and the CC on the node A and the node B respectively initiates a path calculation request to the PCE in the node according to the fault link information.
Step 2: the PCE of the node A uses a proper routing algorithm, network topology and fault link information to calculate a target route which meets a routing strategy and user constraints, namely A-B-D-C, as shown by a thick dotted line in FIG. 4; the PCE of the node B uses the appropriate routing algorithm, network topology, and failed link information to compute a target route, B-D, that satisfies the computational routing policy and user constraints, as indicated by the thin dashed lines in fig. 4.
And step 3: the PCE of the node A determines the mapping relation between each available resource in the network and the parameters in the first set; the PCE of the node B determines a mapping of the available resources in the network to the parameters in the first set.
And 4, step 4: the PCE of the node A uses the characteristic quantity of the node with the uniqueness of the whole network as a key word and uses a proper hash function Hr to determine a first target parameter of the characteristic quantity of the node A in a corresponding first set; the PCE of the node B uses the characteristic quantity of the node with the uniqueness of the whole network as a key and uses a proper hash function Hr to determine a first target parameter of the characteristic quantity of the node B in a corresponding first set.
And 5: a. theThe PCE of the node determines that the end-to-end target available resource of the number a is the wavelength resource lambda according to the first target parametera(ii) a The PCE of the node B also determines the end-to-end target available resource with the number a as the wavelength resource lambda according to the first target parametera。
Step 6: PCE of the A node sends corresponding target route and wavelength resource lambdaaThe CC sent to the A node; PCE of node B sends corresponding target route and wavelength resource lambdaaA CC sent to the node B.
Assuming that the connection establishment of the node a is successful, the node B fails to recover because the same wavelength resource as the point a service is used on the link B-D.
And 7: the service of the node B initiates a path computation request again to the PCE of the node B because the CC resource application of the node B fails, and the path computation request carries the reason of the last failure, where the path computation request includes, but is not limited to, 1 time of attempt time t for establishing a connection, a specific failed link, a failed resource, and the like.
And 8: and the PCE of the node B analyzes the path calculation request sent by the CC in the step, and when the path calculation request is analyzed to be the last resource failure, the characteristic quantity of the node with the network-wide uniqueness is used as a key word, and a proper hash function Ht is used for calculating a unique value D of a value range in a given set D, namely a second target parameter. Wherein the elements in set D are a set of equal-difference positive integers {10,20, 30. }, stepped by δ of 10, using the formula TdelayCalculating to obtain the delay time length Tdelay。
And step 9: the PCE starting time of the node B is TdelayWhen the timer is up, the failure link information corresponding to the first node (assumed to be node B) is used as new failure link information, the operation executed by the node B in the step 2 to the step 6 is returned to be executed, the target route B-E-D is calculated, and the target available resource is calculated to be the wavelength resource lambdabAnd returning the result to the CC of the node B, but the CC of the node B fails to recover the service, repeating the steps 7-9, and finally the node B calculates the target route B-A-E-D (shown by a chain line in the figure) and the target available resource as the wavelength resource lambdafTime, industryThe service is restored successfully.
It should be noted that, the PCEs of the nodes in fig. 4 and 5 need to acquire the network topology from the TED of the node each time the PCE receives the routing request.
The connection establishing method provided in this embodiment implements a feature resource and a feature delay path computation mode of a first node of each affected service in a distributed architecture, and since a globally unique feature value visible to this node is selected, and global uniqueness of a path computation result is ensured in both resource selection and delay path computation, a problem of resource conflict in a distributed path computation can be solved well. The determination process of the target available resources ensures that the same resources are avoided as much as possible even if routes calculated by different nodes pass through the same link; the process of conflict resolution and connection reestablishment furthest ensures that different nodes can avoid simultaneous route calculation recovery in the retry process after failure, so that the resource change can be timely updated to the node which does not start calculation, the used resource is guaranteed not to be calculated any more, and the occurrence of conflict is avoided.
Fig. 6 is a schematic structural diagram of a connection establishment apparatus according to an embodiment. As shown in fig. 6, the connection establishing apparatus provided in this embodiment includes the following modules: a first determination module 61, a second determination module 62, a third determination module 63, a fourth determination module 64, and a connection establishment module 65.
And the first determining module 61 is configured to determine a target route of the affected service according to the route determining information when the network is determined to be in failure.
Optionally, the route determination information includes: failed link information, network topology, and routing algorithms.
A second determining module 62 configured to determine a mapping relationship between each available resource in the network and the parameters in the first set.
And a third determining module 63 configured to determine, according to the feature quantity of the head node of the affected service, a first target parameter corresponding to the feature quantity in the first set.
Optionally, the third determining module 63 is specifically configured to: and determining a first target parameter corresponding to the characteristic quantity in the first set according to the characteristic quantity of the first node of the influenced service and the hash function.
Optionally, the feature quantity of the head node of the affected service includes at least one of: the identifier of the first node of the affected service, the internal resource port address of the first node of the affected service and the serial number of the link port.
And a fourth determining module 64 configured to determine, according to the mapping relationship, a target available resource corresponding to the first target parameter in each available resource.
A connection establishment module 65 configured to establish a connection for the affected service based on the target route and the target available resources.
Optionally, the target route includes a head node of the affected service and a plurality of downstream nodes of the head node of the affected service, and the target available resource includes a target available sub-resource corresponding to the head node of the affected service and a target available sub-resource corresponding to each downstream node.
The connection establishing module 65 is specifically configured to: according to the target route, applying for corresponding target available sub-resources and corresponding cross configuration to nodes included in the target route hop by hop; when determining that both the target available sub-resource and the cross configuration are successfully applied, determining that the connection is successfully established; and when determining that any one of the target available sub-resources corresponding to the first node and the corresponding cross configuration fails to apply, determining that the connection establishment fails.
Optionally, the head node of the affected service includes: CC. PCE and TED. The device also includes: a sending module, configured to send a path computation request to a PCE in a head node of an affected service when determining that a network fails or connection establishment fails, where the path computation request includes failure link information; and the acquisition module is configured to acquire the network topology from the TED of the first node of the affected service after the PCE in the first node of the affected service receives the route calculation request.
In terms of applying for the corresponding target available sub-resources and the corresponding cross configuration from the node included in the target route to the target route hop by hop, the connection establishing module 65 is specifically configured to: the PCE sends a target route and a target available resource to the CC; the CC receives a target route and target available resources; and the CC applies for corresponding target available sub-resources and corresponding cross configuration to nodes included in the target route hop by hop according to the target route.
The connection establishing apparatus provided in this embodiment is used to execute the connection establishing method according to any of the above embodiments, and the implementation principle and the technical effect of the connection establishing apparatus provided in this embodiment are similar, and are not described herein again.
Fig. 7 is a schematic structural diagram of a connection establishment apparatus according to another embodiment. The embodiment is based on the embodiment shown in fig. 6 and various alternatives, and a detailed description is given to other modules included in the connection establishment apparatus. As shown in fig. 7, the connection establishing apparatus provided in this embodiment further includes the following modules: a fifth determining module 71, a sixth determining module 72 and a return executing module 73.
A fifth determining module 71, configured to determine, when it is determined that the reason for the connection establishment failure is that the target available sub-resource application corresponding to the first node fails, a second target parameter corresponding to the feature quantity in the second set according to the feature quantity of the first node of the affected service.
A sixth determining module 72 configured to determine the delay period based on the second target parameter and the number of attempts to establish the connection.
And the return execution module 73 is configured to, after the delay time, take the faulty link information corresponding to the first node as new faulty link information, and return to execute the step of determining the target route of the affected service according to the faulty link information, the network topology and the routing algorithm.
Optionally, the second set is a set of arithmetic progression, and a tolerance of the arithmetic progression is greater than a preset threshold.
Optionally, in a scenario where the CC determines that the connection establishment fails and sends a path computation request to the PCE, the path computation request further includes the number of attempts to establish the connection and a reason of the last connection establishment failure, and the failure link information includes failure link information corresponding to the first node.
Optionally, the apparatus further comprises: the receiving module is configured to receive a path calculation request sent by the CC by the PCE; and the seventh determining module is configured to determine, by the PCE according to the routing request, whether the reason of the connection establishment failure is a target available sub-resource application failure corresponding to the first node.
The connection establishing apparatus provided in this embodiment is used to execute the connection establishing method according to any of the above embodiments, and the implementation principle and the technical effect of the connection establishing apparatus provided in this embodiment are similar, and are not described herein again.
Fig. 8 is a schematic structural diagram of a connection establishment apparatus according to an embodiment. As shown in fig. 8, the connection establishment apparatus includes a processor 81 and a memory 82; the number of the processors 81 in the connection establishment apparatus may be one or more, and one processor 81 is taken as an example in fig. 8; a processor 81 and a memory 82 in the connection establishment apparatus; the connection may be via a bus or other means, such as via a bus as illustrated in FIG. 8.
The memory 82 is a computer-readable storage medium, and can be used for storing software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the connection establishment method in the embodiment of the present application (for example, the first determination module 61, the second determination module 62, the third determination module 63, the fourth determination module 64, and the connection establishment module 65 in the connection establishment apparatus). The processor 81 implements the above-described connection establishment method by executing software programs, instructions, and modules stored in the memory 82, thereby various functional applications and data processing of the connection establishment apparatus.
The memory 82 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to the use of the connection establishment apparatus, and the like. Further, the memory 82 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device.
Embodiments of the present application also provide a storage medium containing computer-executable instructions, which when executed by a computer processor, perform a method for connection establishment, the method comprising:
when the network is determined to have a fault, determining a target route of the affected service according to the route determination information;
determining a mapping relation between each available resource in the network and the parameters in the first set;
determining a first target parameter corresponding to the characteristic quantity in the first set according to the characteristic quantity of the head node of the affected service;
determining a target available resource corresponding to the first target parameter in each available resource according to the mapping relation;
and establishing connection for the affected service according to the target route and the target available resource.
Of course, the storage medium provided by the present application contains computer-executable instructions, and the computer-executable instructions are not limited to the method operations described above, and may also perform related operations in the connection establishment method provided in any embodiment of the present application.
The above description is only exemplary embodiments of the present application, and is not intended to limit the scope of the present application.
In general, the various embodiments of the application may be implemented in hardware or special purpose circuits, software, logic or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software which may be executed by a controller, microprocessor or other computing device, although the application is not limited thereto.
One of ordinary skill in the art will appreciate that all or some of the steps of the methods, systems, functional modules/units in the devices disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof.
In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as is well known to those of ordinary skill in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by a computer. In addition, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media as known to those skilled in the art.
The preferred embodiments of the present invention have been described above with reference to the accompanying drawings, and are not intended to limit the scope of the embodiments of the invention. Any modifications, equivalents and improvements that may occur to those skilled in the art without departing from the scope and spirit of the embodiments of the present invention are intended to be within the scope of the claims of the embodiments of the present invention.

Claims (11)

1. A method for connection establishment, the method comprising the steps of:
when the network is determined to have a fault, determining a target route of the affected service according to the route determination information;
determining a mapping relation between each available resource in the network and the parameters in the first set;
determining a first target parameter corresponding to the characteristic quantity in the first set according to the characteristic quantity of the head node of the affected service;
determining a target available resource corresponding to the first target parameter in each available resource according to the mapping relation;
and establishing connection for the affected service according to the target route and the target available resource.
2. The method of claim 1, wherein the target route comprises a head node of the affected service and a plurality of downstream nodes of the head node of the affected service, and wherein the target available resources comprise a target available sub-resource corresponding to the head node of the affected service and a target available sub-resource corresponding to each of the downstream nodes;
the establishing connection for the affected service according to the target route and the target available resource includes:
according to the target route, applying for corresponding target available sub-resources and corresponding cross configuration from nodes included in the target route hop by hop;
when determining that the target available sub-resource and the cross configuration are both applied successfully, determining that the connection is established successfully;
and when determining that any one of the target available sub-resources corresponding to the first node and the corresponding cross configuration fails to apply, determining that the connection establishment fails.
3. The method of claim 2, wherein the routing determination information comprises: fault link information, network topology and routing algorithms;
when determining that any one of the target available sub-resources corresponding to the first node and the corresponding cross configuration fails to apply for, after determining that the connection establishment fails, the method further includes:
when the reason for the connection establishment failure is determined to be that the target available sub-resource application corresponding to the first node fails, determining a second target parameter corresponding to the characteristic quantity in a second set according to the characteristic quantity of the first node of the affected service;
determining a delay time length according to the second target parameter and the number of attempts to establish the connection;
and after the delay time, taking the fault link information corresponding to the first node as new fault link information, and returning to execute the step of determining the target route of the affected service according to the route determination information.
4. The method of claim 3, wherein the second set is a set of arithmetic series, and wherein a tolerance of the arithmetic series is greater than a predetermined threshold.
5. The method according to any of claims 3 or 4, wherein the head node of the affected service comprises: the method comprises the following steps of connecting a controller CC, a path computation element PCE and a traffic engineering database TED;
the method further comprises the following steps:
when determining that a network fails or connection establishment fails, a CC in a first node of an affected service sends a routing calculation request to a PCE in the first node of the affected service; wherein the routing request includes the failed link information;
and after receiving the route calculation request, a PCE in the first node of the influenced service acquires the network topology from the TED of the first node of the influenced service.
6. The method of claim 5, wherein the CC sends the routing request to the PCE in a scenario where it is determined that the connection establishment fails, wherein the routing request further includes a number of attempts to establish a connection and a reason for a last connection establishment failure, and wherein the failed link information includes failed link information corresponding to the first node.
7. The method according to claim 6, wherein before determining the corresponding second target parameter of the feature quantity in the second set according to the feature quantity of the head node of the affected service, the method further comprises:
the PCE receives a path calculation request sent by the CC;
and the PCE determines whether the reason of the connection establishment failure is the failure of the target available sub-resource application corresponding to the first node or not according to the path calculation request.
8. The method according to any one of claims 1 to 4, wherein determining, according to the feature quantity of the head node of the affected service, a first target parameter corresponding to the feature quantity in the first set comprises:
and determining a first target parameter corresponding to the characteristic quantity in the first set according to the characteristic quantity of the head node of the influenced service and a hash function.
9. The method according to any of claims 1 to 4, wherein the characteristic quantity of the head node of the affected service comprises at least one of: the identifier of the first node of the affected service, the internal resource port address of the first node of the affected service and the serial number of the link port.
10. A connection establishing apparatus, characterized in that the apparatus comprises a memory, a processor, a program stored on the memory and executable on the processor, and a data bus for enabling connection communication between the processor and the memory, the program, when executed by the processor, implementing the steps of the connection establishing method according to any one of claims 1 to 9.
11. A storage medium for computer-readable storage, characterized in that the storage medium stores one or more programs which are executable by one or more processors to implement the steps of the connection establishment method of any one of claims 1 to 9.
CN202010576346.1A 2020-06-22 2020-06-22 Connection establishing method, device and storage medium Pending CN113905291A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010576346.1A CN113905291A (en) 2020-06-22 2020-06-22 Connection establishing method, device and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010576346.1A CN113905291A (en) 2020-06-22 2020-06-22 Connection establishing method, device and storage medium

Publications (1)

Publication Number Publication Date
CN113905291A true CN113905291A (en) 2022-01-07

Family

ID=79186569

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010576346.1A Pending CN113905291A (en) 2020-06-22 2020-06-22 Connection establishing method, device and storage medium

Country Status (1)

Country Link
CN (1) CN113905291A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023137664A1 (en) * 2022-01-20 2023-07-27 Qualcomm Incorporated Parameter selection for connection establishment failure control

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023137664A1 (en) * 2022-01-20 2023-07-27 Qualcomm Incorporated Parameter selection for connection establishment failure control

Similar Documents

Publication Publication Date Title
US11082262B2 (en) Flow entry generating method and apparatus
US10516478B2 (en) Controller based path estimation and path provisioning using optical impairment data
US8619553B2 (en) Methods and systems for mesh restoration based on associated hop designated transit lists
US8675493B2 (en) Routing bandwidth guaranteed paths with local restoration in label switched networks
EP0859491B1 (en) Method for rerouting in hierarchically structured networks
EP1395003B1 (en) Constraint-based shortest path first method for dynamically switched optical transport networks
US7616581B2 (en) Path setup unit, path setup system and path setup method therefor
EP2627043B1 (en) Method, device and system for lossless bandwidth adjustment
JP5596149B2 (en) Method for improving service restoration speed and path calculation element in transmission network
EP3384640B1 (en) Communication among network controllers
US9559947B2 (en) Recovery in connection-oriented network
WO2014081766A1 (en) Bandwidth on-demand services in multiple layer networks
EP2685685A1 (en) Method and related apparatus for establishing link-diverse traffic paths in a telecommunications network
US7366112B2 (en) Communication network control system, control method, node and program
CN106664214B (en) Fault recovery method and device for virtual network
JPH10190686A (en) Setting system for active and standby route of atm network
JP4547314B2 (en) Failure recovery method, management node and communication node
EP1921797B1 (en) Recovery method and apparatus for optical network lsp occuring abnormal delete
US6421316B1 (en) Point-to-multipoint connection restoration
WO2012071909A1 (en) Method and device for service recovery
EP3099010B1 (en) Network path computation method, apparatus and system
CN113905291A (en) Connection establishing method, device and storage medium
CN108781183B (en) Method, node equipment and system for establishing service path
CN109644122B (en) Resource sharing method, network node and related equipment
CN106464524B (en) Route calculation method and device of ASON

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination