CN112910689A - Clock network topology construction method and system - Google Patents
Clock network topology construction method and system Download PDFInfo
- Publication number
- CN112910689A CN112910689A CN202110061581.XA CN202110061581A CN112910689A CN 112910689 A CN112910689 A CN 112910689A CN 202110061581 A CN202110061581 A CN 202110061581A CN 112910689 A CN112910689 A CN 112910689A
- Authority
- CN
- China
- Prior art keywords
- network
- clock
- ring
- node
- sub
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/42—Loop networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W56/00—Synchronisation arrangements
- H04W56/001—Synchronization between nodes
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
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 clock network topology construction method, which comprises the steps of segmenting a network and dividing the network into a plurality of segment networks; in each piece area network, according to the sequence from high to low of a core network, a convergence network and an access network, acquiring a chain/tree network set and a ring network set in a corresponding network hierarchy, and determining a root node of each chain/tree network; appointing a network element in a ring network set in a core network as a clock source node, carrying out breadth-first search by taking the clock source node as a starting point to determine a plurality of sub-ring networks of the core network, determining the clock source node of each sub-ring network, and constructing to obtain a clock network topological structure of the ring network in the core network; respectively constructing and obtaining clock network topological structures of the ring networks in the convergence network and the access network; and respectively constructing a clock network topological structure of the chain/tree network in the core network, the convergence network and the access layer network. By the invention, the clock network topology construction can be quickly and effectively carried out on a complex network.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a clock network topology construction method and a clock network topology construction system.
Background
With the coming of the 5G era, new technologies, new devices and new services of communication devices have emerged endlessly, and digital communication networks have become more and more complex, efficient and intelligent, which has become the development direction of management and control of communication networks. The synchronous network is also receiving more and more attention in the industry as the most important and indispensable supporting network of the digital communication network. The synchronous network ensures the timing performance of the communication network, provides high-precision timing reference for the communication equipment, and is the key point for the accurate operation of the communication equipment on how to reliably and safely establish the perfect synchronous network.
In the prior art, clock planning is usually performed manually according to experience and by comprehensively considering various factors. In the current 5G era packet network, the planning of the synchronous network needs to consider not only the frequency synchronous network based on the synchronous ethernet network, but also the planning of the time synchronous network based on 1588v2, compared with the traditional transmission network, which increases the difficulty of manual planning. On the other hand, as the number of network elements in the network increases, the network topology becomes more and more complex, the opening efficiency is low depending on manual planning and manual configuration, and the whole network angle is lacked, the performance is difficult to achieve the optimum, and errors are easy to occur due to the fact that the local network stacking is usually based on.
Disclosure of Invention
In view of this, the present invention provides a clock network topology construction method and system, which can quickly and effectively construct a clock network topology for a complex network.
In order to achieve the above object, the present invention provides a clock network topology construction method, including:
s1, based on the connection relation among each network element forming the network, dividing the network into a plurality of subarea networks;
s2, in each piece area network, according to the network hierarchy to which the network element belongs, and the sequence of the network hierarchy from high to low, acquiring a chain/tree network set and a ring network set in each hierarchy network, and determining a root node of each chain/tree network, wherein the network hierarchy comprises a core network, a convergence network and an access network;
s3, a network element is appointed in a ring network set in a core network as a clock source node, breadth-first search is carried out by taking the clock source node as a starting point to determine a plurality of sub-ring networks of the core network, the clock source node of each sub-ring network is determined, and a clock network topological structure of the ring network in the core network is constructed and obtained;
s4, sequentially executing the method in the step S3, and respectively constructing and obtaining a clock network topological structure of a ring network in the convergence network and a clock network topological structure of a ring network in the access network;
s5, determining the chain/tree-shaped sub-network in the core network, the convergence network and the access layer network respectively, and constructing the clock network topology structure of the chain/tree-shaped sub-network in the core network, the convergence network and the access layer network;
s6, repeating the steps S3-S5, and obtaining the ring network clock network topology structure and the chain/tree network clock network topology structure in the core network, the convergence network and the access layer network of each zone network.
Preferably, the step S1 includes simplifying the composed network, and the simplifying step includes:
setting link weight between two nodes in the network based on the network level of the network element;
combining all links between any two nodes in the network into one link, and selecting the lowest link weight in all the links as the link weight of the link;
setting a link weight coefficient of the link based on the link weight;
and obtaining a corresponding undirected graph G of the network according to the link of each node, wherein V represents the node combination in the network, and E represents the link between the nodes.
Preferably, the step S1 includes:
creating n sets S1 and S2 … … Sn according to the undirected graph, traversing all links, and merging two sets where head and tail nodes are located into a set Si if head and tail nodes connected by a current link Ei do not belong to the same set, wherein the nodes in the set Si and corresponding links form a fragment area network;
and by analogy, traversing all links in the undirected graph to obtain a plurality of fragment networks.
Preferably, the step S2 includes:
acquiring all network elements of a core network in a current parcel network, and enabling all network elements and links to form a core network undirected graph G1 of the parcel network to be < V1, E1>, wherein V1 represents node combination in the core network, and E1 represents link connection between nodes;
inquiring nodes Vi with the node degree smaller than or equal to 1 in a node set V1 in the core network undirected graph; if the query is successful, the node Vi is removed from the set V and is placed into a node set V1 ', and the link Ei corresponding to the node Vi is removed from the link set E1 and is moved into a link set E1';
subtracting 1 from the node degree of the node associated with the node Vi, and repeating the steps until all the node numbers are traversed to form a chain/tree set;
in the chain/tree-like set, if the head or tail node of the link En is not in the V1 'set, marking the head or tail node as a root node, and adding the node into V1' to obtain a chain/tree-like network set;
and inquiring nodes with the node degree larger than 1 and corresponding links in a node set V1 of the core network undirected graph G1 to form a ring network set.
Preferably, the step S3 includes:
appointing a network element as a clock source node in a ring network set in a core network, taking the clock source node as a link of a starting point, and acquiring all sub-ring networks based on breadth-first search;
sequencing all the sub-ring networks in turn from large to small according to the number of nodes in the ring, acquiring the ring network with the largest number of nodes as a first sub-ring network H1, and determining the network topology of the first sub-ring network;
removing nodes and links in the first sub-ring network from the ring network set;
marking the nodes in the first ring network as planned nodes, and subtracting 1 from the node degrees of the nodes associated with the planned nodes in the ring network set;
searching a second sub-ring network, wherein the ring network searching rule is as follows; finding out a ring network which relates to the most unplanned nodes and relates to the least planned nodes from the ring network set as a second sub-ring network, removing the nodes and links in the second sub-ring network from the ring network set, and determining the network topology of the second sub-ring network;
and according to the same looped network searching rule and steps, sequentially finding out all the sub-looped networks which accord with the rule, and determining the network topology of each sub-looped network.
Preferably, the step S3 includes:
determining a sequence according to the network topology of each sub-ring network of the core network, and sequentially performing clock planning on each sub-ring network, wherein the rule of the clock planning comprises the following steps:
a main clock source node and a standby clock source node of the first sub-ring network are designated by a user;
selecting a main clock source node from the intersected nodes of the next sub-ring network and the previous sub-ring network, selecting a node with the largest hop count away from the main clock source node of the previous sub-ring network from the intersected nodes, wherein the left and right adjacent nodes of the node have at least one unmarked node, the node is used as a main clock source node, and the marked node is used as a standby clock source node;
if there is only one intersected node, the intersected node is a clock source node and only has a master clock source node.
Preferably, the step S4 further includes:
and when constructing a clock network topology structure of a ring network in the convergence network, taking network elements belonging to the core network and the convergence network as clock tracking sources.
Preferably, the step S4 further includes:
and when a clock network topological structure of the looped network in the access network is constructed, taking network elements belonging to the convergence network and the access network simultaneously as clock tracking sources.
Preferably, the step S5 includes:
and according to the link weight and the minimum spanning tree algorithm, sequentially constructing a chain/tree clock network topological structure in the core network, the aggregation network and the access layer network by taking the root node of the chain/tree subnet as a main clock source node.
In order to achieve the above object, the present invention provides a clock network topology construction system, including:
the network fragmentation module is used for fragmenting the network and dividing the network into a plurality of fragment networks based on the connection relation among all network elements forming the network;
a network aggregation module, which is used for acquiring a chain/tree network aggregation and a ring network aggregation in each level network according to the network level to which the network element belongs and the sequence from high to low of the network level in each piece area network, and determining a root node of each chain/tree network, wherein the network level comprises a core network, a convergence network and an access network;
a ring network clock topology module, which designates a network element in a ring network set in a core network as a clock source node, performs breadth-first search with the clock source node as a starting point to determine a plurality of sub-ring networks of the core network, determines a clock source node of each sub-ring network, constructs and obtains a clock network topology structure of a ring network in the core network, sequentially executes a method of the core network clock network construction module, and constructs and obtains a clock network topology structure of the ring network in the aggregation network and a clock network topology structure of the ring network in the access network;
and the chain/tree network clock topology module is used for respectively determining chain/tree subnets in the core network, the convergence network and the access layer network and constructing a clock network topology structure of the chain/tree subnets in the core network, the convergence network and the access layer network.
Compared with the prior art, the invention provides a clock network topology construction method and a system, which bring the following beneficial effects: the invention fully considers the networking characteristics of the 5G bearing network, and gradually changes to a convergence layer and an access layer from a core layer network, and carries out layered iterative planning; based on the automatic identification of the topological structures of the ring network and the chain/tree network, the clock planning and configuration are carried out according to the identified topological structures, so that the efficiency of constructing the topological structures is improved, and the practical engineering application can be better fitted; the network is divided into a plurality of block networks by fragmentation, so that the network topology construction speed is accelerated; on the basis of the breadth-first algorithm, 5G network features and a layering concept are introduced, the range of single processing is reduced, and the convergence speed is accelerated; after the discovery of part of ring network topologies is completed, the network topologies are removed, the range of topology construction processing each time is further reduced, and the processing efficiency is optimized; for a chain/tree network, a minimum spanning tree algorithm is adopted, and the characteristics of the 5G network are combined, so that the phenomenon that low-level network elements track high-level network elements is eliminated.
Drawings
Fig. 1 is a flowchart illustrating a clock network topology construction method according to an embodiment of the present invention.
FIG. 2 is a schematic diagram of a clock tracking path in accordance with a specific embodiment of the present invention.
Fig. 3 is a system block diagram of a clock network topology building system in accordance with one embodiment of the present invention.
Detailed Description
The present invention will be described in detail with reference to the specific embodiments shown in the drawings, which are not intended to limit the present invention, and structural, methodological, or functional changes made by those skilled in the art according to the specific embodiments are included in the scope of the present invention.
In an embodiment of the present invention shown in fig. 1, the present invention provides a clock network topology construction method, where the method includes:
s1, based on the connection relation among each network element forming the network, dividing the network into a plurality of subarea networks;
s2, in each piece area network, according to the network hierarchy to which the network element belongs, and the sequence of the network hierarchy from high to low, acquiring a chain/tree network set and a ring network set in each hierarchy network, and determining a root node of each chain/tree network, wherein the network hierarchy comprises a core network, a convergence network and an access network;
s3, a network element is appointed in a ring network set in a core network as a clock source node, breadth-first search is carried out by taking the clock source node as a starting point to determine a plurality of sub-ring networks of the core network, the clock source node of each sub-ring network is determined, and a clock network topological structure of the ring network in the core network is constructed and obtained;
s4, sequentially executing the method in the step S3, and respectively constructing and obtaining a clock network topological structure of a ring network in the convergence network and a clock network topological structure of a ring network in the access network;
s5, determining the chain/tree-shaped sub-network in the core network, the convergence network and the access layer network respectively, and constructing the clock network topology structure of the chain/tree-shaped sub-network in the core network, the convergence network and the access layer network;
s6, repeating the steps S3-S5, and obtaining the ring network clock network topology structure and the chain/tree network clock network topology structure in the core network, the convergence network and the access layer network of each zone network.
The 5G transmission network is generally a core network, a convergence network is hung below the core network, the convergence network is hung below the convergence network, and the loop bandwidth is converged in a ratio of 8:2:1 layer by layer, so that the clock network planning is also distributed layer by layer according to the hierarchy. The connection relationship between the network elements and the network hierarchy of each network element in the network are usually determined according to the deployment requirements of the network. The network hierarchy is generally classified in the network according to the importance of the network elements in the whole network topology, and the network hierarchy is used for reflecting the importance degree of the network elements in the network. The nodes in the network refer to network element devices forming the network, and the network element devices can be simultaneously positioned in the networks of different network levels. The links between nodes are links, and the degree of a node refers to the number of links related to the node. For more convenient implementation of the present invention, the network formed is first simplified, the simplification comprising: setting a link weight between two nodes in a network based on a network level where a network element is located, for example, a node a and a node Z on a link, wherein if both the node a and the node Z belong to a core network, the link weight of the link is set to 10, and if one of the node a and the node Z belongs to the core network and the other belongs to a convergence network, the link weight of the link is set to 20; if the node A and the node Z belong to the convergence network, the link weight of the link is reset to be 30; if one of the node A and the node Z belongs to the aggregation network and the other belongs to the access network, the link weight of the link is reset to 40; if node A and node Z both belong to the access network, the link weight of the link is reset to 50. Combining all links between any two nodes in the network into one link, and selecting the lowest link weight in all the links as the link weight of the link; the link weight of the two node links is obtained, and the link weight coefficient of the link is set based on the link weight; and obtaining a corresponding undirected graph G of the network according to the link of each node, wherein the link between the two nodes refers to the link of two network element devices. The link coefficient represents a link weight of the link. In general, the smaller the link coefficient, the lower its link weight. An undirected graph is a graph with edges having no direction, and is generally represented by an undirected graph G ═ V, E >, wherein V represents a set of nodes in a constituent network, and E represents link connections between nodes.
Based on the connection relation among network elements forming the network, the network is divided into a plurality of fragment networks, and the number of nodes and the number of links in each fragment network are determined. Based on network connectivity, the formed network is partitioned into a plurality of parcel networks, so that which parcel network each node in the network belongs to is determined, that is, which network elements belong to the same parcel network is determined. Specifically, n sets S1 and S2 … … Sn are created according to the undirected graph, the set Si to which the Vi nodes belong is judged, all links are traversed, if the head and tail nodes connected by the current link Ei do not belong to the same set, the two sets where the head and tail nodes are located are merged into the set Si, and the nodes in the set Si and the corresponding links form a fragment area network; and in the same sequence, traversing all links in the undirected graph to obtain a plurality of fragment area networks and completing the fragmentation of the formed networks. And performing clock planning on each piece area network. And the formed network is segmented based on network connectivity, so that the number of nodes in single layout is reduced, and the efficiency of network topology layout is improved.
The ring network is a ring network formed by a network from a starting ring network element to an ending ring network element through one or more network elements by a link. A chain/tree network refers to a network of network elements connected in a chain or tree. In each piece area network, according to the network hierarchy to which the network elements belong, the network hierarchy is sequentially set as a core network, a convergence network and an access network from high to low according to the sequence of the network hierarchy from high to low, in the first piece area network, all the network elements of the core network in the piece area network are found first, a chain/tree network set of the network hierarchy of the core network and a ring network set are obtained, then all the network elements of the convergence network in the piece area network are found sequentially, a chain/tree network set of the network hierarchy of the convergence network and a ring network set are obtained, finally all the network elements of the access network in the piece area network are found, a chain/tree network set of the network hierarchy of the access network and a ring network set are obtained, and so on, the chain/tree network set in each layer network in each piece area network can be obtained, and a ring network set, and determining the root node of each chain/tree network. In each segment network, specifically, all network elements of a core network are acquired in a current segment network, and a core network undirected graph G1 of the segment network is formed by all network elements and links, < V1, E1>, wherein V1 represents node combination in the core network, E1 represents link connection between nodes, a node Vi with a node degree smaller than or equal to 1 is queried in a node set V1 in the core network undirected graph, the node degree refers to the number of links of all the nodes, if the query is successful, the node Vi is removed from the set V and put into a node set V1 ', and accordingly, a link Ei corresponding to the node Vi is removed from the link set E1 and moved into the link set E1'; and subtracting 1 from the node degree of the node associated with the node Vi, repeating the steps until all the node numbers are traversed to form a chain/tree set, marking the head or tail node of the link En as a root node in the chain/tree set if the head or tail node is not in the V1 'set, and adding the node into the V1' to form the chain/tree network set. And inquiring nodes with the node degree larger than 1 and corresponding links in a node set V1 of the core network undirected graph G1 to form a ring network set. Based on the same implementation steps, a chain/tree network set and a ring network set of the network hierarchy of the aggregation network in the fragment area network are obtained. Similarly, a network-level chain/tree network set of access networks in the network segment and a ring network set are obtained. Based on the technical scheme, the ring network and the chain/tree network in the district network are distinguished.
In each area network, firstly, the clock network topological structure of a core network is determined, then the clock network topological structure of a convergence network is determined, and finally the clock network topological structure of an access network is determined. Specifically, a network element is designated as a clock source node in a ring network set in a core network, a link with the clock source node as a starting point is taken, and all sub-ring networks are obtained based on breadth-first search; sequencing all the sub-ring networks in turn from large to small according to the number of nodes in the ring, acquiring the ring network with the largest number of nodes as a first sub-ring network H1, and determining the network topology of the first sub-ring network; removing nodes and links in the first sub-ring network from the ring network set; marking the nodes in the first ring network as planned nodes, and subtracting 1 from the node degrees of the nodes associated with the planned nodes in the ring network set; searching a second sub-ring network, wherein the ring network searching rule is as follows; finding out a ring network which relates to the most unplanned nodes and relates to the least planned nodes from the ring network set as a second sub-ring network, removing the nodes and links in the second sub-ring network from the ring network set, and determining the network topology of the second sub-ring network; and according to the same ring network searching rule and step, sequentially finding out all sub-ring networks which accord with the rule, determining the network topology of each sub-ring network, and processing all links in a ring network set of a core network in the network of the segment.
And for the condition of looped network nesting, sequentially carrying out clock planning on one looped sub-network according to the determined sequence of the looped sub-networks. Specifically, according to the network topology determination sequence of each sub-ring network of the core network in the above steps, the clock planning is performed on each sub-ring network in sequence, and the rule of the clock planning includes: a main clock source node and a standby clock source node of the first sub-ring network are designated by a user; selecting a main clock source node from the intersected nodes of the next sub-ring network and the previous sub-ring network, selecting a node with the most node hop number away from the main clock source node of the previous sub-ring network from the intersected nodes, wherein the left and right adjacent nodes of the node have at least one unmarked node, the node is used as a main clock source node, and the marked node is used as a standby clock source node. If there is only one intersected node, the intersected node is a clock source node and only has a master clock source node. As shown in fig. 2, in a specific embodiment of the present invention, as shown in fig. 2(a), only one clock source node is provided, a clock tracking path is planned, and starting from the clock source node, a counterclockwise direction of the ring network is used as a main direction of the on-ring network element, and a clockwise direction of the ring network is used as a standby direction of the on-ring network element. As shown in fig. 2(b) and (c), when there are both master and slave clock source nodes on the ring network, starting from the master clock source node of the ring network, the reverse clock link direction of the ring network is used as the master direction of the device on the ring; starting from a standby clock source node of the ring network, the standby clock source node is taken as a standby direction of the equipment on the ring along the clockwise direction of the ring network. According to the technical scheme, the clock source node of each sub-ring network is determined, and the clock network topology structure of the ring network in the core network is constructed and obtained.
And executing the method with the same steps, and performing clock planning by taking the network elements belonging to the core network and the aggregation network as clock tracking sources when constructing the clock network topology structure of the ring network in the aggregation network. Similarly, when constructing the clock network topology structure of the access middle ring network, the network elements belonging to the convergence network and the access network simultaneously are used as clock tracking sources to perform clock planning. According to the technical scheme, the clock planning of the ring networks of the core network, the convergence network and the access network in the network of the district is obtained, and by analogy, the clock planning can be carried out on the ring network in each district network.
And respectively determining chain/tree subnets in the core network, the aggregation network and the access layer network according to the chain/tree network set in each level network, and constructing a chain/tree clock network topological structure in the core network, the aggregation network and the access layer network. And according to the link weight and the minimum spanning tree algorithm, sequentially constructing a chain/tree clock network topological structure in the core network, the aggregation network and the access layer network by taking the root node of the chain/tree subnet as a main clock source node. And obtaining a chain/tree clock network topological structure in the central core network, the aggregation network and the access layer network of each piece area network based on the same processing steps of each piece area network. In the clock planning process, the link weight needs to be verified, and the states that the upstream weight is high and the downstream weight is low are avoided.
In an embodiment of the present invention shown in fig. 3, the present invention provides a clock network topology building system, including:
the fragmentation module 30 is used for fragmenting the network and dividing the network into a plurality of fragment networks based on the connection relation among all network elements forming the network;
a network aggregation module 31, configured to, in each segment network, respectively obtain a chain/tree network aggregation and a ring network aggregation in a core network according to a network hierarchy to which a network element belongs, and in an order from a high level to a low level, and determine a root node of each chain/tree network, where the network hierarchy includes a core network, a convergence network, and an access network;
a ring network clock topology module 32, which designates a network element in a ring network set in a core network as a clock source node, determines a plurality of sub-ring networks of the core network by performing breadth-first search with the clock source node as a starting point, determines a clock source node of each sub-ring network, constructs and obtains a clock network topology structure of a ring network in the core network, sequentially executes a method of the core network clock network construction module, and constructs and obtains a clock network topology structure of the ring network in the aggregation network and a clock network topology structure of the ring network in the access network;
and the chain/tree network clock topology module 33 is configured to determine the chain/tree subnets in the core network, the aggregation network, and the access layer network, and construct the clock network topology structures of the chain/tree subnets in the core network, the aggregation network, and the access layer network.
Based on the connection relation among network elements forming the network, the fragmentation module fragments the network and divides the network into a plurality of fragment networks, and the number of nodes and the number of links in each fragment network are determined. Based on network connectivity, the formed network is partitioned into a plurality of parcel networks, so that which parcel network each node in the network belongs to is determined, that is, which network elements belong to the same parcel network is determined.
In each piece area network, a network aggregation module is sequentially set as a core network, an aggregation network and an access network from high to low according to the network hierarchy to which network elements belong and the sequence of the network hierarchy from high to low, so as to obtain a chain/tree-shaped network aggregation and a ring network aggregation in the core network, obtain a chain/tree-shaped network aggregation and a ring network aggregation in the aggregation network, and obtain a chain/tree-shaped network aggregation and a ring network aggregation in the access network.
In each area network, firstly, the clock network topological structure of a core network is determined, then the clock network topological structure of a convergence network is determined, and finally the clock network topological structure of an access network is determined. The ring network clock topological module appoints a network element in a ring network set in a core network as a clock source node, performs breadth-first search by taking the clock source node as a starting point to determine a plurality of sub-ring networks of the core network, determines a clock source node of each sub-ring network, constructs and obtains a clock network topological structure of the ring network in the core network, sequentially executes a method of the core network clock network constructing module, and constructs and obtains the clock network topological structure of the ring network in the convergence network and the clock network topological structure of the ring network in the access network.
And the chain/tree network clock topology module respectively determines the chain/tree subnets in the core network, the convergence network and the access layer network according to the link weight and the minimum spanning tree, and constructs the clock network topology structures of the chain/tree subnets in the core network, the convergence network and the access layer network. And obtaining a chain/tree-shaped clock network topological structure in the central core network, the aggregation network and the access layer network of each fragment area network.
Although the preferred embodiments of the present invention have been disclosed for illustrative purposes, those skilled in the art will appreciate that various modifications, additions and substitutions are possible, without departing from the scope and spirit of the invention as disclosed in the accompanying claims.
Claims (10)
1. A clock network topology construction method is characterized by comprising the following steps:
s1, based on the connection relation among each network element forming the network, dividing the network into a plurality of subarea networks;
s2, in each piece area network, according to the network hierarchy to which the network element belongs, and the sequence of the network hierarchy from high to low, acquiring a chain/tree network set and a ring network set in each hierarchy network, and determining a root node of each chain/tree network, wherein the network hierarchy comprises a core network, a convergence network and an access network;
s3, a network element is appointed in a ring network set in a core network as a clock source node, breadth-first search is carried out by taking the clock source node as a starting point to determine a plurality of sub-ring networks of the core network, the clock source node of each sub-ring network is determined, and a clock network topological structure of the ring network in the core network is constructed and obtained;
s4, sequentially executing the method in the step S3, and respectively constructing and obtaining a clock network topological structure of a ring network in the convergence network and a clock network topological structure of a ring network in the access network;
s5, determining the chain/tree-shaped sub-network in the core network, the convergence network and the access layer network respectively, and constructing the clock network topology structure of the chain/tree-shaped sub-network in the core network, the convergence network and the access layer network;
s6, repeating the steps S3-S5, and obtaining the ring network clock network topology structure and the chain/tree network clock network topology structure in the core network, the convergence network and the access layer network of each zone network.
2. The method for constructing a clock network topology according to claim 1, wherein said step S1 includes simplifying said composed network, said step of simplifying includes:
setting link weight between two nodes in the network based on the network level of the network element;
combining all links between any two nodes in the network into one link, and selecting the lowest link weight in all the links as the link weight of the link;
setting a link weight coefficient of the link based on the link weight;
and obtaining a corresponding undirected graph G of the network according to the link of each node, wherein V represents the node combination in the network, and E represents the link between the nodes.
3. The clock network topology constructing method according to claim 2, wherein said step S1 includes:
creating n sets S1 and S2 … … Sn according to the undirected graph, traversing all links, and merging two sets where head and tail nodes are located into a set Si if head and tail nodes connected by a current link Ei do not belong to the same set, wherein the nodes in the set Si and corresponding links form a fragment area network;
and by analogy, traversing all links in the undirected graph to obtain a plurality of fragment networks.
4. The clock network topology construction method according to claim 3, wherein said step S2 includes:
acquiring all network elements of a core network in a current parcel network, and enabling all network elements and links to form a core network undirected graph G1 of the parcel network to be < V1, E1>, wherein V1 represents a node set forming the core network, and E1 represents link connection between nodes;
inquiring nodes Vi with the node degree smaller than or equal to 1 in a node set V1 in the core network undirected graph; if the query is successful, the node Vi is removed from the set V and is placed into a node set V1 ', and the link Ei corresponding to the node Vi is removed from the link set E1 and is moved into a link set E1';
subtracting 1 from the node degree of the node associated with the node Vi, and repeating the steps until all the node numbers are traversed to form a chain/tree set;
in the chain/tree-like set, if the head or tail node of the link En is not in the V1 'set, marking the head or tail node as a root node, and adding the node into V1' to obtain a chain/tree-like network set;
and inquiring nodes with the node degree larger than 1 and corresponding links in a node set V1 of the core network undirected graph G1 to form a ring network set.
5. The clock network topology construction method according to claim 4, wherein said step S3 includes:
appointing a network element as a clock source node in a ring network set in a core network, taking the clock source node as a link of a starting point, and acquiring all sub-ring networks based on breadth-first search;
sequencing all the sub-ring networks in sequence from large to small according to the number of nodes in the ring, acquiring the ring network with the largest number of nodes as a first sub-ring network, and determining the network topology of the first sub-ring network;
removing nodes and links in the first sub-ring network from the ring network set; marking the nodes in the first ring network as planned nodes, and subtracting 1 from the node degrees of the nodes associated with the planned nodes in the ring network set;
searching a second sub-ring network, wherein the ring network searching rule is as follows; finding out a ring network which relates to the most unplanned nodes and relates to the least planned nodes from the ring network set as a second sub-ring network, removing the nodes and links in the second sub-ring network from the ring network set, and determining the network topology of the second sub-ring network;
and according to the same looped network searching rule and steps, sequentially finding out all sub looped networks which accord with the looped network searching rule, and determining the network topology of each sub looped network.
6. The clock network topology construction method according to claim 5, wherein said step S3 includes:
determining a sequence according to the network topology of each sub-ring network of the core network, and sequentially performing clock planning on each sub-ring network, wherein the rule of the clock planning comprises the following steps:
a main clock source node and a standby clock source node of the first sub-ring network are designated by a user;
selecting a main clock source node from the intersected nodes of the next sub-ring network and the previous sub-ring network, selecting a node with the most node hop number away from the main clock source node of the previous sub-ring network from the intersected nodes, wherein the left and right adjacent nodes of the node have at least one unmarked node, the node is used as a main clock source node, and the marked node is used as a standby clock source node;
if there is only one intersected node, the intersected node is a clock source node and only has a master clock source node.
7. The clock network topology constructing method according to claim 6, wherein said step S4 further comprises:
and when constructing a clock network topology structure of a ring network in the convergence network, taking network elements belonging to the core network and the convergence network as clock tracking sources.
8. The clock network topology constructing method according to claim 7, wherein said step S4 includes:
and when a clock network topological structure of the looped network in the access network is constructed, taking network elements belonging to the convergence network and the access network simultaneously as clock tracking sources.
9. The clock network topology constructing method according to claim 8, wherein said step S5 includes:
and according to the link weight and the minimum spanning tree algorithm, sequentially constructing a chain/tree clock network topological structure in the core network, the aggregation network and the access layer network by taking the root node of the chain/tree subnet as a main clock source node.
10. A clock network topology construction system, the system comprising:
the network fragmentation module is used for fragmenting the network and dividing the network into a plurality of fragment networks based on the connection relation among all network elements forming the network;
a network aggregation module, which is used for acquiring a chain/tree network aggregation and a ring network aggregation in each level network according to the network level to which the network element belongs and the sequence from high to low of the network level in each piece area network, and determining a root node of each chain/tree network, wherein the network level comprises a core network, a convergence network and an access network;
a ring network clock topology module, which designates a network element in a ring network set in a core network as a clock source node, performs breadth-first search with the clock source node as a starting point to determine a plurality of sub-ring networks of the core network, determines a clock source node of each sub-ring network, constructs and obtains a clock network topology structure of a ring network in the core network, sequentially executes a method of the core network clock network construction module, and constructs and obtains a clock network topology structure of the ring network in the aggregation network and a clock network topology structure of the ring network in the access network;
and the chain/tree network clock topology module is used for respectively determining chain/tree subnets in the core network, the convergence network and the access layer network and constructing a clock network topology structure of the chain/tree subnets in the core network, the convergence network and the access layer network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110061581.XA CN112910689B (en) | 2021-01-18 | 2021-01-18 | Clock network topology construction method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110061581.XA CN112910689B (en) | 2021-01-18 | 2021-01-18 | Clock network topology construction method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112910689A true CN112910689A (en) | 2021-06-04 |
| CN112910689B CN112910689B (en) | 2022-05-17 |
Family
ID=76114680
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110061581.XA Active CN112910689B (en) | 2021-01-18 | 2021-01-18 | Clock network topology construction method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112910689B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023185677A1 (en) * | 2022-04-02 | 2023-10-05 | 华为技术有限公司 | Device large network routing method and routing device |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008125028A1 (en) * | 2007-04-11 | 2008-10-23 | Huawei Technologies Co., Ltd. | A method, an apparatus and a network element for tracing clock |
| WO2014187404A1 (en) * | 2013-12-26 | 2014-11-27 | 中兴通讯股份有限公司 | Potn network oduk ring planning method and device |
| CN106357501A (en) * | 2015-07-16 | 2017-01-25 | 中国移动通信集团公司 | Intelligent clock planning configuration method, device and integrated controller |
| CN108183502A (en) * | 2017-12-21 | 2018-06-19 | 上海电机学院 | Promote the active distribution network reconstructing method of distributed energy consumption |
| CN108667659A (en) * | 2018-04-28 | 2018-10-16 | 烽火通信科技股份有限公司 | The searching method and system of network topology middle ring circuit node |
| CN110225544A (en) * | 2019-06-27 | 2019-09-10 | 合肥更鼓电子科技有限公司 | A kind of mobile communication base station high-precision time synchronization method based on fiber optic network |
| CN111695223A (en) * | 2020-06-11 | 2020-09-22 | Ut斯达康通讯有限公司 | Network topology layout method and system |
-
2021
- 2021-01-18 CN CN202110061581.XA patent/CN112910689B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008125028A1 (en) * | 2007-04-11 | 2008-10-23 | Huawei Technologies Co., Ltd. | A method, an apparatus and a network element for tracing clock |
| WO2014187404A1 (en) * | 2013-12-26 | 2014-11-27 | 中兴通讯股份有限公司 | Potn network oduk ring planning method and device |
| CN106357501A (en) * | 2015-07-16 | 2017-01-25 | 中国移动通信集团公司 | Intelligent clock planning configuration method, device and integrated controller |
| CN108183502A (en) * | 2017-12-21 | 2018-06-19 | 上海电机学院 | Promote the active distribution network reconstructing method of distributed energy consumption |
| CN108667659A (en) * | 2018-04-28 | 2018-10-16 | 烽火通信科技股份有限公司 | The searching method and system of network topology middle ring circuit node |
| CN110225544A (en) * | 2019-06-27 | 2019-09-10 | 合肥更鼓电子科技有限公司 | A kind of mobile communication base station high-precision time synchronization method based on fiber optic network |
| CN111695223A (en) * | 2020-06-11 | 2020-09-22 | Ut斯达康通讯有限公司 | Network topology layout method and system |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023185677A1 (en) * | 2022-04-02 | 2023-10-05 | 华为技术有限公司 | Device large network routing method and routing device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112910689B (en) | 2022-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Sun et al. | A self-routing topology for bluetooth scatternets | |
| CN101965715B (en) | Tie-Breaking in Shortest Path Determination | |
| CN110661666B (en) | Method and device for establishing ring network resources of packet transport network | |
| CN111695223B (en) | Network topology layout method and system | |
| CN103346979B (en) | Flow distribution method and equipment in SPBM network | |
| CN104935476B (en) | A kind of network traffics matrix measuring method based on SDN | |
| WO2010127527A1 (en) | Method and apparatus for implementing k-shortest paths algorithm in the case of existing multiple edges between adjacent nodes | |
| WO2013170838A2 (en) | Method and apparatus for determining network topology structure | |
| CN112910689B (en) | Clock network topology construction method and system | |
| CN105472484A (en) | Wave channel balancing route wavelength allocation method of power backbone optical transport network | |
| CN113242179A (en) | SDN-based SR path calculation and label stack generation method and SDN controller | |
| CN110830394B (en) | Method for generating routing table based on RapidIO network | |
| CN110752990A (en) | Time-varying network shortest routing method for guaranteeing elasticity | |
| CN107995118B (en) | Software defined data center network updating method for ensuring general consistency | |
| CN114727353A (en) | Self-adaptive information transmission method of mobile opportunistic sensor network based on genetic algorithm | |
| WO2016184369A1 (en) | Method for configuring clock tracking and control device | |
| CN114745227B (en) | Electric power business network slicing time delay calculation method and device based on FlexE and SPN technologies | |
| Hadid et al. | A stabilizing algorithm for finding two node-disjoint paths in arbitrary networks | |
| JP2004503989A (en) | Routing in communication networks | |
| CN108011730B (en) | Method and device for automatically changing ring network resources in network management system | |
| US7349351B2 (en) | Method for determining a master ring for an optical communications network | |
| CN108989201B (en) | End-to-end path configuration method for SNCP tangent ring service | |
| Nagano et al. | Efficient information sharing among distributed controllers of openflow network with bi-connectivity | |
| Petrov et al. | Minimization of multicast traffic and ensuring its fault tolerance in software-defined networks | |
| Qin et al. | Designing B-ISDN network topologies using the genetic algorithm |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |