CN111464888A - High-efficiency communication network light path scheduling method - Google Patents
High-efficiency communication network light path scheduling method Download PDFInfo
- Publication number
- CN111464888A CN111464888A CN202010173683.6A CN202010173683A CN111464888A CN 111464888 A CN111464888 A CN 111464888A CN 202010173683 A CN202010173683 A CN 202010173683A CN 111464888 A CN111464888 A CN 111464888A
- Authority
- CN
- China
- Prior art keywords
- data
- optical
- optical cable
- path
- recording
- 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.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0005—Switch and router aspects
-
- 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
-
- 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/20—Hop count for routing purposes, e.g. TTL
-
- 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/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q2011/0073—Provisions for forwarding or routing, e.g. lookup tables
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Optical Communication System (AREA)
Abstract
The invention discloses a high-efficiency communication network light path scheduling method, which comprises the following steps: s1, storing the relation among the machine room, the equipment, the optical cable section, the terminal and the fiber core into a local cache; s2, traversing the positions of equipment and installation points at two ends of all optical cable segments, recording a starting point id as a, recording a termination point id as z, recording the optical cable length between the starting point id and the termination point id as l, and assembling the data into grid data of (a, z, l); s3, finding out the shortest path between the points a and z in the whole system; s4, subdividing the shortest path found in S3 by taking the optical cable section as a base number; s5, converting the actual path found in S4 into entity data, and sequencing the light paths; s6, obtaining a relevant optical path route; s7: and judging whether the middle has the information of inner jump and cross jump. The invention has the advantages that: the method has the advantages of no need of manually scheduling the light path, high efficiency of matching the monotonicity and high efficiency of inquiring the returned data.
Description
Technical Field
The invention relates to the technical field of communication networks, in particular to a high-efficiency communication network light path scheduling method.
Background
The mobile network resource is the basis for providing services for communication enterprises, a resource management system is established, the mobile network resource is fully utilized, and the key for realizing the informatization of the communication enterprises is to improve the management level and the utilization rate of the mobile network resource. With the continuous growth of communication users, the scale of transmission networks is continuously enlarged, the types of networks and the types of transmission equipment on the networks are increased, and the number of transmission optical paths is increased. In most telecommunication enterprises, optical path scheduling depends on experience of network management personnel and network familiarity, and is completed by transmitting to each operation unit in a manual scheduling mode in a fixed process.
However, with the increasing size and complexity of transmission networks and the diversification of transmission light path services, network managers cannot accurately know the resources and the use conditions of the resources in the whole network in real time, effectively and dynamically update the resources, improve the resource utilization rate, and quickly adjust the network to realize quick response to market demands. Therefore, each large telecommunication operator is eager to improve the current optical path scheduling mode and complexity by means of new technology. How to manage resources reasonably and efficiently through a network resource management system, accelerate service providing speed, improve resource utilization rate to increase industry competitiveness, and become a hot point problem concerned by communication operators.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a high-efficiency communication network optical path scheduling method which does not need to manually schedule an optical path, has high efficiency of matching monotonicity and high efficiency of inquiring return data.
In order to solve the technical problems, the technical scheme provided by the invention is as follows: a high-efficiency communication network light path scheduling method comprises the following steps:
s1, storing the relation among the machine room, the equipment, the optical cable section, the terminal and the fiber core into a local cache;
s2, traversing the positions of equipment and installation points at two ends of all optical cable segments, recording a starting point id as a, recording a termination point id as z, recording the optical cable length between the starting point id and the termination point id as l, and assembling the data into grid data of (a, z, l);
s3, finding out the shortest path between the points a and z in the whole system according to the shortest path algorithm by using the initialized grid data in S3;
s4, subdividing the shortest path found in S3 by taking the optical cable section as a base number;
s5, converting the actual path found in S4 into entity data by combining the cached data, calculating the total length of each optical path according to the length of the optical cable segment in the optical path, and then sequencing the optical paths;
s6, obtaining a relevant optical path route;
s7: and judging whether the information of the inner hop and the cross hop exists in the middle, if the two connection devices are the same device in the grouped data, the two connection devices are directly connected by the inner hop, and if not, the fiber hop exists.
As an improvement, in S2, in the case of multiple cable segments between the device and the installation point, the shortest cable segment length is taken.
As a modification, the optical route in S6 has both the case of the presence of a closure and the case of the absence of a closure; when the splice closure does not exist, respectively finding out the available terminals of the two devices and the fiber cores of the optical cable sections, matching the terminals and the fiber cores of the actual available channels according to the relationship between the terminals and the fiber cores, and binding the terminals and the fiber cores to the corresponding devices and the optical cable sections; when the splice closure exists, the data of the device to the junction box is found out firstly, when the second device is detected to be the splice closure, the data is continuously found out, the next group of data is found out, until the second device is not the splice closure, the two groups of data are combined, and then the fiber cores and the terminals of the two groups of data are matched.
Compared with the prior art, the invention has the advantages that: according to the high-efficiency communication network optical path scheduling method, a user does not need to manually schedule an optical path, the system automatically matches relevant available routes, and a mode of adding data such as an optical cable terminal and the like into a cache in advance is adopted, so that the query efficiency of the available routes is improved; the system stores information such as the optical cable terminal into the cache, and the efficiency of inquiring the returned data is improved.
Drawings
Fig. 1 is a flowchart of an efficient optical path scheduling method for a communication network according to the present invention.
Detailed Description
Examples
A high-efficiency communication network light path scheduling method comprises the following steps:
s1, storing the relation among the machine room, the equipment, the optical cable section, the terminal and the fiber core into a local cache;
s2, traversing the positions of equipment and installation points at two ends of all optical cable segments, recording a starting point id as a, recording a termination point id as z, recording the optical cable length between the starting point id and the termination point id as l, and assembling the data into grid data of (a, z, l);
s3, finding out the shortest path between the points a and z in the whole system according to the shortest path algorithm by using the initialized grid data in S3;
s4, the shortest path found in S3 is subdivided by using the optical cable segment as a base number,
find the shortest path of az end is A, B, Z, and assume that there are 3 cable segments between AB L1、L2、L3And 1 optical cable segment L exists between BZ4Then the actual path queried may be:
A→L1→B→B→L4→Z
A→L2→B→B→L4→Z
A→L3→B→B→L4→Z
s5, converting the actual path found in S4 into entity data by combining the cached data, calculating the total length of each optical path according to the length of the optical cable segment in the optical path, and then sequencing the optical paths;
and S6, obtaining relevant optical path routes, and dividing the optical path routes into two cases of joint box existence and joint box nonexistence according to the format of the connection equipment-optical cable section-connection equipment or the connection equipment-optical cable section-joint box:
1. jointless box
Optical path routing A → L1→B→B→L2→Z
Wherein A, B, Z is a connecting device L1Is a segment of optical cable between A, B, L2Is the length of the cable between B, Z,
in this case, the ratio A → is definedL1→B、B→L2The method comprises the following steps of → Z two groups of data, respectively finding out available terminals of two devices and fiber cores of optical cable sections, matching the terminals and the fiber cores of actual available paths according to the relationship between the terminals and the fiber cores, and binding the terminals and the fiber cores to the corresponding devices and the corresponding optical cable sections;
2. presence of multiple splice closures
Optical path routing A → L1→B→B→L2→Z
Wherein A, Z is a connecting device, B is a joint box, L1Is a segment of optical cable between A, B, L2Is the length of the cable between B, Z,
in this case, first find A → L1→ B data, when detecting that the second device is a splice closure, continue to find next group data B → L2→ Z, until the second device is undocked, merge A → L1→B、B→L2→ Z is a set of data, then match their cores and terminations, find A → L1、L2Terminal-to-core end relationship between → Z, and at the same time, L in closure B was found1、L2The relation between the two parts is fused, and finally, A → L is found out according to the relation between the two parts1→B→B→L2Terminal and core of → Z connectivity, then using the first cable in the new array as the main optical path cable segment, and merging the other cable cores of splice closure fusion into the first cable, and removing the middle splice closure information
Thus, a line A → L is finally obtained1And → Z, and finally judging whether the available terminals and fiber cores in the optical path meet the conditions, wherein if the available terminals and fiber cores do not meet the conditions, the optical path is an invalid optical path.
S7, judging whether there is inner jump and cross jump information, if the two connection devices are the same device in the grouped data, the two connection devices are inner jump directly connected, otherwise, there is jump fiber, such as A → L1→B1→B2→L2→ Z, among others, A, B1、B2Z is a connecting device, L1Is A, B1Section of fiber optic cable therebetween, L2Is B2Z, when B1→B2If the devices are not the same, the device-crossing jump fiber exists, and the optical path with the internal jump information and the jump information is an effective optical path.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. All such modifications and variations are intended to be included herein within the scope of this disclosure and the present invention.
Claims (3)
1. An efficient communication network light path scheduling method is characterized by comprising the following steps:
s1, storing the relation among the machine room, the equipment, the optical cable section, the terminal and the fiber core into a local cache;
s2, traversing the positions of equipment and installation points at two ends of all optical cable segments, recording a starting point id as a, recording a termination point id as z, recording the optical cable length between the starting point id and the termination point id as l, and assembling the data into grid data of (a, z, l);
s3, finding out the shortest path between the points a and z in the whole system according to the shortest path algorithm by using the initialized grid data in S3;
s4, subdividing the shortest path found in S3 by taking the optical cable section as a base number;
s5, converting the actual path found in S4 into entity data by combining the cached data, calculating the total length of each optical path according to the length of the optical cable segment in the optical path, and then sequencing the optical paths;
s6, obtaining a relevant optical path route;
s7: and judging whether the information of the inner hop and the cross hop exists in the middle, if the two connection devices are the same device in the grouped data, the two connection devices are directly connected by the inner hop, and if not, the fiber hop exists.
2. The method according to claim 1, wherein the method comprises: and in the S2, a multi-optical-cable section condition exists between the equipment and the installation point, and the optical-cable section length with the shortest value is obtained.
3. The method according to claim 1, wherein the method comprises: the optical route in the S6 has two conditions of the existence of a joint box and the nonexistence of the joint box; when the splice closure does not exist, respectively finding out the available terminals of the two devices and the fiber cores of the optical cable sections, matching the terminals and the fiber cores of the actual available channels according to the relationship between the terminals and the fiber cores, and binding the terminals and the fiber cores to the corresponding devices and the optical cable sections; when the splice closure exists, the data of the device to the junction box is found out firstly, when the second device is detected to be the splice closure, the data is continuously found out, the next group of data is found out, until the second device is not the splice closure, the two groups of data are combined, and then the fiber cores and the terminals of the two groups of data are matched.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010173683.6A CN111464888A (en) | 2020-03-13 | 2020-03-13 | High-efficiency communication network light path scheduling method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010173683.6A CN111464888A (en) | 2020-03-13 | 2020-03-13 | High-efficiency communication network light path scheduling method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111464888A true CN111464888A (en) | 2020-07-28 |
Family
ID=71680780
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010173683.6A Pending CN111464888A (en) | 2020-03-13 | 2020-03-13 | High-efficiency communication network light path scheduling method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111464888A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114301827A (en) * | 2020-09-23 | 2022-04-08 | 中国电信股份有限公司 | Method and apparatus for searching optical cable route |
| CN115884017A (en) * | 2023-03-08 | 2023-03-31 | 联通（山东）产业互联网有限公司 | Method and system for analyzing path of optical cable access section |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101982797A (en) * | 2010-09-30 | 2011-03-02 | 华为技术有限公司 | Optical fibre connection device |
| CN102589498A (en) * | 2012-03-07 | 2012-07-18 | 浙江万马集团电子有限公司 | Jumping fiber length calculating method and a handheld jumping fiber length calculator |
| CN103166774A (en) * | 2011-12-09 | 2013-06-19 | 中国移动通信集团福建有限公司 | Same routing checking method and device |
| CN106603369A (en) * | 2016-12-20 | 2017-04-26 | 浪潮通信信息系统有限公司 | Method for automatically calculating shortest path link chain formed by network elements |
-
2020
- 2020-03-13 CN CN202010173683.6A patent/CN111464888A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101982797A (en) * | 2010-09-30 | 2011-03-02 | 华为技术有限公司 | Optical fibre connection device |
| CN103166774A (en) * | 2011-12-09 | 2013-06-19 | 中国移动通信集团福建有限公司 | Same routing checking method and device |
| CN102589498A (en) * | 2012-03-07 | 2012-07-18 | 浙江万马集团电子有限公司 | Jumping fiber length calculating method and a handheld jumping fiber length calculator |
| CN106603369A (en) * | 2016-12-20 | 2017-04-26 | 浪潮通信信息系统有限公司 | Method for automatically calculating shortest path link chain formed by network elements |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114301827A (en) * | 2020-09-23 | 2022-04-08 | 中国电信股份有限公司 | Method and apparatus for searching optical cable route |
| CN114301827B (en) * | 2020-09-23 | 2023-07-18 | 中国电信股份有限公司 | Method and apparatus for searching for optical cable routes |
| CN115884017A (en) * | 2023-03-08 | 2023-03-31 | 联通（山东）产业互联网有限公司 | Method and system for analyzing path of optical cable access section |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2019114346A1 (en) | Network planning method for service transmission with asymmetric traffic of multi-core fiber network, and network | |
| WO2005011302A1 (en) | A method of transformation between permanent connection and switched connection in optical network | |
| CN110996196B (en) | Optimal route optimizing method for optical transmission network optical path fiber core utilization | |
| EP3038302B1 (en) | Grooming method and device for packet optical transport network | |
| CN106487548B (en) | Method and device for processing POTN virtual interface | |
| CN108900350A (en) | Photosphere business hierarchical mode configuration method and system in a kind of network management system | |
| CN111464888A (en) | High-efficiency communication network light path scheduling method | |
| CN114417572A (en) | Optical cable route planning method and device, terminal equipment and storage medium | |
| CN101729417B (en) | Telecommunication-orientated intelligent inquiry and verification system for end-to-end service circuit resource | |
| JPH10290226A (en) | Multicast connection management method | |
| CN107493522B (en) | Bandwidth type service self-configuration method | |
| EA004086B1 (en) | Method and system for management of network domains | |
| CN101588288A (en) | Configuration method, communication equipment and communication system of link attribute information | |
| CN100382504C (en) | Cross-over end-to-end connection setting method for main apparatus protection in automatic exchange optical network | |
| US20100208623A1 (en) | Method and device of assigning ring identifier | |
| Poon et al. | Designing optimal FTTH and PON networks using new automatic methods | |
| CN108429681B (en) | Source network element is to the multilayer shortest route method for searching and system between egress network element | |
| Kerner et al. | An analysis of alternative architectures for the interoffice network | |
| WO2023155336A1 (en) | Modular optical cable assembly and networking topological structure | |
| CN110691286B (en) | A kind of SDH network protection security control service routing separation method and system | |
| CN104156828A (en) | Portable communication resource management system based on geographic information | |
| CN103618974A (en) | Optical network expanding method | |
| CN107612725B (en) | A planning method for power distribution communication access network | |
| CN108337174B (en) | Method and device for searching end-to-end service route of transmission network and storage medium | |
| CN116166829B (en) | Automatic pipeline path building system based on graph database |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20200728 |
|
| WD01 | Invention patent application deemed withdrawn after publication |