Method for wavelength switch network restoration

[0001] This patent application claims priority from Provisional Patent Application Nos. 60/215,182 and 60/215,399, both filed Jun. 29, 2000 and are hereby incorporated by reference.

[0002] The present patent application is related to fiberoptic networks, and, in particular, to switches for WDM and DWDM network systems.

[0003] In WDM (Wavelength Division Multiplexing) fiberoptic networks, optical signals are sent at predetermined wavelengths over optical fibers. Each predetermined wavelength forms a communication channel in the network and the wavelength (or frequency) of the optical signal is used to control the destination of the signal through the network. An advanced version of WDM networks is the DWDM (Dense Wavelength Division Multiplexing) network in which the number of wavelength channel is increased by reducing the channel wavelength separation to 100 GHz, as set by the ITU (International Telecommunications Union). Hence the term, DWDM, is used herein to refer to both WDM and DWDM networks and other fiberoptic networks which rely upon wavelength to define communication channels, unless indicated otherwise.

[0004] In networks, including such fiberoptic networks described above, switches or routers are used to select paths for signals through the networks. In fiberoptic networks switches and routers not only direct optical signals from one optical fiber to another but also from one wavelength channel to another. The availability of light paths is critical to the users of a network. One way to provide reliability for a light path within the network is to explicitly provide for a redundant path beforehand. However, this approach does not utilize the bandwidth of the network efficiently, i.e., some of the available network capacity is removed for the backup reserve.

[0005] The present invention, on the other hand, is directed toward on-the-fly light path restoration to achieve efficient bandwidth usage and availability at the same time. New paths are quickly rerouted through the network in place of the lost light paths.

[0006] The present invention provides for a method of operation in an optical network having a plurality of interconnected nodes with each node capable of selectively switching optical signals in a first wavelength channel in an input fiber to any one of a plurality of wavelength channels and output fibers. The method restores connection between the nodes upon a failure of the network by maintaining at each of the nodes a synchronized database of network connections between the nodes; sending messages to other nodes to initiate restoration operations by a node noticing the failure; and recalculating the network connections around the failure by each node from the synchronized database at each node. Each node performs the recalculation independently.

[0007] The present invention also provides for a fiberoptic network having a plurality of interconnected nodes with each node capable of selectively switching optical signals in a first wavelength channel in an input fiber to any one of a plurality of wavelength channels and output fibers. A reserved wavelength channel between the interconnected nodes forms an optical supervisory channel to create a control network useful for network restoration and provisioning operations.

[0011] Traditional network restoration techniques utilize a central network controller. When the network controller is notified of a network failure, it may signal provisioning information to one or more nodes in the network to implement alternate routes for circuits affected by the failure. The calculation of the alternate routes may occur before or after the failure.

[0012] The present invention seeks to speed up this process by utilizing embedded, distributed control logic in each node. The chief benefit of this distributed approach is a significant saving of signaling times between the nodes of the network. FIG. 1A illustrates an exemplary fiberoptic network with a plurality of switch nodes. Five switch nodes 10–14 have been selected for the purposes of explanation. More or less switch nodes could be used. Each of the switch nodes 10–14 is connected to external data fiberoptic lines 20, 22, 24, 26 and 28 respectively, which are represented by dotted lines. For example, the switch node 10 is connected to a plurality of fiberoptic lines connected to sources and receivers (not shown) external to the fiberoptic network, which lines are represented by the line 20. Likewise, the switch node 11 is connected to a plurality of externally-connected fiberoptic lines represented by the line 22, and so on. Within the fiberoptic network, the switch nodes 10–14 are interconnected by fiberoptic lines 21, 23, 25, 27, 29, 30 and 31 carrying data signals control.

[0013] For example, the line 21 represents a plurality of fiberoptic lines carrying data between the switch nodes 10 and 11. For controlling the operations of the pair of switch nodes (and the other switch nodes), the network reserves a wavelength channel in one or more of the optical fibers to carry control signals. The reserved wavelength channel may be one of the ordinary WDM wavelength channels, or the reserved wavelength channel might be a channel specially created for control signals. For example, a current WDM standard specifies 64 wavelength channels in one optical fiber and the reserved wavelength channel would be the 65^th channel placed at the wavelength boundary of the 64 channels. Likewise, the node 10 also is connected to the line 29 which represents a plurality of fiberoptic lines carrying data and control signals between the switch nodes 10 and 14, and so forth.

[0014] These reserved wavelength channels form a optical supervisory channel for control and signaling operations for the FIG. 1A network. The supervisory channels are marked with the suffix “A” after the reference numerals of the fiberoptic lines 21, 23, 25, 27, 29, 30 and 31 between the nodes 10–14 in which are embedded an IP (Internet Protocol) router 10A–14A. A processor and memory in each embedded router 10A–14A handles the administrative control operations of the associated node, including the provisioning and restoration operations described below. The network of dotted lines 21A, 23A, 25A, 27A, 29A, 30A and 31A and the IP routers 10A–14A form a control network for the data network shown in FIG. 1A. For these control and signaling functions, IP signals and commands are used with IP routers from Cisco Systems, Inc. of San Jose, Calif.

[0015] Besides the reserved wavelength channels illustrated by the dotted lines 21A, 23A, 25A, 27A, 29A, 30A and 31A between the switch nodes 10–14, an alternative control network can be used, i.e., the Internet. As illustrated in FIG. 1B, the IP routers 10A–14A are also connected to the Internet by connections indicated by dotted lines 32–36.

[0016] The particular architecture of the switch nodes 10–14 is illustrated in FIG. 2. Each switch node is a fiberoptic switch which is connected, in this example, between N input optical fibers 40₁–40_N and N output optical fibers 41₁–41_N. Depending upon the particular switch node 10–14, these optical fibers 40₁–40_N and 41₁–41_N correspond to the FIG. 1A lines which represent externally-connected optical fibers 20, 22, 24, 26 and 8, and switch node-connected optical fibers 21, 23, 25, 27, and 29–31 in FIG. 1A. Being part of a DWDM fiberoptic network, the input and optical fibers 40₁–40_N and 41₁–41_N are in which each of the optical fibers carries signals in M wavelength channels. Three input and three output fibers are illustrated in FIG. 2 for purposes of simplicity. The switch operates so that optical signals in any wavelength channel on any input fiber can be switched to any wavelength channel on any output fiber.

[0017] The fiberoptic switch of FIG. 2 has demultiplexers 48, tunable channel cards 42, a switch fabric formed by switch modules 43, combiners 44 and a control unit 47. It should be noted that ordinary reference numerals refer to elements in the drawings and subscripts to the reference numerals are used to denote the specific instances of these elements. Each of the input fibers 40₁, 40₂–40_N are respectively connected to one of a corresponding number of demultiplexers 48₁, 48₂–48_N. Each of the demultiplexers separates the incoming optical signals by their wavelength channels. The signals of a separated wavelength channel are sent to a tunable channel card; hence for each demultiplexer 48₁, 48₂–48_N, there are M tunable channel cards, one for each wavelength channel. Each tunable channel card receives the optical signals in one wavelength channel and can translate the signals into a second wavelength channel, responsive to control signals from the control unit 47. Since there are N input fibers 40, each fiber having M channels, there are N×M tunable channel cards 42.

[0018] The tunable channel cards 42 are connected to a switch fabric, which, in conventional network switching terminology, constitutes the portion of a switch which performs the actual switching function. In the case of the FIG. 2 switch, the switch fabric is formed by M N×N switch modules associated with each one of the M wavelength channels. The inputs of each of the switch modules 43 are connected to each tunable channel card associated with the wavelength channel of that switch module. In the exemplary fiberoptic switch of FIG. 2, the switch module 43₁ which receives wavelength channel 1 is connected to tunable channel card 42₁₁, 42₂₁–42₃₁. The switch module 43_M receives the signals from the tunable channel cards receiving signals in the Mth wavelength channel, i.e., cards 42_1M, 42_2M–42_3M. Each of the switch modules 43 has each of its N outputs connected to one of the N combiners 44, which are each connected to one of the output optical fibers 41. The first output terminals of all the switch modules 43 are connected to the corresponding input terminals of the first combiner 44₁. The second output terminals of all the switch modules 43 are connected to the corresponding input terminals of the second combiner 44₂. This pattern is repeated for all N output terminals of each switch module 43₁–43_M

[0019] The N×N switch module 43 is formed from N 1-to-N switch elements 45 and N N-to-1 combiners 46. The number 1 output terminals of the switch elements 1-N are connected to the corresponding input terminals 1-N of the first combiner 46₁. The number 2 output terminals of the switch elements 1-N are connected to the corresponding input terminals 1-N of the second combiner 46₂. This pattern is repeated for all N output terminals of each switch element 45₁–45_N. Each switch element 45 corresponds to one of the inputs to the N×N switch module 43. To connect any input terminal to a specific output terminal of the switch module 43, the switch element 45 for that input terminal is set to the position for that output terminal. In this manner, signals on any combination of input terminals of the described fiberoptic switch can be sent to any combination of output terminals, with two constraints. Any single input terminal can only be connected to a single output terminal at a time. If multiple input terminals are connected to a single output terminals, the signals on the multiple input terminals must be noninterfering (i.e., the signals must be at different wavelengths/frequencies).

[0020] Operationally, to connect an incoming signal on some input fiber 40 at a first wavelength to an output fiber 41 on a different wavelength, two operations must be performed. First, the tunable channel card 42 which is associated with the incoming signal at the first wavelength on the input fiber 40 must be tuned to translate the signal to the correct outgoing wavelength. Also, the switch module 43 associated with that tunable channel card 42 must be configured to send the signal to the correct output fiber 41. These operations of the channel cards 42 and the switch modules 43 are directed by the control unit 47, which contains a processor unit, such as a microprocessor or a microcontroller, and memory 48. The memory 48 includes nonvolatile portions to hold software for restarting switch operations after the system goes down for any reason.

[0021] The reconfiguration process can be done fairly quickly. First, the input switch stage (i.e., the switch element 45) is turned off to disconnect the laser source in the tunable channel card 42. In an alternative arrangement, rather than switch elements 45 with off/on functions, off/on switches are placed between the switch elements 45 and the tunable channel cards 42, and the switch for the particular switch element 45 is turned off to disconnected the laser source in the tunable channel card 42. Then the laser is tuned to the new wavelength and the switch elements 45 in the corresponding switch module 43 are set to the correct states for the new configuration and the connection turned back on.

[0022] Hence these switches direct optical signals through designated optical fibers 20–31 and through the M wavelength channels in the FIG. 1A optical network. More details of these switches may be found in U.S. application Ser. No. 09/648,518, entitled, “Scalable DWDM Network Switch Architecture With Wavelength Tunable Sources,” filed Aug. 25, 2000 by Chien-Yu Kuo, Niraj Gupta and Ronald Garrison, and assigned to the present assignee and which is incorporated herein by reference. However, it should be appreciated that the present invention is also applicable to fiberoptic networks with routers, hosts, and other types of switches at the nodes of the network.

[0023] The optical supervisory channels in the optical fibers 21, 23, 25, 27, 29–31 carry signaling and control signals between the switch nodes 10–14 for the restoration and provisioning operations. As stated previously, the signaling and control signals are in the form of IP commands through the IP routers 10A–14A. If one or more of the network component fails, network operations must be restored. For example, in the exemplary network of FIG. 1A, one or more of the optical fibers 20–31 may be cut to cause the loss of all the communication links of the optical fiber, or a laser source in a channel card may become inoperative to cause the loss of one link. Such a condition requires that the signals be rerouted and the links in the network be restored. Besides such a system-initiated recovery from a hardware failure, a network user might wish to initiate a configuration or reconfiguration of the network. Such an operation is often termed provisioning.

[0024] The optical supervisory channels indicated by the dotted lines 21A, 23A, 25A, 27A, 29A–31A in FIG. 1B are used for restoration and provisioning operations and in FIG. 2, these channels are symbolically represented by fibers 49A, which are arbitrarily shown as three in number, and coupled to an IP router 50A. The optical signals received on these optical supervisory channels are converted into electrical signals by the IP router 50A for input into the control unit 47. Similarly, the control unit 47 communicates to other control units in the switches of the network by converting the control unit's electrical output signals into optical signals and transmitting the signals through the IP router 50A onto the fibers 49A.

[0025] To handle these operations, restoration and provisioning software is stored in each switch node 10–14. The software contains both switch node management control software for each switch node and management system software for the whole mesh network. The two software components are divided and the management system software can be placed in the switch node or in a unit separated from the switch node, such as a standalone UNIX/NT box. The software interacts with two management information databases also stored at each switch node. One database is a local management information database which holds information about the switch node and the other is a network management information database which contains the cross-connect provisioning status across the entire mesh network. Only the restoration and provisioning operations can result in a database change. But the network management information database at each switch node must be guaranteed to be consistent across the entire mesh network with the other switch nodes for proper operation of the network. This is carried out by network synchronization.

[0026] To guarantee the database on each switch node is synchronized, the network operation is carried out either at every node or none at all. The initiating node of the operations determines whether the operation is successful or not, based on the acknowledgment from each node. The transaction is completed if every node carries out the operation successfully. Otherwise, the initiator sends out an abort transaction message to every node to cancel the operation.

[0027] The restoration operation is carried out in the following manner: First, a network restoration initiation message is broadcast through the network by the initiating switch node, i.e., the node noticing the hardware failure. The restoration calculation is done independently by each node at each local management information database upon receiving the restoration message and is coordinated by the initiating switch node. The calculation is based on the network management information database which is synchronized to be consistent at all times with the management information databases at the other nodes.

[0028] For the provisioning operations, a provisioning command modifies the cross-connect setup of the network and passes through a multiphase transaction protocol. First, the provisioning command is sent through the entire network to reserve the resource to be provisioned. The switch node issuing the command receives responses from all the switch nodes of the network. If all the responses are affirmative, the commanding node sends a “do-it” command to the entire network to do the actual provisioning operations as commanded. All the switch nodes send responses back to the commanding node as to the success of the provisioning operation and the commanding node either commits or aborts the entire transaction depending upon the responses.

[0029] Since a restoration transaction has higher priority than a provisioning transaction, the restoration transaction may or may not pre-empt the provisioning transaction before initiating the restoration. This depends upon whether the database is synchronized or not. At any time there can be no more than two transactions in progress, one provisioning transaction and one restoration transaction. Each transaction has a unique transaction number across the whole network.

[0030] To carry out these operations, each switch node has a network operation transaction state machine with the initial state as the Idle state. The switch node also keeps a Next Available Transaction Number (NATN), which is initialized to a default value and is then synchronized once it joins the network. The states are as follows:

• • [0031] Idle Neither Provisioning nor Restoration transaction is in progress.
  • [0032] Init_RSV Provisioning transaction is in progress. The node is the initiator of this transaction and is in Reserved (RSV) state.
  • [0033] RSV Provisioning transaction is in progress. The node is NOT the initiator of this transaction and is in Reserved state.
  • [0034] Init_CMT Provisioning transaction is in progress. The node is the initiator of this transaction and is in Committed (CMT) state.
  • [0035] CMT Provisioning transaction is in progress. The node is NOT the initiator of this transaction and is in Committed state.
  • [0036] Init₁₃ RST Restoration transaction is in progress. The node is the initiator of this transaction and is in Restored (RST) state.
  • [0037] RST Restoration transaction is in progress. The node is NOT the initiator of this transaction and is in Restored state.
  • [0038] Init_RSV & Init_RST Both Provisioning and Restoration transactions are in progress. The node initiates both transactions and is in Reserved and Restored State for each transaction respectively.
  • [0039] Init_CMT & Init_RST Both Provisioning and Restoration transactions are in progress. The node initiates both transactions and is in Committed and Restored State for each transaction respectively.
  • [0040] RSV & RST Both Provisioning and Restoration transactions are in progress. The node initiates NEITHER transaction and is in Reserved and Restored State for each transaction respectively.
  • [0041] CMT & RST Both Provisioning and Restoration transactions are in progress. The node initiates NEITHER transaction and is in Committed and Restored State for each transaction respectively.
  • [0042] Init_RSV & RST Both Provisioning and Restoration transactions are in progress. The node initiates the Provisioning transaction but NOT the Restoration transaction and is in Reserved and Restored State for each transaction respectively.
  • [0043] Init_CMT & RST Both Provisioning and Restoration transactions are in progress. The node initiates the Provisioning transaction but NOT the Restoration transaction and is in Committed and Restored State for each transaction respectively.
  • [0044] RSV & Init_RST Both Provisioning and Restoration transactions are in progress. The node initiates the Restoration transaction but NOT the Provisioning transaction and is in Reserved and Restored State for each transaction respectively.
  • [0045] CMT & Init_RST Both Provisioning and Restoration transactions are in progress. The node initiates the Restoration transaction but NOT the Provisioning transaction and is in Committed and Restored State for each transaction respectively.

[0046] The transition from state to another in a switch node is triggered by a message or an event. A triggering message is generated by an operation-initiating switch node for transmission to the other switch nodes. A triggering event results from a user request or acknowledgment from other node. FIG. 3 illustrates the possible transitions for a switch node from one state to another as a result of a message or event. States are indicated by boxes and the transitions are indicated by arrows between the states and labeled with the triggering message or event. For convenience, the table below lists the possible transitions from one state to another, the transition's triggering message or event, the resulting actions at the transitioning switch node with transition reference numerals as used in FIG. 3.

[0047]

	Trigger
Ref.	(event/	From-	To-
num.	msg)	State	State	Action
51	RSV	Idle	RSV	Reserve in management
	msg			information database.
				Send confirmation back to
				initiating node.
				PROV_TN = NATN
				Increment NATN.
52	PROV	Idle	Init—	Reserve in management
	event		RSV	information database.
				Send RSV msg with NATN to
				every node.
				PROV TN = NATN.
				Increment NATN.
53	RST	Idle	RST	Restore in management
	msg			information database and
				hardware as requested.
				Send confirmation back to
				initiating node.
				RST_TN = NATN.
				Increment NATN.
54	RST	Idle	Init—	Restore in management
	event		RST	information database and
				hardware.
				Send RST msg with NATN to
				every node.
				RST_TN = NATN.
				Increment NATN.
		Idle	Idle
55	RSV—	Init—	Idle	If receive RSV—
	FAIL	RSV		DENIED msg, abort PROV
	event			local and send ABORT—
				PROV msg to every node.
				(If timeout, abort PROV and
				exclude the timed out nodes
				from topology. Retry
				PROV again.)
56	CMT	Init—	Init—	Commit in management
	event	RSV	CMT	information database and
				hardware.
				Send CMT msg to every
				node.
57	RST	Init—	Init—	Restore in management
	event	RSV	RSV	information database and
			Init—	hardware. Send RST msg
			RST	with NATN to every node.
				Increment NATN.
58	RST msg	Init—	RST	Abort PROV locally.
	TN =	RSV		Send ABORT_PROV
	PROV—			msg to every node.
	TN			Restore in management
				information database and
				hardware as requested.
				Send confirmation
				back to initiating node.
59	RST msg	Init—	Init—	Restore in management
	TN =	RSV	RSV	information database and
	NATN		RST	hardware as requested.
				Send confirmation to
				initiating node.
				Increment NATN.
		Init—	Init—
		RSV	RSV
60	ABORT_PROV	RSV	Idle	Abort PROV locally.
	msg
61	CMT msg	RSV	CMT	Commit in management
				information
				database and hardware.
				Send confirmation back
				to initiating node.
62	RST msg	RSV	RST	Abort PROV locally.
	TN =			Restore in management
	PROV—			information database
	TN			and hardware
				as requested.
				RST_TN = msg TN
				Send confirmation to
				initiating node.
63	RST msg	RSV	RSV	Restore in management
	TN =		RST	information database and
	NATN			hardware as requested.
				Send confirmation to
				initiating node.
				Increment NATN
64	RST	RSV	RSV	Restore in manage-
	event		Init—	ment information
			RST	database and hardware.
				Send RST msg with NATN to
				every node.
				Increment NATN.
		RSV	RSV
65	CMT_FAIL/	Init—	Idle	If CMT_FAIL, abort
	CMT_DONE	CMT		PROV locally and send
	event			ABORT_PROV msg
				to every node.
				(If timeout, abort PROV
				and exclude the timed out
				nodes from topology. Retry
				PROV again.)
				If CMT_DONE, send
				PROV_DONE msg to
				initiating node.
66	RST event	Init—	Init—	Restore in management
		CMT	CMT	information
			Init—	database and hardware.
			RST	Send RST msg with NATN
				to every node.
				Increment NATN.
67	RST msg	Init—	Init—	Restore in management
		CMT	CMT	information database
			RST	and hardware as requested.
				Send confirmation to initiating
				node. Increment NATN.
		Init—	Init—
		CMT	CMT
68	ABORT_PROV/	CMT	Idle	If ABORT_PROV, abort
	PROV_DONE			PROV locally.
	msg			If PROV_DONE, do nothing.
69	RST msg	CMT	CMT	Restore in management
			RST	information database
				and hardware
				as requested.
				Send confirmation to
				initiating node.
				Increment NATN.
70	RST event	CMT	CMT	Restore in
			Init—	management
			RST	information database
				and hardware.
				Send RST msg with
				NATN to every node.
				Increment NATN.
		CMT	CMT
71	RST_DONE/	Init—	Init—	If RST_DONE, do nothing
	ABORT_RST	RSV	RSV	IF ABORT_RST, abort
	msg	RST		RST in management
				information database and
				hardware.
72	CMT event	Init—	Init—	Commit in management
		RSV	CMT	information database
		RST	RST	and hardware.
				Send CMT msg to every
				node.
73	RSV_FAIL	Init—	RST	Abort PROV locally.
	event	RSV		Send ABORT_PROV
				msg to every node.
		Init—	Init—
		RSV	RSV
		RST	RST
74	RST_DONE/	Init—	Init—	If RST_DONE, send
	RST_FAIL	RSV	RSV	RST_DONE msg
	event	Init—		to every
			RST	node.
				If RST_FAIL,
				abort RST locally and
				send ABORT_RST
				msg to every node.
75	CMT event	Init—	Init—	Commit in management
		RSV	CMT	information database and
		Init—	Init—	hardware.
		RST	RST	Send CMT msg to every
				node.
76	RSV_FAIL	Init—	Init—	Abort PROV locally.
	event	RSV	RST	Send ABORT_PROV msg
		Init—		to every node.
		RST
		Init—	Init—
		RSV	RSV
		Init—	Init—
		RST	RST
77	RST_DONE/	Init—	Init—	If RST_DONE,
	ABORT_RST	CMT	CMT	do nothing.
	msg	RST		If ABORT_RST, abort
				RST locally.
78	CMT_DONE/	Init—	RST	If CMT_DONE, send
	CMT_FAIL	CMT		PROV_DONE msg
	event	RST		to every node.
				If CMT_FAIL, abort
				PROV locally and
				send ABORT_PROV
				msg to every node.
		Init_	Init_
		RSV	RSV
		Init—	Init—
		RST	RST
79	RST_DONE/	Init—	Init—	If RST_DONE, send
	RST_FAIL	CMT	CMT	RST_DONE msg to
	event	Init—		every node.
		RST		If RST_FAIL, abort RST
				locally and send ABORT—
				RST msg to every node.
80	CMT_DONE/	Init—	Init—	If CMT_DONE, send
	CMT_FAIL	CMT	RST	PROV_DONE msg
	event	Init—		to every node.
		RST		If CMT_FAIL, abort PROV
				locally and send ABORT—
				PROV msg to every node.
		Init_	Init_
		CMT	CMT
		Init—	Init—
		RST	RST
81	RST_DONE/	Init—	Idle	If RST_DONE,
	RST_FAIL	RST		send RST_DONE
	event			msg to every node.
				If RST_FAIL,
				abort RST locally
				and send ABORT_RST msg
				to every node.
		Init—	Init—
		RST	RST
82	RST_DONE/	RST	Idle	If RST_DONE, do nothing
	ABORT_RST			If ABORT_RST,
	msg			abort RST locally.
		RST	RST
83	RST_DONE/	RSV	RSV	If RST_DONE, do nothing.
	ABORT_RST	RST		If ABORT_RST,
	msg			abort RST locally.
84	CMT msg	RSV	CMT	Commit in management
		RST	RST	information
				database and hardware.
				Send confirmation to
				initiating node.
85	RSV_FAIL	RSV	RST	Abort PROV locally.
	msg	RST
		RSV	RSV
		RST	RST
86	RST_DONE/	RSV	RSV	If RSV_DONE, send
	RST_FAIL	Init—		RST_DONE msg to
	event	RST		every node.
				If RST_FAIL, abort RST
				locally and send ABORT—
				RST msg to every node.
87	CMT msg	RSV	CMT	Commit in management
		Init—	Init—	information database
		RST	RST	and hardware.
88	RSV_FAIL	RSV	Init—	Abort PROV locally.
	msg	Init—	RST
		RST
		RSV	RSV
		Init—	Init—
		RST	RST
89	RST_DONE/	CMT	CMT	If RST_DONE, do nothing.
	ABORT_RST	RST		If ABORT_RST, abort
	msg			RST locally.
90	PROV_DONE/	CMT	RST	If PROV_DONE, do nothing.
	ABORT_PROV	RST		If ABORT_PROV,
	msg			abort PROV locally.
		CMT	CMT
		RST	RST
91	RST_DONE/	CMT	CMT	If RST_DONE, send RST—
	RST_FAIL	Init—		DONE msg to every node.
	event	RST		IF RST_FAIL, abort RST
				locally and send ABORT—
				RST msg to every node.
92	PROV_DONE/	CMT	Init—	If PROV_DONE, do nothing.
	ABORT_PROV	Init—	RST	If ABORT_PROV,
	msg	RST		abort PROV locally.
		CMT	CMT
		Init—	Init—
		RST	RST

[0048] In the described distributed network approach, the principal objective of the signaling protocol is to disseminate the failure event information to every node in the network as quickly as possible. Hence signaling is used for the failure event information only, and not to cross-connect provisioning information. Broadcast mechanisms are used for signaling, which use pre-provisioned fixed alternate routes through the optical supervisory channels.

[0049] Each failure event message is identified by the source node and a node-specific Failure Event Message Number. Each receiving node keeps track of each other node's current Failure Event Message Number. If a duplicate is received, it is ignored and discarded. In the case of a bi-directional fiber cut, two nodes detect the same network failure and each initiate the broadcast signaling. In this case, other nodes in the network must reconcile the two failure event messages as describing the same single event. In order to perform such reconciliation, each node starts a timer upon receipt of a failure event message. If another “similar” failure event message is received before expiration of the timer, then the new message is ignored and discarded.

[0050] In order to better utilize the embedded IP (Internet Protocol) routers 10A–14A of each node 10–14, multiple fixed alternate routes are pre-provisioned from each node to every other node in the network. Upon local detection of a network failure, a node transmits a series of IP packets, each containing the failure event message, one for each fixed alternate route to each node. The IP router network (illustrated by the network in FIG. 1B) then handles the delivery of the IP packets to their final destinations. By provisioning more than one route between each pair of nodes, the network is guarded against changes in the network topology, for example, a fiber cut. If one route is blocked by a failed fiber, the other IP packet following the other route has a continuous path to its destination.

[0051] The receiving nodes detect and discard duplicate messages. Hence, after a switch node receives a failure event message, the node participates in the flooding protocol described above. The switch node then releases all the wavelength channel resources (i.e., bandwidth) of the optical circuits available for use by alternate routes, despite the network failure. Then in priority order, the shortest path for each affected circuit is recalculated, using only available, i.e., in service but unused, network resources. The optical circuits are restored in a predetermined prioritized order in this manner.

[0052] Each switch node recalculates a new path for each circuit whose active path had traversed the failed link. Each node evaluates the results of the path calculation to determine whether or not that node must execute any new cross-connects. If so, the cross-connects are executed. If not, then that node takes no action, and its participation in the network restoration is completed. All switch nodes perform the identical deterministic calculation, and therefore arrive at the same conclusion.

[0053] To determine the alternate routes, the switch nodes use a version of E.W. Djikstra's “Shortest Path First” (SPF) algorithm to route circuits. U.S. patent application Ser. No. 09/896,843, entitled “Improved Shortest Path First Restoration Routing In a Fiberoptic Network,” filed of even date by Peter Abrams and assigned to the present assignee, and which application is incorporated herein by reference, describes the modified implementation of the SPF algorithm in its operation in the exemplary FIGS. 1A and 1B network. Also the particular link metrics, such as number of hops, path delay, link cost, etc., used in the algorithm are also described.

[0054] Therefore, while the description above provides a full and complete disclosure of the preferred embodiments of the present invention, various modifications, alternate constructions, and equivalents will be obvious to those with skill in the art. Thus, the scope of the present invention is limited solely by the metes and bounds of the appended claims.