CN108809833A - A method of automatically configuring synchronous network clock track path - Google Patents
A method of automatically configuring synchronous network clock track path Download PDFInfo
- Publication number
- CN108809833A CN108809833A CN201810621908.2A CN201810621908A CN108809833A CN 108809833 A CN108809833 A CN 108809833A CN 201810621908 A CN201810621908 A CN 201810621908A CN 108809833 A CN108809833 A CN 108809833A
- Authority
- CN
- China
- Prior art keywords
- network element
- path
- element device
- network
- node
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- 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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- 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/0638—Clock or time synchronisation among nodes; Internode synchronisation
- H04J3/0658—Clock or time synchronisation among packet nodes
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of methods automatically configuring synchronous network clock track path, include the following steps：There are all network element devices of connection relation with injection node for acquisition, and according to fiber port attribute and transmission rate, connection fiber path between automatic preferably each network element device neighbours, oriented adjacency list is depicted as using most rickle algorithm by all connection fiber paths；Using the oriented adjacency list, the primary track path of all network element devices in synchronizing network is calculated；According to the primary track path, the spare track path of all network element devices in synchronizing network is calculated；Automatically generate the relevant configuration of each network element device in synchronizing network.The present invention, using in synchronizing network, there are each network element devices of connection relation to the most short hop count of injection node with injection node, primary, spare synchronizing network track path tree is automatically generated, the human cost of configuration synchronizing network is reduced, synchronizing network planning and the efficiency opened can be improved.
Description
Technical field
The present invention relates to communication system network operation management technical fields, and in particular to when one kind automatically configuring synchronizing network
The method of clock track path.
Background technology
With the fast development of the Internet, applications, more and more transmission network business need low delays and high-precise synchronization,
Clock synchronization and the requirement of time synchronization are higher and higher to be realized to whole network.
Currently, synchronous, time synchronization configuration and management for network element device clock in transmission network, major way is still
By manually planning from network management system, and the track path of the synchronization of done site by site configurable clock generator or Time Synchronization Network, work as whole network
The quantity of transmission network element device sharply increases, or when there is the case where website frequently adjusts, and operator needs to expend a large amount of
Manpower energy is adjusted synchronizing network, so as to cause the efficiency of whole network configuration and cutover is reduced.
In view of this, in network management system, a kind of automatic planning of offer is provided and generates the configuration calculation in synchronizing network path
Method, the O&M efficiency for promoting whole network.
Invention content
The technical problem to be solved by the present invention is to existing artificial planning, and done site by site configurable clock generator is synchronous or time synchronization
The mode of the track path of network, efficiency is low, needs to expend the problem of a large amount of manpower energy is adjusted synchronizing network.
In order to solve the above-mentioned technical problem, the technical solution adopted in the present invention is to provide one kind and automatically configuring synchronizing network
The method in clock tracing path, includes the following steps：
There are all network element devices of connection relation with injection node in acquisition synchronizing network, and according to each network element device neighbour
Fiber port attribute between residence and transmission rate, the connection fiber path preferably between each network element device neighbours, utilizes automatically
All connection fiber paths are depicted as oriented adjacency list by most rickle algorithm；
Synchronization is calculated based on the shortest principle of route jumping figure of distance injection node using the oriented adjacency list
The primary track path of all network element devices in network；
According to the primary track path, the spare track path of all network element devices in synchronizing network is calculated, and will
Reachable network element device in synchronizing network tracks on the close network element device of distance injection node time；
According to the primary, spare track path, the relevant configuration of each network element device in synchronizing network is automatically generated.
In the above-mentioned methods,
If there are the connections of a plurality of optical fiber between network element device neighbours, according to the optical fiber end between each network element device neighbours
Mouthful attribute and transmission rate, preferably wherein an optical fiber be connected to the transmission path of synchronized signal, wherein：
The preferred principle of port attribute is that the priority of optical port connection fiber path connects fiber path higher than power port, and passes
The priority of the high port of the defeated rate port low higher than rate connects fiber path；
The optimum principle that optical fiber connects direction is that convergence-level network element device is injected to access layer network element device.
In the above-mentioned methods, according to up to routing, obtaining in synchronizing network, there are all of connection relation with injection node
Network element device.
In the above-mentioned methods, all injection nodes are traversed, respectively according to preferred connection fiber path, utilize most rickle
Algorithm draws oriented adjacency list.
In the above-mentioned methods,
The specific method for drawing oriented adjacency list includes：
S21, traversal injection node；
S22, unidirectional PATH is established by the clock injection direction of injection node, and injects oriented adjacency list；
S23, using Di Jiesite most rickle algorithms, find the most short hop count path of each network element device distance injection node
Tree：
The each tree end-node PATH of S24, record, as the most short hop count of the network element device under current injection node
Track path；
S25, network element device track path is searched in the primary track path temporal cache of network element device；
S26, it is each injection node between more each track path hop count, using the track path of hop count minimum as network element
The primary synchronized tracking path of equipment.
In the above-mentioned methods,
The method for obtaining most short hop count includes the following steps：
The hop count that decanting point S0 is pressed into Priority Queues QUEUE first, and records S0 is 0；
The company fibre PATHx in oriented adjacency list is begun stepping through from decanting point S0, judges that the hop count of S0 adds the jump of PATHx
Whether number is less than the hop count of the egress node NODEz of PATHx, the node NODEx of shorter hop count is found, equipment and hop count
NODEx is pressed into Priority Queues QUEUE；
Again the extraction device node NODEx from Priority Queues QUEUE judges whether the equipment hop count currently calculated is small
In the most short hop count of the node recorded, if so, being then current most short hop count, shortest path need not be sought again, is otherwise continued
Search most short hop count；
It repeating to take out node NODEx from Priority Queues QUEUE, the oriented adjacency list of poll searches more short path, until
All devices NODE finds most short hop count in oriented adjacency list；It is exported respectively using the decanting point as starting point, institute in topology
There is the most short hop count path of equipment.
In the above-mentioned methods,
The computational methods of the primary track path include the following steps：
S31, traversal injection node；
S32, unidirectional PATH is established by the clock injection direction of injection node, injects oriented adjacency list；
The network element device of S33, traversal with primary path；
S34, the final jump of its primary path is deleted in figure；
S35, the network element device is calculated to the shortest path of this injection node using Dijkstra algorithm；
S36, step S33 is repeated, until all network element devices with primary path are all obtained in this injection node
Under shortest path；
S37, it is exported respectively using the injection node as starting point, the most short hop count path of all network element devices in topology；
Compare between S38, injection node, retains that path of hop count minimum, and as the spare same of the network element device
Walk track path.
In the above-mentioned methods,
The method for generating the relevant configuration of each network element device in synchronizing network includes the following steps：
S41, calculate the corresponding port of each network element device synchronous path final jump, main port as the first priority,
Standby port generates network element device corresponding configuration as the second priority；
S42, according to the sequence of primary synchronous path tree, since root node downloading network element device synchronizes configuration；
If S43, a certain transmission network element device failed download, skip all network element devices for tracing into the network element device and match
Downloading task is set, downloads since another network element device at the same level, until the completion of all network element device downloading tasks, and records
Carry the network element device of failure.
In the above-mentioned methods, most rickle algorithm is using Di Jiesite most rickle algorithms.
In the above-mentioned methods, according to up to routing, obtaining in synchronizing network, there are all of connection relation with injection node
Track in node and synchronizing network with injection node there are all network element devices of connection relation, ensure each tracking node and
Injection node has path reachable.
Compared with prior art, the method provided by the invention for automatically configuring synchronous network clock track path, by obtaining
Take in synchronizing network that there are all network element devices of connection relation with injection node, and according to the light between each network element device neighbours
Fine port attribute and transmission rate, the connection fiber path between automatic preferably each network element device neighbours, using most rickle algorithm,
The most short hop count with injection node there are each network element device of connection relation to injection node in synchronizing network is calculated, automatically
Generate primary, spare synchronizing network track path tree.Reduce the track path of configurable clock generator synchronization or Time Synchronization Network
Human cost and energy improve efficiency, and can avoid opening the stage in synchronizing network, plan synchronized tracking configuration manually,
The efficiency for improving synchronizing network planning and opening, while can avoid timing loop abnormal phenomenon occur.
Description of the drawings
Fig. 1 is the flow chart of method provided by the invention；
Fig. 2 is the flow chart that step S2 is realized in the present invention；
Fig. 3 is the flow chart that step S3 is realized in the present invention.
Specific implementation mode
The present invention provides a kind of methods automatically configuring synchronous network clock track path, entire same for automatically configuring
Walk clock synchronization and the time synchronization of network.
The method provided by the invention for automatically configuring synchronous network clock track path, can efficiently plan synchronizing network
Clock tracing path, in the case of number of nodes is more, advantage is more obvious.It is with reference to the accompanying drawings of the specification and specific real
Mode is applied to be described in detail the present invention.
The present invention realization principle be：
Using most rickle algorithm, calculate in synchronizing network with injection node there are each network element devices of connection relation to arrive
The most short hop count for injecting node, automatically generates primary, spare synchronizing network track path tree, then according to primary, spare tracking road
Diameter tree automatically generates the relevant configuration of each network element device in synchronizing network.The present invention program, user can avoid opening in synchronizing network
The logical stage plans synchronized tracking configuration manually, the efficiency for improving synchronizing network planning and opening, while can avoid timing occur
Ring abnormal phenomenon.
The method provided by the invention for automatically configuring synchronous network clock track path, the realization master of basic technical scheme
Include the following steps：
There are all network element devices of connection relation with injection node in acquisition synchronizing network, and are set according to above-mentioned each network element
For the fiber port attribute and transmission rate between neighbours, the connection fiber path between automatic preferably each network element device neighbours,
All connection fiber paths are depicted as oriented adjacency list using most rickle algorithm.
Using the oriented adjacency list, the shortest principle of route jumping figure based on distance injection node calculates synchronous net
The primary track path of all network element devices in network；
According to the primary track path, the spare track path of all network element devices in synchronizing network is calculated, and will
Reachable network element device in synchronizing network tracks on the close network element device of distance injection node time；
According to the primary, spare track path, the relevant configuration of each network element device in synchronizing network is automatically generated.
Herein, track path is clock tracing path.
It is illustrated more clearly that be made to technical scheme of the present invention and realization method, it is introduced below to realize skill of the present invention
Several preferred specific embodiments of art scheme.Obviously, specific embodiment discussed below is only that the part of the present invention is real
Example is applied, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art are not making creation
Property labour under the premise of the every other embodiment that is obtained, shall fall within the protection scope of the present invention.
Specific embodiment 1.
As shown in Figure 1, the key step that 1 technical solution of specific embodiment is realized includes：
Step S1：It is automatic preferred according to the topological relation for the network element device and synchronizing network for injecting node in synchronizing network
Go out the connection fiber path between each network element device neighbours, and is depicted as all connection fiber paths using most rickle algorithm
Oriented adjacency list.
Step S2：The oriented adjacency list obtained using step S1, the route jumping figure based on distance injection node are shortest
Principle calculates the primary track path for obtaining all network element devices in synchronizing network.
Step S3：According to each primary track path that step S2 is obtained, the spare track path of synchronizing network is calculated, and
Reachable network element device in synchronizing network is tracked on the close network element device of distance injection node time；
Step S4：According to the primary, spare track path that step S3 is obtained, each network element device in synchronizing network is automatically generated
Relevant configuration.
In embodiments above 1, in step S1：
Most rickle algorithm is using Di Jiesite (Dijkstra) most rickle algorithms.
According to up to routing, obtaining in synchronizing network with injection node there are all tracking node NODE of connection relation,
And in synchronizing network with injection node there are all network element devices of connection relation, ensure each tracking node and to inject node equal
There is path reachable.
If there are the connections of a plurality of optical fiber between network element device neighbours, according to the optical fiber end between each network element device neighbours
Mouthful attribute and transmission rate, preferably wherein an optical fiber be connected to the transmission path of synchronized signal, wherein：
The preferred principle of port attribute is：The priority that optical port connects fiber path connects fiber path higher than power port, and
The priority of the high port of the transmission rate port low higher than rate connects fiber path；
Optical fiber connection direction optimum principle be：Convergence-level network element device is injected to access layer network element device.
Drawing the method that oriented adjacency list uses is：
All injection nodes are traversed, according to preferred connection fiber path PATH, respectively as oriented adjoining
The Priority Queues of table recycles Di Jiesite most rickle algorithm optimization most rickles, draws out oriented adjacency list.
In specific embodiments of the present invention 1, step S2 can also be calculated and obtain all network element devices in synchronizing network
Primary track path further refined, to form specific embodiments of the present invention 2.
Specific embodiment 2.
As shown in Fig. 2, the method that this specific embodiment 2 realizes step S2 includes the following steps：
S21, traversal injection node；
S22, unidirectional connection fiber path PATH is established by the clock injection direction of injection node, and injects oriented neighbour
It connects in table；
S23, using Di Jiesite most rickle algorithms, find the most short hop count path of each network element device distance injection node
Tree：
S24, the end-node connection fiber path PATH for recording each path tree are somebody's turn to do as under current injection node
The most short hop count of the track path of network element device；
S25, the track path that network element device is searched in the primary track path temporal cache of network element device；
S26, it is each injection node between more each track path hop count, using the track path of hop count minimum as network element
The primary synchronized tracking path of equipment.
In the method that specific embodiment 2 realizes step S2, the Method And Principle that step S23 obtains most short hop count is：
The hop count that decanting point S0 is pressed into Priority Queues QUEUE first, and records S0 is 0；
The company fibre PATHx in oriented adjacency list G is begun stepping through from decanting point S0, judges the hop count of S0 plus PATHx's
Whether hop count is less than the hop count of the egress node NODEz of PATHx, to find the node NODEx of shorter hop count, equipment and jump
Number NODEx indentation Priority Queues QUEUE；
Again the extraction device node NODEx from Priority Queues QUEUE judges whether the equipment hop count currently calculated is small
In the most short hop count of the node recorded, it is then current most short hop count in this way, shortest path need not be sought again, otherwise continue to look into
Look for most short hop count.
It repeats to take out node NODEx, the oriented adjacency list G of poll from QUEUE, more short path is searched, until oriented
All devices NODE finds most short hop count in adjacency list G；
It is exported respectively using the decanting point as starting point, the most short hop count path of all devices, generates primary tracking in topology
Path tree.
In specific embodiments of the present invention 1, spare tracking road can also be calculated according to primary track path to step S3
Diameter is further refined, to form specific embodiments of the present invention 3.
Specific embodiment 3.
As shown in figure 3, the method that specific embodiment 3 realizes step S3 includes the following steps：
S31, traversal injection node；
S32, using the injection node as starting point, by injection node clock injection direction establish unidirectional connection fiber path
PATH injects in oriented adjacency list；
The network element device of S33, traversal with primary track path；
S34, the final jump of the primary track path of the network element device is deleted in oriented adjacency list；
S35, using Dijkstra algorithm, the network element device is calculated to the shortest path of this injection node；
S36, repeat step S33, until obtain all the network element device with primary path under this injection node
Shortest path；
S37, it is exported respectively using the injection node as starting point, the most short hop count path of all network element devices in topology；
Shortest path between S38, relatively more each injection node, using the path of hop count minimum as the spare of the network element device
Synchronized tracking path.
S39, the spare track path of refreshing a device, ultimately produce spare track path tree.
In specific embodiments of the present invention 1, step S4 can also further be refined, to form the present invention
Specific embodiment 4.
Specific embodiment 4.
The method that specific embodiment 4 realizes step S4 includes the following steps：
S41, calculate each network element device track path the corresponding port of final jump, wherein：Main port is as
One priority, standby port generate network element device corresponding configuration as the second priority；
S42, according to the sequence of primary track path tree, the clock that network element device is downloaded since root node synchronizes configuration；
If S43, a certain transmission network element device download clock and synchronize configuration failure, skips and all trace into the network element device
Downloading task, download since another network element device at the same level, until all network element device downloading tasks are completed, and record
Carry the network element device of failure.
The invention is not limited in above-mentioned preferred forms, and anyone should learn that is made under the inspiration of the present invention
Structure change, the technical schemes that are same or similar to the present invention are each fallen within protection scope of the present invention.
Claims (10)
1. a kind of method automatically configuring synchronous network clock track path, which is characterized in that include the following steps：
Obtain synchronizing network in injection node there are all network element devices of connection relation, and according to each network element device neighbours it
Between fiber port attribute and transmission rate, the connection fiber path between automatic preferably each network element device neighbours utilize minimum
All connection fiber paths are depicted as oriented adjacency list by heap algorithm；
Synchronizing network is calculated based on the shortest principle of route jumping figure of distance injection node using the oriented adjacency list
In all network element devices primary track path；
According to the primary track path, the spare track path of all network element devices in synchronizing network is calculated, and will be synchronized
Reachable network element device in network tracks on the close network element device of distance injection node time；
According to the primary, spare track path, the relevant configuration of each network element device in synchronizing network is automatically generated.
2. according to the method described in claim 1, it is characterized in that, if there are a plurality of optical fiber companies between network element device neighbours
It connects, then according to the fiber port attribute and transmission rate between each network element device neighbours, an optical fiber is connected to preferably wherein
The transmission path of synchronized signal, wherein：
The preferred principle of port attribute is that the priority of optical port connection fiber path connects fiber path higher than power port, and transmits speed
The priority of the high port of the rate port low higher than rate connects fiber path；
The optimum principle that optical fiber connects direction is that convergence-level network element device is injected to access layer network element device.
3. according to the method described in claim 1, it is characterized in that, according to up to routing, obtains in synchronizing network and saved with injection
There are all network element devices of connection relation for point.
4. according to the method described in claim 1, it is characterized in that, traversing all injection nodes, basis preferably connects respectively
Fiber path is connect, oriented adjacency list is drawn using most rickle algorithm.
5. according to the method described in claim 4, it is characterized in that, the specific method for drawing oriented adjacency list includes：
S21, traversal injection node；
S22, unidirectional PATH is established by the clock injection direction of injection node, and injects oriented adjacency list；
S23, using Di Jiesite most rickle algorithms, find the most short hop count path tree of each network element device distance injection node：
The each tree end-node PATH of S24, record, as the tracking of the most short hop count of the network element device under current injection node
Path；
S25, network element device track path is searched in the primary track path temporal cache of network element device；
S26, it is each injection node between more each track path hop count, using the track path of hop count minimum as network element device
Primary synchronized tracking path.
6. according to the method described in claim 5, it is characterized in that, the method for obtaining most short hop count includes the following steps：
The hop count that decanting point S0 is pressed into Priority Queues first, and records S0 is 0；
The company fibre PATHx in oriented adjacency list is begun stepping through from decanting point S0, judges that the hop count of S0 is plus the hop count of PATHx
The hop count of the no egress node NODEz less than PATHx, finds the node NODEx of shorter hop count, equipment and hop count NODEx pressures
Enter Priority Queues QUEUE；
Again the extraction device node NODEx from Priority Queues QUEUE, judges whether the equipment hop count currently calculated is less than
The most short hop count of the node of record need not seek shortest path, otherwise continue to search for again if so, being then current most short hop count
Most short hop count；
It repeats to take out node NODEx from Priority Queues QUEUE, the oriented adjacency list of poll searches more short path, until oriented
Adjacency list in all nodes all find most short hop count；
It is exported respectively using the decanting point as starting point, the most short hop count path of all devices in topology.
7. according to the method described in claim 3, it is characterized in that, the computational methods of the primary track path include following step
Suddenly：
S31, traversal injection node；
S32, unidirectional PATH is established by the clock injection direction of injection node, injects oriented adjacency list；
The network element device of S33, traversal with primary path；
S34, the final jump of its primary path is deleted in figure；
S35, the network element device is calculated to the shortest path of this injection node using Dijkstra algorithm；
S36, step S33 is repeated, until all network element devices with primary path all obtain under this injection node
Shortest path；
S37, it is exported respectively using the injection node as starting point, the most short hop count path of all network element devices in topology；
S38, injection node between compare, retain hop count minimum that path, and as the spare synchronization of the network element device with
Track path.
8. according to the method described in claim 2, it is characterized in that, generating the relevant configuration of each network element device in synchronizing network
Method includes the following steps：
S41, the corresponding port of each network element device synchronous path final jump is calculated, main port is spare as the first priority
Port generates network element device corresponding configuration as the second priority；
S42, according to the sequence of primary synchronous path tree, since root node downloading network element device synchronizes configuration；
If S43, a certain transmission network element device failed download, skip under all network element device configurations for tracing into the network element device
Load task is downloaded since another network element device at the same level, until the completion of all network element device downloading tasks, and is recorded download and is lost
The network element device lost.
9. according to the method described in claim 1, it is characterized in that, most rickle algorithm is calculated using Di Jiesite most rickles
Method.
10. according to the method described in claim 1, it is characterized in that, according to up to routing, obtains in synchronizing network and saved with injection
There are there are all network elements of connection relation to set with injection node in all tracking nodes and synchronizing network of connection relation for point
It is standby, ensure that each tracking node has path reachable with injection node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810621908.2A CN108809833A (en) | 2018-06-15 | 2018-06-15 | A method of automatically configuring synchronous network clock track path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810621908.2A CN108809833A (en) | 2018-06-15 | 2018-06-15 | A method of automatically configuring synchronous network clock track path |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108809833A true CN108809833A (en) | 2018-11-13 |
Family
ID=64086720
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810621908.2A Withdrawn CN108809833A (en) | 2018-06-15 | 2018-06-15 | A method of automatically configuring synchronous network clock track path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108809833A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109921857A (en) * | 2019-02-22 | 2019-06-21 | 烽火通信科技股份有限公司 | A kind of method and device for planning of Transmission system |
| CN110443449A (en) * | 2019-07-02 | 2019-11-12 | 烽火通信科技股份有限公司 | A kind of fiber path reverse calculation algorithms and system |
| CN114448792A (en) * | 2022-01-04 | 2022-05-06 | 武汉烽火技术服务有限公司 | Method and device for automatically maintaining clock synchronization network based on network configuration change |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1770701A (en) * | 2004-11-03 | 2006-05-10 | 华为技术有限公司 | Clock track realizing method in MESH network |
| CN101309122A (en) * | 2007-05-17 | 2008-11-19 | 华为技术有限公司 | Clock track relation establishing method and clock track relation computing apparatus |
| US20090324215A1 (en) * | 2008-06-30 | 2009-12-31 | Huawei Technologies Co., Ltd. | Active/standby switchover method and device of asynchronous backplane in transport network |
| CN102332009A (en) * | 2011-09-02 | 2012-01-25 | 北京大学 | Relational query method implemented on large-scale data set |
| CN106301643A (en) * | 2015-05-15 | 2017-01-04 | 华为技术有限公司 | A kind of method followed the tracks of for configurable clock generator and control equipment |
| CN106888122A (en) * | 2017-03-06 | 2017-06-23 | 烽火通信科技股份有限公司 | A kind of method and system of synchronizing network tracking configuration |
| CN107547159A (en) * | 2016-06-28 | 2018-01-05 | 华为技术有限公司 | A kind of planing method and management equipment in clock tracing path |
-
2018
- 2018-06-15 CN CN201810621908.2A patent/CN108809833A/en not_active Withdrawn
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1770701A (en) * | 2004-11-03 | 2006-05-10 | 华为技术有限公司 | Clock track realizing method in MESH network |
| CN101309122A (en) * | 2007-05-17 | 2008-11-19 | 华为技术有限公司 | Clock track relation establishing method and clock track relation computing apparatus |
| US20090324215A1 (en) * | 2008-06-30 | 2009-12-31 | Huawei Technologies Co., Ltd. | Active/standby switchover method and device of asynchronous backplane in transport network |
| CN102332009A (en) * | 2011-09-02 | 2012-01-25 | 北京大学 | Relational query method implemented on large-scale data set |
| CN106301643A (en) * | 2015-05-15 | 2017-01-04 | 华为技术有限公司 | A kind of method followed the tracks of for configurable clock generator and control equipment |
| CN107547159A (en) * | 2016-06-28 | 2018-01-05 | 华为技术有限公司 | A kind of planing method and management equipment in clock tracing path |
| CN106888122A (en) * | 2017-03-06 | 2017-06-23 | 烽火通信科技股份有限公司 | A kind of method and system of synchronizing network tracking configuration |
Non-Patent Citations (1)
| Title |
|---|
| ETHSON: "单源最短路径（1）：Dijkstra算法", 《SEGMENTFAULT 思否》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109921857A (en) * | 2019-02-22 | 2019-06-21 | 烽火通信科技股份有限公司 | A kind of method and device for planning of Transmission system |
| CN110443449A (en) * | 2019-07-02 | 2019-11-12 | 烽火通信科技股份有限公司 | A kind of fiber path reverse calculation algorithms and system |
| CN110443449B (en) * | 2019-07-02 | 2022-05-13 | 烽火通信科技股份有限公司 | Optical fiber path back calculation method and system |
| CN114448792A (en) * | 2022-01-04 | 2022-05-06 | 武汉烽火技术服务有限公司 | Method and device for automatically maintaining clock synchronization network based on network configuration change |
| CN114448792B (en) * | 2022-01-04 | 2023-09-26 | 武汉烽火技术服务有限公司 | Method and device for automatically maintaining clock synchronization network based on network configuration change |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108809833A (en) | A method of automatically configuring synchronous network clock track path | |
| CN103259718B (en) | A kind of stream table conversion method and device | |
| CN105260817B (en) | Topological structure of electric and analysis method based on power network resources model | |
| CN105933148B (en) | A kind of SDNization GIS network topology model implementation method | |
| CN109995594A (en) | Block chain network method for managing resource, device and block catenary system | |
| CN103699664B (en) | A kind of power distribution network dynamic topology analysis method | |
| WO2017045578A1 (en) | Topological graph optimal path algorithm with constraint conditions | |
| CN104378229B (en) | A kind of link prediction method of opportunistic network | |
| CN109583665A (en) | A kind of unmanned plane charging tasks dispatching method in wireless sensor network | |
| CN103379032A (en) | Acquisition method and device for cross-domain end-to-end route and secondary route computation element | |
| CN109474023B (en) | Intelligent power distribution network section real-time updating method and system, storage medium and terminal | |
| WO2014003321A1 (en) | Start point-based traffic allocation method using shortest path | |
| CN109299404A (en) | Train operation pathway searching method based on LKJ track data, device and system | |
| CN106059696A (en) | Method and device for configuring synchronization network | |
| CN106201625A (en) | A kind of software version updating method, updating device and electronic equipment thereof | |
| CN107241273B (en) | A kind of communications ring network structure setting method based on genetic algorithm | |
| Ma et al. | An efficient approach to finding dense temporal subgraphs | |
| CN106301643B (en) | A kind of method and control device for configurable clock generator tracking | |
| CN109510681A (en) | A kind of communication system time synchronization the smallest datum node selection method of series | |
| CN106357501A (en) | Intelligent clock planning configuration method, device and integrated controller | |
| CN111800339A (en) | Route optimization method with path number constraint in hybrid SDN scene | |
| CN104967562B (en) | A kind of method for routing between internet of things equipment node | |
| CN106888122B (en) | Method and system for synchronous network tracking configuration | |
| CN102891760B (en) | Tunnel protection configuration method and system in a kind of network management system | |
| CN103428087A (en) | Longest path preset protection P ring generating method based on circulation depth-first traversal |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WW01 | Invention patent application withdrawn after publication | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20181113 |