SYNCHRONISATION IN AN SDH NETWORK

Abstract: An SDH network is enclosed in which the occurrence of closed timing loops is prevented by causing each node to stamp the clock signal passing through that node with identifying data. In one embodiment, each node is operative to overstamp any node identifying data from preceding nodes and to indicate that the timing signal is not to be used for synchronisation purposes if the node to which it is being sent would result in a closed timing loop. In a second embodiment, node identifying data is added to a list, and if any node reads its own identifying data on that list, then it knows not to use the synchronisation signal. By counting the number of nodes through which the signal has passed, a means may be provided for preventing the occurrence of synchronisation reference chains of excessive length.

Description: SYNCHRONISAΗON IN AN SDH NETWORK This invention relates to an SDH (synchronous digital hierarchy) network. Communication systems using optical networks, and to a lesser extent radio networks are increasingly employing digital communication patterns. The European systems are being standardised by the CCITT on SDH whereas the American systems are known as SONET (synchronous optical networks) and operate on the ANSI standard. The SDH system uses a network-node interface and is compatible with SONET. With the network node system it is necessary to drive information around a network using a clock pulse and this is normally obtained from an external timing source. The invention is applicable to any such system. Within such a network it is important that the clock pulse used within a node for synchronisation purposes is of as high a quality as possible - i.e. that it has not deteriorated to the extent that there is uncertainty in its value. One problem where such deterioration can occur is when a closed timing loop forms such that the same timing signal is sent repeatedly around a loop and where deterioration occurs in the clock signal each time it passes through a node. It is one object of the invention to provide a means for preventing the occurance of such closed timing loops. In one aspect the invention provides an SDH network comprising a plurality of nodes connected by bidirectional links, an external clock signal being present at an input of one of said nodes which are arranged to pass the clock signal from node to node for synchronisation purposes, each node being operative to stamp the clock signal passing through the respective node with data identifying that node as part of a means for preventing the occurance of closed timing loops. Once ensuing nodes have knowledge of where the clock signal has been, a decision can be made as to whether a closed timing loop would occur. In one embodiment each node is operative to overstamp any node identifying data from preceding nodes through which the signal has passed. Such an arrangement provides an effective means, in particular for preventing the occurance of closed timing loops between adjacent nodes. Preferably in such a case each node is operative to read the identity of the node from which an incoming clock signal has arrived and, in the event that the clock signal is to be returned to the same node to transmit a signal indicative that the clock signal is not to be used. Within SDH information is carried in a framework comprising 270 bytes of information. These are arranged in columns in nine rows. The first nine columns are used for creating an overhead known as the section overhead (SOH). Synchronisation status indication (SSMB) is included as part of the section overhead. The byte of information referred to in a section overhead for synchronisation is known as S 1 and is used to indicate the quality of the timing source that supports the traffic to which it is attached. In the embodiment described above it is preferably the S 1 byte of the SSMB which carries the signal indicative data that the clock signal is not to be used. The embodiment described above is of particular use in preventing the occurance of timing loops between adjacent nodes within a network. In order to prevent the possibility of larger multi node loops, in an alternative embodiment, each node may be operative to add node identifying data to a list transmitted along with a clock signal, which list identifies all the preceding nodes through which the clock signal has passed and, in the event that the list contains data identifying that respective node, to not use the clock signal for synchronisation. In the event that a node finds it own identifying data in the list then the respective node will have detected a timing loop. It is also desirable that, irrespective of the presence of timing loops, a clock signal does not pass through too many nodes before being discarded. Preferably, with the embodiment described immediately above, each node is operative to count the number of nodes through which the clock signal has passed and, in the event that the number exceeds a predetermined value, to not use the clock signal for synchronisation. Embodiments of the invention will now be described by way of example with reference to the accompanying drawings in which; Figure 1 illustrates schematically an SDH network in the form of a ring; Figure 2 illustrates the network of Figure 1, after a fault condition has developed; Figure 3 illustrates a pair of adjacent nodes within an alternative, more complicated type of network; Figure 4 illustrates two nodes in operation according to one aspect of the invention: Figure 5 illustrates a more complicated multinode network according to the invention; and Figure 6 illustrates the network of Figure 5, but which uses a different aspect of the invention. Referring to Figure 1 an SDH network comprises four nodes 1, 2, 3, 4 arranged in a ring configuration and where each adjacent node is connected by a bidirectional communication link 5. Typically each node comprises a Network Element consisting of a multiplexer/demultiplexer which is provided for routing traffic and other signals to other switching elements through further inputs and outputs which are not shown in Figure 1 for reasons of clarity and simplicity. Since SDH is a synchronised network it is important that a high quality timing signal is available to all nodes within the network. As shown an external timing source 6 is input to the first node 1 within the network. As shown the external timing source is denoted by G811 which to use SDH terminology implies that the source is of the highest quality. This signal is then distributed along the data link 5 in such a way that there are no closed timing loops provided - i.e. each channel 5A or 5B is timed from a source which has at most only been looped back on itself once. If one of these sections fails as a timing source, as is illustrated in Figure 2 at point x, a timing loop is created since channel 5B will obtain timing information from the channel available to it - i.e. that incoming on channel 5A from node 4. This causes a synchronisation status indication to be inserted as part of a multiplex section overhead signal in the S 1 part of the section overhead. It should be appreciated that the detection of "looped" timing is not as easy to detect as the illustration indicates. For each node may be connected by multiple sections and hence the timing loop would possibly occur if timing from one of these sources were to be turned round on the same node but in a different section as is illustrated in Figure 3. The examples shown in Figures 1, 2 and 3 imply a very simple set of East/West directions to determine where the timing signal is looped back. When used with cross connect devices or elements residing in a meshed network, the determination of where the timing is turned around back towards the source from where it originated is less certain and thus a certain degree of network knowledge regarding its immediate surroundings must be imparted to the respective node. According to the invention, in one aspect, each node is operative to apend identifying data to a signal associated with the clock signal, such as the SSMB as in the SDH hierarchy. The SI byte contains four spare bits (1-4) and it is these that are used. The identifier necessitates a relatively large range and sixteen bits are allocated and multiframed as shown below; SI Bit Bit l Bit 2 Bit 3 Bit 4 Frame 1 l(FAW) BO B l Spare Frame 2 0 B2 B3 Spare Frame 3 0 B4 B5 Spare Frame 4 0 B6 B7 Spare Frame 5 0 B8 B9 Spare Frame 6 0 BIO B l l Spare Frame 7 0 B12 B12 Spare Frame 8 0 B14 B15 Spare FAW relates to the frame alignment word. Figure 4 shows the case where two nodes 10, 11 are connected by two separate bi-directional channels 5. A synchronisation source 6 of quality level G.811 is used to time each of the traffic bearing sections from the first node 10 to the second node 11. The SSMB attached to each of the sections indicates that the quality level is G811 and the source identifier is set to indicate that it is originated from the first node 10. The second node 11 uses the recovered clock signal from one of these sections to synchronise the traffic transmitted back to the first node 10. However the SSMB in this case is set to "do not use" as the node is able to ascertain that both channels 5A , 5B , are connected to the first node 10 and hence the timing would be turned around. The SI byte is set to "1111" to indicate the "do not use" signal. Figure 5 illustrates a more complicated network where each node 21, 22, 23, 24 is connected by two bi-directional sections 5, 5 2 with two spurs at the third node 23 connected to two further nodes 24 and 25. In each case where timing has been looped a "do not use" indication is transmitted in the SSMB. Each node is able to determine from which other node in the network timing has been received from and is then able to determine whether the timing signal has been turned around. As described above the arrangement removes the need for network knowledge to be downloaded from the controlling management centre to indicate potential timing loops. Furthermore network changes need little or no reconfiguration with respect to the timing data. The system may also have increased reliability since configuration is reduced to simply providing a synchronisation source identifier or node identifier for each element in the network and accordingly the chances of incorrect configuration are considerably reduced. The embodiment described above is of particular use in preventing the occurance of timing loops between adjacent nodes in a network. A second embodiment of the invention will now be described which allows multinode timing loops to be identified and can also provide a means of identifying through how many nodes a timing signal has passed. This can be important because deterioration occurs in the clock signal each time it is used for synchronisation purposes. For example, SDH standards currently specify that no more than twenty synchronised clocks should form part of a so called synchronised reference chain due to the deterioration of timing quality. In the second embodiment node identification information is added to a list each time the clock signal passes through a respective node. The identity information is appended to the SSMB, as is described below. As has been described previously the SI byte contains four spare bits (1-4). Each identifier necessitates a relatively large range and sixteen bits are allocated. A maximum of twenty identifiers are needed to form a list and an indication of the number of identifiers currently in that list is also provided. This structure is multiframed and is shown below. SI Bit Bit l Bit 2 Bit 3 Bit 4 Frame 1 l(FAW) BO B l Spare } Frame 2 0 B2 B3 Spare } Frame 3 0 B4 B5 Spare } Number Source IDs Frame 4 0 B6 B7 Spare } Frame 5 0 B8 B9 Spare } Frame 6 0 BIO Bl l Spare } Frame 7 0 B12 B12 Spare } Frame 8 0 B14 B15 Spare } Frame 9 0 B16 B17 Spare } Source ID#1 Frame 10 0 B18 B19 Spare } Frame 11 0 B20 B21 Spare } Frame 12 0 B22 B23 Spare } Frame 13 0 B24 B25 Spare } Frame 158 0 B314 B315 Spare } Frame 159 0 B316 B317 Spare } Frame 160 0 B318 B319 Spare } Frame 161 0 B320 B321 Spare } Source LD#20 Frame 162 0 B322 B323 Spare } Frame 163 0 B324 B325 Spare } Frame 164 0 B326 B327 Spare } Frame 165 0 B328 B329 Spare } Each time a synchronisation source is used by a node its identification data is appended to the list of nodes held in the SSMB and the number of source ID's is incremented by one. This new SSMB is then transmitted in each section that uses that source for timing. Figure 6 corresponds to Figure 5 except that the alternative technique is used. Each node is able to detect potential timing loops if its own identification data is present in the received SSMB. For example, the third node 23 knows that it cannot use timing from nodes 25 and 26 as its own identification information is present in the SSMB received from those nodes. Each node is also able to determine the length of the synchronisation reference chain and as such is able to determine whether the quality of timing has deteriorated beyond the point that it should be used. For example if a chain length of five were to be considered unacceptable, then the timing from the sixth node 26 could indicate in its SSMB a quality of "do not use".

Claims: CLAIMS 1. An SDH network comprising a plurality of nodes interconnected by bi-directional links, an external clock signal being present at an input of one of said nodes which are arranged to pass the clock signal from node to node for synchronisation, each node being operative to stamp the clock signal passing through the respective node with data identifying that node as part of a means for preventing the occurance of closed timing loops. 2. An SDH network according to claim 1 in which each node is operative to replace any node identifying data from proceeding nodes through which the signal has passed. 3. An SDH network according to claim 2 in which each node is operative to read the identity of the node from which an incoming clock signal has arrived and, in the event that the clock signal is to be returned to that same node, to transmit a signal indicative that the clock signal is not to be used for synchronisation. 4. An SDH network according to claim 3 in which the SSMB carries signal indicative that the clock signal is not to be used. 5. An SDH network according to claim 4 in which the SI byte of the SSMB carries the signal. 6. An SDH network according to claim 1 in which each node is operative to add node identifying data to a list transmitted along with the clock signal, which list identifies a plurality of preceding nodes through which the clock signal has passed and, in the event that the list contains data identifying the respective node, to not use the clock signal for synchronisation. 7. An SDH network according to claim 6 in which each node is operative to count the number of nodes through which the clock signal has passed and, in the event that the number exceeds a predetermined value, to not use the clock signal for synchronisation. 8. A method of preventing the occurance of closed timing loops within an SDH network, which network comprises a plurality of nodes interconnected by bi-directional links and which are arranged to pass an external clock signal from node to node for synchronisation purposes, said method including the step of stamping the clock signal passing through each node with data identifying that node. 9. An SDH substantially as described with reference to Figures 4, 5 and 6 of the drawings. 10. A method of preventing the occurance of closed timing loops in an SDH network substantially as described with reference to Figures 4, 5 and 6 of the drawings.

Inventors: CHAPMAN STEVEN TAYLOR, CHAPMAN, STEVEN, TAYLOR
Applicants: CHAPMAN STEVEN TAYLOR, PLESSEY TELECOMM, CHAPMAN, STEVEN, TAYLOR, GPT LIMITED
Application year: 1996
Main classification: H04J3
IPC codes: H04J3, H04Q11