WO2011026350A1 - 多业务恢复的选路装置及选路方法 - Google Patents

多业务恢复的选路装置及选路方法 Download PDF

Info

Publication number
WO2011026350A1
WO2011026350A1 PCT/CN2010/073082 CN2010073082W WO2011026350A1 WO 2011026350 A1 WO2011026350 A1 WO 2011026350A1 CN 2010073082 W CN2010073082 W CN 2010073082W WO 2011026350 A1 WO2011026350 A1 WO 2011026350A1
Authority
WO
WIPO (PCT)
Prior art keywords
route
service
path
calculation unit
recovery
Prior art date
Application number
PCT/CN2010/073082
Other languages
English (en)
French (fr)
Inventor
王家昱
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Priority to ES10813272.1T priority Critical patent/ES2689469T3/es
Priority to EP10813272.1A priority patent/EP2464036B1/en
Priority to KR1020127008553A priority patent/KR101343529B1/ko
Priority to US13/394,154 priority patent/US9036989B2/en
Publication of WO2011026350A1 publication Critical patent/WO2011026350A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J14/00—Optical multiplex systems
    • H04J14/02—Wavelength-division multiplex systems
    • H04J14/0227—Operation, administration, maintenance or provisioning [OAMP] of WDM networks, e.g. media access, routing or wavelength allocation
    • H04J14/0254—Optical medium access
    • H04J14/0256—Optical medium access at the optical channel layer
    • H04J14/0257—Wavelength assignment algorithms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J14/00—Optical multiplex systems
    • H04J14/02—Wavelength-division multiplex systems
    • H04J14/0227—Operation, administration, maintenance or provisioning [OAMP] of WDM networks, e.g. media access, routing or wavelength allocation
    • H04J14/0254—Optical medium access
    • H04J14/0267—Optical signaling or routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J14/00—Optical multiplex systems
    • H04J14/02—Wavelength-division multiplex systems
    • H04J14/0227—Operation, administration, maintenance or provisioning [OAMP] of WDM networks, e.g. media access, routing or wavelength allocation
    • H04J14/0254—Optical medium access
    • H04J14/0267—Optical signaling or routing
    • H04J14/0268—Restoration of optical paths, e.g. p-cycles
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/22—Alternate routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/62—Wavelength based
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery

Definitions

  • the present invention relates to the field of communications technologies, and in particular, to a routing device and a routing method for multi-service recovery. Background technique
  • ASON Automatic Switched Optical Network
  • the Path Computation Element (PCE) in ASON makes the path calculation function independent from the network device, that is, by deploying a separate path calculation unit in the network to solve multi-protocol label switching/general multi-protocol label switching (MPLS/ GMPLS)
  • MPLS/ GMPLS multi-protocol label switching/general multi-protocol label switching
  • a large number of links in a network are subject to special resource problems required for constrained path computation. Since the routing calculation and path resource selection currently required for each faulty service that needs to resume rerouting is required, the path computation unit needs to calculate one by one. Especially when a large number of services request fault recovery route calculation at the same time, the path calculation unit may not be able to respond to the request in time to delay the service recovery due to being too busy. Summary of the invention
  • the present invention is directed to a routing device and a routing method for multi-service recovery, which are used to solve the problem that the path calculation unit existing in the prior art is too busy to respond to requests in time to delay service recovery. .
  • the object of the present invention is mainly achieved by the following technical solutions:
  • the present invention provides a routing device for multi-service recovery, the device comprising: a path calculation unit and a service path merging unit, wherein
  • the path calculation unit is configured to forward the received unified route calculation notification message that includes multiple service fault connection information to the service path merging unit; during the service fault query, the path calculation unit is further configured to: The routing query request sent by the faulty service head node is forwarded to the service path merging unit;
  • the service path merging unit is configured to receive a unified route calculation notification message forwarded by the path calculation unit, and perform service fault connection information according to the service merging and route query statistic algorithm, and uniformly obtain recovery route information from the path calculation unit. Recording; when receiving the route query request forwarded by the path calculation unit, searching for the record according to the route query request, and returning the found corresponding recovery route information to the first node requesting recovery through the path calculation unit.
  • the device further includes: a service fault reporting unit, configured in the node of the automatic switching optical network, configured to determine whether the number of service faulty connections is greater than when a multiplexing alarm is generated on the transmission port that retrieves the local node
  • the threshold value is predetermined, and when it is determined that the number of service faulty connections is greater than a predetermined threshold, a unified route calculation notification message including a plurality of faulty connection information is sent to the path calculation unit.
  • the path calculation unit specifically includes: a message forwarding module, a route query request forwarding module, and a recovery routing information forwarding module, where
  • the message forwarding module is configured to forward the received unified route calculation notification message that includes multiple faulty connection information to the service path merging unit, and set the path calculation state of the path calculation unit to a service fault. Query status
  • the route query request forwarding module is configured to receive a route query request sent by a faulty service head node, and determine a path calculation state of the current path calculation unit itself, and if the service fault is a route query state, report the first node Routing query request forwarded to the service path The path merge unit; otherwise, the path calculation unit is triggered to directly calculate corresponding recovery route information according to the received route query request;
  • the routing information forwarding module is configured to forward, by the service path merging unit, the restored routing information that is found according to the routing query request to the first node that requests recovery.
  • the service path merging unit specifically includes: a storage module, a route recovery module, and a query module, where
  • the storage module is configured to separate all the service fault connection information in the unified route calculation notification message one by one, and store the source and sink nodes of the service fault connection as key values in the hash table structure;
  • the route recovery module is configured to sequentially extract key values from the hash table, and perform the following processing on each key value separately:
  • the query module is configured to search the hash table structure according to the route query request forwarded by the path calculation unit, and calculate the recovery route information corresponding to the service fault connection through the path when the corresponding service fault connection is found.
  • the unit feeds back to the corresponding head node.
  • the storage module is specifically configured to: detach all service fault connection information in the unified route calculation notification message one by one, and perform service faults of the routing policy attribute and the weak routing policy attribute according to the routing policy attribute in the fault connection information.
  • the connected source and sink nodes are stored as key values in the hash table structure.
  • route recovery module is specifically configured to take the source and sink nodes connected by the service fault as key values, sequentially extract the key values from the hash table, and perform the following processing on each key value separately:
  • the query module is specifically configured to: according to the route query request forwarded by the path calculation unit, look up a hash table structure, and return a corresponding recovery route information to the path calculation unit when finding a corresponding service fault connection. .
  • the invention also provides a routing method for multi-service recovery, the method comprising:
  • the path calculation unit forwards the unified route calculation notification message that is sent by the service fault reporting unit and includes multiple service fault connection information to the service path merging unit.
  • the service path merging unit receives a unified route calculation notification message that includes multiple faulty connection information, and sorts the service fault connection information according to the service merging and the route query statistic algorithm, and uniformly obtains the restored routing information from the path calculation unit. And record;
  • the path calculation unit forwards the route query request sent by the fault service head node to the service path merge unit, and the service path merge unit searches for the record according to the route query request, and searches for The corresponding recovery routing information to be returned is fed back to the first node requesting recovery by the path calculation unit.
  • step A specifically includes:
  • the corresponding node of the faulty link determines whether the number of service faulty connections is greater than a predetermined threshold, and performs A2 when it is determined to be greater than a predetermined threshold;
  • A2 Send a unified route calculation notification message including all faulty connection information to the path calculation unit; A3.
  • the path calculation unit forwards the unified route calculation notification message to the service path merging unit, and sets its own path calculation status to a service fault query status.
  • step B specifically includes:
  • the service path merging unit separates all service fault connections in the unified route calculation notification message one by one, and stores the source and sink nodes of the service fault connection as key values in the hash table structure;
  • the key values are sequentially taken out from the hash table, and each key value is processed as follows:
  • the route calculation unit searches the route and asks the path calculation unit to return a route containing all available wavelengths, and assigns each service The wavelength occupied by the faulty connection, and the route is sequentially filled in the recovery route record field of each hash connection in the hash table.
  • the B1 specifically includes:
  • the service path merging unit separates all the service fault connection information in the unified route calculation notification message one by one, and connects the source and sink nodes of the service faultless connection attribute attribute and the weak route policy attribute according to the routing policy attribute in the fault connection information. Stored as a key value in the hash table structure.
  • the B2 specifically includes:
  • the key values are sequentially taken from the hash table, and each key value is processed as follows:
  • the route calculation unit searches the route and asks the path calculation unit to return a route containing all available wavelengths;
  • the route returned by the path calculation unit it is determined whether the number of available wavelengths on the route is greater than or equal to the number of service fault connections under the key value. If yes, the route and wavelength assignment analysis is performed, and the route is faulted according to the service. The priority order of the connection is filled in each service fault connection in the recovery route record field of the hash table, and the unused wavelength is fed back to the path calculation unit; otherwise, the route is continuously queried to the path calculation unit and the path calculation unit is required to return another A route containing all available wavelengths until the number of available wavelengths on the route is greater than the industry under the key value The number of failed connections, or no route.
  • step C specifically includes:
  • the route query request reported by the first node is forwarded to the service path merge unit, and executed. C2; Otherwise, the route recovery request is directly performed on the received route query request;
  • the service path merging unit searches for a corresponding service fault connection according to the route query request, and feeds back the recovered routing information of the service fault connection to the first node requesting recovery through the path calculation unit.
  • the present invention achieves the goal of reducing the resource consumption of the path computation unit and improving the recovery efficiency of the link failure by merging all the services that can use the same path and then performing the route calculation on them.
  • FIG. 1 is a schematic diagram of an application scenario of a routing device according to an embodiment of the present invention.
  • FIG. 2 is a schematic structural diagram of a routing device according to an embodiment of the present invention.
  • FIG. 3 is a schematic flowchart of a routing method according to an embodiment of the present invention.
  • FIG. 4 is a schematic diagram of a network topology structure with 11 nodes according to an embodiment of the present invention. detailed description
  • the object of the present invention is to simultaneously fail a large number of services and to perform recovery rerouting At the same time, the method of merging all the services that can use the same path and then performing route calculation on them uniformly reduces the resource consumption of the path calculation unit and improves the recovery efficiency of the link failure.
  • FIG. 1 is a schematic diagram of an application scenario of a routing device according to an embodiment of the present invention.
  • an automatic optical switching network multiplex section When an automatic optical switching network multiplex section generates an alarm, the faulty node of the service link collects the number of service fault connections.
  • notifying the routing device of the unified routing calculation notification message that includes multiple service fault connections, and notifying the fault condition to the first node of the service fault connection through the signaling protocol, and determining, by the first node, to initiate the restoration routing request;
  • the merging and routing query processing is performed according to the unified routing calculation notification message, and the obtained recovery routing information is fed back to the first node when the first node initiates the recovery routing request.
  • FIG. 2 is a schematic structural diagram of a routing device according to an embodiment of the present invention, including: a service fault reporting unit, a path calculation unit, and a service path merging unit, where the path calculation unit specifically includes: a message forwarding module, The route query request forwarding module and the recovery route information forwarding module; the service path merging unit specifically includes: a storage module, a route recovery module, and a query module.
  • the path calculation unit specifically includes: a message forwarding module, The route query request forwarding module and the recovery route information forwarding module
  • the service path merging unit specifically includes: a storage module, a route recovery module, and a query module.
  • the service fault reporting unit is set in the node of the automatic switching optical network.
  • the corresponding node of the faulty link retrieves the service fault connection existing on the faulty port, and determines Whether the number of service faulty connections is greater than a predetermined threshold, and when determining that the number of service faulty connections is greater than a predetermined threshold, transmitting a unified route calculation notification message including multiple faulty connection information to the path computation unit.
  • the predetermined threshold is usually based on the road
  • the maximum load capacity of the path calculation unit is determined to ensure a reasonable workload of the path calculation unit.
  • the path calculation unit is mainly responsible for forwarding the message, for example, forwarding the received unified route calculation notification message including multiple service fault connection information to the service path merging unit; during the service fault query, The path calculation unit is further configured to forward the routing query request sent by the faulty service head node to the service path merging unit; and further, is responsible for performing the restoration route calculation according to the route query request, and recovering the route calculation function, which has a mature solution in the prior art. Details are no longer detailed at J3 ⁇ 4.
  • the path calculation unit may include: a message forwarding module, a route query request forwarding module, and a recovery routing information forwarding module, where
  • the message forwarding module When the message forwarding module receives the unified route calculation notification message that includes multiple faulty connection information from the service fault reporting unit of the faulty link peer node, the message forwarding module forwards the unified route calculation notification message to the service path merging unit, and calculates the path at the same time.
  • the path calculation state of the unit itself is set to the service fault inquiry state;
  • the route query request forwarding module receives the route query request, and determines the path calculation state of the current path calculation unit itself, if the path calculation state of the path calculation unit itself is a service fault.
  • the route query status is forwarded to the service path merging unit by the routing query request reported by the faulty service head node; otherwise, when the path calculation state of the path calculation unit itself is the non-service fault route query state, the path calculation unit is triggered.
  • the received route query request directly performs the route recovery calculation and feeds back the calculated recovery route information to the first node that requests the recovery, and does not forward the information;
  • the route information forwarding module forwards the recovery route information found by the service path merging unit according to the route query request to the first node that requests the recovery.
  • the service path merging unit is mainly responsible for two aspects, and receives, on the one hand, a unified route calculation notification message that is forwarded by the path calculation unit and includes multiple faulty connection information, After all the faulty connections are merged and routed, the routing information is obtained from the path calculation unit and recorded. On the other hand, when receiving the route query request forwarded by the path calculation unit, it is responsible for finding the record according to the route query request. And returning the found corresponding recovery routing information to the first node requesting recovery through the path calculation unit.
  • the service path merging unit may specifically include: a storage module, a route recovery module, and a query module, where
  • the storage module receives the unified route calculation notification message that is sent by the path calculation unit and includes multiple faulty connection information, and separates all service faulty connections in the unified route calculation notification message one by one, and connects the source and sink nodes of the service fault connection. Stored as a key value in the hash table structure;
  • the route recovery module takes the key values from the hash table in turn, and processes each key value as follows:
  • the route recovery module queries the path calculation unit for routing and requires the path calculation unit to return a route containing all available wavelengths; then, according to the route returned by the path calculation unit, it is determined whether the number of available wavelengths on the route is If the number of service faults is greater than or equal to the critical value, if yes, perform RWA (Routing and Wavelength Assignment) analysis to assign the wavelength occupied by each service faulty connection, and prioritize the route according to the service fault.
  • RWA Rasteret Transfer and Wavelength Assignment
  • the order is filled in each service fault connection in the recovery route record field of the hash table, and the unused wavelength is fed back to the path calculation unit to release the resource; otherwise, the route is continuously queried to the path calculation unit and the path calculation unit is required to return another Routing of all available wavelengths, until The number of wavelengths available on the route is larger than the critical service faults in the number of connections value, or until there is no route.
  • the query module searches for a hash table according to the route query request forwarded by the path calculation unit And when the corresponding service fault connection is found, the recovery routing information corresponding to the service fault connection is fed back to the corresponding first node by the path calculation unit; specifically, the query module forwards according to the path calculation unit.
  • the routing query request finds the hash table structure. If the corresponding service fault connection is found, it is determined whether the service fault connection has calculated the recovery routing information. If yes, the corresponding recovery routing information is returned to the path calculation unit, otherwise the waiting is entered. Status, until the recovery of the routing information is calculated or the recovery route calculation fails or the recovery route calculation timeout expires; if the corresponding service failure connection is not found, the path calculation unit is directly notified to perform the route recovery calculation.
  • FIG. 3 is a schematic flowchart of a method for selecting a multi-service recovery according to an embodiment of the present invention, including but not limited to the following steps:
  • Step 301 When a link fails, the corresponding end node of the link detects that the transmission port has a multiplex section alarm generated;
  • Step 302 The service fault reporting unit of the node retrieves all service fault connections existing on the transmission port corresponding to the fault;
  • Step 303 Determine whether the number of service faulty connections is greater than a predetermined threshold. If yes, go to step 304, otherwise, according to the original alarm processing flow, notify the service faulty connection node of the service faulty connection node, and the service fault first node to the path
  • the computing unit initiates a route recovery calculation request;
  • the predetermined threshold is generally determined according to a maximum load capacity of the path calculation unit to ensure a reasonable workload of the path calculation unit;
  • Step 304 The service fault reporting unit of the node sends a unified route calculation notification message including all service fault connection information to the path calculation unit of the domain where the node is located;
  • Step 305 The path calculation unit forwards the unified route calculation notification message to the service path merging unit for processing, and sets its own path calculation state to the multi-service fault route query state.
  • Step 306 The service path merging unit performs the service merging and routing query. The statistical algorithm performs merging and routing query processing on all faulty connection information, and obtains recovery routing information from the path calculation unit and records it;
  • Step 307 When the path calculation unit is in the multi-service fault route query state, forward the route query request reported by the first node of each service fault to the service path merging unit;
  • the path calculation unit processes the result as normal, and returns the calculation result to the service path merging unit; the path calculation unit connects the first node of each service failure when the non-service fault route query state is in the state Reporting the incoming route query request, and performing normal route recovery calculation processing;
  • Step 308 When the first node of the service fault connection starts to apply for the restoration path calculation, the route query request is forwarded to the service path merging unit by the path calculation unit, and the service path merging unit receives the route query request forwarded by the path calculation unit, according to The stored record finds a service fault connection corresponding to the route query request;
  • Step 309 The service path merging unit determines whether the corresponding service fault connection is found. If yes, step 310 is performed; otherwise, step 313 is performed;
  • Step 310 The service path merging unit determines whether the service fault connection has calculated the recovery route information, and if so, step 311 is performed, otherwise step 312 is performed;
  • Step 311 Return the recovery routing information corresponding to the service fault connection, and end the process.
  • Step 312 Set the timeout timer and enter the waiting state until the calculation of the restoration routing information or the route recovery calculation failure or the timer expires. Exit any one of the situations and end the process;
  • Step 313 The corresponding service fault connection cannot be found, and the path calculation unit is notified to calculate the recovery routing information and return it to the first node of the corresponding request query route. And, after processing all the faulty service connections in the unified route calculation notification message, the service path merging unit notifies the path calculation unit to switch the path calculation state of the path calculation unit itself from the service fault route query state to the non-service fault route. Query status.
  • the service path merging unit performs merging and processing all the faulty connection information according to the service merging and the routing query statistic algorithm, and the steps of uniformly obtaining the routing information from the path calculating unit and recording the steps include:
  • the service path merging unit processes the received unified route calculation notification message that includes multiple faulty connection information, and separates the faulty connection information carried in the unified route calculation notification message one by one, for the non-routing policy requirement attribute and the weak routing policy requirement.
  • the service fault connection of the attribute is stored in a fault service hash table, and the key value is the service source sink node ID (ie, the source node ID and the destination node ID); the service fault connection for the strong routing policy attribute is excluded, and subsequently
  • the path calculation unit directly calculates the restored routing information and feeds back to the first node, and no forwarding processing is performed.
  • each key value is processed as follows:
  • the service path merging unit queries the path calculation unit for the route based on the source and sink node IDs, and requests a route containing all available wavelengths returned by the path calculation unit.
  • the service path merging unit analyzes the available route returned by the path calculation unit, and determines whether the number of available wavelengths on the route is greater than or equal to the number of faulty services under the key value in the hash table. If yes, the RWA analysis is performed to assign the occupied wavelength, and the route is filled into the recovery route record field of each hash connection in the hash table according to the priority order of the service fault connection, and the unused wavelength feedback is used.
  • FIG. 4 is a schematic diagram of a network topology having 11 nodes (node 1 to node 11), and each link has 5 available wavelength resources, namely ⁇ 1, ⁇ 2, and ⁇ 3 . , ⁇ 4, and ⁇ 5 .
  • the network topology has the following services:
  • Service 1 the route is node 1-node 2-node 3-node 4-node 5, occupying wavelength ⁇ ⁇ ; service 2, routing is node 1-node 2-node 3-node 4-node 5, occupying wavelength ⁇ 2 ; Service 3, route is node 1-node 2-node 3-node 4-node 5, occupying wavelength ⁇ 3 ; service 4, route is node 2-node 3-node 4, occupying wavelength ⁇ 4
  • Service 5 the route is node 2-node 3-node 4-node 5, occupying wavelength ⁇ 5 ; service 6, routing is node 1-node 9-node 10-node 11-node 5, occupying wavelength ⁇ 3 ; The route is node 2 - node 6 - node 7 - node 8 - node 4, occupying wavelength ⁇ 2 ; service 8, routing is node 2 - node 6 - node 7 - node 8 - node 4, occupying wavelength ⁇ 4 ; The route is node 2 - node 6 - node 7 - node 8 - node 4, occupying wavelength ⁇ 5 . It is assumed that the fiber between the node 3 and the node 4 is faulty. When the node 4 detects that there is a light alarm on the transmission port, the node 4 searches for the faulty service connection.
  • the affected services are service 1, service 2, service 3, and service 4. Business 5.
  • Step a Node 4 carries the above five service fault connection information in the unified route calculation notification message and reports it to the path calculation unit;
  • Step b The path calculation unit forwards the foregoing unified route calculation notification message to the service path merging unit, and sets the self path calculation state to the service fault route query state;
  • Step c The service path merging unit sorts the service fault connection information according to the service merging and route query statistic algorithm, and stores the source and sink nodes of the service fault connection as key values in the hash table structure, as shown in Table 1. .
  • Table 1. Business merging and routing query statistics algorithm Hash table record 1: Source 1 sink 5 Record 2: Source 2 sink 4 Record 3: Source 2 sink 5
  • Connection ID 1 Connection ID: 4 Connection ID: 5
  • Step d Take the records 1, record 2, and record 3 sequentially from the hash table, and process each record as follows:
  • the path calculation unit Taking the record from the hash table 1 Query the route to the path calculation unit, and the path calculation unit returns an available route: Node 1 - Node 9 - Node 10 - Node 11 - Node 5, with ⁇ 1, ⁇ 2, ⁇ 4, ⁇ 5
  • the four wavelengths are available. Determine whether the number of available wavelengths on the available route is greater than or equal to the number of service fault connections under the key value in the hash table.
  • the available wavelength number 4> the number of service fault connections 3 is allocated through the RWA process.
  • the path calculation unit returns an available route: Node 2 - Node 6 - Node 7 - Node 8 - Node 4, with ⁇ 1 and ⁇ 3
  • the wavelength is available. Determine whether the number of available wavelengths on the available route is greater than or equal to the number of service fault connections under the key value in the hash table (available wavelength number 2 > service fault connection number 1), and assign it to the service fault through the RWA process.
  • Connection 4 restores the connection ⁇ 1 wavelength while releasing ⁇ 3 The wavelength is fed back to the path computation unit to release the resources.
  • the path calculation unit returns an available route: Node 2 - Node 6 - Node 7 - Node 8 - Node - Node 5, with ⁇ 3
  • Step e When the node 1 starts to apply for the restoration path calculation for the service 1, the path calculation unit forwards the route query request to the service path merging unit, and the service path merging unit finds the ID 1 according to the path query request to the table 2 Connect, and restore the connection of this connection, that is, the route with ID 1: 1->9->10->11->5, and the recovery wavelength ⁇ ⁇ is fed back to node 1 through the path calculation unit.
  • the route calculation unit forwards the route query request to the service path merging unit, and the service path merging unit finds the connection with the ID 2 according to the route query request to the table 2, and Restore the connection to this connection, ie ID
  • the route of 1 is: 1->9->10->11->5, and the recovery wavelength ⁇ 2 is fed back to the node 1 through the path calculation unit.
  • the route calculation unit forwards the route query request to the service path merging unit, and the service path merging unit finds the connection with the ID 3 in the table 2 according to the route query request, and The recovery route of this connection, that is, the route with ID 1: 1->9->10->11->5, and the recovery wavelength ⁇ 4 are fed back to node 1 through the path calculation unit.
  • the route calculation unit forwards the route query request to the service path merging unit, and the service path merging unit finds the ID 4 according to the route query request to the table 2. Connect, and restore the connection of this connection, that is, the route with ID 2: 2->6->7->8->4, and the recovery wavelength ⁇ 1 is fed back to node 2 through the path calculation unit.
  • the route calculation unit forwards the route query request to the service path merging unit, and the service path merging unit finds the connection with the ID 5 according to the route query request to the table 2. And restore the connection of this connection, that is, the route with ID 3: 2->6->7->8->4->5, and the recovery wavelength ⁇ 3 is fed back to node 2 through the path calculation unit.
  • Step f When the path merging unit processes the five faulty services, the notification path calculating unit switches from the service fault routing query state to the non-service fault routing query state.
  • the embodiment of the present invention provides a routing device and a routing method for service recovery.
  • the multiple failed services need to be merged after the multiple services are merged.
  • the calculation of the route reduces the calculation time of the path calculation unit, reduces the burden on the path calculation unit, improves the recovery efficiency of the multi-service failure, and ensures the rapid response of the service recovery.

Landscapes

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

Description

多业务恢复的选路装置及选路方法 技术领域
本发明涉及通信技术领域， 尤其涉及一种多业务恢复的选路装置及选 路方法。 背景技术
自动交换光网络 ( ASON, Automatic switched optical network )是指在 选路和信令控制之下完成自动交换功能的新一代光网络， 是近年来光网络 领域的研究热点。 ASON技术的引入则可增强网络业务的快速配置能力， 提高业务的生存性， 有效抵抗网络多点故障， 并能够灵活提供不同的业务 等级， 满足目前迅速发展的差异化服务的需要。
ASON中的路径计算单元 ( PCE, Path Computation Element )使得路径 计算功能从网络设备中独立出来， 即通过在网络中部署独立的路径计算单 元以解决多协议标签交换 /通用多协议标记交换（MPLS/GMPLS ) 网络中大 量链路基于约束的路径计算所需的特别资源问题。 由于目前对于每条需要 恢复重路由的故障业务所请求的路由计算和路径资源选择， 路径计算单元 都需要逐一计算。 特别是在大量业务同时请求故障恢复路由计算的时候， 路径计算单元会因过于繁忙而不能及时响应请求造成业务恢复的延误。 发明内容
鉴于上述的分析， 本发明旨在提供一种多业务恢复的选路装置及选路 方法， 用以解决现有技术中存在的路径计算单元由于过于繁忙而不能及时 响应请求造成业务恢复延误的问题。
本发明的目的主要是通过以下技术方案实现的： 本发明提供了一种多业务恢复的选路装置， 所述装置包括： 路径计算 单元和业务路径归并单元， 其中，
所述路径计算单元， 用于将接收到的包含有多个业务故障连接信息的 统一路由计算通知消息转发给所述业务路径归并单元； 在业务故障查询期 间， 所述路径计算单元还用于将故障业务首节点发来的路由查询请求转发 给所述业务路径归并单元；
所述业务路径归并单元， 用于接收所述路径计算单元转发的统一路由 计算通知消息， 根据业务归并和路由查询统计算法分检业务故障连接信息 并统一从所述路径计算单元获取恢复路由信息并记录； 当收到所述路径计 算单元转发来的路由查询请求时， 根据该路由查询请求查找记录， 并将查 找到的相应恢复路由信息通过所述路径计算单元返回给请求恢复的首节 点。
进一步地， 所述装置还包括： 业务故障上报单元， 设置于自动交换光 网络的节点中， 用于在检索到本节点的传送端口上有复用告警产生时， 判 断业务故障连接的数量是否大于预定阙值， 并在确定业务故障连接的数量 大于预定阙值时， 发送包含有多个故障连接信息的统一路由计算通知消息 给所述路径计算单元。
进一步地， 所述路径计算单元具体包括： 消息转发模块、 路由查询请 求转发模块和恢复路由信息转发模块， 其中，
所述消息转发模块， 用于将接收到的包含有多个故障连接信息的统一 路由计算通知消息转发给所述业务路径归并单元， 同时将所述路径计算单 元自身的路径计算状态设置为业务故障查询状态；
所述路由查询请求转发模块， 用于接收故障业务首节点发来的路由查 询请求， 并判断当前所述路径计算单元自身的路径计算状态， 如果为业务 故障路由查询状态， 则将该首节点上报的路由查询请求转发给所述业务路 径归并单元； 否则触发所述路径计算单元直接根据接收到的路由查询请求 计算相应的恢复路由信息；
所述路由信息转发模块， 用于将业务路径归并单元根据所述路由查询 请求查找到的恢复路由信息转发给请求恢复的首节点。
进一步地， 所述业务路径归并单元具体包括： 存储模块、 路由恢复模 块和查询模块， 其中，
所述存储模块， 用于逐条分离所述统一路由计算通知消息中的所有业 务故障连接信息， 并将业务故障连接的源宿节点作为关键值存储在哈希表 结构中；
所述路由恢复模块， 用于依次从哈希表中取出关键值， 并对每个关键 值分别进行如下处理：
向所述路径计算单元查询路由并要求所述路径计算单元返回一条包含 所有可用波长的路由， 指配好每个业务故障连接占用的波长， 并将该路由 依次填进每个业务故障连接在哈希表的恢复路由记录字段中；
所述查询模块， 用于根据所述路径计算单元转发的路由查询请求查找 哈希表结构， 并在查找到对应的业务故障连接时， 将该业务故障连接对应 的恢复路由信息通过所述路径计算单元反馈给相应的首节点。
进一步地， 所述存储模块具体用于， 逐条分离所述统一路由计算通知 消息中的所有业务故障连接信息， 根据故障连接信息中的路由策略属性将 无路由策略属性和弱路由策略属性的业务故障连接的源宿节点作为关键值 存储在哈希表结构中。
进一步地， 所述路由恢复模块具体用于， 以业务故障连接的源宿节点 作为关键值， 依次从哈希表中取出关键值， 并对每个关键值分别进行如下 处理：
向所述路径计算单元查询路由并要求路径计算单元返回一条包含所有 可用波长的路由； 根据所述路径计算单元返回的路由进行分析， 判断该路 由上的可用波长数是否大于或等于该关键值下的业务故障连接数， 如果是， 则进行路由和波长指配分析， 并将该路由按业务故障连接的优先级次序填 进每个业务故障连接在哈希表的恢复路由记录字段中； 否则， 继续向所述 路径计算单元查询路由并要求所述路径计算单元返回另一条包含所有可用 波长的路由， 直到该路由上的可用波长数大于或等于该关键值下的业务故 障连接数、 或者没有路由为止。
进一步地， 所述查询模块具体用于， 根据所述路径计算单元转发的路 由查询请求查找哈希表结构， 在查找到对应的业务故障连接时， 返回相应 的恢复路由信息给所述路径计算单元。
本发明还提供了一种多业务恢复的选路方法， 所述方法包括：
A、路径计算单元将业务故障上报单元发来的包含有多个业务故障连接 信息的统一路由计算通知消息转发给业务路径归并单元；
B、所述业务路径归并单元接收到包含有多个故障连接信息的统一路由 计算通知消息， 根据业务归并和路由查询统计算法分检业务故障连接信息 并统一从所述路径计算单元获取恢复路由信息并记录；
C、 在业务故障查询期间， 所述路径计算单元将故障业务首节点发来的 路由查询请求转发给所述业务路径归并单元， 所述业务路径归并单元根据 该路由查询请求查找记录， 并将查找到的相应恢复路由信息通过所述路径 计算单元反馈给请求恢复的首节点。
进一步地， 所述步骤 A具体包括：
Al、 当自动光交换网络中有链路发生故障时， 故障链路对应节点判断 业务故障连接的数量是否大于预定阙值，并在确定大于预定阙值时执行 A2;
A2、 发送包含所有故障连接信息的统一路由计算通知消息给所述路径 计算单元； A3、 所述路径计算单元将该统一路由计算通知消息转发给所述业务路 径归并单元， 同时将自身的路径计算状态设置为业务故障查询状态。
进一步地， 所述步骤 B具体包括：
B 1、 所述业务路径归并单元逐条分离统一路由计算通知消息中的所有 业务故障连接， 并将业务故障连接的源宿节点作为关键值存储在哈希表结 构中；
B2、 依次从哈希表中取出关键值， 对每个关键值分别进行如下处理： 向所述路径计算单元查询路由并要求路径计算单元返回一条包含所有 可用波长的路由， 指配好每个业务故障连接占用的波长， 将该路由依次填 进每个业务故障连接在哈希表的恢复路由记录字段中。
进一步地， 所述 B1具体包括：
所述业务路径归并单元逐条分离所述统一路由计算通知消息中的所有 业务故障连接信息， 根据故障连接信息中的路由策略属性将无路由策略属 性和弱路由策略属性的业务故障连接的源宿节点作为关键值存储在哈希表 结构中。
进一步地， 所述 B2具体包括：
依次从哈希表中取出关键值， 并对每个关键值分别进行如下处理： 向路径计算单元查询路由并要求路径计算单元返回一条包含所有可用 波长的路由；
根据路径计算单元返回的路由进行分析， 判断该路由上的可用波长数 是否大于等于该关键值下的业务故障连接数， 如果是， 则进行路由和波长 指配分析， 并将该路由按业务故障连接的优先级次序填进每个业务故障连 接在哈希表的恢复路由记录字段中， 同时将不用的波长反馈给路径计算单 元； 否则继续向路径计算单元查询路由并要求路径计算单元返回另一条包 含所有可用波长的路由， 直到该路由上的可用波长数大于该关键值下的业 务故障连接数、 或者没有路由为止。
进一步地， 所述步骤 C具体包括：
Cl、 当故障业务首节点开始申请恢复路径计算的时候， 所述路径计算 单元如果处于业务故障路由查询状态时， 则将该首节点上报的路由查询请 求转发给所述业务路径归并单元， 并执行 C2; 否则对接收到的路由查询请 求直接进行路由恢复计算；
C2、 所述业务路径归并单元根据所述路由查询请求查找对应的业务故 障连接， 并将查找到的该业务故障连接的恢复路由信息通过所述路径计算 单元反馈给请求恢复的首节点。
本发明有益效果如下：
本发明通过釆用归并所有可以使用相同路径的业务继而对它们统一进 行路由计算的方法， 达到减少路径计算单元的资源消耗和提高链路故障的 恢复效率的目的。
本发明的其他特征和优点将在随后的说明书中阐述， 并且， 部分的从 说明书中变得显而易见， 或者通过实施本发明而了解。 本发明的目的和其 他优点可通过在所写的说明书、 权利要求书、 以及附图中所特别指出的结 构来实现和获得。 附图说明
图 1为本发明实施例所述选路装置的应用场景示意图；
图 2为本发明实施例所述选路装置的结构示意图；
图 3为本发明实施例所述选路方法的流程示意图；
图 4为本发明实施例中一个具有 11个节点的网络拓朴结构示意图。 具体实施方式
本发明的目的在于， 在大量业务同时出现故障并需要进行恢复重路由 的时候， 釆用归并所有可以使用相同路径的业务继而对它们统一进行路由 计算的方法来减少路径计算单元的资源消耗和提高链路故障的恢复效率。
下面结合附图来具体描述本发明的优先实施例， 其中， 附图构成本申 请一部分， 并与本发明的实施例一起用于阐释本发明的原理。 为了清楚和 简化目的， 当其可能使本发明的主题模糊不清时， 将省略本文所描述的器 件中已知功能和结构的详细具体说明。
首先结合附图 1和附图 2对本发明实施例所述装置进行详细说明。 如图 1所示， 图 1为本发明实施例所述选路装置的应用场景示意图， 当自动光交换网络复用段发生故障产生告警时， 业务链路的故障节点统计 业务故障连接的数量， 并将包含有多个业务故障连接的统一路由计算通知 消息通知给选路装置， 同时将故障情况通过信令协议通知给业务故障连接 的首节点， 由首节点决定发起恢复路由请求； 选路装置根据统一路由计算 通知消息进行归并和路由查询处理， 并在首节点发起恢复路由请求时将得 到的恢复路由信息反馈给该首节点。
如图 2所示， 图 2为本发明实施例所述选路装置的结构示意图， 包括： 业务故障上报单元、 路径计算单元和业务路径归并单元， 其中， 路径计算 单元具体包括： 消息转发模块、 路由查询请求转发模块和恢复路由信息转 发模块； 业务路径归并单元具体包括： 存储模块、 路由恢复模块和查询模 块。
以下将对各个单元和模块分别予以详细说明。
(一） 业务故障上报单元， 设置于自动交换光网络的节点中， 当自动 交换光网络复用段发生故障产生告警时， 故障链路对应端节点检索故障端 口上存在的业务故障连接， 并判断业务故障连接的数量是否大于预定阙值， 并在确定业务故障连接的数量大于预定阙值时， 发送包含有多个故障连接 信息的统一路由计算通知消息给路径计算单元。 该预定阙值通常是根据路 径计算单元的最大负荷能力确定， 以保证路径计算单元的合理工作量。
(二）路径计算单元， 主要负责消息的转发， 比如， 将接收到的包含 有多个业务故障连接信息的统一路由计算通知消息转发给所述业务路径归 并单元； 在业务故障查询期间， 所述路径计算单元还用于将故障业务首节 点发来的路由查询请求转发给所述业务路径归并单元； 还负责根据路由查 询请求进行恢复路由计算， 恢复路由计算功能现有技术中已有成熟方案， J¾处不再进行详细说明。
路径计算单元具体可以包括： 消息转发模块、 路由查询请求转发模块 和恢复路由信息转发模块， 其中，
消息转发模块从故障链路对端节点的业务故障上报单元接收到包含有 多个故障连接信息的统一路由计算通知消息时， 将该统一路由计算通知消 息转发给业务路径归并单元， 同时将路径计算单元自身的路径计算状态设 置为业务故障查询状态；
在故障业务首节点向路径计算单元发起路由查询请求时， 路由查询请 求转发模块接收到路由查询请求， 并判断当前路径计算单元自身的路径计 算状态， 如果路径计算单元自身的路径计算状态为业务故障路由查询状态， 则将故障业务首节点上报的路由查询请求转发给所述业务路径归并单元； 否则， 即路径计算单元自身的路径计算状态为非业务故障路由查询状态时， 则触发路径计算单元对接收到的路由查询请求直接进行路由恢复计算并将 计算出来的恢复路由信息反馈给请求恢复的首节点， 不再进行转发；
当业务路径归并单元根据转发的路由查询请求查找到对应的恢复路由 信息时， 路由信息转发模块将业务路径归并单元根据所述路由查询请求查 找到的恢复路由信息转发给请求恢复的首节点。
(三） 业务路径归并单元， 主要负责两方面， 一方面接收所述路径计 算单元转发来的包含有多个故障连接信息的统一路由计算通知消息， 对其 中的所有故障连接进行归并和路由查询处理后统一从路径计算单元获取路 由信息并记录； 另一方面当收到所述路径计算单元转发来的路由查询请求 时， 负责根据该路由查询请求查找记录， 并将查找到的相应恢复路由信息 通过所述路径计算单元返回给请求恢复的首节点。
业务路径归并单元具体可以包括： 存储模块、 路由恢复模块和查询模 块， 其中，
存储模块接收所述路径计算单元转发来的包含有多个故障连接信息的 统一路由计算通知消息， 逐条分离所述统一路由计算通知消息中的所有业 务故障连接， 并将业务故障连接的源宿节点作为关键值存储在哈希表结构 中；
路由恢复模块依次从哈希表中取出关键值， 并对每个关键值分别进行 如下处理：
向路径计算单元查询路由并要求路径计算单元返回的一条包含所有可 用的波长的路由， 并指配好占用的波长， 将该路由依次填进每个业务故障 连接在哈希表的恢复路由记录字段中； 具体的说就是， 路由恢复模块向路 径计算单元查询路由并要求路径计算单元返回一条包含所有可用波长的路 由； 然后根据路径计算单元返回的路由进行分析， 判断该路由上的可用波 长数是否大于或等于该关键值下的业务故障连接数， 如果是， 则进行 RWA (路由和波长指配）分析指配好每个业务故障连接占用的波长， 并将该路 由按业务故障连接的优先级次序填进每个业务故障连接在哈希表的恢复路 由记录字段中， 同时将不用的波长反馈给路径计算单元以释放资源； 否则 继续向路径计算单元查询路由并要求路径计算单元返回另一条包含所有可 用波长的路由， 直到该路由上的可用波长数大于该关键值下的业务故障连 接数， 或者没有路由为止。
查询模块根据所述路径计算单元转发的路由查询请求查找哈希表结 构， 并在查找到对应的业务故障连接时， 将该业务故障连接对应的恢复路 由信息通过所述路径计算单元反馈给相应的首节点； 具体的说就是， 查询 模块根据所述路径计算单元转发的路由查询请求查找哈希表结构， 如果查 找到对应的业务故障连接， 则判断该业务故障连接是否已计算出恢复路由 信息， 如果是， 返回相应的恢复路由信息给路径计算单元， 否则进入等待 状态， 直到计算出恢复路由信息或者恢复路由计算失败或者恢复路由计算 超时而退出； 如果找不到对应的业务故障连接， 则直接通知路径计算单元 进行路由恢复计算。
本发明实施例所多业务恢复的述选路装置的具体实施过程将在以下方 法的描述中进行详细说明， 此处不再进行过多阐述。
下面将结合附图 3到附图 4对利用上述多业务恢复的选路装置进行选 路的方法描述。
如图 3所示， 图 3为本发明实施例所述多业务恢复的选路方法的流程 示意图， 包括但不限于以下步骤：
步骤 301 : 当某一条链路发生故障， 该链路的对应端节点检测到传送端 口有复用段告警产生；
步骤 302:该节点的业务故障上报单元检索故障对应的传送端口上存在 的所有业务故障连接；
步骤 303 : 判断业务故障连接的数量是否大于预定阙值， 如果是， 执行 步骤 304, 否则按原有告警处理流程处理， 即将业务故障连接信息通知给业 务故障首节点， 由业务故障首节点向路径计算单元发起路由恢复计算请求； 该预定阙值通常是根据路径计算单元的最大负荷能力确定， 以保证路径计 算单元的合理工作量；
步骤 304:该节点的业务故障上报单元向该节点所在域的路径计算单元 发送一个包含所有业务故障连接信息的统一路由计算通知消息； 步骤 305:路径计算单元将该统一路由计算通知消息转发至业务路径归 并单元处理， 同时将自身的路径计算状态置成多业务故障路由查询状态； 步骤 306: 业务路径归并单元根据业务归并和路由查询统计算法，对所 有故障连接信息进行归并和路由查询处理， 统一从路径计算单元获取恢复 路由信息并记录；
步骤 307: 当路径计算单元处于多业务故障路由查询状态时， 将各业务 故障连接首节点上报上来的路由查询请求转发给业务路径归并单元；
本步骤中， 对于业务路径归并单元的路由查询请求， 路径计算单元按 正常处理， 并将计算结果返回给业务路径归并单元； 路径计算单元对处于 非业务故障路由查询状态时各业务故障连接首节点上报上来的路由查询请 求， 进行正常的路由恢复计算处理；
步骤 308: 当业务故障连接的首节点开始申请恢复路径计算的时候， 将 路由查询请求通过路径计算单元转发给业务路径归并单元， 业务路径归并 单元收到路径计算单元转发的路由查询请求后， 根据其中存储的记录查找 该路由查询请求对应的业务故障连接；
步骤 309: 业务路径归并单元判断是否找到对应的业务故障连接， 如果 是， 则执行步骤 310, 否则执行步骤 313 ;
步骤 310:业务路径归并单元判断该业务故障连接是否已计算出恢复路 由信息， 如果是， 执行步骤 311 , 否则执行步骤 312;
步骤 311 : 返回该业务故障连接对应的恢复路由信息， 结束流程； 步骤 312: 设置超时定时器， 进入等待状态， 直到计算出恢复路由信息 或者路由恢复计算失败或者定时器超时这三种情况的中任一种情况出现而 退出， 结束流程；
步骤 313: 找不到对应的业务故障连接， 通知路径计算单元自行计算恢 复路由信息并返回给相应的请求查询路由的首节点。 并且， 当对于该统一路由计算通知消息中的所有故障业务连接都处理 完后， 业务路径归并单元通知路径计算单元将路径计算单元自身的路径计 算状态从业务故障路由查询状态切换为非业务故障路由查询状态。
本发明实施例中， 步骤 306, 即业务路径归并单元根据业务归并和路由 查询统计算法， 对所有故障连接信息进行归并处理， 统一从路径计算单元 获取路由信息并记录的步骤具体包括：
业务路径归并单元对接收到的包含有多个故障连接信息的统一路由计 算通知消息进行处理， 逐条分离该统一路由计算通知消息中携带的故障连 接信息， 对于无路由策略要求属性和弱路由策略要求属性的业务故障连接 存到一张故障业务哈希表中， 关键值为业务源宿节点 ID (即源节点 ID和目 的节点 ID ); 对于强路由策略属性的业务故障连接则排除，后续当该强路由 策略属性的业务故障连接的首节点查询时， 通过路径计算单元直接计算恢 复路由信息并反馈给该首节点， 不再进行转发处理。
从哈希表中依次取出关键值， 对每个关键值进行如下处理：
业务路径归并单元根据源宿节点 ID向路径计算单元查询路由， 并要求 路径计算单元返回的一条包含所有可用的波长的路由。 当路径计算单元返 回一条可用路由时， 业务路径归并单元对路径计算单元返回的可用路由进 行分析， 判断该路由上的可用波长数是否大于或等于哈希表中这个关键值 下的故障业务数， 如果是， 则进行 RWA分析指配好占用的波长， 则将该路 由按业务故障连接的优先级次序填进每个业务故障连接在哈希表的恢复路 由记录字段中， 同时将不用的波长反馈给路径计算单元以释放资源； 如果 否， 则继续向路径计算单元查询路由并要求路径计算单元返回的另一条包 含所有可用的波长的路由， 直到有路由上的可用波长数大于这个关键值下 的故障业务数， 或者没有路由为止。
为了便于理解本发明实施例， 下面将通过一个具体的网络拓朴结构对 本发明实施例所述方法进行解释说明。
如图 4所示， 图 4为一个具有 11个节点 （节点 1〜节点 11 ) 的网络拓 朴结构示意图， 每条链路上都有 5个可用波长资源， 即 λ 1、 λ 2、 λ 3、 λ 4、 和 λ 5 。
该网络拓朴结构中有如下业务：
业务 1 , 路由为节点 1-节点 2-节点 3-节点 4-节点 5 , 占用波长 λ ΐ ； 业务 2, 路由为节点 1-节点 2-节点 3-节点 4-节点 5 , 占用波长 λ 2 ； 业务 3 , 路由为节点 1-节点 2-节点 3-节点 4-节点 5 , 占用波长 λ 3 ； 业务 4, 路由为节点 2-节点 3-节点 4, 占用波长 λ 4
业务 5 , 路由为节点 2-节点 3-节点 4-节点 5 , 占用波长 λ 5 ； 业务 6, 路由为节点 1-节点 9-节点 10-节点 11-节点 5 , 占用波长 λ 3 ； 业务 7, 路由为节点 2-节点 6-节点 7-节点 8-节点 4, 占用波长 λ 2 ； 业务 8, 路由为节点 2-节点 6-节点 7-节点 8-节点 4, 占用波长 λ 4 ； 业务 9, 路由为节点 2-节点 6-节点 7-节点 8-节点 4, 占用波长 λ 5 。 现在假定节点 3到节点 4之间的光纤发生故障， 节点 4检测到传送端 口有无光告警时， 查找发生故障的业务连接， 受到影响的业务有业务 1、 业 务 2、 业务 3、 业务 4、 业务 5。
具体执行过程如下：
步骤 a:节点 4将上述 5个业务故障连接信息携带在统一路由计算通知 消息中上报给路径计算单元；
步骤 b:路径计算单元将上述统一路由计算通知消息转发至业务路径归 并单元， 同时将自身路径计算状态置成业务故障路由查询状态；
步骤 c: 业务路径归并单元根据业务归并和路由查询统计算法， 分检业 务故障连接信息， 以业务故障连接的源宿节点作为关键值在哈希表结构中 进行存储记录， 具体见表 1所示。 表 1. 业务归并和路由查询统计算法哈希表 记录 1 : 源 1宿 5 记录 2: 源 2宿 4 记录 3 : 源 2宿 5
，
连接 ID: 1 连接 ID: 4 连接 ID: 5
恢复路由： 无 恢复路由： 无 恢复路由： 无
恢复波长： 无 恢复波长： 无 恢复波长： 无 连接 ID: 2
恢复路由: 无
恢复波长: 无
，
连接 ID: 3
恢复路由: 无
恢复波长: 无
步骤 d: 从哈希表中依次取出记录 1、 记录 2和记录 3 , 对每个记录进 行如下处理：
从哈希表中取出记录 1 向路径计算单元查询路由， 路径计算单元返回 一条可用路由： 节点 1-节点 9-节点 10-节点 11-节点 5 , 有 λ 1、 λ 2、 λ 4、 λ 5 这 4个波长可用； 判断该条可用路由上的可用波长数是否大于或等于 哈希表中这个关键值下的业务故障连接数， 可用波长数 4>业务故障连接数 3 , 则通过 RWA过程分配给业务故障连接 1的恢复连接 λ ΐ波长， 业务故 障连接 2的恢复连接 λ 2波长， 业务故障连接 3的恢复连接 λ 4波长， 同时 释放 λ 5波长反馈给路径计算单元以释放资源。
接下来， 取出哈希表中的记录 2 向路径计算单元查询路由， 路径计算 单元返回一条可用路由： 节点 2-节点 6-节点 7-节点 8-节点 4, 有 λ 1、 λ 3 这 2个波长可用； 判断该条可用路由上的可用波长数是否大于或等于哈希 表中这个关键值下的业务故障连接数 (可用波长数 2>业务故障连接数 1 ), 通过 RWA过程分配给业务故障连接 4的恢复连接 λ 1波长， 同时释放 λ 3 波长反馈给路径计算单元以释放资源。
再接下来， 取出哈希表中的记录 3 向路径计算单元查询路由， 路径计 算单元返回一条可用路由： 节点 2-节点 6-节点 7-节点 8-节点 -节点 5 , 有 λ 3这 1个波长可用；判断该条可用路由上的可用波长数是否大于或等于哈希 表中这个关键值下的业务故障连接数 (可用波长数 1=业务故障连接数 1 ), 通过 RWA过程分配给业务故障连接 5的恢复连接 λ 1波长。
完成后的记录如表 2所示。
表 2. 完成业务归并和路由查询统计算法后的哈希表
Figure imgf000017_0001
步骤 e: 当节点 1对业务 1开始申请恢复路径计算的时候， 通过路径计 算单元将路由查询请求转发给业务路径归并单元， 业务路径归并单元根据 该路查询请求到表 2中找到 ID为 1的连接， 并将这个连接的恢复路由， 即 ID为 1的路由： 1->9->10->11->5 , 以及恢复波长 λ ΐ通过路径计算单元反 馈给节点 1。
当节点 1对业务 2开始申请恢复路径计算的时候， 通过路径计算单元 将路由查询请求转发给业务路径归并单元， 业务路径归并单元根据该路由 查询请求到表 2中找到 ID为 2的连接， 并将这个连接的恢复路由， 即 ID 为 1的路由： 1->9->10->11->5 , 以及恢复波长 λ 2通过路径计算单元反馈给 节点 1。
当节点 1对业务 3开始申请恢复路径计算的时候， 通过路径计算单元 将路由查询请求转发给业务路径归并单元， 业务路径归并单元根据该路由 查询请求到表 2中找到 ID为 3的连接， 并将这个连接的恢复路由， 即 ID 为 1的路由： 1->9->10->11->5 , 以及恢复波长 λ 4通过路径计算单元反馈给 节点 1。
同理， 当节点 2对业务 4开始申请恢复路径计算的时候， 通过路径计 算单元将路由查询请求转发给业务路径归并单元， 业务路径归并单元根据 该路由查询请求到表 2中找到 ID为 4的连接， 并将这个连接的恢复路由， 即 ID为 2的路由： 2->6->7->8->4, 以及恢复波长 λ 1通过路径计算单元反 馈给节点 2。
同样， 当节点 2对业务 5开始申请恢复路径计算的时候， 通过路径计 算单元将路由查询请求转发给业务路径归并单元， 业务路径归并单元根据 该路由查询请求到表 2中找到 ID为 5的连接， 并将这个连接的恢复路由， 即 ID为 3的路由： 2->6->7->8->4->5 , 以及恢复波长 λ 3通过路径计算单元 反馈给节点 2。
步骤 f: 当路径归并单元对于这 5个故障业务都处理完毕时， 通知路径 计算单元由业务故障路由查询状态切换为非业务故障路由查询状态。
综上所述， 本发明实施例提供了一种业务恢复的选路装置及选路方法， 与现有技术相比， 由于本发明实施例对多个故障业务经过归并后只需对相 应归并数量的路由进行计算， 从而减少了路径计算单元的计算时间， 减轻 了路径计算单元的负担， 提高了多业务故障的恢复效率， 确保业务恢复的 迅捷响应。
以上所述， 仅为本发明较佳的具体实施方式， 但本发明的保护范围并 不局限于此， 任何熟悉本技术领域的技术人员在本发明揭露的技术范围内， 可轻易想到的变化或替换， 都应涵盖在本发明的保护范围之内。 因此， 本 发明的保护范围应该以权利要求书的保护范围为准。

Claims

权利要求书
1、 一种多业务恢复的选路装置， 其特征在于， 所述装置包括： 路径计 算单元和业务路径归并单元， 其中，
所述路径计算单元， 用于将接收到的包含有多个业务故障连接信息的 统一路由计算通知消息转发给所述业务路径归并单元； 在业务故障查询期 间， 所述路径计算单元还用于将故障业务首节点发来的路由查询请求转发 给所述业务路径归并单元；
所述业务路径归并单元， 用于接收所述路径计算单元转发的统一路由 计算通知消息， 根据业务归并和路由查询统计算法分检业务故障连接信息 并统一从所述路径计算单元获取恢复路由信息并记录； 当收到所述路径计 算单元转发来的路由查询请求时， 根据该路由查询请求查找记录， 并将查 找到的相应恢复路由信息通过所述路径计算单元返回给请求恢复的首节 点。
2、 根据权利要求 1所述的装置， 其特征在于， 所述装置还包括： 业务 故障上报单元， 设置于自动交换光网络的节点中， 用于在检索到本节点的 传送端口上有复用告警产生时， 判断业务故障连接的数量是否大于预定阙 值， 并在确定业务故障连接的数量大于预定阙值时， 发送包含有多个故障 连接信息的统一路由计算通知消息给所述路径计算单元。
3、 根据权利要求 1所述的装置， 其特征在于， 所述路径计算单元具体 包括： 消息转发模块、 路由查询请求转发模块和恢复路由信息转发模块， 其中，
所述消息转发模块， 用于将接收到的包含有多个故障连接信息的统一 路由计算通知消息转发给所述业务路径归并单元， 同时将所述路径计算单 元自身的路径计算状态设置为业务故障查询状态；
所述路由查询请求转发模块， 用于接收故障业务首节点发来的路由查 询请求， 并判断当前所述路径计算单元自身的路径计算状态， 如果为业务 故障路由查询状态， 则将该首节点上报的路由查询请求转发给所述业务路 径归并单元； 否则触发所述路径计算单元直接根据接收到的路由查询请求 计算相应的恢复路由信息；
所述路由信息转发模块， 用于将业务路径归并单元根据所述路由查询 请求查找到的恢复路由信息转发给请求恢复的首节点。
4、 根据权利要求 1到 3任一项所述的装置， 其特征在于， 所述业务路 径归并单元具体包括： 存储模块、 路由恢复模块和查询模块， 其中，
所述存储模块， 用于逐条分离所述统一路由计算通知消息中的所有业 务故障连接信息， 并将业务故障连接的源宿节点作为关键值存储在哈希表 结构中；
所述路由恢复模块， 用于依次从哈希表中取出关键值， 并对每个关键 值分别进行如下处理：
向所述路径计算单元查询路由并要求所述路径计算单元返回一条包含 所有可用波长的路由， 指配好每个业务故障连接占用的波长， 并将该路由 依次填进每个业务故障连接在哈希表的恢复路由记录字段中；
所述查询模块， 用于根据所述路径计算单元转发的路由查询请求查找 哈希表结构， 并在查找到对应的业务故障连接时， 将该业务故障连接对应 的恢复路由信息通过所述路径计算单元反馈给相应的首节点。
5、 根据权利要求 4所述的装置， 其特征在于， 所述路由恢复模块具体 用于， 以业务故障连接的源宿节点作为关键值， 依次从哈希表中取出关键 值， 并对每个关键值分别进行如下处理：
向所述路径计算单元查询路由并要求路径计算单元返回一条包含所有 可用波长的路由； 根据所述路径计算单元返回的路由进行分析， 判断该路 由上的可用波长数是否大于或等于该关键值下的业务故障连接数， 如果是， 则进行路由和波长指配分析， 并将该路由按业务故障连接的优先级次序填 进每个业务故障连接在哈希表的恢复路由记录字段中； 否则， 继续向所述 路径计算单元查询路由并要求所述路径计算单元返回另一条包含所有可用 波长的路由， 直到该路由上的可用波长数大于或等于该关键值下的业务故 障连接数、 或者没有路由为止。
6、根据权利要求 4所述的装置， 其特征在于， 所述查询模块具体用于， 根据所述路径计算单元转发的路由查询请求查找哈希表结构， 在查找到对 应的业务故障连接时， 返回相应的恢复路由信息给所述路径计算单元。
7、 一种多业务恢复的选路方法， 其特征在于， 所述方法包括：
A、路径计算单元将业务故障上报单元发来的包含有多个业务故障连接 信息的统一路由计算通知消息转发给业务路径归并单元；
B、所述业务路径归并单元接收到包含有多个故障连接信息的统一路由 计算通知消息， 根据业务归并和路由查询统计算法分检业务故障连接信息 并统一从所述路径计算单元获取恢复路由信息并记录；
C、 在业务故障查询期间， 所述路径计算单元将故障业务首节点发来的 路由查询请求转发给所述业务路径归并单元， 所述业务路径归并单元根据 该路由查询请求查找记录， 并将查找到的相应恢复路由信息通过所述路径 计算单元反馈给请求恢复的首节点。
8、 根据权利要求 7所述的选路方法， 其特征在于， 所述步骤 A具体包 括：
Al、 当自动光交换网络中有链路发生故障时， 故障链路对应节点判断 业务故障连接的数量是否大于预定阙值，并在确定大于预定阙值时执行 A2;
A2、 发送包含所有故障连接信息的统一路由计算通知消息给所述路径 计算单元；
A3、 所述路径计算单元将该统一路由计算通知消息转发给所述业务路 径归并单元， 同时将自身的路径计算状态设置为业务故障查询状态。
9、 根据权利要求 7或 8所述的方法， 其特征在于， 所述步骤 B具体包 括：
B 1、 所述业务路径归并单元逐条分离统一路由计算通知消息中的所有 业务故障连接， 并将业务故障连接的源宿节点作为关键值存储在哈希表结 构中；
B2、 依次从哈希表中取出关键值， 对每个关键值分别进行如下处理： 向所述路径计算单元查询路由并要求路径计算单元返回一条包含所有 可用波长的路由， 指配好每个业务故障连接占用的波长， 将该路由依次填 进每个业务故障连接在哈希表的恢复路由记录字段中。
10、根据权利要求 9所述的方法，其特征在于，所述步骤 B1具体包括： 所述业务路径归并单元逐条分离所述统一路由计算通知消息中的所有 业务故障连接信息， 根据故障连接信息中的路由策略属性将无路由策略属 性和弱路由策略属性的业务故障连接的源宿节点作为关键值存储在哈希表 结构中。
11、根据权利要求 9所述的方法，其特征在于，所述步骤 B2具体包括： 依次从哈希表中取出关键值， 并对每个关键值分别进行如下处理： 向路径计算单元查询路由并要求路径计算单元返回一条包含所有可用 波长的路由；
根据路径计算单元返回的路由进行分析， 判断该路由上的可用波长数 是否大于等于该关键值下的业务故障连接数， 如果是， 则进行路由和波长 指配分析， 并将该路由按业务故障连接的优先级次序填进每个业务故障连 接在哈希表的恢复路由记录字段中， 同时将不用的波长反馈给路径计算单 元； 否则， 继续向路径计算单元查询路由并要求路径计算单元返回另一条 包含所有可用波长的路由， 直到该路由上的可用波长数大于该关键值下的 业务故障连接数、 或者没有路由为止。
12、 根据权利要求 7或 8所述的方法， 其特征在于， 所述步骤 C具体 包括：
Cl、 当故障业务首节点开始申请恢复路径计算的时候， 所述路径计算 单元如果处于业务故障路由查询状态时， 则将该首节点上报的路由查询请 求转发给所述业务路径归并单元， 并执行 C2; 否则对接收到的路由查询请 求直接进行路由恢复计算；
C2、 所述业务路径归并单元根据所述路由查询请求查找对应的业务故 障连接， 并将查找到的该业务故障连接的恢复路由信息通过所述路径计算 单元反馈给请求恢复的首节点。
PCT/CN2010/073082 2009-09-03 2010-05-21 多业务恢复的选路装置及选路方法 WO2011026350A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
ES10813272.1T ES2689469T3 (es) 2009-09-03 2010-05-21 Aparato de selección de ruta y método de selección de ruta para recuperación de múltiples servicios
EP10813272.1A EP2464036B1 (en) 2009-09-03 2010-05-21 Route selection apparatus and route selection method for multi-service recovery
KR1020127008553A KR101343529B1 (ko) 2009-09-03 2010-05-21 멀티 서비스 회복을 위한 경로 선택 장치 및 경로 선택 방법
US13/394,154 US9036989B2 (en) 2009-09-03 2010-05-21 Apparatus and method for rerouting multiple traffics

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200910170118.8 2009-09-03
CN2009101701188A CN101651625B (zh) 2009-09-03 2009-09-03 多业务恢复的选路装置及选路方法

Publications (1)

Publication Number Publication Date
WO2011026350A1 true WO2011026350A1 (zh) 2011-03-10

Family

ID=41673745

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/073082 WO2011026350A1 (zh) 2009-09-03 2010-05-21 多业务恢复的选路装置及选路方法

Country Status (6)

Country Link
US (1) US9036989B2 (zh)
EP (1) EP2464036B1 (zh)
KR (1) KR101343529B1 (zh)
CN (1) CN101651625B (zh)
ES (1) ES2689469T3 (zh)
WO (1) WO2011026350A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103167539B (zh) * 2011-12-13 2015-12-02 华为技术有限公司 故障处理方法、设备和系统
CN110689418A (zh) * 2019-09-27 2020-01-14 支付宝(杭州)信息技术有限公司 账单生成方法及装置
CN115913899A (zh) * 2022-11-08 2023-04-04 云南电网有限责任公司 一种输电线路异构融合通信故障快速恢复方法及系统

Families Citing this family (45)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101651625B (zh) 2009-09-03 2011-09-21 中兴通讯股份有限公司 多业务恢复的选路装置及选路方法
US9940670B2 (en) * 2009-12-10 2018-04-10 Royal Bank Of Canada Synchronized processing of data by networked computing resources
CN102142982A (zh) * 2010-11-23 2011-08-03 华为数字技术有限公司 一种转发平面故障修复方法和装置
CN102487329B (zh) * 2010-12-02 2016-03-30 中兴通讯股份有限公司 业务恢复方法及装置
CN102938702B (zh) * 2011-08-15 2017-09-19 中兴通讯股份有限公司 一种实现通讯设备业务数据恢复的方法、装置和系统
US8843622B1 (en) * 2011-12-19 2014-09-23 Cisco Technology, Inc. System and method to contact and maintain status of managed devices
US9054831B2 (en) * 2012-01-05 2015-06-09 Ciena Corporation Optical communication network path restoration
JP5831318B2 (ja) * 2012-03-19 2015-12-09 富士通株式会社 ネットワーク装置、ネットワーク制御方法、及びプログラム
US9270597B2 (en) * 2012-07-10 2016-02-23 Futurewei Technologies, Inc. Representing bandwidth constraints in partially controlled environments
US9548960B2 (en) 2013-10-06 2017-01-17 Mellanox Technologies Ltd. Simplified packet routing
US9729473B2 (en) 2014-06-23 2017-08-08 Mellanox Technologies, Ltd. Network high availability using temporary re-routing
US9806994B2 (en) 2014-06-24 2017-10-31 Mellanox Technologies, Ltd. Routing via multiple paths with efficient traffic distribution
CN105721192A (zh) * 2014-12-05 2016-06-29 中兴通讯股份有限公司 实现容量规划的方法和装置
US9369785B1 (en) * 2014-12-18 2016-06-14 Juniper Networks, Inc. Integrated controller for routing / switching network and underlying optical transport system
US9369200B1 (en) * 2014-12-18 2016-06-14 Juniper Networks, Inc. Network controller having predictable analytics and failure avoidance in packet-optical networks
US9894005B2 (en) * 2015-03-31 2018-02-13 Mellanox Technologies, Ltd. Adaptive routing controlled by source node
CN106330695B (zh) * 2015-06-24 2021-03-02 中兴通讯股份有限公司 一种业务控制方法及装置
CN106549865A (zh) * 2015-09-21 2017-03-29 中兴通讯股份有限公司 业务动态恢复的方法、装置及软件定义网络sdn控制器
US9973435B2 (en) 2015-12-16 2018-05-15 Mellanox Technologies Tlv Ltd. Loopback-free adaptive routing
US10819621B2 (en) 2016-02-23 2020-10-27 Mellanox Technologies Tlv Ltd. Unicast forwarding of adaptive-routing notifications
US10178029B2 (en) 2016-05-11 2019-01-08 Mellanox Technologies Tlv Ltd. Forwarding of adaptive routing notifications
CN107579914A (zh) * 2016-07-04 2018-01-12 中兴通讯股份有限公司 一种快速抢通业务路由的装置和方法
WO2018076346A1 (zh) * 2016-10-31 2018-05-03 华为技术有限公司 一种电层资源的添加方法及系统
US10200294B2 (en) 2016-12-22 2019-02-05 Mellanox Technologies Tlv Ltd. Adaptive routing based on flow-control credits
CN107147539A (zh) * 2017-07-14 2017-09-08 北京邮电大学 软件定义网络中判定关键链路提供快速故障恢复的方法及装置
CN108377221A (zh) * 2017-11-02 2018-08-07 北京紫光恒越网络科技有限公司 调用路由算法的方法及装置
US10644995B2 (en) 2018-02-14 2020-05-05 Mellanox Technologies Tlv Ltd. Adaptive routing in a box
EP3776225A4 (en) 2018-03-30 2022-01-05 Provino Technologies, Inc. PROTOCOL LEVEL CONTROL FOR A SYSTEM AGENT ON CHIP (SOC) RESET AND ENERGY MANAGEMENT
EP4216062A1 (en) 2018-03-30 2023-07-26 Google LLC Arbitrating portions of transactions over virtual channels associated with an interconnect
CN110708254B (zh) 2018-07-09 2023-04-18 华为技术有限公司 一种业务处理方法、控制设备及存储介质
CN110858820A (zh) 2018-08-22 2020-03-03 中兴通讯股份有限公司 业务运行方法、装置、存储介质及电子装置
US11005724B1 (en) 2019-01-06 2021-05-11 Mellanox Technologies, Ltd. Network topology having minimal number of long connections among groups of network elements
US10733131B1 (en) * 2019-02-01 2020-08-04 Hewlett Packard Enterprise Development Lp Target port set selection for a connection path based on comparison of respective loads
US11792114B2 (en) 2019-05-23 2023-10-17 Hewlett Packard Enterprise Development Lp System and method for facilitating efficient management of non-idempotent operations in a network interface controller (NIC)
CN110879819A (zh) * 2019-11-20 2020-03-13 北京明略软件系统有限公司 路由信息快速准确识别方法、装置、服务器及存储介质
CN112994785A (zh) * 2019-12-18 2021-06-18 中国电信股份有限公司 业务恢复方法和装置
CN111193669B (zh) * 2020-02-03 2022-02-08 杭州迪普科技股份有限公司 路由管理方法和路由管理装置
CN114070783A (zh) * 2020-07-27 2022-02-18 中兴通讯股份有限公司 预置路径信息获取方法、实体、业务控制单元及存储介质
US11575594B2 (en) 2020-09-10 2023-02-07 Mellanox Technologies, Ltd. Deadlock-free rerouting for resolving local link failures using detour paths
CN112203316B (zh) * 2020-09-30 2023-07-14 Oppo（重庆）智能科技有限公司 网络异常的恢复方法、装置、电子设备及存储介质
US11411911B2 (en) 2020-10-26 2022-08-09 Mellanox Technologies, Ltd. Routing across multiple subnetworks using address mapping
CN114615190B (zh) * 2020-11-23 2023-04-18 华为技术有限公司 重路由方法、通信装置及存储介质
CN112671640A (zh) * 2020-12-14 2021-04-16 烽火通信科技股份有限公司 一种基于流水线的路由部署方法及系统
US11870682B2 (en) 2021-06-22 2024-01-09 Mellanox Technologies, Ltd. Deadlock-free local rerouting for handling multiple local link failures in hierarchical network topologies
US11765103B2 (en) 2021-12-01 2023-09-19 Mellanox Technologies, Ltd. Large-scale network with high port utilization

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1960341A (zh) * 2006-09-29 2007-05-09 华为技术有限公司 一种业务恢复方法
CN101141195A (zh) * 2007-07-16 2008-03-12 中兴通讯股份有限公司 光通讯传送平面上大量告警的上报方法及系统
CN101286892A (zh) * 2007-04-12 2008-10-15 华为技术有限公司 进行业务恢复的装置和方法
CN101651625A (zh) * 2009-09-03 2010-02-17 中兴通讯股份有限公司 多业务恢复的选路装置及选路方法

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7324453B2 (en) * 2002-08-30 2008-01-29 Alcatel Lucent Constraint-based shortest path first method for dynamically switched optical transport networks
US20040062195A1 (en) * 2002-09-30 2004-04-01 Intel Corporation Algorithm for dynamic provisioning of fail-over support in generalized multi-protocol label switching enabled networks
CN1499747A (zh) * 2002-11-07 2004-05-26 华为技术有限公司 一种实现智能光网络保护和恢复的方法
US8441919B2 (en) * 2006-01-18 2013-05-14 Cisco Technology, Inc. Dynamic protection against failure of a head-end node of one or more TE-LSPs
US20070174483A1 (en) * 2006-01-20 2007-07-26 Raj Alex E Methods and apparatus for implementing protection for multicast services
US7839767B2 (en) * 2008-03-07 2010-11-23 Cisco Technology, Inc. Path reroute in a computer network
US7990877B2 (en) * 2008-05-15 2011-08-02 Telefonaktiebolaget L M Ericsson (Publ) Method and apparatus for dynamically runtime adjustable path computation
US9450778B2 (en) * 2009-02-25 2016-09-20 Telefonaktiebolaget Lm Ericsson (Publ) P2MP traffic protection in MPLS-TP ring topology
US9026632B2 (en) * 2012-03-15 2015-05-05 Adva Optical Networking Se Network with a network wide extended policy framework

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1960341A (zh) * 2006-09-29 2007-05-09 华为技术有限公司 一种业务恢复方法
CN101286892A (zh) * 2007-04-12 2008-10-15 华为技术有限公司 进行业务恢复的装置和方法
CN101141195A (zh) * 2007-07-16 2008-03-12 中兴通讯股份有限公司 光通讯传送平面上大量告警的上报方法及系统
CN101651625A (zh) * 2009-09-03 2010-02-17 中兴通讯股份有限公司 多业务恢复的选路装置及选路方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP2464036A4 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103167539B (zh) * 2011-12-13 2015-12-02 华为技术有限公司 故障处理方法、设备和系统
CN110689418A (zh) * 2019-09-27 2020-01-14 支付宝(杭州)信息技术有限公司 账单生成方法及装置
CN115913899A (zh) * 2022-11-08 2023-04-04 云南电网有限责任公司 一种输电线路异构融合通信故障快速恢复方法及系统

Also Published As

Publication number Publication date
EP2464036A1 (en) 2012-06-13
US20120163797A1 (en) 2012-06-28
KR20120062864A (ko) 2012-06-14
KR101343529B1 (ko) 2013-12-19
CN101651625A (zh) 2010-02-17
US9036989B2 (en) 2015-05-19
ES2689469T3 (es) 2018-11-14
CN101651625B (zh) 2011-09-21
EP2464036A4 (en) 2016-06-15
EP2464036B1 (en) 2018-07-18

Similar Documents

Publication Publication Date Title
WO2011026350A1 (zh) 多业务恢复的选路装置及选路方法
EP1845656B1 (en) A method for implementing master and backup transmission path
US8493872B2 (en) System and method for monitoring the connectivity of a path between nodes in a network
US8014300B2 (en) Resource state monitoring method, device and communication network
US8335154B2 (en) Method and system for providing fault detection and notification for composite transport groups
WO2008098451A1 (fr) Procédé d'établissement de tunnel, dispositif de noeud de réseau et système de réseau
JP2002190825A (ja) トラフィックエンジニアリング方法及びそれを用いたノード装置
WO2007071189A1 (fr) Procede et dispositif de restauration d'un reseau maille partage
WO2008119294A1 (fr) Procédé et matériel de restauration du commerce en réseau
JP2005252368A (ja) 経路計算システム、経路計算方法、及び通信ノード
US20150186202A1 (en) Method and Device for Sending Inter-Domain Fault Information
WO2011157130A2 (zh) 路径建立方法和装置
WO2023015897A1 (zh) 一种光网络智能控制方法、装置及系统
WO2010028560A1 (zh) 在mesh网络中实现永久环网保护的方法
CN101192959B (zh) 一种自动交换光网络组播业务连接的恢复方法
WO2012106976A1 (zh) 一种故障保护方法及设备
US20140040476A1 (en) Method and system for network restructuring in multilayer network
US8868967B2 (en) Method and system for connection-error handling of service in an automatically switched optical network
CN101192956A (zh) 一种自动交换光网络组播业务组播树的计算方法
WO2006116896A1 (fr) Méthode de restauration rapide pour ason
US8462617B2 (en) Method for relieving failure, and packet communication device
CN101192957A (zh) 一种自动交换光网络组播业务路由的计算方法
CN101192986A (zh) 一种自动交换光网络组播业务组播树的恢复方法
US7855949B1 (en) Method and apparatus for bundling signaling messages for scaling communication networks
Zheng et al. Destination-initiating path restoration protocol for wavelength-routed WDM networks

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 10813272

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 13394154

Country of ref document: US

Ref document number: 2010813272

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 20127008553

Country of ref document: KR

Kind code of ref document: A