CN113225259A - Communication network route planning method - Google Patents

Communication network route planning method Download PDF

Info

Publication number
CN113225259A
CN113225259A CN202110397039.1A CN202110397039A CN113225259A CN 113225259 A CN113225259 A CN 113225259A CN 202110397039 A CN202110397039 A CN 202110397039A CN 113225259 A CN113225259 A CN 113225259A
Authority
CN
China
Prior art keywords
routes
route
independent
equipment
communication network
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
Application number
CN202110397039.1A
Other languages
Chinese (zh)
Other versions
CN113225259B (en
Inventor
何天玲
赵立新
张维
张红红
蔡立波
王宇鹏
胡满
钟睿
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
State Grid Corp of China SGCC
North China Grid Co Ltd
Original Assignee
State Grid Corp of China SGCC
North China Grid Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by State Grid Corp of China SGCC, North China Grid Co Ltd filed Critical State Grid Corp of China SGCC
Priority to CN202110397039.1A priority Critical patent/CN113225259B/en
Publication of CN113225259A publication Critical patent/CN113225259A/en
Application granted granted Critical
Publication of CN113225259B publication Critical patent/CN113225259B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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/02—Topology update or discovery
    • 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/06—Management of faults, events, alarms or notifications
    • H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
    • H04L41/0668—Management of faults, events, alarms or notifications using network fault recovery by dynamic selection of recovery network elements, e.g. replacement by the most appropriate element after failure
    • 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/16—Multipoint 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/22—Alternate routing

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The application discloses a communication network route planning method, and relates to the field of route planning. The specific implementation scheme is as follows: acquiring basic information of the communication network, wherein the communication network comprises at least one starting station and at least one stopping station, the starting station comprises at least one starting device, and the stopping station comprises at least one stopping device; the basic information comprises equipment information and/or link information; the equipment comprises the starting equipment, the terminating equipment and intermediate equipment between the starting station and the terminating station; acquiring service information of the communication network, wherein the service information comprises node service information of the equipment in the communication network and/or link service information of the link; and determining the route planned by the communication network route according to the basic information and the service information. By using the scheme, the reliability of the service route in the communication network can be improved.

Description

Communication network route planning method
Technical Field
The present application relates to the field of routing planning technologies, and in particular, to a method for routing a communication network.
Background
At present, for the routing planning of a communication network, only the resource itself is used for path planning, and the corresponding routing planning cannot be performed with the service reliability as a target, so that the adjustment is continuously performed according to the service requirement in the network operation and maintenance. With the increasing requirement on the reliability of the communication network service, the problem that the service route cannot be comprehensively analyzed in the traditional route planning is solved through an optimized route planning method on the basis of the service reliability as a route planning, and the intelligent route planning of the communication network with high service reliability is realized.
Disclosure of Invention
In view of the above, the present application provides a method for routing a communication network, including: acquiring basic information of the communication network, wherein the communication network comprises at least one starting station and at least one stopping station, the starting station comprises at least one starting device, and the stopping station comprises at least one stopping device; the basic information comprises equipment information and/or link information; the equipment comprises the starting equipment, the terminating equipment and intermediate equipment between the starting station and the terminating station; acquiring service information of the communication network, wherein the service information comprises node service information of the equipment in the communication network and/or link service information of the link; and determining the route planned by the communication network route according to the basic information and the service information.
Whether the channel is newly added, the channel mode is adjusted under the condition of fault maintenance, or the independence check work is carried out on the existing protection and stability service of the existing network, a large amount of routing planning and independence check work are required to be carried out. The routing planning is more reasonable by combining the service information with the routing basic information.
Other effects of the above-described alternative will be described below with reference to specific embodiments.
Drawings
The drawings are included to provide a better understanding of the present solution and are not intended to limit the present application. Wherein:
fig. 1 is a flowchart of a communication routing planning method according to an embodiment of the present application;
fig. 2 is a flowchart of a method for constructing a route set according to a second embodiment of the present application.
Detailed Description
The following description of the exemplary embodiments of the present application, taken in conjunction with the accompanying drawings, includes various details of the embodiments of the application for the understanding of the same, which are to be considered exemplary only. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present application. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness. The present application will be described in detail with reference to examples.
The embodiment of the invention provides a communication network routing planning method which can optimize the routing effect of a communication network.
Example one
Fig. 1 shows a communication network route planning method, which includes:
step 12, obtaining basic information of the communication network, wherein the communication network comprises at least one starting station and at least one ending station, the starting station comprises at least one starting device, and the ending station comprises at least one ending device; the basic information comprises equipment information and/or link information; the equipment comprises the starting equipment, the terminating equipment and intermediate equipment between the starting station and the terminating station.
The communication network includes a plurality of stations including a plurality of devices, the communication network being a collection of routes from a plurality of origination stations to a plurality of termination stations. The basic information of the communication network may include identification information of each station and each device in the network, link information connecting each station or device in the network, and the like.
Step 14, obtaining service information of the communication network, where the service information includes node service information of the device in the communication network and/or link service information of the link.
The service may be a relay protection service. The relay protection service parameters may be: the method comprises the steps of 2M switching device protection, A, B port protection, single port protection, designated overloading judgment conditions, designated station collection which does not pass through, designated equipment collection which does not pass through, optical cable collection which does not pass through and the like.
The service information is service-related information carried in a network route, and includes: one or more of equipment information, transmission section information and optical cable section information; wherein the content of the first and second substances,
the device information includes: one or more of equipment identification, equipment name, equipment manufacturer, property right unit, maintenance unit, machine room where the equipment is located, site where the equipment is located, commissioning time, equipment operation level and equipment heavy-load service quantity;
the transmission segment information includes: one or more of a transmission segment identifier, a transmission segment name, an A-side system, an A-side equipment identifier, an A-side port identifier, a Z-side system, a Z-side equipment identifier, a Z-side port identifier, a transmission segment protection state, a protected transmission segment identifier, a transmission segment associated optical cable and a bandwidth occupation percentage;
the optical cable section information includes: the optical cable identification, the optical cable name, the voltage grade, the type, the commissioning time, the optical cable operation level and the optical cable heavy-load service quantity.
And step 16, determining a path of the communication network routing plan according to the basic information and the service information.
Fig. 2 illustrates a method of constructing a route set.
The steps of determining a path for a communication network routing plan are as follows:
all routes between the at least one originating site to the at least one terminating site are determined, forming a first set of routes.
And bearing the service information on the route in the first set of routes to obtain the route with the weight sum, and forming a second set of routes.
Determining in the second set of routes a number of originating devices within the originating site and a number of terminating devices within the terminating site,
if at least one of the starting equipment number and the terminating equipment number is less than 2, directly planning a route;
if one of the starting equipment number and the terminating equipment number is equal to 2, and the other one is more than or equal to 2, judging whether a first independent double route is met;
if the number of the starting equipment and the number of the terminating equipment are both larger than 2, judging whether the number of the starting equipment and the number of the terminating equipment meet three independent routes;
the independent double/three routes mean that the starting equipment, the terminating equipment and the intermediate equipment of the two/three routes are not intersected, and the links in the two/three routes are also not intersected.
Any two independent routes are devices and links that are not intersected except for the two routes. Therefore, independence can be kept among all routes in the communication network route, and when a certain node or link fails, other routes can also work normally, so that the availability of the route is ensured, and the safety of the communication network is improved.
The device and link where no intersection exists between any two routes can be represented by the following formula:
Figure BDA0003018943180000051
wherein the content of the first and second substances,
Figure BDA0003018943180000052
for arbitrary symbols, P is a second set of routes, Pi,pjFor the ith and jth routes, V, respectively, belonging to PiAnd VjSets of nodes, E, for the ith and jth routes, respectivelyiAnd EjThe link sets of the ith route and the jth route respectively, wherein, n is the intersection,
Figure BDA0003018943180000053
is an empty set.
After judging whether the first independent double route is satisfied, the method comprises the following steps: if a first independent dual route is satisfied, the first independent dual route forms a subset of a third set of routes, wherein the third set of routes is the set of planned communication network routes.
The judging whether the independent three routes are satisfied comprises:
selecting a weight value and an optimal route from the second set of routes;
the following independent three route judgment processes are executed:
judging whether three independent routes including the selected route exist or not;
if so, the independent three routes form a subset of the third set of routes;
and if not, selecting the weight and the suboptimal route, and returning to execute the independent three-route judgment process until all the routes in the second set are traversed.
The process of judging whether the independent three routes are satisfied comprises the following steps:
if the independent double routes exist, recording the independent double routes as subsets of an independent double route set, and recording the routes which are not coincident with the equipment at the two ends of the independent double routes as the subsets of an adjustment route set.
If there are still no independent three routes after traversing all the routes in the second set:
if the independent double-route set is not empty, selecting a pair of weights and an optimal second independent double route from the independent double-route set;
the following independent three route judgment processes are executed:
selecting one route from the adjusted route set, judging whether to form an independent three-route together with the second independent double-route, and if so, forming a subset of the third set of routes by the independent three-route; if not, traversing all routes in the adjusted route set; and if all the routes in the adjusted route set cannot form independent three routes together with the second independent double route, selecting a pair of weight values and suboptimal second independent double routes from the independent double route set, and returning to execute the independent three-route judgment process until all the second independent double routes in the independent double route set are traversed.
And if no independent three-route still exists after traversing all the second independent double-routes in the independent double-route set, the second independent double-routes form a subset of a third set of routes.
And if the independent double-route set is empty, judging whether the second set comprises two routes which are independent from the starting equipment and the destination equipment, and if so, forming a subset of the third set of routes by the two routes which are independent from the starting equipment and the destination equipment.
In the above steps, the selected route may be calculated according to DIJKSTRA algorithm (dickstra algorithm); the routing calculation takes business factors into account.
By selecting three independent routes or two independent routes, independence can be kept among the routes, and when a certain node or link fails, other routes can also work normally, so that the availability of the routes is ensured, and the safety of a communication network is improved.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
It will be understood by those skilled in the art that all or part of the steps in the above embodiments can be implemented by hardware associated with program instructions, and the program can be stored in a computer readable storage medium. The storage medium referred to herein is a ROM/RAM, a magnetic disk, an optical disk, or the like.
The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall fall within the protection scope of the present invention.

Claims (12)

1. A method for routing a communication network, the method comprising:
acquiring basic information of the communication network, wherein the communication network comprises at least one starting station and at least one stopping station, the starting station comprises at least one starting device, and the stopping station comprises at least one stopping device; the basic information comprises equipment information and/or link information; the equipment comprises the starting equipment, the terminating equipment and intermediate equipment between the starting station and the terminating station;
acquiring service information of the communication network, wherein the service information comprises node service information of the equipment in the communication network and/or link service information of the link;
and determining the route planned by the communication network route according to the basic information and the service information.
2. The method of claim 1, further comprising, before said determining a path of the communication network routing plan based on the basis information and the traffic information: all routes between the at least one originating site to the at least one terminating site are determined, forming a first set of routes.
3. The method of claim 2, wherein the service information is carried on the routes in the first set of routes, and the routes with weighted sum are obtained to form the second set of routes.
4. The method of claim 3, wherein the number of originating devices within the originating site and the number of terminating devices within the terminating site are determined in the second set of routes,
if at least one of the starting equipment number and the terminating equipment number is less than 2, directly planning a route;
if one of the starting equipment number and the terminating equipment number is equal to 2, and the other one is more than or equal to 2, judging whether a first independent double route is met;
if the number of the starting equipment and the number of the terminating equipment are both larger than 2, judging whether the number of the starting equipment and the number of the terminating equipment meet three independent routes;
the independent double/three routes mean that the starting equipment, the terminating equipment and the intermediate equipment of the two/three routes are not intersected, and the links in the two/three routes are also not intersected.
5. The method of claim 4, wherein determining whether the first independent dual route is satisfied comprises: if a first independent dual route is satisfied, the first independent dual route forms a subset of a third set of routes, wherein the third set of routes is the set of planned communication network routes.
6. The method of claim 4, wherein the determining whether independent three routes are satisfied comprises:
selecting a weight value and an optimal route from the second set of routes;
the following independent three route judgment processes are executed:
judging whether three independent routes including the selected route exist or not;
if so, the independent three routes form a subset of the third set of routes;
and if not, selecting the weight and the suboptimal route, and returning to execute the independent three-route judgment process until all the routes in the second set are traversed.
7. The method of claim 6, wherein determining whether the independent three routes are satisfied comprises:
if the independent double routes exist, recording the independent double routes as subsets of an independent double route set, and recording the routes which are not coincident with the equipment at the two ends of the independent double routes as the subsets of an adjustment route set.
8. The method of claim 7, wherein if there are still no three independent routes after traversing all the routes in the second set:
if the independent double-route set is not empty, selecting a pair of weights and an optimal second independent double route from the independent double-route set;
the following independent three route judgment processes are executed:
selecting one route from the adjusted route set, judging whether to form an independent three-route together with the second independent double-route, and if so, forming a subset of the third set of routes by the independent three-route; if not, traversing all routes in the adjusted route set; and if all the routes in the adjusted route set cannot form independent three routes together with the second independent double route, selecting a pair of weight values and suboptimal second independent double routes from the independent double route set, and returning to execute the independent three-route judgment process until all the second independent double routes in the independent double route set are traversed.
9. The method of claim 8, wherein if no independent triple route is present after traversing all second independent double routes in the set of independent double routes, the second independent double routes form a subset of a third set of routes.
10. The method of claim 8, wherein if the independent dual route set is empty, determining whether the second set includes two routes that are independent from both the originating device and the destination device, and if so, the two routes that are independent from both the originating device and the destination device form a subset of the third set of routes.
11. The method according to any of claims 1-10, wherein the service information comprises: one or more of equipment information, transmission section information and optical cable section information; wherein the content of the first and second substances,
the device information includes: one or more of equipment identification, equipment name, equipment manufacturer, property right unit, maintenance unit, machine room where the equipment is located, site where the equipment is located, commissioning time, equipment operation level and equipment heavy-load service quantity;
the transmission segment information includes: one or more of a transmission segment identifier, a transmission segment name, an A-side system, an A-side equipment identifier, an A-side port identifier, a Z-side system, a Z-side equipment identifier, a Z-side port identifier, a transmission segment protection state, a protected transmission segment identifier, a transmission segment associated optical cable and a bandwidth occupation percentage;
the optical cable section information includes: the number of optical cables, the identification of the optical cables, the name of the optical cables, the voltage grade, the type, the commissioning time, the operation level of the optical cables and the number of optical cable bearer services.
12. The method according to any of claims 1-10, wherein the service is a relay protection service.
CN202110397039.1A 2021-04-13 2021-04-13 Communication network route planning method Active CN113225259B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110397039.1A CN113225259B (en) 2021-04-13 2021-04-13 Communication network route planning method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110397039.1A CN113225259B (en) 2021-04-13 2021-04-13 Communication network route planning method

Publications (2)

Publication Number Publication Date
CN113225259A true CN113225259A (en) 2021-08-06
CN113225259B CN113225259B (en) 2022-11-29

Family

ID=77087072

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110397039.1A Active CN113225259B (en) 2021-04-13 2021-04-13 Communication network route planning method

Country Status (1)

Country Link
CN (1) CN113225259B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113992519A (en) * 2021-11-17 2022-01-28 国网天津市电力公司 Power communication resource planning method capable of automatically calculating
CN115118649A (en) * 2022-06-29 2022-09-27 国网山东省电力公司威海供电公司 Automatic planning method for relay protection route of power communication network

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060291378A1 (en) * 2005-06-28 2006-12-28 Alcatel Communication path redundancy protection systems and methods
US7761836B1 (en) * 2006-10-11 2010-07-20 Cadence Design Systems, Inc. Circuit autorouter with object oriented constraints
CN106549779A (en) * 2015-09-18 2017-03-29 中国电力科学研究院 A kind of maximum non-intersect double route collocation method of multiple constraint energy communication service
WO2017118431A1 (en) * 2016-01-08 2017-07-13 中兴通讯股份有限公司 Route selection method and apparatus
CN108011817A (en) * 2017-11-09 2018-05-08 中国电力科学研究院有限公司 A kind of method and system disposed again to power communication private network business route
CN111340431A (en) * 2020-03-27 2020-06-26 上海东普信息科技有限公司 Method, device and equipment for planning transportation route and storage medium

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060291378A1 (en) * 2005-06-28 2006-12-28 Alcatel Communication path redundancy protection systems and methods
US7761836B1 (en) * 2006-10-11 2010-07-20 Cadence Design Systems, Inc. Circuit autorouter with object oriented constraints
CN106549779A (en) * 2015-09-18 2017-03-29 中国电力科学研究院 A kind of maximum non-intersect double route collocation method of multiple constraint energy communication service
WO2017118431A1 (en) * 2016-01-08 2017-07-13 中兴通讯股份有限公司 Route selection method and apparatus
CN108011817A (en) * 2017-11-09 2018-05-08 中国电力科学研究院有限公司 A kind of method and system disposed again to power communication private network business route
CN111340431A (en) * 2020-03-27 2020-06-26 上海东普信息科技有限公司 Method, device and equipment for planning transportation route and storage medium

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113992519A (en) * 2021-11-17 2022-01-28 国网天津市电力公司 Power communication resource planning method capable of automatically calculating
CN115118649A (en) * 2022-06-29 2022-09-27 国网山东省电力公司威海供电公司 Automatic planning method for relay protection route of power communication network
CN115118649B (en) * 2022-06-29 2023-07-11 国网山东省电力公司威海供电公司 Automatic planning method for relay protection route of power communication network

Also Published As

Publication number Publication date
CN113225259B (en) 2022-11-29

Similar Documents

Publication Publication Date Title
CN113225259B (en) Communication network route planning method
JP3016811B2 (en) Predictive access control and routing system for integrated services telecommunications networks
CN102231647B (en) Fiber communication network service route configuration method used in electric power
US8443079B2 (en) Mixed integer programming model for minimizing leased access network costs
EP0568477A2 (en) Method and apparatus for optinum path selection in packet transmission networks
CN106506357A (en) A kind of double route collocation method of power telecom network and device
CN109038794B (en) QoS control-oriented extra-high voltage power grid system protection service path planning method
CN103098425A (en) Communication network system and method of configuring communication network
CN106549779A (en) A kind of maximum non-intersect double route collocation method of multiple constraint energy communication service
CN101160805B (en) Resource management equipment, access system and method for ensuring multi-service service quality
CN109639575A (en) Route planning method based on link congestion coefficient
CN104579965B (en) Support two layers of path calculation method of photoelectricity and system of a variety of constraints policies
CN112887207B (en) Service route distribution method and device for power IP-optical communication network
CN114095075B (en) Optical network fault recovery method based on service customization demand perception
Zhao et al. A routing optimization method based on risk prediction for communication services in smart grid
CN113193996A (en) Power optical transmission network optimization method, device, equipment and storage medium
CN110691286B (en) SDH network protection security service route separation method and system
CN104917677A (en) Data stream forwarding control method and system
CN109842522A (en) Communicate the configuration method and system of route resource
Lv et al. Service awareness recovery under N-1 failure in power grid optical communication networks
Ferdousi et al. Slice-aware service restoration with recovery trucks for optical metro-access networks
Huang et al. Reliability specification of telecommunication networks based on the failure influence by using evolutional algorithm
CN103701622B (en) Multicast processing method and device based on IRF systems
CN109996292B (en) Path optimization method of mobile backhaul network
CN114520935A (en) Path selection method and path selection device

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