WO2001047150A1 - Telecommunication network synchronisation - Google Patents

Telecommunication network synchronisation Download PDF

Info

Publication number
WO2001047150A1
WO2001047150A1 PCT/EP2000/011539 EP0011539W WO0147150A1 WO 2001047150 A1 WO2001047150 A1 WO 2001047150A1 EP 0011539 W EP0011539 W EP 0011539W WO 0147150 A1 WO0147150 A1 WO 0147150A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
message
nodes
link
network
Prior art date
Application number
PCT/EP2000/011539
Other languages
French (fr)
Inventor
Mikko Antero Lipsanen
Original Assignee
Telefonaktiebolaget Lm Ericsson (Publ)
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 Telefonaktiebolaget Lm Ericsson (Publ) filed Critical Telefonaktiebolaget Lm Ericsson (Publ)
Priority to DE60020162T priority Critical patent/DE60020162T2/en
Priority to AU18584/01A priority patent/AU1858401A/en
Priority to AT00981281T priority patent/ATE295638T1/en
Priority to EP00981281A priority patent/EP1240732B1/en
Publication of WO2001047150A1 publication Critical patent/WO2001047150A1/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J3/00—Time-division multiplex systems
    • H04J3/02—Details
    • H04J3/06—Synchronising arrangements
    • H04J3/0635—Clock or time synchronisation in a network
    • H04J3/0679—Clock or time synchronisation in a network by determining clock distribution path in a network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J2203/00—Aspects of optical multiplex systems other than those covered by H04J14/05 and H04J14/07
    • H04J2203/0001—Provisions for broadband connections in integrated services digital network using frames of the Optical Transport Network [OTN] or using synchronous transfer mode [STM], e.g. SONET, SDH
    • H04J2203/0089—Multiplexing, e.g. coding, scrambling, SONET

Definitions

  • the present invention relates to the synchronisation of nodes in a telecommunication network and in particular, though not necessarily, to the synchronisation of nodes in a Universal Mobile Telecommunications System network.
  • Network synchronisation permits all nodes on the network to operate from a common time base. This means that when one node (i.e. an intersection point) sends data to another node, both nodes can be expected to operate at approximately the same rate ensuring the successful transfer of data between the nodes. Background information on the need for network node synchronisation can be found in EP0450828.
  • one master node is chosen to distribute high quality clock signals (generated by a Primary Reference Clock (PRC)) to all slave nodes in a hierarchy of network nodes.
  • the master node distributes PRC clock signals to adjacent nodes which in turn distribute the received and regenerated clock signals to their adjacent nodes until all the nodes in the network are using the same clock origin.
  • PRC Primary Reference Clock
  • a typical UTRAN configuration consists of Radio Network Controllers (RNCs) which perform switching functions in the network (analogous in some ways with conventional telephone exchanges and with Mobile Switching Centres of GSM networks) and Radio Base Stations (RBSs) which provide the interface between the UTRAN and the mobile terminals (each RBS being responsible for a given cell).
  • RNCs and RBSs are arranged in a hierarchy (or hierarchies) with a single RNC possibly being responsible for tens of RBSs.
  • the link structure in a UTRAN may be complex, with nodes of the same type being linked to one another as well as to nodes of a different type. In certain circumstances, synchronisation may be taken from a co-located GSM network or UTRAN synchronisation may be utilised in GSM nodes.
  • WO95/24801 describes a method of synchronising a network by propagating synchronisation messages down through a hierarchy of network nodes.
  • the synchronisation messages each comprise a master node address, a distance-to-master node, indicated as the number of intermediate nodes through which the message has passed, and the identity of the transmitting node.
  • Each node through which a message passes increases a distance counter by 1 and changes the transmitting node identity to its own identity.
  • the path field allows receiving nodes to prioritise incoming links for synchronisation purposes.
  • WO96/39760 describes a method of detecting timing loops in a Synchronous Digital Hierarchy (SDH) network by sending a synchronisation message consisting of the identities of all the nodes through which the synchronisation message has passed.
  • the synchronisation message also contains a count of the number of nodes through which clock signal has passed. This is used to prevent excessively long synchronisation chains.
  • a method of synchronising nodes of a telecommunication network in which a master node is coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes are each arranged to synchronise their internal clock to the PRC using data received on incoming data link, the method comprising: propagating Synchronisation Status Messages through the network from the master node, with each node through which a message passes incorporating into the message its own identity, thereby generating in each message a path which has been followed by the message; introducing a delay in the propagation of the messages at at least certain of the network nodes; and for each of at least some of the incoming links of each node, registering the path and/or path length of a Synchronisation Status Message received on a link as an attribute for that link.
  • PRC Primary Reference Clock
  • Embodiments of the present invention allow a node to compare the merits of different incoming data links as sources of synchronisation information.
  • the node may select that incoming link having an attribute indicating the shortest path length from the master node.
  • the introduction of a delay in the propagation of messages at at least certain nodes increases the probability that a synchronisation message will be received first at a given node over a shorter path, rather than over a longer path. This will tend to decrease the overall time taken to synchronise the network.
  • Synchronisation Status Messages may also be broadcast periodically or at other intervals thereafter in order to enable the network to cope with dynamic changes in network architecture (e.g. due to the failure of an inter-node link or the introduction of a new link or node).
  • Synchronisation Status Messages may be generated in response to receipt at the master node of a Synchronisation Status Request Message sent from another network node. Such a Request Message may be sent be a new node upon introduction to the network.
  • a Synchronisation Status Message may be generated by a slave node in response to receipt at that slave node of a Synchronisation Status Request Message sent from a neighbouring slave node, with the Synchronisation Status Message including an identification of the path over which the sending slave node has been synchronised.
  • a node through which a Synchronisation Status Message passes may additionally add to the message its own "distance" from the master node. This distance may be defined by way of the number of node-to-node hops made by the message to get from the master node to the current node. Nodes adjacent to the master node have a distance of PRC + 1, nodes adjacent to nodes having a distance of PRC + 1 have a distance of PRC + 2, etc. For each incoming link, a node may register the distance included in a Synchronisation Status Message received on that link as an attribute for that link.
  • the present invention is particularly applicable to mobile telecommunications networks such as GSM and UMTS (more particularly to the UTRAN part of a UMTS network).
  • GSM Global System for Mobile communications
  • UMTS More particularly to the UTRAN part of a UMTS network
  • PSTNs Public Switched Telephone Networks
  • the delay introduced by a slave node may be the same for all slave nodes which introduce a delay. Alternatively, the delay may increase with distance from the master node. Preferably, slave nodes neighbouring the master node do not introduce a delay.
  • the delay to be introduced by a node may be incorporated into a Synchronisation Status Message. This avoids the need to have delay tables at all network nodes. However, in the alternative, delay tables may be present at all nodes.
  • a telecommunications network comprising a master node coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes, each of the slave nodes being arranged to synchronise their internal clock to the PRC using data received on incoming data link, each of the slave nodes comprising: means for receiving on the or each of at least some of the incoming links to the node, a Synchronisation Status Message incorporating the identities of the nodes through which the message has passed; means for registering the path or path length of the Synchronisation Status Message as an attribute for the link on which it was received; means for incorporating into one of said messages the identity of the node, thereby generating in the message a path which has been followed by the message; and means for propagating the modified Synchronisation Status Message to neighbouring nodes using outgoing links, wherein at least certain of the nodes in the network are arranged to introduce a delay in the propagation of the respective modified messages.
  • PRC Primary Reference Clock
  • a receiving node will synchronise on the best incoming link, as identified by the paths of the Synchronisation Status Messages received on the incoming links.
  • the Synchronisation Status Message received on the best incoming link is the message to which the node will incorporate its identity, and which is propagated to the neighbouring nodes.
  • a node for use in a multi-node telecommunications network, the node comprising: means for receiving on the or each incoming link to the node a Synchronisation
  • a method of synchronising nodes of a telecommunication network in which a master node is coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes are each arranged to synchronise their internal clock to the PRC using data received on incoming data link, the method comprising: propagating Synchronisation Status Messages through the network from the master node, with each slave node through which a message passes incrementing a distance counter contained in the message, thereby generating in each message a path length taken by the message; introducing a delay in the propagation of the messages at at least certain of the network nodes; and for each of at least some of the incoming links of each node, registering the path length of a Synchronisation Status Message received on a link as an attribute for that link.
  • PRC Primary Reference Clock
  • a method of synchronising nodes of a telecommunication network in which a master node is coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes are each arranged to synchronise their internal clock to the PRC using data received on an incoming data link, the method comprising: propagating Synchronisation Status Messages through the network from the master node, with each node through which a message passes incorporating into the message its own identity, thereby generating in each message a path which has been followed by the message; for each incoming link of each slave node, registering the path or path length of a Synchronisation Status Message received on that link as an attribute for that link; and for each slave node, identifying the best incoming signalling link and synchronising on that link after a time delay, indicated by the path of the Synchronisation Status Message received on that link, has elapsed, assuming that no better link is identified in the meantime.
  • PRC Primary Reference Clock
  • a method of synchronising a node of a telecommunication network in which a master node is coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes are each arranged to synchronise their internal clock to the PRC using data received on incoming data link, the method comprising: sending a Synchronisation Status Message Request from the node to be synchronised to neighbouring nodes in the network; returning Synchronisation Status Messages from the neighbouring nodes to the requesting node, said messages including a path which has been followed by the message from the master node; synchronising said node on the incoming signalling link over which the message having the shortest path was received; extending the path of the message having the shortest path to include the identity the receiving node; and propagating the modified synchronisation message to at least certain of the neighbouring nodes.
  • PRC Primary Reference Clock
  • a node for use in a multi-node telecommunications network, the node comprising: means for sending a Synchronisation Status Message Request to neighbouring nodes in the network; means for receiving on incoming links to the node, respective Synchronisation Status Messages inco ⁇ orating the identities of the nodes through which the messages have passed; means for registering the paths or path lengths of the Synchronisation Status Messages as attributes for the respective links on which they were received; means for inco ⁇ orating into the message having the shortest path length the identity of the node, thereby generating in the message a path which has been followed by the message; and means for propagating the modified Synchronisation Status Message to at least certain neighbouring nodes using outgoing links.
  • a method of synchronising a node of a telecommunication network in which a master node is coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes are each arranged to synchronise their internal clock to the PRC using data received on incoming data link, the method comprising: sending a Synchronisation Status Message Request from the node to be synchronised to neighbouring nodes in the network; returning Synchronisation Status Messages from the neighbouring nodes to the requesting node, said messages including a path length which has been taken by the message from the master node; synchronising said node on the incoming signalling link over which the message having the shortest path length was received; extending the path of the message; and propagating the modified synchronisation message to at least certain of the neighbouring nodes.
  • PRC Primary Reference Clock
  • Figure 1 illustrates schematically a multi-node telecommunication network
  • Figure 2 illustrates schematically an alternative multi-node telecommunication network prior to synchronisation
  • Figure 3 illustrates the network of Figure 2 following synchronisation
  • Figure 4 is a flow diagram illustrating a method of synchronising the nodes of the network of Figures 2 and 3;
  • Figure 5 illustrates schematically a multi-node telecommunication network prior to synchronisation, and comprising a new node
  • Figure 6 illustrates the network of Figure 5 following synchronisation
  • Figure 7 is a flow diagram illustrating a method of synchronising a new node introduced into a multi-node telecommunication network.
  • FIG. 1 a multi-node telecommunication network comprising Nodes A to G.
  • the Nodes are interconnected by data links which may carry user data, signalling data, or a combination of both.
  • the network of Figure 1 might be a UMTS Terrestrial Radio Access Network (UTRAN), where certain of the nodes (for example Node A) might be Radio Network Controllers (RNCs) whilst others of the nodes (for example Nodes B to G) might be Radio Base Stations (RBSs).
  • UTRAN UMTS Terrestrial Radio Access Network
  • RNCs Radio Network Controllers
  • RBSs Radio Base Stations
  • Node A is a so-called "master Node” and is connected to a Primary Reference Clock (PRC).
  • PRC Primary Reference Clock
  • the slave Nodes B to G are able to synchronise with another network Node (and hence with the network as a whole) using data signals received on an incoming data links.
  • the accuracy of the synchronisation will depend to a large extent upon the remoteness of the node which is being synchronised from the master node. An important consideration therefore in choosing which incoming link to synchronise on is the number of inter-node hops which a signal has taken to arrive at the node from the master node.
  • Node A Upon initialisation of the network of Figure 1, Node A initiates the synchronisation selection process by sending a Synchronisation Status Message (SSM) to each of the nodes to which it is connected (in this case only Node B).
  • SSM Synchronisation Status Message
  • the SSM includes a "path" field in which Node A places its own identity together with an indication that Node A is the master node.
  • the SSM is received on a given incoming signalling link by Node B.
  • Node B analyses the SSM and identifies the path. The path is stored as an attribute for the incoming signalling link.
  • Node B adds its own identity to the path field of the SSM (which becomes ⁇ Node Ap RC , Node B ⁇ ), and propagates the modified SSM to Nodes C, D, and E to which it is connected.
  • the receiving nodes again store the path contained in the received SSM as an attribute for the link on which the message is received. Whilst Nodes D and E are not connected to any further nodes, Node C is connected to Nodes F and G. Node C therefore adds its identity to the SSM path field (now ⁇ Node A PRC , Node B, Node C ⁇ ) and propagates it to Nodes F and G. Nodes F and G are not connected to any further Nodes and therefore the SSM propagation terminates at these nodes.
  • the path contained in the SSM is stored as an attribute for the incoming links to Nodes F and G.
  • each Node has only a single incoming data link on which to synchronise.
  • Figure 2 illustrates a modified network in which an additional link exists between Nodes A and C.
  • Node C upon initialisation, Node C will receive an SSM from both Nodes A and B. The path contained in the SSM received from Node A will be ⁇ Node A PRC ⁇ whilst that contained in the SSM received from Node B will be ⁇ Node A PR c, Node B ⁇ .
  • Node C will select the incoming link from Node A as the link to synchronise on. It does this by comparing the attributes allocated to those links as a result of the respective SSMs.
  • Node C will only choose to synchronise on the incoming link from Node B in the event that the link from Node A fails.
  • Figure 3 illustrates the network of Figure 2 following synchronisation. It will be appreciated that this selection process can be extended to selection from three or more incoming links.
  • Node C will only propagate to Nodes F and G (at least when the network is fully operational) the SSM which is received from Node A. Only in the event that the link to Node A fails will Node C propagate the SSM received from Node B to Node F and G.
  • Figure 2 illustrates using dashed lines a so-called "directed loop" which might arise when Node D is connected to Node E and Node E is connected back to Node B.
  • an SSM propagated from Node E to Node B will include the path ⁇ Node A PRC , Node B, Node D, Node E ⁇ .
  • Node B will find that its own identity is contained in the path and hence will detect a directed loop.
  • the problem can be mitigated by introducing a delay in the re-transmission of SSMs at each of the slave nodes. Providing this delay is sufficiently long, it will increase the probability that an SSM travelling over a shorter path will be received at a node before SSMs travelling over longer paths.
  • Figure 4 is a flow diagram illustrating this method.
  • a Node in addition to adding its identity to the path of an SSM, a Node might add its synchronisation reference distance to the SSM.
  • the Master Node A would add a distance PRC to the SSM, whilst Nodes B and C would add a distance PRC+1, Nodes D, E, F, and G would add a distance PRC+2 etc. It is then a simple operation for a Node to determine the synchronisation quality of an incoming link.
  • a second SSM message referred to here as a Synchronisation Status Message Request (SSM2)
  • SSM2 Synchronisation Status Message Request
  • This message is generated by a Node and is sent to neighbouring Nodes, requesting that these Nodes return to the enquiring Node an SSM of the first form (SSM1).
  • SSM1 Synchronisation Status Message Request
  • This procedure may be used for example by a new Node X introduced to an existing network.
  • Figure 5 illustrates the situation after synchronisation has been achieved.
  • Figure 7 is a flow diagram illustrating this method.
  • a delay on acting upon a received SSM may be introduced at receiving slave nodes (rather than delaying the sending of the message). This delay provides an opportunity for other SSMs to arrive at the node (and which may have travelled over a shorter path) prior to synchronisation occurring.

Abstract

A method of synchronising nodes of a telecommunication network in which a master node is coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes are each arranged to synchronise their internal clock to the PRC using data received on incoming data link. The method comprises propagating Synchronisation Status Messages through the network from the master node, with each node through which a messages pass incorporating into the message its own identity, thereby generating in each message a node path which has been followed by the message. For each incoming link of each node, the path or path length of a Synchronisation Status Message received on that link is registered as an attribute for that link.

Description

TELECOMMUNICATION NETWORK SYNCHRONISATION
Field of the Invention
The present invention relates to the synchronisation of nodes in a telecommunication network and in particular, though not necessarily, to the synchronisation of nodes in a Universal Mobile Telecommunications System network.
Background to the Invention
In a digital communication network, such as a telecommunications network or a private network having several private branch exchanges, it is often necessary to synchronise the time clocks of respective network nodes in order to ensure correct operation of the network. Network synchronisation permits all nodes on the network to operate from a common time base. This means that when one node (i.e. an intersection point) sends data to another node, both nodes can be expected to operate at approximately the same rate ensuring the successful transfer of data between the nodes. Background information on the need for network node synchronisation can be found in EP0450828.
In so-called "master-slave" synchronisation, one master node is chosen to distribute high quality clock signals (generated by a Primary Reference Clock (PRC)) to all slave nodes in a hierarchy of network nodes. The master node distributes PRC clock signals to adjacent nodes which in turn distribute the received and regenerated clock signals to their adjacent nodes until all the nodes in the network are using the same clock origin.
The need for synchronisation is especially important in mobile telecommunication networks, and will become even more so with the introduction of Universal Mobile Telecommunications System (UMTS) networks where the UMTS Terrestrial Radio Access Network (UTRAN) places very severe limits on network synchronisation.
A typical UTRAN configuration consists of Radio Network Controllers (RNCs) which perform switching functions in the network (analogous in some ways with conventional telephone exchanges and with Mobile Switching Centres of GSM networks) and Radio Base Stations (RBSs) which provide the interface between the UTRAN and the mobile terminals (each RBS being responsible for a given cell). The RNCs and RBSs are arranged in a hierarchy (or hierarchies) with a single RNC possibly being responsible for tens of RBSs. The link structure in a UTRAN may be complex, with nodes of the same type being linked to one another as well as to nodes of a different type. In certain circumstances, synchronisation may be taken from a co-located GSM network or UTRAN synchronisation may be utilised in GSM nodes.
In the event of a synchronisation failure, e.g. due to the failure of a link between two nodes, action must be taken quickly to re-establish synchronisation. This usually means selecting for the node suffering from the effects of the failure (as well as for other nodes downstream of that node) an alternative incoming link which can be used to achieve synchronisation. Typically, certain incoming links are preferred to other links for this purpose, and the selection of an appropriate link requires a network level administration system which is connected to all network nodes. This work requires each node of the network to have a complete knowledge of the network and, in failure situations, the network synchronisation can suffer from unforeseen combinations of the network nodes.
WO95/24801 describes a method of synchronising a network by propagating synchronisation messages down through a hierarchy of network nodes. The synchronisation messages each comprise a master node address, a distance-to-master node, indicated as the number of intermediate nodes through which the message has passed, and the identity of the transmitting node. Each node through which a message passes, increases a distance counter by 1 and changes the transmitting node identity to its own identity. The path field allows receiving nodes to prioritise incoming links for synchronisation purposes.
WO96/39760 describes a method of detecting timing loops in a Synchronous Digital Hierarchy (SDH) network by sending a synchronisation message consisting of the identities of all the nodes through which the synchronisation message has passed. The synchronisation message also contains a count of the number of nodes through which clock signal has passed. This is used to prevent excessively long synchronisation chains. Summary of the Invention
It is an object of the present invention to overcome or at least mitigate the disadvantages of known synchronisation networks. In particular, it is an object of the present invention to provide a synchronisation network in which synchronisation problems may be overcome substantially on a node level, automatically and with no or minimal operator intervention. It is a second object of the present invention to allow for the fast stabilisation of a network synchronisation process. It is a third object of the present invention to allow newly introduced network nodes to be rapidly synchronised with the network.
According to a first aspect of the present invention there is provided a method of synchronising nodes of a telecommunication network in which a master node is coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes are each arranged to synchronise their internal clock to the PRC using data received on incoming data link, the method comprising: propagating Synchronisation Status Messages through the network from the master node, with each node through which a message passes incorporating into the message its own identity, thereby generating in each message a path which has been followed by the message; introducing a delay in the propagation of the messages at at least certain of the network nodes; and for each of at least some of the incoming links of each node, registering the path and/or path length of a Synchronisation Status Message received on a link as an attribute for that link.
Embodiments of the present invention allow a node to compare the merits of different incoming data links as sources of synchronisation information. In the event that synchronisation (or re-synchronisation) is required, the node may select that incoming link having an attribute indicating the shortest path length from the master node. The introduction of a delay in the propagation of messages at at least certain nodes, increases the probability that a synchronisation message will be received first at a given node over a shorter path, rather than over a longer path. This will tend to decrease the overall time taken to synchronise the network.
It will be appreciated that it is necessary to propagate Synchronisation Status Messages on initialising a new network. Synchronisation Status Messages may also be broadcast periodically or at other intervals thereafter in order to enable the network to cope with dynamic changes in network architecture (e.g. due to the failure of an inter-node link or the introduction of a new link or node).
Synchronisation Status Messages may be generated in response to receipt at the master node of a Synchronisation Status Request Message sent from another network node. Such a Request Message may be sent be a new node upon introduction to the network. A Synchronisation Status Message may be generated by a slave node in response to receipt at that slave node of a Synchronisation Status Request Message sent from a neighbouring slave node, with the Synchronisation Status Message including an identification of the path over which the sending slave node has been synchronised.
A node through which a Synchronisation Status Message passes may additionally add to the message its own "distance" from the master node. This distance may be defined by way of the number of node-to-node hops made by the message to get from the master node to the current node. Nodes adjacent to the master node have a distance of PRC + 1, nodes adjacent to nodes having a distance of PRC + 1 have a distance of PRC + 2, etc. For each incoming link, a node may register the distance included in a Synchronisation Status Message received on that link as an attribute for that link.
The present invention is particularly applicable to mobile telecommunications networks such as GSM and UMTS (more particularly to the UTRAN part of a UMTS network). However, the invention is also applicable to fixed line networks such as Public Switched Telephone Networks (PSTNs).
The delay introduced by a slave node may be the same for all slave nodes which introduce a delay. Alternatively, the delay may increase with distance from the master node. Preferably, slave nodes neighbouring the master node do not introduce a delay. The delay to be introduced by a node may be incorporated into a Synchronisation Status Message. This avoids the need to have delay tables at all network nodes. However, in the alternative, delay tables may be present at all nodes.
According to a second aspect of the present invention there is provided a telecommunications network comprising a master node coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes, each of the slave nodes being arranged to synchronise their internal clock to the PRC using data received on incoming data link, each of the slave nodes comprising: means for receiving on the or each of at least some of the incoming links to the node, a Synchronisation Status Message incorporating the identities of the nodes through which the message has passed; means for registering the path or path length of the Synchronisation Status Message as an attribute for the link on which it was received; means for incorporating into one of said messages the identity of the node, thereby generating in the message a path which has been followed by the message; and means for propagating the modified Synchronisation Status Message to neighbouring nodes using outgoing links, wherein at least certain of the nodes in the network are arranged to introduce a delay in the propagation of the respective modified messages.
It will be appreciated that a receiving node will synchronise on the best incoming link, as identified by the paths of the Synchronisation Status Messages received on the incoming links. The Synchronisation Status Message received on the best incoming link is the message to which the node will incorporate its identity, and which is propagated to the neighbouring nodes.
According to a third aspect of the present invention there is provided a node for use in a multi-node telecommunications network, the node comprising: means for receiving on the or each incoming link to the node a Synchronisation
Status Message incorporating the identities of the nodes through which the message has passed; means for registering the path or path length of the or each Synchronisation Status Message as an attribute for the link on which it was received; means for incorporating into one of the messages the identity of the node, thereby generating in the message a node path which has been followed by the message; and means for propagating the modified Synchronisation Status Message to neighbouring nodes using outgoing links, after a predefined time delay.
According to a fourth aspect of the present invention there is provided a method of synchronising nodes of a telecommunication network in which a master node is coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes are each arranged to synchronise their internal clock to the PRC using data received on incoming data link, the method comprising: propagating Synchronisation Status Messages through the network from the master node, with each slave node through which a message passes incrementing a distance counter contained in the message, thereby generating in each message a path length taken by the message; introducing a delay in the propagation of the messages at at least certain of the network nodes; and for each of at least some of the incoming links of each node, registering the path length of a Synchronisation Status Message received on a link as an attribute for that link.
According to a fifth aspect of the present invention there is provided a method of synchronising nodes of a telecommunication network in which a master node is coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes are each arranged to synchronise their internal clock to the PRC using data received on an incoming data link, the method comprising: propagating Synchronisation Status Messages through the network from the master node, with each node through which a message passes incorporating into the message its own identity, thereby generating in each message a path which has been followed by the message; for each incoming link of each slave node, registering the path or path length of a Synchronisation Status Message received on that link as an attribute for that link; and for each slave node, identifying the best incoming signalling link and synchronising on that link after a time delay, indicated by the path of the Synchronisation Status Message received on that link, has elapsed, assuming that no better link is identified in the meantime.
According to a sixth aspect of the present invention there is provided a method of synchronising a node of a telecommunication network in which a master node is coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes are each arranged to synchronise their internal clock to the PRC using data received on incoming data link, the method comprising: sending a Synchronisation Status Message Request from the node to be synchronised to neighbouring nodes in the network; returning Synchronisation Status Messages from the neighbouring nodes to the requesting node, said messages including a path which has been followed by the message from the master node; synchronising said node on the incoming signalling link over which the message having the shortest path was received; extending the path of the message having the shortest path to include the identity the receiving node; and propagating the modified synchronisation message to at least certain of the neighbouring nodes.
According to a seventh aspect of the present invention there is provided a node for use in a multi-node telecommunications network, the node comprising: means for sending a Synchronisation Status Message Request to neighbouring nodes in the network; means for receiving on incoming links to the node, respective Synchronisation Status Messages incoφorating the identities of the nodes through which the messages have passed; means for registering the paths or path lengths of the Synchronisation Status Messages as attributes for the respective links on which they were received; means for incoφorating into the message having the shortest path length the identity of the node, thereby generating in the message a path which has been followed by the message; and means for propagating the modified Synchronisation Status Message to at least certain neighbouring nodes using outgoing links.
According to an eighth aspect of the present invention there is provided a method of synchronising a node of a telecommunication network in which a master node is coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes are each arranged to synchronise their internal clock to the PRC using data received on incoming data link, the method comprising: sending a Synchronisation Status Message Request from the node to be synchronised to neighbouring nodes in the network; returning Synchronisation Status Messages from the neighbouring nodes to the requesting node, said messages including a path length which has been taken by the message from the master node; synchronising said node on the incoming signalling link over which the message having the shortest path length was received; extending the path of the message; and propagating the modified synchronisation message to at least certain of the neighbouring nodes.
Brief Description of the Drawings
Figure 1 illustrates schematically a multi-node telecommunication network;
Figure 2 illustrates schematically an alternative multi-node telecommunication network prior to synchronisation;
Figure 3 illustrates the network of Figure 2 following synchronisation;
Figure 4 is a flow diagram illustrating a method of synchronising the nodes of the network of Figures 2 and 3;
Figure 5 illustrates schematically a multi-node telecommunication network prior to synchronisation, and comprising a new node;
Figure 6 illustrates the network of Figure 5 following synchronisation; and Figure 7 is a flow diagram illustrating a method of synchronising a new node introduced into a multi-node telecommunication network.
Detailed Description of a Preferred Embodiment
There is illustrated in Figure 1 a multi-node telecommunication network comprising Nodes A to G. The Nodes are interconnected by data links which may carry user data, signalling data, or a combination of both. In one example, the network of Figure 1 might be a UMTS Terrestrial Radio Access Network (UTRAN), where certain of the nodes (for example Node A) might be Radio Network Controllers (RNCs) whilst others of the nodes (for example Nodes B to G) might be Radio Base Stations (RBSs).
Node A is a so-called "master Node" and is connected to a Primary Reference Clock (PRC). As has already been outlined above, the slave Nodes B to G are able to synchronise with another network Node (and hence with the network as a whole) using data signals received on an incoming data links. The accuracy of the synchronisation will depend to a large extent upon the remoteness of the node which is being synchronised from the master node. An important consideration therefore in choosing which incoming link to synchronise on is the number of inter-node hops which a signal has taken to arrive at the node from the master node.
Upon initialisation of the network of Figure 1, Node A initiates the synchronisation selection process by sending a Synchronisation Status Message (SSM) to each of the nodes to which it is connected (in this case only Node B). The SSM includes a "path" field in which Node A places its own identity together with an indication that Node A is the master node. The SSM is received on a given incoming signalling link by Node B. Node B analyses the SSM and identifies the path. The path is stored as an attribute for the incoming signalling link. Node B then adds its own identity to the path field of the SSM (which becomes {Node ApRC, Node B}), and propagates the modified SSM to Nodes C, D, and E to which it is connected.
The receiving nodes again store the path contained in the received SSM as an attribute for the link on which the message is received. Whilst Nodes D and E are not connected to any further nodes, Node C is connected to Nodes F and G. Node C therefore adds its identity to the SSM path field (now {Node APRC, Node B, Node C}) and propagates it to Nodes F and G. Nodes F and G are not connected to any further Nodes and therefore the SSM propagation terminates at these nodes. The path contained in the SSM is stored as an attribute for the incoming links to Nodes F and G.
In the very simple example of Figure 1, each Node has only a single incoming data link on which to synchronise. Figure 2 illustrates a modified network in which an additional link exists between Nodes A and C. In this network, upon initialisation, Node C will receive an SSM from both Nodes A and B. The path contained in the SSM received from Node A will be {Node APRC} whilst that contained in the SSM received from Node B will be {Node APRc, Node B} . In the event that the network is fully operational, Node C will select the incoming link from Node A as the link to synchronise on. It does this by comparing the attributes allocated to those links as a result of the respective SSMs. Node C will only choose to synchronise on the incoming link from Node B in the event that the link from Node A fails. Figure 3 illustrates the network of Figure 2 following synchronisation. It will be appreciated that this selection process can be extended to selection from three or more incoming links.
It will also be appreciated that Node C will only propagate to Nodes F and G (at least when the network is fully operational) the SSM which is received from Node A. Only in the event that the link to Node A fails will Node C propagate the SSM received from Node B to Node F and G.
Figure 2 illustrates using dashed lines a so-called "directed loop" which might arise when Node D is connected to Node E and Node E is connected back to Node B. In this situation, an SSM propagated from Node E to Node B will include the path {Node APRC, Node B, Node D, Node E} . Node B will find that its own identity is contained in the path and hence will detect a directed loop.
It will be appreciated that where a Node has several incoming links on which SSMs may be received, it is possible that a node might end up receiving an SSM having a relatively long path before subsequently receiving an SSM having a shorter path. The result will be that the Node will first synchronise on the link on which the first SSM is received and will subsequently have to re-synchronise on the link on which the second SSM is received. This behaviour can result in a relatively long stabilisation time for the network.
The problem can be mitigated by introducing a delay in the re-transmission of SSMs at each of the slave nodes. Providing this delay is sufficiently long, it will increase the probability that an SSM travelling over a shorter path will be received at a node before SSMs travelling over longer paths. Figure 4 is a flow diagram illustrating this method.
In a modification to the above embodiment, in addition to adding its identity to the path of an SSM, a Node might add its synchronisation reference distance to the SSM. For example (with reference to Figure 2), the Master Node A would add a distance PRC to the SSM, whilst Nodes B and C would add a distance PRC+1, Nodes D, E, F, and G would add a distance PRC+2 etc. It is then a simple operation for a Node to determine the synchronisation quality of an incoming link.
In a further modification to the above embodiment, a second SSM message, referred to here as a Synchronisation Status Message Request (SSM2), may be introduced. This message is generated by a Node and is sent to neighbouring Nodes, requesting that these Nodes return to the enquiring Node an SSM of the first form (SSM1). This procedure may be used for example by a new Node X introduced to an existing network. Such a scenario is illustrated in Figure 5, with Figure 6 illustrating the situation after synchronisation has been achieved. Figure 7 is a flow diagram illustrating this method.
It will be appreciated by the person of skill in the art that various modifications may be made to the above described embodiment without departing from the scope of the present invention. For example, a delay on acting upon a received SSM may be introduced at receiving slave nodes (rather than delaying the sending of the message). This delay provides an opportunity for other SSMs to arrive at the node (and which may have travelled over a shorter path) prior to synchronisation occurring.

Claims

Claims
1. A method of synchronising nodes of a telecommunication network in which a master node is coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes are each arranged to synchronise their internal clock to the PRC using data received on incoming data link, the method comprising: propagating Synchronisation Status Messages through the network from the master node, with each node through which a message passes incoφorating into the message its own identity, thereby generating in each message a path which has been followed by the message; introducing a delay in the propagation of the messages at at least certain of the network nodes; and for each of at least some of the incoming links of each node, registering the path or path length of a Synchronisation Status Message received on that link as an attribute for that link.
2. A method according to claim 1 and comprising selecting that incoming link having an attribute indicating the shortest path length from the master node as the link to synchronise on.
3. A method according to claim 1 or 2 and comprising propagating Synchronisation Status Messages on initialising a new network.
4. A method according to any one of the preceding claims and comprising sending Synchronisation Status Messages periodically or at other intervals thereafter in order to enable the network to cope with dynamic changes in network architecture.
5. A method according to any one of the preceding claims and comprising, wherein Synchronisation Status Messages are generated in response to receipt at the master node of a Synchronisation Status Request Message sent from another network node.
6. A method according to any one of the preceding claims and comprising generating a Synchronisation Status Message at a slave node in response to receipt at that slave node of a Synchronisation Status Request Message sent from a neighbouring slave node, with the Synchronisation Status Message including an identification of the path over which the sending slave node has been synchronised.
7. A method according to any one of the preceding claims, wherein a node through which a Synchronisation Status Message passes adds to the message its own distance from the master node and, for each incoming link, a node registers the distance included in a Synchronisation Status Message received on that link as an attribute for that link.
8. A method according to any one of the preceding claims, wherein the network is a UMTS network.
9. A method according to any one of the preceding claims, wherein the delay introduced by a slave node is the same for all slave nodes which introduce a delay.
10. A method according to any one of claims 1 to 8, wherein the delay increases with distance from the master node.
11. A method according to any one of the preceding claims, wherein the delay to be introduced by a node for a Synchronisation Status Message is identified in the
Synchronisation Status Message.
12. A method according to any one of claims 1 to 10, wherein the delay to be introduced by a node for a Synchronisation Status Message is defined by a delay table stored at the node.
13. A telecommunications network comprising a master node coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes, each of the slave nodes being arranged to synchronise their internal clock to the PRC using data received on incoming data link, each of the slave nodes comprising: means for receiving on the or each of at least some of the incoming links to the node, a Synchronisation Status Message incoφorating the identities of the nodes through which the message has passed; means for registering the path or path length of the Synchronisation Status Message as an attribute for the link on which it was received; means for incoφorating into one of said messages the identity of the node, thereby generating in the message a path which has been followed by the message; and means for propagating the modified Synchronisation Status Message to neighbouring nodes using outgoing links, wherein at least certain of the nodes in the network are arranged to introduce a delay in the propagation of the respective modified messages.
14. A node for use in a multi-node telecommunications network, the node comprising: means for receiving on the or each of at least some of the incoming links to the node a Synchronisation Status Message incoφorating the identities of the nodes through which the message has passed; means for registering the path or path length of the or each Synchronisation
Status Message as an attribute for the link on which it was received; means for incoφorating into one of the messages the identity of the node, thereby generating in the message a node path which has been followed by the message; and means for propagating the modified Synchronisation Status Message to neighbouring nodes using outgoing links, after a predefined time delay.
15. A method of synchronising nodes of a telecommunication network in which a master node is coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes are each arranged to synchronise their internal clock to the PRC using data received on incoming data link, the method comprising: propagating Synchronisation Status Messages through the network from the master node, with each slave node through which a message passes incrementing a distance counter contained in the message, thereby generating in each message a path length taken by the message; introducing a delay in the propagation of the messages at at least certain of the network nodes; and for each of at least some of the incoming links of each node, registering the path length of a Synchronisation Status Message received on a link as an attribute for that link.
16. A method of synchronising nodes of a telecommunication network in which a master node is coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes are each arranged to synchronise their internal clock to the PRC using data received on incoming data link, the method comprising: propagating Synchronisation Status Messages through the network from the master node, with each node through which a message passes incoφorating into the message its own identity, thereby generating in each message a path which has been followed by the message; for each of at least some of the incoming links of each slave node, registering the path or path length of a Synchronisation Status Message received on that link as an attribute for that link; and for each slave node, identifying the best incoming signalling link and synchronising on that link after a time delay, indicated by the path of the
Synchronisation Status Message received on that link, has elapsed, assuming that no better link is identified in the meantime.
17. A method of synchronising a node of a telecommunication network in which a master node is coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes are each arranged to synchronise their internal clock to the PRC using data received on an incoming data link, the method comprising: sending a Synchronisation Status Message Request from the node to be synchronised to neighbouring nodes in the network; returning Synchronisation Status Messages from the neighbouring nodes to the requesting node, said messages including a path which has been followed by the message from the master node; synchronising said node on the incoming signalling link over which the message having the shortest path was received; extending the path of the message having the shortest path to include the identity the receiving node; and propagating the modified synchronisation message to at least certain of the neighbouring nodes.
18. A node for use in a multi-node telecommunications network, the node comprising: means for sending a Synchronisation Status Message Request to neighbouring nodes in the network; means for receiving on incoming links to the node, respective Synchronisation Status Messages incoφorating the identities of the nodes through which the messages have passed; means for registering the paths or path lengths of the Synchronisation Status Messages as attributes for the respective links on which they were received; means for incoφorating into the message having the shortest path length the identity of the node, thereby generating in the message a path which has been followed by the message; and means for propagating the modified Synchronisation Status Message to at least certain neighbouring nodes using outgoing links.
19. A method of synchronising a node of a telecommunication network in which a master node is coupled to a Primary Reference Clock (PRC) and a plurality of slave nodes are each arranged to synchronise their internal clock to the PRC using data received on incoming data link, the method comprising: sending a Synchronisation Status Message Request from the node to be synchronised to neighbouring nodes in the network; returning Synchronisation Status Messages from the neighbouring nodes to the requesting node, said messages including a path length which has been taken by the message from the master node; synchronising said node on the incoming signalling link over which the message having the shortest path length was received; extending the path of the message; and propagating the modified synchronisation message to at least certain of the neighbouring nodes.
PCT/EP2000/011539 1999-12-22 2000-11-20 Telecommunication network synchronisation WO2001047150A1 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
DE60020162T DE60020162T2 (en) 1999-12-22 2000-11-20 SYNCHRONIZING A MESSAGE TRANSMISSION NETWORK
AU18584/01A AU1858401A (en) 1999-12-22 2000-11-20 Telecommunication network synchronisation
AT00981281T ATE295638T1 (en) 1999-12-22 2000-11-20 SYNCHRONIZATION OF A MESSAGE TRANSMISSION NETWORK
EP00981281A EP1240732B1 (en) 1999-12-22 2000-11-20 Telecommunication network synchronisation

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
GBGB9930132.7A GB9930132D0 (en) 1999-12-22 1999-12-22 Telecommunication network synchronisation
GB9930132.7 1999-12-22

Publications (1)

Publication Number Publication Date
WO2001047150A1 true WO2001047150A1 (en) 2001-06-28

Family

ID=10866694

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2000/011539 WO2001047150A1 (en) 1999-12-22 2000-11-20 Telecommunication network synchronisation

Country Status (10)

Country Link
US (1) US7031329B2 (en)
EP (1) EP1240732B1 (en)
CN (1) CN1211963C (en)
AR (1) AR029208A1 (en)
AT (1) ATE295638T1 (en)
AU (1) AU1858401A (en)
DE (1) DE60020162T2 (en)
GB (1) GB9930132D0 (en)
TW (1) TW490954B (en)
WO (1) WO2001047150A1 (en)

Families Citing this family (50)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003028258A1 (en) * 2001-09-26 2003-04-03 Siemens Aktiengesellschaft Method for synchronising nodes of a communications system
DE10308952A1 (en) * 2003-02-28 2004-09-09 Siemens Ag Synchronization in a switchable data network
US7583704B1 (en) * 2003-06-10 2009-09-01 Carl Walker Synchronizing separated upstream and downstream channels of cable modem termination systems
CN100350763C (en) * 2004-01-02 2007-11-21 上海欣泰通信技术有限公司 Time supply and synchronizing system for telecommunication network
US7599398B1 (en) * 2004-07-01 2009-10-06 Cisco Technology, Inc. Method and apparatus for dynamically adjusting system timers in wireless networks to optimize connection performance
CN1770701A (en) * 2004-11-03 2006-05-10 华为技术有限公司 Clock track realizing method in MESH network
US8767705B2 (en) * 2004-11-25 2014-07-01 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Method for synchronization and data transmission in a multi-hop network
US7783746B2 (en) * 2005-06-30 2010-08-24 Infinera Corporation Efficient synchronization of element management systems to network element attributes
KR100965672B1 (en) 2005-07-06 2010-06-24 삼성전자주식회사 System and method for state synchroniation between a base station and a mobile station in a mobile communication system
US7539889B2 (en) 2005-12-30 2009-05-26 Avega Systems Pty Ltd Media data synchronization in a wireless network
US8462627B2 (en) * 2005-12-30 2013-06-11 Altec Lansing Australia Pty Ltd Media data transfer in a network environment
CN100442903C (en) * 2006-01-20 2008-12-10 华为技术有限公司 Realization method and device for improving clock source stability
FI119310B (en) * 2006-10-02 2008-09-30 Tellabs Oy Procedure and equipment for transmitting time marking information
CN1946017A (en) 2006-10-09 2007-04-11 华为技术有限公司 Method and system for clock synchronizing of transmission end and receiving end in package switching network
US8036330B2 (en) * 2006-12-29 2011-10-11 Samsung Electronics Co., Ltd. System and method for frequency synchronization in a wireless non-hierarchical network
US8036247B2 (en) * 2007-01-05 2011-10-11 Frank Paul R System and method of synchronizing real time clock values in arbitrary distributed systems
WO2008101394A1 (en) * 2007-02-13 2008-08-28 Shan Dong University Real-time synchronous method and synchronous network based on the standard ethernet
US8199695B2 (en) * 2007-04-10 2012-06-12 International Business Machines Corporation Clock signal synchronization among computers in a network
CN101309122B (en) * 2007-05-17 2013-01-02 华为技术有限公司 Clock track relation establishing method and clock track relation computing apparatus
US8351369B2 (en) * 2007-12-12 2013-01-08 Synapsense Corporation Apparatus and method for adaptive data packet scheduling in mesh networks
US7995467B2 (en) * 2007-12-12 2011-08-09 Synapsense Corporation Apparatus and method for adapting to failures in gateway devices in mesh networks
US8331282B2 (en) * 2007-12-28 2012-12-11 Synapsense Corporation Apparatus and method for adaptive channel hopping in mesh networks
US8885548B2 (en) * 2007-12-28 2014-11-11 Synapsense Corporation Apparatus and method for admitting new devices in a self-healing, self-organizing mesh network
JP5169485B2 (en) * 2008-05-26 2013-03-27 富士通株式会社 Communication apparatus and control method
US8473898B2 (en) * 2008-07-08 2013-06-25 Synapsense Corporation Apparatus and method for building integrated distributed applications for use with a mesh network
US8532003B2 (en) * 2008-10-03 2013-09-10 Synapsense Corporation Apparatus and method for managing packet routing through internally-powered network devices in wireless sensor networks
US8538584B2 (en) 2008-12-30 2013-09-17 Synapsense Corporation Apparatus and method for controlling environmental conditions in a data center using wireless mesh networks
US8600560B2 (en) 2008-12-30 2013-12-03 Synapsense Corporation Apparatus and method for controlling computer room air conditioning units (CRACs) in data centers
US8761084B2 (en) * 2009-01-14 2014-06-24 Synapsense Corporation Apparatus and method for establishing data communication in a time-synchronized mesh wireless network during time synchronization failures
US8160838B2 (en) * 2009-04-30 2012-04-17 Synapsense Corporation Apparatus and method for visualizing environmental conditions in a data center using wireless sensor networks
EP2443901B1 (en) * 2009-06-15 2019-12-25 Synapsense Corporation Apparatuses and methods for ambient noise adaptation in wireless sensor networks
US8582450B1 (en) * 2009-09-30 2013-11-12 Shoretel, Inc. Status reporting system
TWI421667B (en) * 2009-10-07 2014-01-01 Univ Nat Cheng Kung Method of clock synchronization and internet system using the same
CN102083193B (en) * 2009-11-30 2016-09-28 中兴通讯股份有限公司 The synchronous method of network node and system in tdd systems
DE102010022525A1 (en) * 2010-02-11 2012-05-10 Siemens Aktiengesellschaft Method for time synchronization in communication network for industrial automation system, involves estimating frequency ratio of reference cycle frequency to internal cycle frequency of node
WO2011131822A1 (en) * 2010-04-22 2011-10-27 Nokia Corporation Open/closed loop synchronization for radio transmitters
CN105578589A (en) * 2010-04-22 2016-05-11 诺基亚技术有限公司 Open/closed loop synchronization for radio transmitter
US9178640B2 (en) * 2010-08-20 2015-11-03 Qualcomm Incorporated Determination of network synchronization
US8811377B1 (en) 2010-08-30 2014-08-19 Synapsense Corporation Apparatus and method for instrumenting devices to measure power usage using a multi-tier wireless network
US8681645B2 (en) * 2011-02-25 2014-03-25 Time Warner Cable Inc. System and method for coordinated discovery of the status of network routes by hosts in a network
US20130070751A1 (en) * 2011-09-20 2013-03-21 Peter Atwal Synchronization of time in a mobile ad-hoc network
CN102594481B (en) * 2012-03-08 2017-05-10 中兴通讯股份有限公司 Clock oscillation generating method, device and system
US10447532B2 (en) * 2015-10-23 2019-10-15 International Business Machines Corporation Non-disruptively merging coordinated timing networks
GB2554638B (en) * 2016-09-28 2019-12-04 Advanced Risc Mach Ltd Error detection in communication networks
US10164759B1 (en) 2016-12-13 2018-12-25 Amazon Technologies, Inc. Distributed precision time architecture
US10158442B1 (en) * 2016-12-13 2018-12-18 Amazon Technologies, Inc. Reliable precision time architecture
CN109327273B (en) * 2018-01-02 2021-03-05 中国移动通信有限公司研究院 Synchronization information transmission method, synchronization method, network node and storage medium
US10708924B2 (en) * 2018-02-22 2020-07-07 Trabus Technologies Data communication using interference alignment
CN110336634B (en) * 2018-04-23 2021-03-23 苏州拓夫电子科技有限公司 Clock distribution and synchronization method for multiple subsystems in data transmission system
CN111404701B (en) * 2019-12-16 2022-04-05 杭州复杂美科技有限公司 Information broadcasting method, equipment and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0626769A2 (en) * 1993-05-26 1994-11-30 Nec Corporation Network synchronization for TDMA cellular communication using signals from mobile stations in neighboring cells
WO1997033396A2 (en) * 1996-03-08 1997-09-12 Northern Telecom Limited Network synchronisation
WO1998035466A2 (en) * 1997-02-11 1998-08-13 Nokia Telecommunications Oy Synchronization of telecommunications network

Family Cites Families (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI71452C (en) * 1985-04-10 1986-12-19 Arvo Mustonen SYNKRONISERINGSFOERFARANDE FOER ETT LOKALT T EX RIKSOMFATTANDEPERSONSOEKARNAETS RADIOSAENDARE
US4736393A (en) * 1986-04-16 1988-04-05 American Telephone And Telegraph Co., At&T Information Systems, Inc. Distributed timing control for a distributed digital communication system
US5001730A (en) * 1989-03-31 1991-03-19 International Business Machines Corporation Clock synchronization algorithm for address independent networks
US5068877A (en) 1990-04-02 1991-11-26 At&T Bell Laboratories Method for synchronizing interconnected digital equipment
US5428645A (en) * 1992-11-03 1995-06-27 International Business Machines Corporation Anonymous time synchronization method
FI95979C (en) * 1994-03-01 1996-04-10 Nokia Telecommunications Oy Hierarchical synchronization procedure
GB2301991B (en) 1995-06-06 1999-06-30 Plessey Telecomm SDH Network
US5699388A (en) * 1995-06-21 1997-12-16 Motorola, Inc. System and method for fully distributed synchronization of a radio communication network
SE518132C2 (en) * 1996-06-07 2002-08-27 Ericsson Telefon Ab L M Method and apparatus for synchronizing combined receivers and transmitters in a cellular system
US6130889A (en) * 1996-10-02 2000-10-10 International Business Machines Corporation Determining and maintaining hop-count for switched networks
US5875179A (en) * 1996-10-29 1999-02-23 Proxim, Inc. Method and apparatus for synchronized communication over wireless backbone architecture
US5881243A (en) * 1997-05-07 1999-03-09 Zaumen; William T. System for maintaining multiple loop free paths between source node and destination node in computer network
US6157957A (en) * 1998-01-22 2000-12-05 Cisco Technology, Inc. Clock synchronization system and method using a continuous conversion function for a communication network
US6611872B1 (en) * 1999-01-11 2003-08-26 Fastforward Networks, Inc. Performing multicast communication in computer networks by using overlay routing
JP3761732B2 (en) * 1999-01-19 2006-03-29 富士通株式会社 Network synchronization controller
US6671291B1 (en) * 1999-07-21 2003-12-30 Qualcomm Incorporated Method and apparatus for sequentially synchronized network
AU2068201A (en) * 1999-12-08 2001-06-18 Broadcom Homenetworking, Inc. Synchronized transport across non-synchronous networks

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0626769A2 (en) * 1993-05-26 1994-11-30 Nec Corporation Network synchronization for TDMA cellular communication using signals from mobile stations in neighboring cells
WO1997033396A2 (en) * 1996-03-08 1997-09-12 Northern Telecom Limited Network synchronisation
WO1998035466A2 (en) * 1997-02-11 1998-08-13 Nokia Telecommunications Oy Synchronization of telecommunications network

Also Published As

Publication number Publication date
US7031329B2 (en) 2006-04-18
GB9930132D0 (en) 2000-02-09
AR029208A1 (en) 2003-06-18
ATE295638T1 (en) 2005-05-15
US20010005361A1 (en) 2001-06-28
EP1240732A1 (en) 2002-09-18
DE60020162T2 (en) 2006-01-26
DE60020162D1 (en) 2005-06-16
EP1240732B1 (en) 2005-05-11
AU1858401A (en) 2001-07-03
CN1211963C (en) 2005-07-20
TW490954B (en) 2002-06-11
CN1421075A (en) 2003-05-28

Similar Documents

Publication Publication Date Title
EP1240732B1 (en) Telecommunication network synchronisation
US6317475B1 (en) Synchronization of telecommunications network
JP3814296B2 (en) Synchronization in SDH networks
US5579318A (en) Processes and apparatus for maintaining data concurrence between databases in telecommunications networks
EP2093925A1 (en) A method, an apparatus and a network element for tracing clock
EP1427121A1 (en) Radio access network, radio communication method, synchronous server and node
CN102036361B (en) Processing method, device and system for clock source selection
US6185247B1 (en) Method of reducing synchronization rearrangements in synchronous transmission systems
EP2782290A1 (en) Method, system and apparatus for implementing hybrid networking of multiple clock synchronization technologies
JP2008501262A (en) Distributed synchronization method and system
US20020029266A1 (en) Parallel processing architecture for alarm management network entities
FI104592B (en) Maintenance of synchronization over a telecommunications network
JP6326907B2 (en) Transmission system, transmission apparatus, and clock synchronization method
CN103297216A (en) Method and device for enabling equipment to achieve synchronization
AU676695B2 (en) Network arrangement
CN101695046A (en) Method and equipment for arranging RRPP block points
Harrington Synchronization techniques for various switching network topologies
US7355985B2 (en) Automatic update of squelch tables for optical network applications
CN102487301A (en) Method and device for recovering multilink clock
JP2004194067A (en) Synchronous network establishing method and apparatus
WO2013097365A1 (en) Method and network device for converging master clock sources
JP2010219850A (en) Method for switching synchronization timing source of transmission communication device
KR100264081B1 (en) Method for propagation delay revision in wireless local loop
KR19990058828A (en) Network synchronizer
Crossett et al. SONET/SDH network synchronization and synchronization sources

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
WWE Wipo information: entry into national phase

Ref document number: 2000981281

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 008182221

Country of ref document: CN

WWP Wipo information: published in national office

Ref document number: 2000981281

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

WWG Wipo information: grant in national office

Ref document number: 2000981281

Country of ref document: EP