EP0965193A1 - Hierarchisches synchronisierungsverfahren - Google Patents

Hierarchisches synchronisierungsverfahren

Info

Publication number
EP0965193A1
EP0965193A1 EP97942970A EP97942970A EP0965193A1 EP 0965193 A1 EP0965193 A1 EP 0965193A1 EP 97942970 A EP97942970 A EP 97942970A EP 97942970 A EP97942970 A EP 97942970A EP 0965193 A1 EP0965193 A1 EP 0965193A1
Authority
EP
European Patent Office
Prior art keywords
synchronization
node
reserve
signature
link
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP97942970A
Other languages
English (en)
French (fr)
Inventor
Jukka Kainulainen
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nokia Oyj
Original Assignee
ABB Industry Oy
Nokia Oyj
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 ABB Industry Oy, Nokia Oyj filed Critical ABB Industry Oy
Publication of EP0965193A1 publication Critical patent/EP0965193A1/de
Withdrawn legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J3/00Time-division multiplex systems
    • H04J3/02Details
    • H04J3/06Synchronising arrangements
    • H04J3/0635Clock or time synchronisation in a network
    • H04J3/0679Clock or time synchronisation in a network by determining clock distribution path in a network

Definitions

  • the present invention relates generally to the synchronization of communications networks and particularly to improvement of the interference immunity of network synchronization in a communications network employing message-based synchronization.
  • node is used to denote a junction point of transmission sections in a communications network. Accordingly, a node may be formed by any apparatus or equipment such as a branching unit or a cross-connection device.
  • the nodes of the system are interconnected by transmission links serving for the information transfer needs of the system.
  • the same links also carry the clock frequency of the transmitting node to the receiving node.
  • Each node selects as the source of its own clock frequency either the frequency from a neighbouring node, the frequency of its own clock source or a frequency brought into the node from an external source through a separate clock input.
  • the master clock To force all nodes of a system to operate at the same clock frequency, in most cases the system is preferentially synchronized to a single clock source called the master clock.
  • all the nodes of the system having a direct connection with the selected master clock will be synchronized with said master clock, while more remote nodes connected with said nodes of direct connection, however, not having a direct connection with the master clock, will be synchronized with said nodes situated closer to the master clock.
  • the nodes more remote from the master clock will be synchronized to those nodes which are located one link closer to the master clock.
  • the nodes of the system exchange synchronization messages with each other. These messages carry information which permit the individual nodes to select the optimal clock source for their clock synchronization.
  • the nodes of the system are prioritized, and the system tends to synchronize itself with the clock frequency of the node possessing the highest priority level. Normally, a given priority level can be assigned to one node of the system only.
  • the synchronization messages normally contain information on the clock source used by the transmitting node, the priority level of the transmitting node, and a parameter value indicating the quality of the clock signal.
  • any single node can select the synchronizing source for its own clock signal to be the clock frequency of that neighbouring node whose clock frequency originates from a desired node and is of the highest quality.
  • each node uses its internal clock as its clock frequency source.
  • the node selects the clock frequency of the highest-priority neighbouring node as the source of its clock frequency.
  • Fig. 1 is shown in steady state a system MS utilizing message- based synchronization.
  • the priorities assigned to the nodes are indicated by numerals marked inside the circles representing the nodes. The smaller the value of the numeral the higher the priority of the node.
  • the synchronization messages sent by the individual nodes are different from each other and have a format dependent on the message- based synchronization method used in the system.
  • Distribution of the clock frequency from the master clock (node 1) to the other nodes of the system is indicated with solid lines. While the internode links indicated with dashed lines are not used for system synchronization under normal conditions, they are available during state change situations.
  • the basic concept of message-based synchronization is that the system operator defines the synchronizing hierarchy of the nodes by assigning each node a dedicated signature serving to indicate the level of the node in the hierarchy, and the system is allowed to synchronize itself in a self- contained manner with the defined master clock utilizing all existing internode links as required. If the chain of synchronizing links to the master clock is disrupted and a redundant chain of internode links is not available, or the master clock fails, the system will assume synchronization with a node of the next highest level. Such a reaction to a change in the system synchronization takes place via message interchange between the nodes.
  • the synchronization hierarchy is reconstructed from the point of synchronization discontinuity onward (that is, hierarchically outward from the master clock node of the system).
  • the end result is a hierarchy structure approximating the original situation, however, having the faulty link replaced by a functional link with the rest of the system configuration remaining almost unchanged.
  • any link can be utilized for synchronization purposes provided that it momentarily fulfills the specified quality criteria. Even when a link is known to be prone to fail, it may still be used under normal conditions for synchronization provided that said link at the moment fulfills the specifications defined for synchronization, and moreover, happens to be situated in such a location of the network that the message-based synchronization method can utilize it. If a failure then occurs in such a fault-sensitive link used for synchronization, the message-based synchronization method has to initiate its synchronization recovery routine for the purpose of reconstructing its synchronization hierarchy in at least some areas of the network. Hereby, the quality of synchronization may deteriorate temporarily and uncontrolled bit slips can occur.
  • the goal of the invention is achieved by the solution specified in the appended independent claims.
  • the invention is based on the concept of explicitly defining certain links as reserve paths of synchronization, said arrangement being implemented so that the node equipment mark the synchronization signatures received over such reserve links with a special reserve link identifier.
  • said links are defined as reserve links only with regard to synchronization, not with regard to normal data transmission.
  • the signature received over the normal path is always assigned a higher priority.
  • Each node which synchronizes itself with a signal whose synchronization signature indicates that the signal has passed over a reserve path or link must preserve in its outgoing synchronization signature the information indicating the use of such a reserve path.
  • network synchronization can be controlled through inhibiting the synchronization use of certain paths under normal conditions even if the message-based synchronization method would prefer the use of such paths.
  • these reserve paths may be utilized in a fault situation provided that no other paths can be established to the master clock source.
  • the arrangement according to the invention permits the mutual prioritization of synchronization sources to be distinctly separated from the use of a reserve path. Resultingly, the behaviour of the synchronization method is always precisely known and real-time information is available on a possible use of a reserve path.
  • Figure 1 shows a communications system using a message-based synchronization when the system is synchronized with the clock frequency of the master source
  • Figure 2 shows a network using a self-organizing master-slave (SOMS) synchronization scheme in its initial state;
  • SOMS self-organizing master-slave
  • Figure 3 shows the network of Fig. 2 in steady state
  • Figures 4a-4d show a diagram elucidating the method according to the invention by a sequence of four different states of a network using message-based synchronization
  • Figure 5 shows a flow diagram of the comparison process according to the invention of synchronization signatures
  • Figure 6a shows an apparatus suited for implementing the method according to the invention in single node of the network
  • Figure 6b shows an alternative embodiment of node equipment
  • Figure 7a shows an example of the structure of the synchronization message
  • Figure 7b shows an exemplifying embodiment of the transfer of the synchronization signature and the reserve path information in the synchronization message illustrated in Fig. 7a.
  • FIG. 2 therein is illustrated a system utilizing Self- Organizing Master-Slave (SOMS) synchronization (which is a well-known message-based synchronization technique), said system in the illustrated case comprising five nodes (or apparatuses) indicated by reference numerals 1-5 according to their assigned level in the synchronization hierarchy.
  • SOMS Self-Organizing Master-Slave
  • the master node of the network has the smallest-value SOMS address.
  • the nodes interchange messages containing said SOMS addresses.
  • the nodes can identify each other by virtue of these address numbers and establish a synchronization hierarchy permitting the entire network to be synchronized with the master clock source node.
  • the synchronization messages interchanged continuously in the network are dependent on the type of the message- based synchronization method used.
  • each transmitting node sends a message with an individual content.
  • the synchronization message is comprised of three distinct parts: a frame structure, a signature and a checksum.
  • the SOMS signature is the most important part of the SOMS message.
  • the signature is formed by three consecutive numbers D1-D3:
  • D1 indicates the origin of the synchronizing clock frequency used by the transmitting node, that is, the SOMS address of the node acting as the master clock source node for the transmitting node.
  • D2 is a connection quality parameter, which typically is given a value proportional to the distance of the receiving node to the node indicated by D1. The distance is expressed as the number of nodes between the source node and the receiving node.
  • D3 is the SOMS address of the transmitting node. Each node (or device) performs continuous comparison between the incoming SOMS signatures and selects the one with the smallest value. While the fields D1 , D2 and D3 are directly combined in the signature into a single number formed by the direct combination (D1 D2D3) of the fields (in the text, however, a hyphen is used to separate the different parts of the signature, e.g., D1-D2-D3).
  • the primary criterion in the selection of the smallest-value address will be based on the SOMS address (D1) of the node appearing to the preceding nodes as the master clock source, which means that any node aims to synchronize itself with a signal whose clock frequency source can be traced to a node of the smallest possible address.
  • the entire network in steady state will run synchronized with the same master node (because the master node of the entire network has the smallest-value SOMS address). If two or more of the incoming signals are synchronized with the same master node, the receiving node will select the master clock frequency from the transmitting node via which the path to the master node is shortest (i.e., the value of D2 is smallest).
  • the last selection criterion is based on the SOMS address (D3) of the SOMS-message transmitting node, whereby the smallest value of this address is chosen if the preceding steps of address selection have not been able to rank the incoming signals.
  • the node After a node has validated one of its neighbouring nodes as a new synchronizing source after comparison of the incoming signal SOMS signatures, the node has to reconstruct its own SOMS signature.
  • the new value of the SOMS signature can be derived from the selected smallest-value SOMS signature as follows: the first field (D1) is left unchanged, the value of the second field (D2) is incremented by one and the third field (D3) is replaced with the SOMS address of the node itself.
  • each node has an internal SOMS signature of the format X-O-X, where X is the SOMS address of the node itself. If none of the SOMS messages in the incoming signals has a value smaller than in the internal SOMS signature of the node, the node will select the internal oscillator of the node, or possibly a synchronizing signal present at the external clock signal input of the node, for synchronizing the clock of the node. Obviously, the internal SOMS signature of the node will then be used in the outgoing SOMS message.
  • the nodes send the SOMS messages continuously in each direction in order to assure maximally rapid emission of altered synchronization information in the SOMS signatures and to keep neighbouring nodes continuously informed of each others' operating status.
  • the incoming SOMS messages must be accepted and the SOMS signatures must be separated therefrom.
  • the SOMS signature of the message is accepted immediately for comparison if the message is faultless.
  • the incoming signal from the transmission link has an acceptable SOMS signature and the received messages carrying the same, unchanged signature are faultless, the situation remains unchanged. If the received SOMS message is found corrupted, the current SOMS signature is retained valid until three successive faulty SOMS messages have been received. Then, the SOMS signature is ex- eluded from the comparison process. This kind of waiting for three consecutive SOMS messages serves to eliminate temporary disturbances.
  • the comparison process activates a delay corresponding to three consecutive SOMS messages before the currently selected SOMS signature is invalidated. If the link fails entirely, the SOMS signature is discarded immediately. Equally, when interference imposed on the incoming signal makes it impossible to extract an SOMS signature of sufficient quality for comparisons, the SOMS signature of that link is discarded. Instead, the comparison process is carried out using the default SOMS signature for that incoming link having all the fields (D1 , D2 and D3) set to their maximum values (MAX-MAX-MAX).
  • each node uses its internal source of synchronization frequency, whereby the node sends the other nodes its internal SOMS signature of the format X-O-X. This signature is also compared with the other incoming SOMS signatures. If none of the incoming signatures has a smaller value than that of the node's internal signature, the node will continue using its internal synchronization source.
  • the SOMS-synchronized network shown therein is in its initial state when no node (or device) has yet had time to process the incoming SOMS messages. All the nodes give the highest priority to the internal SOMS signature of the node, because no other signatures have been processed so far.
  • the incoming SOMS signatures of each node are marked beside the node, and the selected signature is marked inside the outline frame (herein it must be noted that in the initial state shown in Fig. 2, all the nodes use their internal sources of synchronization).
  • Links used for synchronization are drawn with a solid line, and the standby links are indicated by dashed lines (whereby it must be noted that in the initial state illustrated in Fig. 2, all the lines represent standby links).
  • node 1 After the nodes have had some time to process the incoming SOMS messages, node 1 stays synchronized with its internal clock source, nodes 2 and 4 will synchronize with node 1 on the basis of its signature 1-0-1 , node 3 will synchronize with node 2 (signature 2-0-2) and node 5 with node 3 (signature 3-0-3). By the same token, the nodes will rewrite their own new SOMS signatures in the above-described fashion and attach the signature to the outgoing SOMS message. After the network has assumed steady state, its configuration will be as shown in Fig. 3. Herein, all the nodes are synchronized with the master node 1 via the shortest possible path.
  • one or more of the transmission links of the network may have a higher failure rate due to, e.g., different character of said link or links with regard to other links of the network.
  • the links which are known prone to fail are defined according to the invention as reserve links in synchronization use by means of complementing the synchronization message passing (or passed) via such a link with additional information indicating the passage of the respective synchronization signature via a reserve link.
  • Figs. 4a-4d is illustrated the effect of the present method on the synchronization behaviour of the network through a drawing presenting a network of eleven nodes in four different states.
  • the master clock of the network is node 1 as indicated by oblique hatching of the circle representing the node.
  • the message-based system is in the examples assumed to be SOMS-synchronized, the invention may as well be applied to other message-based synchronization techniques in which the synchronization signature transferred in the network contains information on the master clock identity or equivalent data.
  • Solid lines in similar manner as those of Figs. 2 and 3 are used in the diagrams to indicate connections along which synchronization takes place.
  • Fig. 4a is shown the initial state in which the synchronization process advances along paths 1®2®4®7®9, (1®)2®5 as well as 1®3®6®8®10 and (1®3®6®)8®11.
  • the transmission links of the network are assumed to be optical fiber links with the exception of two links (marked with reference symbols X and Z) that are assumed to be radio links which by their character are more sensitive to interference. Hence, the latter links are defined as reserve links for synchronization.
  • synchronization next proceeds as shown in Fig.
  • Fig. 5 is shown a flow diagram illustrating the comparison of synchronization signatures occurring in each node of a network using a message-based SOMS synchronization method.
  • a "new" synchronization signature received from one interface is compared with a signature received from some other interface called the "old" synchronization signature in the figure.
  • step 51 the values of the signa- ture parameters D1 are compared. If the value of parameter D1 in the new signature is better (having a smaller value) than in the old signature, a direct decision is made that the new signature is of higher quality, irrespective of whether the new and/or old signature has been received over a reserve link or not. Correspondingly, if the parameter D1 of the old signature is better, a direct decision is made in favour of the old signature ignoring in a similar manner whether the new and/or old signature have been received over a reserve link. By contrast, if the values of parameters D1 are equal, the comparison is made on the reserve link information carried in the synchronizing signatures.
  • Step 52 is first performed to test if the new signature has been received over a reserve link (one or more). If the new signature has passed over a reserve link, the next operation (step 53) tests whether the old signature stems from path containing a reserve link. If the old signature has not been passed via a reserve link but the new signature has been, the old signature is selected as being a better one. Correspondingly, if step 54 finds that the new signature is received over a reserve-link-free path but the old signature not, the new signature is selected as being a better one. Finally, if neither or both of the signatures stem from a path containing a reserve link, the selection process proceeds to step 55 in order to compare the values of parameters D2.
  • step 55 makes it possible to select the signature of a better value in parameter D2.
  • the process proceeds to step 56 in order to compare the parameters D3 and to select the signature of higher quality based on the better value of parameter D3. If both signatures have the same value of parameter D3, the signatures are considered to be of equal quality.
  • the arrangement according to the invention is different by having the comparison process complemented with a block denoted in the flow diagram with the reference symbol NB, in which the reserve link information carried by the signatures is tested.
  • the basic strategy is in every case to select from two synchronization signatures, of which both indicate the same master clock, the one in which the additional information indicates that the synchronizing signal has not been passed via a reserve link.
  • the selection process ignores whether the signature has passed via a reserve path or not. In this fashion, the synchro- nization is under normal situations always based on the clock source having the highest quality.
  • Figs. 6a and 6b illustrate functional block diagrams of means suited for implementing the above-described method in a single node of a network.
  • the node may be comprised, e.g., of a plurality of parallel interface units IU1 , IU2 IUN, each communicating with at least one neighbouring node and of a control unit CU, common to all the interface units, whereby the control unit performs the decision-making related to node synchronization.
  • the control unit and the individual interface units can communicate with each other via, e.g., an internal bus CBUS of the node equipment.
  • the figures show the system node communicating with the neighbouring nodes over two incoming connections A, and A 2 , each of these terminated at its own interface unit.
  • the connections are formed by 2 Mbit/s PCM digital signals compatible with ITU CCITT Recommendations G.703 and G.704 or SDH signals compatible with ITU CCITT Recommendations G.708 and G.709.
  • Each interface unit IU may have one or more interfaces through which the node is respectively connected to one or more neighbouring nodes.
  • a node can be characterized as comprising N interface units with M interfaces in total (M 3 N).
  • the synchronization message extracted therein is further passed to a synchronization message transmit/receive block 16, directly connected thereto.
  • the synchronization message transmit/receive blocks 16 check the integrity of the synchroniza- tion message and pass the validated message further to a centralized decision-making block 20 of the node via the common bus CBUS.
  • the signal transmit/receive blocks also monitor the quality of the receive signal and store the results in interface-specific fault databases 14,.
  • each synchronization message transmit/receive block can retrieve fault data from its dedicated fault database. Conventional methods are applied in the signal transmit/receive blocks for monitoring faults or changes in a signal passed over a transmission link.
  • the decision-making block 20 of the control unit CU stores the synchronization signatures received from the interfaces in memory area 21 , performs comparison of the stored synchronization signatures, and on the basis of the comparison, selects the signature with the highest priority as the synchronization source for its own clock.
  • the decision-making block forms in memory area 22 a priority list in which the available synchronization sources are sorted is descending order according to their priorities resolved from the contents of their synchronization signa- tures so that highest in the list is placed the clock frequency source which is currently selected for the synchronization of the node and whose signature acts as the template on which the outgoing signature of the node is formed.
  • the decision-making block also obtains fault information related to the incoming signals, either as a synchronization message or as separate fault data.
  • the decision-making block also maintains the currently valid value of outgoing synchronization signature in memory area 24, wherefrom the signature is distributed to the interface-specific synchronization message transmit/receive blocks 16,.
  • An incoming or outgoing link can be defined in the node as a synchronization reserve link in two different ways depending on the storage location of the reserve link information.
  • each interface unit stores the information defining which ones of its interfaces are connected to synchronization reserve links.
  • the reserve link definitions entered by the operator are stored separately for each interface (memory areas 17 ; ), adapted in conjunction with the synchronization message transmit/receive blocks.
  • the synchronization message transmit block receives from the decision-making block a new outgoing synchronization signature, it complements the signature with the reserve path data.
  • the synchronization message receive block receives a message from the network and recognizes a change in the synchronization signature of the message, it complements the signature with the reserve path information (in the case that this information is lacking) prior to forwarding the signature to the decision-making block of the node.
  • Fig. 6b is shown another alternative arrangement in which the operator-entered definitions of synchronization reserve links are stored in a centralized manner in one location (memory area 23 of the decision-making block) for common use in the node.
  • the decision-making block distributes the outgoing synchronization message to the interface units of the node, the block adds the reserve link information to the messages submitted to the interfaces defined as serving the synchronization reserve links.
  • the decision-making block gets a received synchronization signature from an interface unit, the block can immediately identify a signature received over a reserve link, thus being able to add the reserve link information prior to the comparison of synchronization signatures if so required.
  • the signal transmitted from another node of the communications system to the signal-processing blocks of the interface units IU is, e.g., a 2048 kbit/s signal conforming with ITU CCITT Recommendations G.703/G.704, the frame of the signal comprising 32 time slots (TS0-TS31) and each multiframe being formed by 16 frames.
  • the synchronization message can be transferred so that, e.g., the synchronization message reserves two bits in some time slot of the frame structure, advantageously from the bits of time slot TSO (it must be noted herein that while the frame alignment signal occupies the bits of time slot TSO in every other frame, the remaining every other frames have bits 4-8 reserved for national use, whereby they can be utilized for transferring the synchronization message). If the synchronization message transfer is implemented using the bits of time slot TSO, maximally three bits will still remain for other use such as the service channel. Obviously, the bits needed for the synchronization message may also be reserved from some other time slot, but this arrangement bears the penalty of stealing the required transmission capacity from the capacity reserved for the payload.
  • the message is sent in the selected channel in a "piecewise" manner (2 bits in each frame).
  • the generalized structure of the synchronization message can be such as, e.g., shown in Fig. 7a comprising eight consecutive bytes.
  • the actual message begins from the first zero following the string of eight consecutive ones (the messages are sent successively without delay).
  • bit 8) the most significant bit of each byte is zero in order to prevent the message byte from ever comprising eight ones, which would cause confusion of the message byte with the start byte.
  • bit 2--7 bits
  • bits (bits 2-7) are reserved for header information and the last bit (x) for user data.
  • the next five bytes carry user data in bits 1-7 with bit 8 being zero.
  • Bits 1-7 of the last byte contain the check sum of the message.
  • the SOMS signature fields D1-D2-D3 and the reserve path information can be transferred using a method such as that shown in Fig. 7b.
  • Field D3 is transferred in, e.g., bytes 2-4, field D2 in bytes 4 and 5, and field D1 in bytes 6 and 7.
  • the reserve path information Ww may be transferred in, e.g., bits 2 and 3 of the fourth byte, whereby the following bit combinations could be used, for instance:
  • either of the fourth-byte bits can be used alone (e.g., 0: synchronization signature not passed via a reserve path, 1 : synchronization signature passed via a reserve path).
  • the signature comparison is extended to include the priority level of the reserve path, too, whereby from two signatures originating from the same master node but passed over two different reserve paths is selected the one having the highest priority level.
  • the priority information may be considered to comprise a parameter of type D1.5, that is, a parameter half-way between parameters D1 and D2, whereby this intermediate parameter is used in the comparison process after the comparison of parameters D1 but prior to the comparison of parameters D2.
  • the length of the transmit buffer in the node is made equal to the length of the message (8 bytes), thus permitting under interference-free operation the receiving node to find the start of the mes- sage always at the same point of the buffer, whereby there is no need to initiate a buffer content scan for finding the start point of each message separately.
  • the communications system employing the method according to the invention is formed by, e.g., an SDH network in which the signals present at the input ports of the node conform to ITU
  • a reserve path may be activated in a variety of different manners.
  • One straightforward approach is to take a reserve path into use as shown in the diagram of Fig. 5.
  • the use of a reserve path may be permitted only after a preset delay during which the node has not had a reserve- link-free path to the master clock source.
  • This technique takes into account the possibility that due to network delays, a synchronization signature origi- nating from the master clock source may be received in failure or change situations only after a certain delay when transmitted over another path.
  • Such a time-delayed decision-making technique is capable of preventing unnecessary signature hunting, thus inhibiting the node from at once switching to use a signature received via a reserve path and then immediately back to the higher-quality signature now passed over another path.
  • a transmission link may be defined as a reserve link in conjunction with either reception or transmission.
  • the reserve path definition may be made at both ends of the link, or alternatively, only at one end. If the reserve path definition is made only at one end of the link, the definition is made in conjunction with both transmission and reception.
  • the latter alternative assumes that the link serves as a synchronization reserve link for both directions of transmission. This convention arises from the fact that a transmission link can be used as a synchronization reserve link in one direction only. More generally, a link is used for synchronization purposes only in one direction as is evident from the foregoing discussion of the potential applications of the method.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Synchronisation In Digital Transmission Systems (AREA)
EP97942970A 1996-09-30 1997-09-26 Hierarchisches synchronisierungsverfahren Withdrawn EP0965193A1 (de)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
FI963909A FI104665B (fi) 1996-09-30 1996-09-30 Hierarkkinen synkronointimenetelmä
FI963909 1996-09-30
PCT/FI1997/000583 WO1998015077A1 (en) 1996-09-30 1997-09-26 Hierarchical synchronization method

Publications (1)

Publication Number Publication Date
EP0965193A1 true EP0965193A1 (de) 1999-12-22

Family

ID=8546767

Family Applications (1)

Application Number Title Priority Date Filing Date
EP97942970A Withdrawn EP0965193A1 (de) 1996-09-30 1997-09-26 Hierarchisches synchronisierungsverfahren

Country Status (5)

Country Link
EP (1) EP0965193A1 (de)
CN (1) CN1138362C (de)
AU (1) AU4461297A (de)
FI (1) FI104665B (de)
WO (1) WO1998015077A1 (de)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6711411B1 (en) * 2000-11-07 2004-03-23 Telefonaktiebolaget Lm Ericsson (Publ) Management of synchronization network
CN1770701A (zh) * 2004-11-03 2006-05-10 华为技术有限公司 Mesh网中时钟跟踪的实现方法
CN101286835B (zh) 2007-04-11 2013-03-20 华为技术有限公司 一种时钟跟踪的方法、装置及网元设备
KR101654400B1 (ko) 2011-11-25 2016-09-05 주식회사 엘지화학 수지 혼합물
CN107295624B (zh) * 2016-03-30 2021-11-26 日本电气株式会社 节点同步方法和采用该方法的节点
CN108064079B (zh) * 2016-11-09 2020-08-18 大唐移动通信设备有限公司 一种时钟同步方法及基站
CN111654419B (zh) * 2020-06-19 2022-02-11 西安微电子技术研究所 网络同步方法、系统、节点设备及可读存储介质

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE3629931A1 (de) * 1986-09-03 1988-03-10 Philips Patentverwaltung Hierarchisches synchronisationsverfahren und schaltungsanordnung fuer vermittlungsstellen eines vermaschten fernmeldenetzes
DE4122276C2 (de) * 1991-07-05 1995-02-02 Philips Patentverwaltung Hierarchisches Synchronisationsverfahren für ein digitales Kommunikationssystem
FI92358C (fi) * 1992-11-09 1994-10-25 Nokia Telecommunications Oy Hierarkkinen synkronointimenetelmä sekä sanomapohjaista synkronointia käyttävä tietoliikennejärjestelmä
FI95979C (fi) * 1994-03-01 1996-04-10 Nokia Telecommunications Oy Hierarkkinen synkronointimenetelmä
DE4446511A1 (de) * 1994-12-24 1996-06-27 Sel Alcatel Ag Synchrones digitales Nachrichtenübertragungssystem mit hierarchischem Synchronisierungsnetz
GB2301991B (en) * 1995-06-06 1999-06-30 Plessey Telecomm SDH Network

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
FI104665B (fi) 2000-04-14
FI963909A (fi) 1998-03-31
CN1232586A (zh) 1999-10-20
AU4461297A (en) 1998-04-24
CN1138362C (zh) 2004-02-11
FI963909A0 (fi) 1996-09-30
WO1998015077A1 (en) 1998-04-09

Similar Documents

Publication Publication Date Title
US6317475B1 (en) Synchronization of telecommunications network
US5805568A (en) Add/drop multiplexer for supporting fixed length cell
US6122250A (en) Ring transmission system and squelch method used for same
US5333130A (en) Self-healing drop and insert communication network
EP0667997B1 (de) Hierarchisches synchronisierungsverfahren und telekommunikationssystem mit nachrichtenbasierter synchronisierung
US6917584B2 (en) Channel reassignment method and circuit for implementing the same
US6278690B1 (en) Local area network for reconfiguration in the event of line ruptures or node failure
US5706291A (en) Method and apparatus for connecting two messaging systems having differing synchronizations one of which is message-based
JP3427303B2 (ja) Sdhデータ伝送タイミング
US6141320A (en) Method and apparatus for nested automatic protection switching
US5796793A (en) Hierarchical synchronization method
EP0965193A1 (de) Hierarchisches synchronisierungsverfahren
EP0932950A1 (de) Hierarchisches synchronisierungssystem
EP0667996B1 (de) Netzwerkanordnung
WO1995024083A2 (en) Network arrangement
US6496518B1 (en) SDH transmission system, and frame transmission method in SDH transmission system and SDH transmission unit
US7050450B1 (en) Telecommunications system and method for producing a master clock in the same
EP0689745B1 (de) Verfahren zur synchronisation von verbundenen sdh- und pdh-fernmeldenetzen
JP3052922B2 (ja) 通信端局装置及びその動作クロック選定方法並びにその制御プログラムを記録した記録媒体
JP2001358736A (ja) リング型ネットワークシステム
EP0910189A2 (de) Netzwerksynchronisierung mit SDH/SONET
KR100322273B1 (ko) 교환망의마스터-슬레이브노드간의망동기장치및방법
JP3492558B2 (ja) リング型ネットワークシステム
JPH09307576A (ja) リング網ノード
CA2162185A1 (en) Fault recovery system of a ring network

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 19990324

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): BE CH DE DK FR GB IT LI NL PT SE

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NOKIA NETWORKS OY

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NOKIA CORPORATION

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN WITHDRAWN

18W Application withdrawn

Effective date: 20041122