CN114124794B - Service domain bearing planning method and device based on multi-area optical network system - Google Patents

Service domain bearing planning method and device based on multi-area optical network system Download PDF

Info

Publication number
CN114124794B
CN114124794B CN202110971975.9A CN202110971975A CN114124794B CN 114124794 B CN114124794 B CN 114124794B CN 202110971975 A CN202110971975 A CN 202110971975A CN 114124794 B CN114124794 B CN 114124794B
Authority
CN
China
Prior art keywords
service
node
link
links
area 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.)
Active
Application number
CN202110971975.9A
Other languages
Chinese (zh)
Other versions
CN114124794A (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.)
Guangdong Planning and Designing Institute of Telecommunications Co Ltd
Original Assignee
Guangdong Planning and Designing Institute of Telecommunications 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 Guangdong Planning and Designing Institute of Telecommunications Co Ltd filed Critical Guangdong Planning and Designing Institute of Telecommunications Co Ltd
Priority to CN202110971975.9A priority Critical patent/CN114124794B/en
Publication of CN114124794A publication Critical patent/CN114124794A/en
Application granted granted Critical
Publication of CN114124794B publication Critical patent/CN114124794B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J14/00—Optical multiplex systems
    • H04J14/02—Wavelength-division multiplex systems
    • H04J14/0201—Add-and-drop multiplexing
    • H04J14/0202—Arrangements therefor
    • H04J14/021—Reconfigurable arrangements, e.g. reconfigurable optical add/drop multiplexers [ROADM] or tunable optical add/drop multiplexers [TOADM]
    • 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/14—Routing performance; Theoretical aspects
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion
    • H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering

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 business domain bearing planning method and a device based on a multi-area optical network system, comprising the following steps: basic information of each area network in the multi-area optical network system and service demand information of a service to be processed are obtained; determining the shortest service path of the service to be processed according to the shortest path algorithm, the basic information and the service demand information; acquiring the regional attribute of each section of link in the shortest service path, and judging whether a service cross-domain transit node exists in path nodes included in the shortest service path; if the existence of the service cross-domain transit node is judged, the service bearing area network group of the service to be processed is determined according to the area attribute of each section of link and the service cross-domain transit node. Therefore, by implementing the invention, the time delay in the service transmission process can be reduced, reasonable service cross-domain switching nodes can be planned, the regional network group for bearing the service can be accurately determined, the relay configuration investment is reduced, and the bearing benefit is improved.

Description

Service domain bearing planning method and device based on multi-area optical network system
Technical Field
The present invention relates to network communication technologies, and in particular, to a method and an apparatus for planning service domain division bearer based on a multi-area optical network system.
Background
With the maturation and progress of ROADM/OTN technologies, various large operators have adopted ROADM/OTN technologies to perform network construction, and for convenience of network management, coverage is usually performed in administrative areas, and a network is built in each area.
In actual network construction, overlapping, tangency, and the like may occur among a plurality of regional networks. However, the service is required to pass through a plurality of regional networks in the middle and be carried by a plurality of regional network segments, which brings certain difficulty to service planning. At present, the industry does not have a standard and perfect service domain bearing planning method and flow, and a common method is to manually set a general path and a trans-regional transit node of a service item by item, and divide the service into different regional networks for bearing. The method is time-consuming and labor-consuming, and can not shorten the service path length to the greatest extent to realize the optimal time delay, and can not reduce the number of relay nodes to the greatest extent to realize the optimal investment benefit.
Therefore, how to create low-delay service, set reasonable butt joint nodes, and how to classify the overlapping coverage part of the multi-area network into higher bearing benefit is important.
Disclosure of Invention
In order to fully realize the optimal benefit of service planning, and create a service with low time delay, high safety and easy maintenance, the first aspect of the invention discloses a service sub-domain bearing planning method of a multi-domain optical network, which comprises the following steps:
acquiring basic information of each area network in the multi-area optical network system, and acquiring service demand information of a service to be processed, wherein the basic information comprises node information and link information, and the service demand information comprises a service starting node and a service terminating node of the service to be processed;
determining the shortest service path of the service to be processed according to a shortest path algorithm, the basic information and the service demand information;
acquiring the regional attribute of each section of link in the shortest service path;
judging whether a service cross-domain transit node exists in path nodes included in the shortest service path according to the regional attribute of each link in the shortest service path;
and if the service cross-domain transit node exists in the path node included in the shortest service path, determining a service bearing area network group of the service to be processed according to the area attribute of each section of the link and the service cross-domain transit node.
As an optional implementation manner, in the first aspect of the present invention, the obtaining basic information of each area network in the multi-area optical network system includes:
acquiring node information of each area network in the multi-area optical network system, wherein the node information comprises: node identification, node region attribute; merging nodes with the same node identification in all the node information;
acquiring link information between two adjacent nodes in the area network, wherein the link information comprises: link identification, link starting point identification, link end point identification, link distance, group delay difference, optical signal to noise ratio value, equivalent span number and link region attribute; and merging links with the same link identification in all the link information.
As an optional implementation manner, in the first aspect of the present invention, the area attribute of the link includes an area network to which the link belongs;
judging whether a service cross-domain transit node exists in a path node included in the shortest service path according to the regional attribute of each link in the shortest service path, including:
judging whether the number of the links of the predetermined target link set is equal to 2; wherein the target link set comprises at least two links;
When the number of the links is equal to 2, judging whether an intersection area network exists in the area network to which the two links of the target link set belong; if the intersection area network does not exist, setting a path node between two sections of links of the target link set as a service cross-domain transit node; if the intersection area network exists, judging whether a path node between two links of the target link set is a service cross-domain electrical relay node, if so, setting the path node between the two links of the target link set as the service cross-domain switching node; if not, adding the next section of adjacent links of the target link set to update the target link set, and triggering the step of judging whether the number of links of the target link set is equal to 2 or not;
when the number of links is greater than 2, judging whether an intersection exists between an area network to which a last link of the target link set belongs and an intersection area network of the rest links of the target link set, wherein the rest links are all links except the last link of the target link set, and the area network to which all links of the rest links belong has the intersection area network;
When judging that the intersection of the regional network to which the last section of link belongs and the intersection regional network of the rest links does not exist, determining a starting node of the last section of link as a service cross-domain transit node, determining two sections of adjacent links taking the service cross-domain transit node as the starting node as new target link sets, and triggering the step of judging whether the number of links of the target link sets determined in advance is equal to 2;
when judging that the intersection exists between the regional network to which the last section of link belongs and the intersection regional network of the rest links, judging whether the starting node of the last section of link is a business cross-domain electric relay node;
when the starting node of the last section of link is judged to be a service cross-domain electric relay node, determining the starting node of the last section of link as a service cross-domain switching node, determining two sections of adjacent links taking the service cross-domain switching node as the starting node as new target link sets, and triggering the step of judging whether the number of links of the target link sets determined in advance is equal to 2;
and when the starting node of the last section of link is not a business cross-domain electric relay node, adding the next section of adjacent link of the target link set to update the target link set, and triggering the step of judging whether the number of links of the predetermined target link set is equal to 2.
In an optional implementation manner, before the determining, according to the area attribute of each link in the shortest service path, whether the path node included in the shortest service path has a service cross-domain transit node, the method further includes:
calculating a first accumulated value of optical signal-to-noise ratio values of the first two sections of links taking a target node as a starting point and a second accumulated value of group delay difference values of the first two sections of links, and judging whether the first accumulated value meets a preset target optical signal-to-noise ratio tolerance and whether the second accumulated value meets a preset target group delay difference tolerance;
when any one of the two links is not satisfied, setting the intermediate node of the two links as a service electricity relay node; using the service electric relay node as a starting point, and searching whether an area network overlapping node closest to the service electric relay node exists along the reverse direction of the service direction of the shortest service path;
when the area network overlapped node exists, setting the area network overlapped node as a service cross-domain electric relay node, determining the service cross-domain electric relay node as a new target node, executing the steps of calculating a first accumulated value of optical signal to noise ratio values of the first two sections of links taking the target node as a starting point and a second accumulated value of group delay differences of the first two sections of links, and judging whether the first accumulated value meets a preset target optical signal to noise ratio tolerance and whether the second accumulated value meets a preset target group delay difference tolerance;
When there is no overlapping node in the area network, determining the service electric relay node as a new target node, and executing the steps of calculating a first accumulated value of optical signal to noise ratio values of the first two links taking the target node as a starting point and a second accumulated value of group delay differences of the first two links, and judging whether the first accumulated value meets a preset target optical signal to noise ratio tolerance and whether the second accumulated value meets a preset target group delay difference tolerance;
when the first accumulated value meets the target optical signal to noise ratio tolerance and the second accumulated value meets the target group delay difference tolerance, determining a termination computing node corresponding to the target node, calculating accumulated values of optical signal to noise ratio values of all links from the target node to the termination computing node to obtain a third accumulated value, and calculating accumulated values of group delay difference values of all links from the target node to the termination computing node to obtain a fourth accumulated value; judging whether the third accumulated value meets the target optical signal to noise ratio tolerance or not and whether the fourth accumulated value meets the target group delay tolerance or not; when the optical signal to noise ratio values of all links from the target node to the termination computing node are all met, determining the next adjacent node of the termination computing node as a new termination computing node, triggering and executing the termination computing node corresponding to the target node, calculating the accumulated value of the optical signal to noise ratio values of all links from the target node to the termination computing node to obtain a third accumulated value, and calculating the accumulated value of the group delay difference values of all links from the target node to the termination computing node to obtain a fourth accumulated value; judging whether the third accumulated value meets the target optical signal to noise ratio tolerance or not and whether the fourth accumulated value meets the target group delay tolerance or not; and when any one of the service paths is not satisfied, setting the previous adjacent node of the termination computing node as a service electric relay node, and executing the step of reversely searching whether an area network overlapped node closest to the service electric relay node exists along the service direction of the shortest service path by taking the service electric relay node as a starting point.
As an optional implementation manner, in the first aspect of the present invention, the area attribute of the link includes an area network to which the link belongs;
the determining the service carrying area network group of the service to be processed according to the area attribute of each section of the link and the service cross-domain transit node specifically comprises the following steps:
extracting the service starting node, all the service cross-domain transit nodes and the service terminating nodes contained in the shortest service path of the service to be processed to form a first node set;
dividing the service to be processed into a plurality of service segments according to the first node set, wherein the service segments are formed by one or more segments of links between two adjacent nodes in the first node set;
for each service segment of the service to be processed, acquiring an intersection area network of an area network to which each segment of links in the service segment belong, determining the intersection area network as an area attribute of the service segment, and storing the intersection area network into a service segment bearing area network group corresponding to the service segment;
and connecting the service segment bearing area network groups corresponding to all the service segments of the service to be processed in series to obtain the service bearing area network group of the service to be processed.
As an alternative embodiment, in the first aspect of the present invention, the method further includes:
if the shortest service path includes a path node which does not have the service cross-domain transit node, determining a service bearing area network group of the service to be processed according to the area attribute of each section of the link;
the regional attribute of the link comprises a regional network to which the link belongs;
the determining the service carrying area network group of the service to be processed according to the area attribute of each section of the link comprises the following steps:
extracting the service starting node and the service ending node contained in the shortest service path of the service to be processed to form a second node set;
determining the service to be processed as a service segment according to the second node set, wherein the service segment is formed by one or more links between the service starting node and the service ending node;
and for the service segment of the service to be processed, acquiring an intersection area network of an area network to which each segment of links in the service segment belong, taking the intersection area network as the area attribute of the service segment, and storing the intersection area network into a service segment bearing area network group corresponding to the service segment as a service bearing area network group of the service to be processed.
As an optional implementation manner, in the first aspect of the present invention, after determining the service carrying area network group of the service to be processed, the method further includes:
judging whether the number of regional networks included in a service segment bearing regional network group corresponding to the service segment is greater than or equal to a preset number for any service segment in the service to be processed;
and when the judgment result is yes, distributing the service segment to one of the regional networks according to a load balancing algorithm.
As an optional implementation manner, in the first aspect of the present invention, the service to be processed is an associated service group, where the associated service group includes a first service group and a second service group, the first service group includes at least one service, the second service group includes at least one service, and any service in the first service group and any service in the second service group are associated services;
the method further comprises the steps of:
acquiring shared risk link group information, wherein the shared risk link group information comprises multi-section link information of the same optical cable or the same-ditch and same-pipeline optical cables;
and determining a shortest service path of the service to be processed according to a shortest path algorithm, the basic information and the service requirement information, wherein the determining comprises the following steps:
Calculating a first shortest path of the first service group according to a shortest path algorithm, the basic information and the service demand information of the first service group;
determining risk links corresponding to all links of the first shortest path according to the shared risk link group information;
disconnecting all links of the first shortest path and risk links corresponding to all links of the first shortest path;
and calculating a second shortest path of the second service group according to a shortest path algorithm, the basic information, the service demand information of the second service group and the unbroken link.
As an alternative embodiment, in the first aspect of the present invention, the method further includes:
determining all first service segments contained in the first service group, the number of services borne by each first service segment, and all second service segments contained in the second service group;
judging whether the number of regional networks included in a service segment bearing regional network group corresponding to any one of the first service segments is greater than or equal to a preset number; when the judging result is yes, judging whether target second service segments which are intersected with the regional network included by the service segment bearing regional network group corresponding to the first service segment exist in all the second service segments; if the target second service segment exists, updating the area network of the service segment bearing area network group corresponding to the first service segment and the area network of the service segment bearing area network group corresponding to the target second service segment into an intersecting area network of the first service segment and the target second service segment; and if the target second service segment does not exist, uniformly distributing the service number borne by the first service segment to the regional network of the service segment bearing regional network group corresponding to the first service segment according to a load balancing algorithm and the service number borne by the first service segment.
The second aspect of the present invention discloses a service domain bearing planning device based on a multi-area optical network system, the device comprises:
the information acquisition module is used for acquiring basic information of each area network in the multi-area optical network system and acquiring service demand information of a service to be processed, wherein the basic information comprises node information and link information, and the service demand information comprises a service starting node and a service terminating node of the service to be processed;
the path planning module is used for determining the shortest service path of the service to be processed according to a shortest path algorithm, the basic information and the service demand information;
the link region attribute acquisition module is used for acquiring the region attribute of each section of link in the shortest service path;
the judging module is used for judging whether a service cross-domain transit node exists in the path nodes included in the shortest service path according to the regional attribute of each link in the shortest service path;
and the determining module is used for determining a service bearing area network group of the service to be processed according to the area attribute of each section of the link and the service cross-domain transfer node if the judging module judges that the service cross-domain transfer node exists in the path node included in the shortest service path.
In a second aspect of the present invention, the manner in which the information obtaining module obtains the basic information of each area network in the multi-area optical network system specifically includes:
acquiring node information of each area network in the multi-area optical network system, wherein the node information comprises: node identification, node region attribute; merging nodes with the same node identification in all the node information;
acquiring link information between two adjacent nodes in the area network, wherein the link information comprises: link identification, link starting point identification, link end point identification, link distance, group delay difference, optical signal to noise ratio value, equivalent span number and link region attribute; and merging links with the same link identification in all the link information.
As an optional implementation manner, in the second aspect of the present invention, the area attribute of the link includes an area network to which the link belongs;
the judging module is configured to judge whether a service cross-domain transit node exists in a path node included in the shortest service path according to a region attribute of each link in the shortest service path, where the mode specifically includes:
Judging whether the number of the links of the predetermined target link set is equal to 2; wherein the target link set comprises at least two links;
when the number of the links is equal to 2, judging whether an intersection area network exists in the area network to which the two links of the target link set belong; if the intersection area network does not exist, setting a path node between two sections of links of the target link set as a service cross-domain transit node; if the intersection area network exists, judging whether a path node between two links of the target link set is a service cross-domain electrical relay node, if so, setting the path node between the two links of the target link set as the service cross-domain switching node; if not, adding the next section of adjacent links of the target link set to update the target link set, and triggering the step of judging whether the number of links of the target link set is equal to 2 or not;
when the number of links is greater than 2, judging whether an intersection exists between an area network to which a last link of the target link set belongs and an intersection area network of the rest links of the target link set, wherein the rest links are all links except the last link of the target link set, and the area network to which all links of the rest links belong has the intersection area network;
When judging that the intersection of the regional network to which the last section of link belongs and the intersection regional network of the rest links does not exist, determining a starting node of the last section of link as a service cross-domain transit node, determining two sections of adjacent links taking the service cross-domain transit node as the starting node as new target link sets, and triggering the step of judging whether the number of links of the target link sets determined in advance is equal to 2;
when judging that the intersection exists between the regional network to which the last section of link belongs and the intersection regional network of the rest links, judging whether the starting node of the last section of link is a business cross-domain electric relay node;
when the starting node of the last section of link is judged to be a service cross-domain electric relay node, determining the starting node of the last section of link as a service cross-domain switching node, determining two sections of adjacent links taking the service cross-domain switching node as the starting node as new target link sets, and triggering the step of judging whether the number of links of the target link sets determined in advance is equal to 2;
and when the starting node of the last section of link is not a business cross-domain electric relay node, adding the next section of adjacent link of the target link set to update the target link set, and triggering the step of judging whether the number of links of the predetermined target link set is equal to 2.
As an optional implementation manner, in the second aspect of the present invention, the apparatus further includes a setting module, where the setting module is configured to:
before the judging module judges whether a path node included in the shortest service path has a service cross-domain switching node according to the regional attribute of each link in the shortest service path, a first accumulated value of optical signal-to-noise ratio values of the first two links taking a target node as a starting point and a second accumulated value of group delay difference values of the first two links are calculated, and whether the first accumulated value meets a preset target optical signal-to-noise ratio tolerance and the second accumulated value meets a preset target group delay difference tolerance are judged;
when any one of the two links is not satisfied, setting the intermediate node of the two links as a service electricity relay node; using the service electric relay node as a starting point, and searching whether an area network overlapping node closest to the service electric relay node exists along the reverse direction of the service direction of the shortest service path;
when the area network overlapped node exists, setting the area network overlapped node as a service cross-domain electric relay node, determining the service cross-domain electric relay node as a new target node, and executing the operation of calculating a first accumulated value of optical signal to noise values of the first two sections of links taking the target node as a starting point and a second accumulated value of group delay differences of the first two sections of links and the operation of judging whether the first accumulated value meets a preset target optical signal to noise ratio tolerance and whether the second accumulated value meets a preset target group delay tolerance;
When the area network overlapping node does not exist, determining the service electric relay node as a new target node, and executing the operation of calculating a first accumulated value of optical signal to noise ratio values of the first two sections of links taking the target node as a starting point and a second accumulated value of group delay differences of the first two sections of links and the operation of judging whether the first accumulated value meets a preset target optical signal to noise ratio tolerance and whether the second accumulated value meets a preset target group delay difference tolerance;
when the first accumulated value meets the target optical signal to noise ratio tolerance and the second accumulated value meets the target group delay difference tolerance, determining a termination computing node corresponding to the target node, calculating accumulated values of optical signal to noise ratio values of all links from the target node to the termination computing node to obtain a third accumulated value, and calculating accumulated values of group delay difference values of all links from the target node to the termination computing node to obtain a fourth accumulated value; judging whether the third accumulated value meets the target optical signal to noise ratio tolerance or not and whether the fourth accumulated value meets the target group delay tolerance or not; when the optical signal to noise ratio values of all links from the target node to the termination computing node are all met, determining the next adjacent node of the termination computing node as a new termination computing node, triggering and executing the termination computing node corresponding to the target node, calculating the accumulated value of the optical signal to noise ratio values of all links from the target node to the termination computing node to obtain a third accumulated value, and calculating the accumulated value of the group delay difference values of all links from the target node to the termination computing node to obtain a fourth accumulated value; an operation of judging whether the third accumulated value satisfies the target osnr margin or not and whether the fourth accumulated value satisfies the target group delay margin or not; and when any one of the service paths is not satisfied, setting the prior adjacent node of the termination computing node as a service electric relay node, and executing the operation of reversely searching whether the area network overlapped node closest to the service electric relay node exists along the service direction of the shortest service path by taking the service electric relay node as a starting point.
As an optional implementation manner, in the second aspect of the present invention, the area attribute of the link includes an area network to which the link belongs;
the determining module determines the service carrying area network group of the service to be processed according to the area attribute of each section of the link and the service cross-domain transit node specifically comprises:
extracting the service starting node, all the service cross-domain transit nodes and the service terminating nodes contained in the shortest service path of the service to be processed to form a first node set;
dividing the service to be processed into a plurality of service segments according to the first node set, wherein the service segments are formed by one or more segments of links between two adjacent nodes in the first node set;
for each service segment of the service to be processed, acquiring an intersection area network of an area network to which each segment of links in the service segment belong, determining the intersection area network as an area attribute of the service segment, and storing the intersection area network into a service segment bearing area network group corresponding to the service segment;
and connecting the service segment bearing area network groups corresponding to all the service segments of the service to be processed in series to obtain the service bearing area network group of the service to be processed.
As an alternative embodiment, in a second aspect of the invention,
the determining module is further configured to determine, if the judging module judges that the path node included in the shortest service path does not include the service cross-domain transit node, a service carrying area network group of the service to be processed according to an area attribute of each section of the link;
the regional attribute of the link comprises a regional network to which the link belongs;
the determining module determines the service carrying area network of the service to be processed according to the area attribute of each section of the link specifically includes:
extracting the service starting node and the service ending node contained in the shortest service path of the service to be processed to form a second node set;
determining the service to be processed as a service segment according to the second node set, wherein the service segment is formed by one or more links between the service starting node and the service ending node;
and for the service segment of the service to be processed, acquiring an intersection area network of an area network to which each segment of links in the service segment belong, taking the intersection area network as the area attribute of the service segment, and storing the intersection area network into a service segment bearing area network group corresponding to the service segment as a service bearing area network group of the service to be processed.
As an alternative embodiment, in the second aspect of the present invention, the apparatus further comprises a first allocation module, wherein the first allocation module is configured to:
after the determining module determines the service carrying area network group of the service to be processed, judging whether the number of area networks included in the service segment carrying area network group corresponding to any service segment in the service to be processed is greater than or equal to a preset number; and when the judgment result is yes, distributing the service segment to one of the regional networks according to a load balancing algorithm.
As an optional implementation manner, in the second aspect of the present invention, the service to be processed is an associated service group, where the associated service group includes a first service group and a second service group, the first service group includes at least one service, the second service group includes at least one service, and any service in the first service group and any service in the second service group are associated services;
the information acquisition module is further used for acquiring shared risk link group information, wherein the shared risk link group information comprises multiple pieces of link information using the same optical cable or using the same ditch and the same pipeline optical cable;
And the path planning module determines the shortest service path of the service to be processed according to the shortest path algorithm, the basic information and the service demand information, wherein the method specifically comprises the following steps:
calculating a first shortest path of the first service group according to a shortest path algorithm, the basic information and the service demand information of the first service group;
determining risk links corresponding to all links of the first shortest path according to the shared risk link group information;
disconnecting all links of the first shortest path and risk links corresponding to all links of the first shortest path;
and calculating a second shortest path of the second service group according to a shortest path algorithm, the basic information, the service demand information of the second service group and the unbroken link.
As an optional implementation manner, in the second aspect of the present invention, the apparatus further includes a second allocation module, where the second allocation module is configured to:
determining all first service segments contained in the first service group, the number of services borne by each first service segment, and all second service segments contained in the second service group;
Judging whether the number of regional networks included in a service segment bearing regional network group corresponding to any one of the first service segments is greater than or equal to a preset number; when the judging result is yes, judging whether target second service segments which are intersected with the regional network included by the service segment bearing regional network group corresponding to the first service segment exist in all the second service segments; if the target second service segment exists, updating the area network of the service segment bearing area network group corresponding to the first service segment and the area network of the service segment bearing area network group corresponding to the target second service segment into an intersecting area network of the first service segment and the target second service segment; and if the target second service segment does not exist, uniformly distributing the service number borne by the first service segment to the regional network of the service segment bearing regional network group corresponding to the first service segment according to a load balancing algorithm and the service number borne by the first service segment.
A third aspect of the present invention discloses an electronic device, including:
a memory storing executable program code;
a processor coupled to the memory;
The processor invokes the executable program codes stored in the memory to execute the service domain bearing planning method based on the multi-area optical network system disclosed in the first aspect of the invention.
A fourth aspect of the present invention discloses a computer readable storage medium, in which computer program instructions are stored, the computer program instructions, when called, are configured to perform the service domain division bearer planning method based on the multi-area optical network system disclosed in the first aspect of the present invention.
Compared with the prior art, the embodiment of the invention has the following beneficial effects:
the embodiment of the invention provides a business domain bearing planning method and device based on a multi-area optical network system, wherein the method comprises the following steps: acquiring basic information of each area network in a multi-area optical network system, and acquiring service demand information of a service to be processed, wherein the basic information comprises node information and link information, and the service demand information comprises a start node identifier and a termination node identifier of the service to be processed; determining the shortest service path of the service to be processed according to the shortest path algorithm, the basic information and the service demand information; acquiring the regional attribute of each section of link in the shortest service path; judging whether a service cross-domain transit node exists in path nodes included in the shortest service path according to the regional attribute of each link in the shortest service path; if the shortest service path includes the path node with the service cross-domain switching node, determining the service bearing area network group of the service to be processed according to the area attribute of each section of link and the service cross-domain switching node. The invention can be seen that by automatically planning the service path to be processed, acquiring the regional attribute of each section of link in the path and the service cross-domain switching node, determining the regional network group for bearing the service, providing a perfect service domain bearing planning method and flow, and reducing the time delay in the service transmission process; and reasonable service cross-domain switching nodes are planned, relay configuration investment is reduced, and bearing benefits are improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic flow diagram of a service domain-division bearer planning method based on a multi-area optical network system according to an embodiment of the present invention;
fig. 2 is a schematic flow diagram of another service domain-division bearer planning method based on a multi-area optical network system according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a service domain-division bearer planning device based on a multi-area optical network system according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of another service domain-division bearer planning device based on a multi-area optical network system according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of another service domain bearing planning device based on a multi-area optical network system according to an embodiment of the present invention.
Detailed Description
In order that those skilled in the art will better understand the present invention, a technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in which it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The terms first, second and the like in the description and in the claims and in the above-described figures are used for distinguishing between different objects and not necessarily for describing a sequential or chronological order. Furthermore, the terms "comprise" and "have," as well as any variations thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, apparatus, article, or article that comprises a list of steps or elements is not limited to only those listed but may optionally include other steps or elements not listed or inherent to such process, method, article, or article.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment may be included in at least one embodiment of the invention. The appearances of such phrases in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those of skill in the art will explicitly and implicitly appreciate that the embodiments described herein may be combined with other embodiments.
The invention discloses a service domain-division bearing planning method and a device based on a multi-area optical network system, which can automatically plan a to-be-processed service path, acquire the area attribute of each section of link in the path and a service cross-domain switching node, determine the area network group for bearing the service, provide a perfect service domain-division bearing planning method and a flow, and can reduce the time delay in the service transmission process; and reasonable service cross-domain switching nodes are planned, relay configuration investment is reduced, and bearing benefits are improved. The following will describe in detail.
Example 1
Fig. 1 is a schematic flow diagram of a service domain-division bearer planning method based on a multi-area optical network system according to an embodiment of the present invention. The method described in fig. 1 may be applied to a service domain bearing planning apparatus, such as an electronic device, a server, etc., which is not limited by the embodiment of the present invention. As shown in fig. 1, the service domain bearing planning method based on the multi-area optical network system may include the following steps:
s101, acquiring basic information of each area network in the multi-area optical network system and acquiring service demand information of a service to be processed.
In the embodiment of the invention, the ROADM/OTN technology is adopted for network construction, the ROADM/OTN network covering a certain area is called an area network, and each area is constructed with one network to form a multi-area optical network system. An office station in an optical network system, where ROADM/OTN devices are configured, is called a node, and an optical cable route formed by combining one or more optical cables between two adjacent nodes is called a link. The end-to-end wavelength level circuits on ROADM/OTN networks are referred to as traffic, and when traffic is carried by multiple regional networks, it is necessary to select a node where the two regional networks intersect (or overlap) to use OTU back-to-back switching. The case where a city, node, link, service paragraph, etc. belongs to one or more regional ROADM/OTN networks is described by a regional attribute, e.g., a regional network covers guangzhou city and B regional network also covers guangzhou city, then the regional attribute of guangzhou city is "a regional network/B regional network".
In the embodiment of the invention, the basic information of each regional network in the regional optical network system comprises node information and link information. The service demand information comprises service starting nodes and service ending nodes of the service to be processed, wherein the service starting nodes and the service ending nodes can be identification information such as names and/or codes of the service starting nodes and the service ending nodes.
In the embodiment of the present invention, optionally, the step of obtaining the basic information of each area network in the multi-area optical network system in S101 includes the following steps:
acquiring node information of each area network in the multi-area optical network system, wherein the node information comprises: node identification (e.g., node name, node code, etc.), node region attribute; and merging nodes with the same node identification in all the node information.
Acquiring link information between two adjacent nodes in a regional network, wherein the link information comprises: link identification (such as link name, link code, etc.), link start identification (such as link start name, link start sequence number, etc.), link end identification (such as link end name, link end sequence number, etc.), link distance, group delay difference (DGD), optical signal to noise ratio (OSNR), equivalent span number, link region attribute; and merging links with the same link identification in all the link information.
S102, determining the shortest service path of the service to be processed according to the shortest path algorithm, the basic information and the service demand information.
In the embodiment of the invention, the shortest path algorithm can be a common shortest path algorithm in the field, such as Dijkstra algorithm, floyd algorithm and the like, and the invention is not limited to the method.
Taking a service starting node of a service to be processed as Nanjing and a service terminating node as Kunming as examples, after the service path planning is completed, the style of the shortest service path is as follows: nanjing xx-ANAI-Jiujiangxx-AWAI-Wuhan xx-AWFD 1-Jing Zhou xx-FDKU-WUX-KMKU-Kailixx-KMKC-Guiyang xx-KCKH-Anshun xx-KGKH-Panxian xx-JFKG-tricJing xx-JZJF 1-XYJKxx-JZJD 1-Kunming xx.
In the embodiment of the invention, the low-delay path of the service to be processed can be planned through the shortest path algorithm, which is beneficial to guaranteeing the transmission timeliness of the service.
S103, obtaining the regional attribute of each section of link in the shortest service path.
In the embodiment of the present invention, optionally, the area attribute of the link includes an area network to which the link belongs.
Taking the service initiation node of the service to be processed as Nanjing and the service termination node as Kunming, the shortest service path of the service to be processed is planned as an example. Based on the link coding, searching the regional attribute of the link in the pre-acquired multi-regional optical network system link information. The area network to which the first-segment link ANAI belongs is an A area network and a D area network, that is, the area attribute of the first-segment link ANAI is { A area network/D area network }. Similarly, the region attribute of each link is obtained as shown in table 1:
Link origin name Link endpoint name Link coding Region attribute 1 Region attribute 2 Region attribute 3 Region attribute 4
Nanjing xx Jiujiangxx device ANAI A area network D area network
Jiujiangxx device Wuhan xx AWAI A area network B area network D area network
Wuhan xx Jing Zhou xx AWFD1 A area network B area network
Jing Zhou xx Wyohua xx FDKU B area network
Wyohua xx Kaixx KMKU B area network
Kaixx Guiyang xx KMKC B area network
Guiyang xx Anshun xx KCKH B area network C area network
Anshun xx County xx KGKH B area network C area network
County xx Curved surface xx JFKG B area network C area network
Curved surface xx Seek marn xx JZJF1 B area network C area network
Seek marn xx Kunming xx JZJD1 B area network C area network
Table 1 regional properties of links in shortest traffic path for pending traffic
S104, judging whether a service cross-domain transit node exists in the path nodes included in the shortest service path according to the regional attribute of each link in the shortest service path.
In an embodiment of the present invention, optionally, step S104 includes the following steps:
judging whether the number of the links of the predetermined target link set is equal to 2; wherein the target link set includes at least two links.
When the number of links is equal to 2, judging whether an intersection area network exists in the area network to which the two links of the target link set belong; if the intersection area network does not exist, setting a path node between two sections of links of the target link set as a service cross-domain transit node; if the intersection area network exists, judging whether a path node between two sections of links of the target link set is a service cross-domain electrical relay node, if so, setting the path node between the two sections of links of the target link set as the service cross-domain switching node; if not, adding the next section of adjacent links of the target link set to update the target link set, and triggering to judge whether the number of links of the target link set is equal to 2 or not. For example, assuming that the area network to which the link X belongs is an a area network, and the area network to which the next link Y adjacent to the link X belongs is a B area network, that is, two adjacent links respectively belong to two tangential area networks, there is no intersection area network between the area network to which the link X belongs and the area network to which the link Y belongs, and the path node between the link X and the link Y is set as the service cross-domain transit node according to the above operation.
When the number of links is greater than 2, judging whether an intersection exists between the regional network to which the last section of links of the target link set belongs and the intersection regional network of the rest links of the target link set, wherein the rest links are all links except the last section of links in the target link set, and the intersection regional network exists in the regional network to which all links in the rest links belong.
When judging that the intersection of the regional network to which the last section of link belongs and the intersection regional network of the rest links does not exist, determining the starting node of the last section of link as a service cross-domain transfer node, determining two sections of adjacent links taking the service cross-domain transfer node as the starting node as new target link sets, and triggering and judging whether the number of links of the predetermined target link sets is equal to 2. When judging that the intersection exists between the regional network to which the last section of link belongs and the intersection regional network of the rest links, judging whether the starting node of the last section of link is a business cross-domain electric relay node.
When the starting node of the last section of link is judged to be the service cross-domain electric relay node, the starting node of the last section of link is determined to be the service cross-domain switching node, two sections of adjacent links taking the service cross-domain switching node as the starting node are determined to be new target link sets, and the step of judging whether the number of links of the predetermined target link sets is equal to 2 is triggered.
And when judging that the starting node of the last section of link is not the business cross-domain electric relay node, adding the next section of adjacent link of the target link set to update the target link set, and triggering the step of judging whether the number of links of the predetermined target link set is equal to 2.
In the embodiment of the present invention, step S104 is further described by taking the example that the service start node of the service to be processed is nanjing, the service end node is kunming, and the shortest service path is planned.
Judging whether an intersection area network exists between the area network of the first section of link ANAI and the area network of the second section of link AWAI, and knowing the area attribute of the link ANAI and the area attribute of the link AWAI based on the obtained area attribute of the link ANAI and the obtained area attribute of the link AWAI, wherein the intersection area network exists between the first section of link ANAI and the second section of link AWAI, and is an A area network and a D area network. Further judging whether a path node Jiujiang xx between a first section of link ANAI and a second section of link AWAI is a service cross-domain electric relay node, and if the path node Jiujiang xx is not the preset service cross-domain electric relay node based on the preset service cross-domain electric relay node information, not processing the node Jiujiang xx.
And continuing to execute the step of judging whether the intersection area network exists between the intersection area network (A area network and D area network) of the first section link ANAI and the second section link AWAI and the area network (A area network and B area network) of the third section link AWFD1, wherein the intersection area network exists between the intersection area network of the first two sections links and the area network of the third section link is known as the A area network. Further judging whether a path node WHan xx between the second section link AWAI and the third section link AWFD1 is a service cross-domain electric relay node, and setting the WHan xx as a service cross-domain switching node if the path node WHan xx is a preset service cross-domain electric relay node.
And determining a target link set by taking the traffic cross-domain transit node Wuhan xx as a new starting node, and repeatedly executing the step S104 until all links in the shortest traffic path are judged to be completed.
Therefore, in the alternative embodiment, all the service cross-domain transit nodes in the shortest service path are obtained through the link region attribute, the butt joint nodes carried by the service sub-domains are reasonably configured, and the links as long as possible are placed in the same regional network, so that the configuration of intermediate nodes in the service transmission process can be reduced, and the domain switching times of the service are reduced.
In an embodiment of the present invention, before step S104, the method for planning service domain bearing based on the multi-area optical network system further includes:
a first cumulative value of optical signal-to-noise ratio (OSNR) values of the first two segments of links starting from the target node and a second cumulative value of group delay difference (DGD) values of the first two segments of links are calculated. The initial target node is a service initiation node.
And judging whether the first accumulated value meets a preset target optical signal to noise ratio tolerance and whether the second accumulated value meets a preset target group delay difference tolerance.
And when any one of the two links is not satisfied, setting the intermediate node of the two links as a business electric relay node. And searching whether an area network overlapping node closest to the service electric relay node exists along the reverse direction of the service direction of the shortest service path by taking the service electric relay node as a starting point. And when the area network overlapped node exists, setting the area network overlapped node as a service cross-domain electric relay node, determining the service cross-domain electric relay node as a new target node, executing the calculation of a first accumulated value of optical signal to noise ratio (OSNR) values of the first two links taking the target node as a starting point and a second accumulated value of group delay difference values (DGD) of the first two links, and judging whether the first accumulated value meets a preset target optical signal to noise ratio tolerance and whether the second accumulated value meets the preset target group delay difference tolerance. And when the area network overlapping node does not exist, determining the service electric relay node as a new target node, executing the steps of calculating a first accumulated value of optical signal to noise ratio (OSNR) values of the first two links taking the target node as a starting point and a second accumulated value of group delay difference values (DGD) of the first two links, and judging whether the first accumulated value meets a preset target optical signal to noise ratio tolerance and whether the second accumulated value meets the preset target group delay difference tolerance.
When the first accumulated value and the second accumulated value meet the tolerance requirement, determining a termination computing node corresponding to the target node. The initial termination computing node is a link termination node of the third segment link.
And calculating the accumulated value of the optical signal to noise ratio values of all links from the target node to the termination computing node to obtain a third accumulated value, and calculating the accumulated value of the group delay difference values of all links from the target node to the termination computing node to obtain a fourth accumulated value.
And determining whether the third accumulated value meets the target osnr tolerance and whether the fourth accumulated value meets the target group delay tolerance, if so, determining the next adjacent node of the termination computing node as a new termination computing node, executing the accumulated values of the osnr values of all links from the calculation target node to the termination computing node to obtain the third accumulated value and the accumulated values of the group delay differences of all links from the calculation target node to the termination computing node to obtain the fourth accumulated value, and determining whether the third accumulated value meets the target osnr tolerance and whether the fourth accumulated value meets the target group delay tolerance. And if any node does not meet the requirement, setting the previous adjacent node of the termination computing node as a service electric relay node, and executing the step of searching whether the area network overlapped node closest to the service electric relay node exists along the reverse direction of the service direction of the shortest service path by taking the service electric relay node as a starting point.
In the embodiment of the invention, the method steps are further described by taking the example that the service starting node of the service to be processed is Nanjing, the service ending node is Kunming, and the shortest service path is planned.
With the service initiation node Nanjing xx as a starting point, the OSNR cumulative value and the DGD cumulative value of the first two links are calculated, namely the OSNR of the first link ANAI is calculated 1 OSNR with second segment link AWAI 2 Where osnr=cumulative calculation function (OSNR 1 ,OSNR 2 ) And calculating the DGD of the first segment link ANAI 1 DGD with second segment link AWAI 2 Wherein DGD = cumulative calculation function (DGD 1 ,DGD 2 ). Comparison of OSNR and OSNR Tolerance margin And comparing the DGD with the DGD Tolerance margin Based on the pre-acquired link optical signal to noise value and group delay difference, the calculated OSNR and DGD of the first two links meet the tolerance requirement, namely the OSNR is more than or equal to OSNR Tolerance margin And DGD<DGD Tolerance margin 。
The OSNR integration value and DGD integration value of the first three links are calculated, osnr=integration calculation function (OSNR 1 ,OSNR 2 ,OSNR 3 ) Dgd=cumulative calculation function (DGD 1 ,DGD 2 ,DGD 3 ) Wherein the OSNR 3 For the OSNR value, DGD, of the third segment link AWFD1 3 Is the DGD value of the third segment link AWFD 1. The calculated new OSNR and DGD are respectively matched with the OSNR Tolerance margin 、DGD Tolerance margin By comparison, the OSNR and DGD of the first three links calculated at this time meet the tolerance requirements.
And further calculating the OSNR accumulated value and the DGD accumulated value of the first four links, and the OSNR accumulated value and the DGD accumulated value of the first five links until the maximum number of links which do not meet the tolerance requirement is found. In the shortest traffic path of the example pending traffic, the maximum number of links that do not meet the tolerance requirement is 6, i.e. OSNR = cumulative calculation function (OSNR 1 ,OSNR 2 ,OSNR 3 ,OSNR 4 ,OSNR 5 ,OSNR 6 ) When the OSNR does not satisfy the OSNR Tolerance margin 。
At this time, the link end point noble yang xx of the sixth link KMKC is a termination computing node, and the preceding neighboring node, kelixx, of the termination computing node noble yang xx is set as a service electrical relay node.
And (3) taking the service electric relay node Kelvin as a starting point, searching an area network overlapped node closest to the service electric relay node Kelvin along the reverse direction of the service direction of the shortest service path, searching an area network overlapped node Wohman xx, setting the node Wohman xx as a service cross-domain electric relay node, and storing the service cross-domain electric relay node information table.
With the traffic cross-domain electric relay node wuhanxx as a new starting point, the OSNR cumulative value and DGD cumulative value of the first two links are calculated, that is, the OSNR cumulative value and DGD cumulative value of the third link AWFD1 and the fourth link FDKU are calculated, where osnr=cumulative calculation function (OSNR 3 ,OSNR 4 ) Dgd=cumulative calculation function (DGD 3 ,DGD 4 ). Comparison of OSNR and OSNR Tolerance margin And DGD Tolerance margin . The OSNR and DGD of the first two links calculated at this time meet the margin requirement. The OSNR and DGD accumulated values for the first three links, the OSNR and DGD accumulated values for the first four links, … …, etc. are further calculated. Performing the OSNR accumulated value and the OSNR once every time the OSNR accumulated value and the DGD accumulated value are calculated Tolerance margin Cumulative value of DGD and DGD Tolerance margin And comparing until the maximum number of links which do not meet the tolerance is found or until the last section of links included in the current service path is calculated. In the shortest service path of the service to be processed in this example, in all links formed by taking the Wuhan xx as a service cross-domain electric relay node as a starting point and taking the Kunming xx as an end point of the service to be processed, the OSNR accumulated value and the DGD accumulated value meet the requirements of the OSNR tolerance and the DGD tolerance, and the step is finished. So far, all the service cross-domain electrical relay nodes included in the shortest service path of the current service to be processed can be obtained.
Therefore, in the alternative embodiment, the maximum transmission distance of the single electric relay section meeting the transmission requirement of the link is found out through the accumulated value of the optical signal to noise ratio value and the accumulated value of the group delay difference value of the link, and the service cross-domain electric relay node is determined, so that the configuration of the electric relay node is reduced in the process of service cross-domain transmission, and the optimization of investment benefit is realized.
S105, if judging that the path node included in the shortest service path has a service cross-domain transit node, determining a service bearing area network group of the service to be processed according to the area attribute of each section of link and the service cross-domain transit node.
In the embodiment of the present invention, optionally, determining, in step S105, a service bearer area network group of a service to be processed according to an area attribute of each link and a service cross-domain transit node specifically includes the following steps:
and extracting a service starting node, all service cross-domain transit nodes and service termination nodes contained in the shortest service path of the service to be processed to form a first node set.
The service to be processed is divided into a plurality of service segments according to the first node set, and the service segments are formed by one or more segments of links between two adjacent nodes in the first node set.
For each service segment of the service to be processed, acquiring an intersection area network of an area network to which each segment link in the service segment belongs, determining the intersection area network as an area attribute of the service segment, and storing the intersection area network into a service segment bearing area network group corresponding to the service segment.
And connecting the service segment bearing area network groups corresponding to all the service segments of the service to be processed in series to obtain the service bearing area network group of the service to be processed.
In the embodiment of the present invention, step S105 is further described by taking the example that the service start node of the service to be processed is nanjing, the service end node is kunming, and the shortest service path is planned.
And forming a first node set by the service initiation node Nanjing xx, the service cross-domain transfer node Wuhan xx and the service termination node Kunming xx, wherein the first node set is { Nanjing xx, wuhan xx and Kunming xx }.
Dividing the service to be processed into two service segments according to the three nodes in the first node set. Service segment 1: nanjing xx-Wuhanxx, including links ANAI, AWAI. Service segment 2: martial xx-kunming xx, including links AWFD1, FDKU, KMKU, KMKC, KCKH, JFKG, JZJF1, JZJD1.
For the service segment 1, an intersection area network of the area networks to which the links ANAI and AWAI belong, namely an A area network and a D area network, is acquired. And taking the A area network and the D area network as the area attribute of the service segment 1 to obtain a service segment bearing area network group 1 corresponding to the service segment 1, wherein the service segment bearing area network group 1 is { A area network/D area network }.
For the traffic segment 2, an intersection area network, i.e., a B area network, of the area networks to which the links AWFD1, FDKU, KMKU, KMKC, KCKH, JFKG, JZJF1, JZJD1 belong is acquired. And taking the B area network as the area attribute of the service segment 2 to obtain a service segment bearing area network group 2 corresponding to the service segment 2, wherein the service segment bearing area network group 2 is { B area network }.
Thereby, the service bearing area network group of the service to be processed can be obtained: { a regional area network/D regional area network; b area network }. The service path pattern for completing the grouping of the service bearing area network is as follows: nanjing xx- { A area network/D area network } -Wuhan- { B area network } -Kunming xx.
Therefore, the embodiment of the invention can automatically plan the to-be-processed service path by improving the service domain-division bearing planning method based on the multi-area optical network system, acquire the area attribute and the service cross-domain switching node of each section of link in the path, determine the area network group bearing the service, provide a perfect service domain-division bearing planning method and flow, and reduce the time delay in the service transmission process; and reasonable service cross-domain switching nodes are planned, relay configuration investment is reduced, and bearing benefits are improved.
In an embodiment of the present invention, optionally, the service domain-division bearer planning method based on the multi-area optical network system further includes: if the shortest service path includes path nodes without service cross-domain transfer nodes, determining service bearing area network groups of the service to be processed according to the area attribute of each section of link.
In the embodiment of the present invention, further optionally, determining a service carrying area network group of a service to be processed according to an area attribute of each link specifically includes the following steps:
And extracting a service starting node and a service ending node contained in the shortest service path of the service to be processed to form a second node set.
And determining the service to be processed as a service segment according to the second node set, wherein the service segment is formed by one or more segments of links between the service starting node and the service ending node.
And for the service segment of the service to be processed, acquiring an intersection area network of an area network to which each segment link in the service segment belongs, taking the intersection area network as the area attribute of the service segment, and storing the intersection area network into a service segment bearing area network group corresponding to the service segment as a service bearing area network group of the service to be processed.
In the embodiment of the invention, if the service starting node of the service to be processed is a Wuhan, the service ending node is a Kunming, no cross-domain switching node exists in the planned shortest service path, the service to be processed is regarded as a service segment of Nanjing xx-Wuhan xx, and the intersection of the link region attributes of each segment between Nanjing xx-Wuhan service segments, namely the intersection region network of each segment of links, and the B region network are acquired. The B area network is used as the area attribute of the service segment, so that the service bearing area network group from the Wuhan to the Kunming of the service to be processed can be obtained: { area B network }.
In the embodiment of the present invention, optionally, after determining the service carrying area network group of the service to be processed, the service domain-division carrying planning method based on the multi-area optical network system further includes: judging whether the number of regional networks included in a service segment bearing regional network group corresponding to any service segment to be processed is greater than or equal to a preset number; and when the judgment result is yes, distributing the service segment to one of the regional networks according to a load balancing algorithm.
In the embodiment of the present invention, taking the service initiation node of the service to be processed as nanjing and the service termination node as kunming as an example, for the determined service segment 1, the area network carrying the service segment 1 is not unique, and the service segment 1 can be allocated to the a area network or the D area network according to the load balancing algorithm from the area network { a area network/D area network } carrying the service segment 1.
Therefore, the optional embodiment of the invention distributes the service segments to the regional networks through the load balancing algorithm, can balance the service bearing quantity of each regional network, is beneficial to the balance development of each regional network, and improves the service bearing benefit.
Example two
Fig. 2 is a flow chart of another service domain-division bearer planning method based on a multi-area optical network system according to an embodiment of the present invention. As shown in fig. 2, the service domain bearing planning method based on the multi-area optical network system may include the following steps:
S201, basic information of each area network in the multi-area optical network system is obtained, and service demand information of a service to be processed is obtained.
In the embodiment of the present invention, optionally, the service to be processed is an associated service group, the associated service group includes a first service group and a second service group, the first service group includes at least one service, the second service group includes at least one service, and any service in the first service group and any service in the second service group are associated services. The plurality of services in the same service group have the same service initiation node and service termination node, and the service initiation node and/or service termination node of the plurality of service groups in the same associated service group are generally different. The related service group 1 comprises a service group A and a service group B, wherein a service starting node of the service group A is Nanjing xx, and a service ending node is Kunming xx; the service starting node of the service group B is a combined fertilizer xx, and the service ending node is a long sand xx. One service in the associated service group may be expressed as: (202 x years) associated service group 1-a group-1.
In the embodiment of the present invention, further optionally, shared risk link group (SLRG) information is obtained, where the shared risk link group information includes multiple pieces of link information using the same optical cable or using the same-channel and same-pipe optical cables. Two services that are associated with each other do not allow the use of the same link and links within the same shared risk link group (SLRG).
In the embodiment of the present invention, the other descriptions of step S201 refer to the other specific descriptions of step S101 in the first embodiment, and the embodiment of the present invention is not repeated.
S202, determining the shortest service path of the service to be processed according to the shortest path algorithm, the basic information and the service demand information.
In an embodiment of the present invention, optionally, step S202 includes the following steps:
s2021, according to the shortest path algorithm, the basic information and the service requirement information of the first service group, calculating a first shortest path of the first service group.
S2022, determining risk links corresponding to all links of the first shortest path according to the shared risk link group information.
S2023, disconnect all links of the first shortest path and risk links corresponding to all links of the first shortest path.
S2024, calculating a second shortest path of the second service group according to the shortest path algorithm, the basic information, the service requirement information of the second service group and the unbroken link.
Therefore, in the alternative embodiment, the available link resources of the service group associated with the link occupation of the service group are determined according to the link occupation of the service group, so that the use of the same link and the links in the same risk link group by the associated service is avoided, and efficient path planning of the associated service group is realized.
In the embodiment of the present invention, for other descriptions of step S202, please refer to other specific descriptions of step S102 in the first embodiment, and the description of the embodiment of the present invention is omitted.
S203, obtaining the regional attribute of each section of link in the shortest service path.
S204, judging whether a service cross-domain transit node exists in the path nodes included in the shortest service path according to the regional attribute of each link in the shortest service path.
S205, if judging that the path node included in the shortest service path has a service cross-domain switching node, determining a service bearing area network group of the service to be processed according to the area attribute of each section of link and the service cross-domain switching node.
In the embodiment of the present invention, the other descriptions of the steps S203 to S205 refer to the other specific descriptions of the steps S103 to S105 in the first embodiment, and the embodiments of the present invention are not repeated.
In the embodiment of the present invention, optionally, a service carrying area network group of a service to be processed is determined, and the service domain bearing planning method based on the multi-area optical network system further includes the following steps:
and determining all the first service segments contained in the first service group, the number of services carried by each first service segment and all the second service segments contained in the second service group.
And judging whether the number of the regional networks included in the service segment bearing regional network group corresponding to any first service segment is larger than or equal to the preset number. And when the judgment result is yes, judging whether target second service segments which are intersected with the regional network included by the service segment bearing regional network group corresponding to the first service segment exist in all the second service segments.
If the target second service segment exists, updating the regional network of the service segment bearing regional network group corresponding to the first service segment and the regional network of the service segment bearing regional network group corresponding to the target second service segment into the intersection regional network of the first service segment and the target second service segment.
And if the target second service segment does not exist, uniformly distributing the service number borne by the first service segment to the regional network of the service segment bearing regional network group corresponding to the first service segment according to a load balancing algorithm and the service number borne by the first service segment.
For example, the service paths of the service group a in the associated service group 1 for completing the service bearer area network group are as follows: nanjing xx- { A area network/D area network } -Wuhanxx- { B area network- -Kunming xx. The service path of the service group B in the associated service group 1 for completing the grouping of the service bearing area network is as follows: set top box xx- { A regional network } -Jinan xx- { B regional network } -Changshaxx. The service section Nanjing xx-Wuhanxx of the service group A comprises an A area network and a D area network.
The method comprises the steps that if an area network which is intersected with an area network A which is included in a service section bearing area network group of a service section Nanjing xx-Wuhan xx of a service group A and an area network which is included in a service section bearing area network group of a service group B exist, the area network of the service section bearing area network group of the service section Nanjing xx-Wuhan xx of the service group A is updated to be an 'A area network', and at the moment, the determined service bearing area network group of the service group A is: nanjing xx- { A regional network } -Wuhan xx- { B regional network } -Kunming xx.
It can be seen that this optional embodiment can avoid the risk that the services in the service group a and the service group B associated with the service group a and the service group B are planned to the same link when the services in the service group a and the service group B are carried by different regional networks. The safety of network service bearing is effectively enhanced, and the maintenance of network service is easy.
As can be seen, implementing the service domain-division bearer planning method based on the multi-area optical network system as described in fig. 2 can automatically plan a to-be-processed service path, obtain the area attribute and the service cross-domain transit node of each link in the path, determine the area network group for bearing the service, provide a perfect service domain-division bearer planning method and flow, and can reduce the time delay in the service transmission process; planning reasonable service cross-domain transfer nodes, reducing relay configuration investment and improving bearing benefit; the method can determine the available link resources of the service group associated with the service group according to the link occupation of the service group, avoids the use of the same link and the links in the same risk link group by the associated service, and realizes efficient path planning of the associated service group; it is also possible to avoid the risk that traffic in multiple associated traffic groups may be planned onto the same link when carried by different regional networks.
Example III
Fig. 3 is a schematic structural diagram of a service domain-division bearer planning device based on a multi-area optical network system according to an embodiment of the present invention. As shown in fig. 3, the service domain bearing planning apparatus based on the multi-area optical network system may include an information acquisition module 301, a path planning module 302, an attribute acquisition module 303, a judgment module 304, and a determination module 305, where:
the information obtaining module 301 is configured to obtain basic information of each area network in the multi-area optical network system, and obtain service requirement information of a service to be processed, where the basic information includes node information and link information, and the service requirement information includes a service start node and a service end node of the service to be processed.
In the embodiment of the invention, the ROADM/OTN technology is adopted for network construction, the ROADM/OTN network covering a certain area is called an area network, and each area is constructed with one network to form a multi-area optical network system. An office station in an optical network system, where ROADM/OTN devices are configured, is called a node, and an optical cable route formed by combining one or more optical cables between two adjacent nodes is called a link. The end-to-end wavelength level circuits on ROADM/OTN networks are referred to as traffic, and when traffic is carried by multiple regional networks, it is necessary to select a node where the two regional networks intersect (or overlap) to use OTU back-to-back switching. The case where a city, node, link, service paragraph, etc. belongs to one or more regional ROADM/OTN networks is described by a regional attribute, e.g., a regional network covers guangzhou city and B regional network also covers guangzhou city, then the regional attribute of guangzhou city is "a regional network/B regional network".
In the embodiment of the invention, the basic information of each regional network in the regional optical network system comprises node information and link information. The service demand information comprises service starting nodes and service ending nodes of the service to be processed, wherein the service starting nodes and the service ending nodes can be identification information such as names and/or codes of the service starting nodes and the service ending nodes.
In the embodiment of the present invention, optionally, the manner in which the information obtaining module 301 obtains the basic information of each area network in the multi-area optical network system specifically includes:
acquiring node information of each area network in the multi-area optical network system, wherein the node information comprises: node identification (e.g., node name, node code, etc.), node region attribute; and merging nodes with the same node identification in all the node information.
Acquiring link information between two adjacent nodes in a regional network, wherein the link information comprises: link identification (such as link name, link code, etc.), link start identification (such as link start name, link start sequence number, etc.), link end identification (such as link end name, link end sequence number, etc.), link distance, group delay difference (DGD), optical signal to noise ratio (OSNR), equivalent span number, link region attribute; and merging links with the same link identification in all the link information.
The path planning module 302 is configured to determine a shortest service path of the service to be processed according to the shortest path algorithm, the basic information and the service requirement information.
In the embodiment of the invention, the shortest path algorithm can be a common shortest path algorithm in the field, such as Dijkstra algorithm, floyd algorithm and the like, and the invention is not limited to the method.
In the embodiment of the invention, the low-delay path of the service to be processed can be planned through the shortest path algorithm, which is beneficial to guaranteeing the transmission timeliness of the service.
And the attribute obtaining module 303 is configured to obtain an area attribute of each link in the shortest service path.
In the embodiment of the present invention, optionally, the area attribute of the link includes an area network to which the link belongs.
And the judging module 304 is configured to judge whether a service cross-domain transit node exists in the path nodes included in the shortest service path according to the area attribute of each link in the shortest service path.
In an embodiment of the present invention, optionally, the judging module 304 includes:
judging whether the number of the links of the predetermined target link set is equal to 2; the target link set comprises at least two sections of links;
when the number of links is equal to 2, judging whether an intersection area network exists in the area network to which the two links of the target link set belong; if the intersection area network does not exist, setting a path node between two sections of links of the target link set as a service cross-domain transit node; if the intersection area network exists, judging whether a path node between two sections of links of the target link set is a service cross-domain electrical relay node, if so, setting the path node between the two sections of links of the target link set as the service cross-domain switching node; if not, adding the next section of adjacent links of the target link set to update the target link set, and triggering and judging whether the number of links of the target link set is equal to 2 or not;
When the number of links is greater than 2, judging whether an intersection exists between an area network to which a last section of links of the target link set belongs and intersection area networks of the rest links of the target link set, wherein the rest links are all links except the last section of links in the target link set, and the area networks to which all links in the rest links belong exist;
when judging that the intersection of the regional network to which the last section of link belongs and the intersection regional network of the rest links does not exist, determining a starting node of the last section of link as a service cross-domain switching node, determining two sections of adjacent links taking the service cross-domain switching node as the starting node as new target link sets, and triggering and judging whether the number of links of the predetermined target link sets is equal to 2;
when judging that the intersection exists between the regional network to which the last section of link belongs and the intersection regional network of the rest links, judging whether the starting node of the last section of link is a business cross-domain electric relay node;
when judging that the initial node of the last section of link is a service cross-domain electric relay node, determining the initial node of the last section of link as a service cross-domain switching node, determining two sections of adjacent links taking the service cross-domain switching node as the initial node as a new target link set, and triggering and judging whether the number of links of the predetermined target link set is equal to 2;
And when judging that the starting node of the last section of link is not the business cross-domain electric relay node, adding the next section of adjacent link of the target link set to update the target link set, and triggering the step of judging whether the number of links of the predetermined target link set is equal to 2.
Therefore, in the alternative embodiment, all the service cross-domain transit nodes in the shortest service path are obtained through the link region attribute, the butt joint nodes carried by the service sub-domains are reasonably configured, and the links as long as possible are placed in the same regional network, so that the configuration of intermediate nodes in the service transmission process can be reduced, and the domain switching times of the service are reduced.
In an embodiment of the present invention, as shown in fig. 4, the apparatus further includes a setting module 300, where the setting module 300 is configured to:
before the judging module judges whether a path node included in the shortest service path exists a service cross-domain transit node according to the regional attribute of each link in the shortest service path, a first accumulated value of optical signal to noise ratio (OSNR) values of the first two links taking a target node as a starting point and a second accumulated value of group delay difference (DGD) values of the first two links are calculated. The initial target node is a service initiation node.
And judging whether the first accumulated value meets a preset target optical signal to noise ratio tolerance and whether the second accumulated value meets a preset target group delay difference tolerance.
And when any one of the two links is not satisfied, setting the intermediate node of the two links as a business electric relay node. And searching whether an area network overlapping node closest to the service electric relay node exists along the reverse direction of the service direction of the shortest service path by taking the service electric relay node as a starting point. When the area network overlapped node exists, setting the area network overlapped node as a service cross-domain electric relay node, determining the service cross-domain electric relay node as a new target node, executing the operation of calculating a first accumulated value of optical signal to noise ratio (OSNR) values of the first two links taking the target node as a starting point and a second accumulated value of group delay difference (DGD) values of the first two links, and judging whether the first accumulated value meets a preset target optical signal to noise ratio tolerance and whether the second accumulated value meets a preset target group delay tolerance. When there is no area network overlapping node, the service electric relay node is determined as a new target node, and the operations of calculating a first accumulated value of optical signal to noise ratio (OSNR) values of the first two links starting from the target node and a second accumulated value of group delay difference (DGD) values of the first two links, and judging whether the first accumulated value meets a preset target OSNR tolerance and whether the second accumulated value meets a preset target group delay difference tolerance are performed.
When the first accumulated value and the second accumulated value meet the tolerance requirement, determining a termination computing node corresponding to the target node. The initial termination computing node is a link termination node of the third segment link.
And calculating the accumulated value of the optical signal to noise ratio values of all links from the target node to the termination computing node to obtain a third accumulated value, and calculating the accumulated value of the group delay difference values of all links from the target node to the termination computing node to obtain a fourth accumulated value.
And determining that the next adjacent node of the termination computing node is a new termination computing node, executing the above-mentioned operation of calculating the cumulative value of the optical signal to noise ratio values of all links from the target node to the termination computing node to obtain a third cumulative value and calculating the cumulative value of the group delay difference values of all links from the target node to the termination computing node to obtain a fourth cumulative value, and determining whether the third cumulative value meets the target optical signal to noise ratio tolerance and whether the fourth cumulative value meets the target group delay difference tolerance. And when any one of the service paths is not satisfied, setting the previous adjacent node of the termination computing node as a service electric relay node, and executing the operation of searching whether the area network overlapped node closest to the service electric relay node exists along the reverse direction of the service direction of the shortest service path by taking the service electric relay node as a starting point.
Therefore, in the alternative embodiment, the maximum transmission distance of the single electric relay section meeting the transmission requirement of the link is found out through the accumulated value of the optical signal to noise ratio value and the accumulated value of the group delay difference value of the link, and the service cross-domain electric relay node is determined, so that the configuration of the electric relay node is reduced in the process of service cross-domain transmission, and the optimization of investment benefit is realized.
The determining module 305 is configured to determine, if the determining module 304 determines that the path node included in the shortest service path includes a service cross-domain transit node, a service bearer area network group of the service to be processed according to the area attribute of each link and the service cross-domain transit node.
In the embodiment of the present invention, optionally, the determining module 305 determines, according to the area attribute of each link and the service cross-domain transit node, a service carrying area network group of the service to be processed specifically includes:
and extracting a service starting node, all service cross-domain transit nodes and service termination nodes contained in the shortest service path of the service to be processed to form a first node set.
The service to be processed is divided into a plurality of service segments according to the first node set, and the service segments are formed by one or more segments of links between two adjacent nodes in the first node set.
For each service segment of the service to be processed, acquiring an intersection area network of an area network to which each segment link in the service segment belongs, determining the intersection area network as an area attribute of the service segment, and storing the intersection area network into a service segment bearing area network group corresponding to the service segment.
And connecting the service segment bearing area network groups corresponding to all the service segments of the service to be processed in series to obtain the service bearing area network group of the service to be processed.
Therefore, the embodiment of the invention can automatically plan the to-be-processed service path by improving the service domain-division bearing planning method based on the multi-area optical network system, acquire the area attribute and the service cross-domain switching node of each section of link in the path, determine the area network group bearing the service, provide a perfect service domain-division bearing planning method and flow, and reduce the time delay in the service transmission process; and reasonable service cross-domain switching nodes are planned, relay configuration investment is reduced, and bearing benefits are improved.
In this embodiment of the present invention, optionally, the determining module 305 is further configured to determine, if the determining module determines that the path node included in the shortest service path does not include a service cross-domain transit node, a service bearer area network group of the service to be processed according to the area attribute of each link.
In this embodiment of the present invention, further optionally, the determining module 305 determines, according to the area attribute of each link, a service carrying area network group of the service to be processed specifically includes:
and extracting a service starting node and a service ending node contained in the shortest service path of the service to be processed to form a second node set.
And determining the service to be processed as a service segment according to the second node set, wherein the service segment is formed by one or more segments of links between the service starting node and the service ending node.
And for the service segment of the service to be processed, acquiring an intersection area network of an area network to which each segment link in the service segment belongs, taking the intersection area network as the area attribute of the service segment, and storing the intersection area network into a service segment bearing area network group corresponding to the service segment as a service bearing area network group of the service to be processed.
In an embodiment of the present invention, optionally, as shown in fig. 4, the apparatus further includes a first allocation module 306, where the first allocation module 306 is configured to: after the determining module 305 determines the service carrying area network group of the service to be processed, for any service segment in the service to be processed, determining whether the number of area networks included in the service segment carrying area network group corresponding to the service segment is greater than or equal to a preset number; and when the judgment result is yes, distributing the service segment to one of the regional networks according to a load balancing algorithm.
Therefore, the optional embodiment of the invention distributes the service segments to the regional networks through the load balancing algorithm, can balance the service bearing quantity of each regional network, is beneficial to the balance development of each regional network, and improves the service bearing benefit.
In an alternative embodiment, the service to be processed is an associated service group, the associated service group includes a first service group and a second service group, the first service group includes at least one service, the second service group includes at least one service, and any service in the first service group and any service in the second service group are associated services. The plurality of services in the same service group have the same service initiation node and service termination node, and the service initiation node and/or service termination node of the plurality of service groups in the same associated service group are generally different. The related service group 1 comprises a service group A and a service group B, wherein a service starting node of the service group A is Nanjing xx, and a service ending node is Kunming xx; the service starting node of the service group B is a combined fertilizer xx, and the service ending node is a long sand xx. One service in the associated service group may be expressed as: (202 x years) associated service group 1-a group-1.
In this embodiment of the present invention, further optionally, the information obtaining module 301 is further configured to obtain shared risk link group (SLRG) information, where the shared risk link group information includes multiple pieces of link information using the same optical cable or using the same-channel and same-channel optical cables. Two services that are associated with each other do not allow the use of the same link and links within the same shared risk link group (SLRG).
In the embodiment of the present invention, optionally, the method for determining the shortest service path of the service to be processed by the path planning module 302 according to the shortest path algorithm, the basic information and the service requirement information specifically includes:
and calculating a first shortest path of the first service group according to the shortest path algorithm, the basic information and the service demand information of the first service group.
And determining risk links corresponding to all links of the first shortest path according to the shared risk link group information.
All links of the first shortest path and risk links corresponding to all links of the first shortest path are disconnected.
And calculating a second shortest path of the second service group according to the shortest path algorithm, the basic information, the service demand information of the second service group and the unbroken link.
Therefore, in the alternative embodiment, the available link resources of the service group associated with the link occupation of the service group are determined according to the link occupation of the service group, so that the use of the same link and the links in the same risk link group by the associated service is avoided, and efficient path planning of the associated service group is realized.
In an embodiment of the present invention, optionally, the apparatus further includes a second allocation module, where the second allocation module is configured to:
And determining all the first service segments contained in the first service group, the number of services carried by each first service segment and all the second service segments contained in the second service group.
And judging whether the number of the regional networks included in the service segment bearing regional network group corresponding to any first service segment is larger than or equal to the preset number. And when the judgment result is yes, judging whether target second service segments which are intersected with the regional network included by the service segment bearing regional network group corresponding to the first service segment exist in all the second service segments.
If the target second service segment exists, updating the regional network of the service segment bearing regional network group corresponding to the first service segment and the regional network of the service segment bearing regional network group corresponding to the target second service segment into the intersection regional network of the first service segment and the target second service segment.
And if the target second service segment does not exist, uniformly distributing the service number borne by the first service segment to the regional network of the service segment bearing regional network group corresponding to the first service segment according to a load balancing algorithm and the service number borne by the first service segment.
It can be seen that this optional embodiment can avoid the risk that the services in the service group a and the service group B associated with the service group a and the service group B are planned to the same link when the services in the service group a and the service group B are carried by different regional networks. The safety of network service bearing is effectively enhanced, and the maintenance of network service is easy.
As can be seen, implementing the service domain-division bearer planning device based on the multi-area optical network system as described in fig. 3 can automatically plan a to-be-processed service path, obtain the area attribute and the service cross-domain transit node of each link in the path, determine the area network group for bearing the service, provide a perfect service domain-division bearer planning flow, and reduce the time delay in the service transmission process; planning reasonable service cross-domain transfer nodes, reducing relay configuration investment and improving bearing benefit; the method can determine the available link resources of the service group associated with the service group according to the link occupation of the service group, avoids the use of the same link and the links in the same risk link group by the associated service, and realizes efficient path planning of the associated service group; it is also possible to avoid the risk that traffic in multiple associated traffic groups may be planned onto the same link when carried by different regional networks.
Example IV
Referring to fig. 5, fig. 5 is a schematic diagram of another service domain-division bearer planning apparatus based on a multi-area optical network system according to an embodiment of the present invention. As shown in fig. 5, the service domain bearing planning device based on the multi-area optical network system may include:
A memory 401 storing executable program codes;
a processor 402 coupled with the memory 401;
the processor 402 invokes executable program codes stored in the memory 401 to perform some or all of the steps in the service split domain bearer planning method based on the multi-area optical network system described in the first embodiment or the second embodiment.
Example five
The embodiment of the invention discloses a computer readable storage medium storing a computer program for electronic data exchange, wherein the computer program causes a computer to execute part or all of the steps in the service domain bearing planning method based on the multi-area optical network system described in the first embodiment or the second embodiment.
The apparatus embodiments described above are merely illustrative, in which the modules illustrated as separate components may or may not be physically separate, and the components shown as modules may or may not be physical, i.e., may be located in one place, or may be distributed over multiple network modules. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
From the above detailed description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course by means of hardware. Based on such understanding, the foregoing technical solutions may be embodied essentially or in part in the form of a software product that may be stored in a computer-readable storage medium including Read-Only Memory (ROM), random-access Memory (Random Access Memory, RAM), programmable Read-Only Memory (Programmable Read-Only Memory, PROM), erasable programmable Read-Only Memory (Erasable Programmable Read Only Memory, EPROM), one-time programmable Read-Only Memory (OTPROM), electrically erasable programmable Read-Only Memory (EEPROM), compact disc Read-Only Memory (Compact Disc Read-Only Memory, CD-ROM) or other optical disc Memory, magnetic disc Memory, tape Memory, or any other medium that can be used for computer-readable carrying or storing data.
Finally, it should be noted that: the embodiment of the invention discloses a business domain bearing planning method and a business domain bearing planning device based on a multi-area optical network system, which are disclosed by the embodiment of the invention only for illustrating the technical scheme of the invention, but not limiting the technical scheme; although the invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art will understand that; the technical scheme recorded in the various embodiments can be modified or part of technical features in the technical scheme can be replaced equivalently; such modifications and substitutions do not depart from the spirit and scope of the corresponding technical solutions.

Claims (10)

1. The service domain bearing planning method based on the multi-area optical network system is characterized by comprising the following steps:
acquiring basic information of each area network in the multi-area optical network system, and acquiring service demand information of a service to be processed, wherein the basic information comprises node information and link information, and the service demand information comprises a service starting node and a service terminating node of the service to be processed;
determining the shortest service path of the service to be processed according to a shortest path algorithm, the basic information and the service demand information;
Acquiring the regional attribute of each section of link in the shortest service path;
judging whether a service cross-domain transit node exists in path nodes included in the shortest service path according to the regional attribute of each link in the shortest service path;
if the service cross-domain transit node exists in the path node included in the shortest service path, determining a service bearing area network group of the service to be processed according to the area attribute of each section of the link and the service cross-domain transit node;
and if the fact that the service cross-domain transit node does not exist in the path nodes included in the shortest service path is judged, determining a service bearing area network group of the service to be processed according to the area attribute of each section of the link.
2. The method for planning service regional bearing based on the multi-regional optical network system according to claim 1, wherein the obtaining basic information of each regional network in the multi-regional optical network system comprises:
acquiring node information of each area network in the multi-area optical network system, wherein the node information comprises: node identification, node region attribute; merging nodes with the same node identification in all the node information;
Acquiring link information between two adjacent nodes in the area network, wherein the link information comprises: link identification, link starting point identification, link end point identification, link distance, group delay difference, optical signal to noise ratio value, equivalent span number and link region attribute; and merging links with the same link identification in all the link information.
3. The method for planning traffic split domain bearing based on multi-area optical network system according to claim 1, wherein the area attribute of the link includes an area network to which the link belongs;
judging whether a service cross-domain transit node exists in a path node included in the shortest service path according to the regional attribute of each link in the shortest service path, including:
judging whether the number of the links of the predetermined target link set is equal to 2; wherein the target link set comprises at least two links;
when the number of the links is equal to 2, judging whether an intersection area network exists in the area network to which the two links of the target link set belong; if the intersection area network does not exist, setting a path node between two sections of links of the target link set as a service cross-domain transit node; if the intersection area network exists, judging whether a path node between two links of the target link set is a service cross-domain electrical relay node, if so, setting the path node between the two links of the target link set as the service cross-domain switching node; if not, adding the next section of adjacent links of the target link set to update the target link set, and triggering the step of judging whether the number of links of the target link set is equal to 2 or not;
When the number of links is greater than 2, judging whether an intersection exists between an area network to which a last link of the target link set belongs and an intersection area network of the rest links of the target link set, wherein the rest links are all links except the last link of the target link set, and the area network to which all links of the rest links belong has the intersection area network;
when judging that the intersection of the regional network to which the last section of link belongs and the intersection regional network of the rest links does not exist, determining a starting node of the last section of link as a service cross-domain transit node, determining two sections of adjacent links taking the service cross-domain transit node as the starting node as new target link sets, and triggering the step of judging whether the number of links of the target link sets determined in advance is equal to 2;
when judging that the intersection exists between the regional network to which the last section of link belongs and the intersection regional network of the rest links, judging whether the starting node of the last section of link is a business cross-domain electric relay node;
when the starting node of the last section of link is judged to be a service cross-domain electric relay node, determining the starting node of the last section of link as a service cross-domain switching node, determining two sections of adjacent links taking the service cross-domain switching node as the starting node as new target link sets, and triggering the step of judging whether the number of links of the target link sets determined in advance is equal to 2;
And when the starting node of the last section of link is not a business cross-domain electric relay node, adding the next section of adjacent link of the target link set to update the target link set, and triggering the step of judging whether the number of links of the predetermined target link set is equal to 2.
4. The method for planning service domain division bearer based on a multi-area optical network system according to claim 3, wherein before determining whether a path node included in the shortest service path has a service cross-domain transit node according to an area attribute of each link in the shortest service path, the method further comprises:
calculating a first accumulated value of optical signal-to-noise ratio values of the first two sections of links taking a target node as a starting point and a second accumulated value of group delay difference values of the first two sections of links, and judging whether the first accumulated value meets a preset target optical signal-to-noise ratio tolerance and whether the second accumulated value meets a preset target group delay difference tolerance;
when any one of the two links is not satisfied, setting the intermediate node of the two links as a service electricity relay node; using the service electric relay node as a starting point, and searching whether an area network overlapping node closest to the service electric relay node exists along the reverse direction of the service direction of the shortest service path;
When the area network overlapped node exists, setting the area network overlapped node as a service cross-domain electric relay node, determining the service cross-domain electric relay node as a new target node, executing the steps of calculating a first accumulated value of optical signal to noise ratio values of the first two sections of links taking the target node as a starting point and a second accumulated value of group delay differences of the first two sections of links, and judging whether the first accumulated value meets a preset target optical signal to noise ratio tolerance and whether the second accumulated value meets a preset target group delay difference tolerance;
when there is no overlapping node in the area network, determining the service electric relay node as a new target node, and executing the steps of calculating a first accumulated value of optical signal to noise ratio values of the first two links taking the target node as a starting point and a second accumulated value of group delay differences of the first two links, and judging whether the first accumulated value meets a preset target optical signal to noise ratio tolerance and whether the second accumulated value meets a preset target group delay difference tolerance;
when the first accumulated value meets the target optical signal to noise ratio tolerance and the second accumulated value meets the target group delay difference tolerance, determining a termination computing node corresponding to the target node, calculating accumulated values of optical signal to noise ratio values of all links from the target node to the termination computing node to obtain a third accumulated value, and calculating accumulated values of group delay difference values of all links from the target node to the termination computing node to obtain a fourth accumulated value; judging whether the third accumulated value meets the target optical signal to noise ratio tolerance or not and whether the fourth accumulated value meets the target group delay tolerance or not; when the optical signal to noise ratio values of all links from the target node to the termination computing node are all met, determining the next adjacent node of the termination computing node as a new termination computing node, triggering and executing the termination computing node corresponding to the target node, calculating the accumulated value of the optical signal to noise ratio values of all links from the target node to the termination computing node to obtain a third accumulated value, and calculating the accumulated value of the group delay difference values of all links from the target node to the termination computing node to obtain a fourth accumulated value; judging whether the third accumulated value meets the target optical signal to noise ratio tolerance or not and whether the fourth accumulated value meets the target group delay tolerance or not; and when any one of the service paths is not satisfied, setting the previous adjacent node of the termination computing node as a service electric relay node, and executing the step of reversely searching whether an area network overlapped node closest to the service electric relay node exists along the service direction of the shortest service path by taking the service electric relay node as a starting point.
5. The service domain-division bearer plan method based on the multi-area optical network system according to claim 1, wherein the area attribute of the link includes an area network to which the link belongs;
the determining the service carrying area network group of the service to be processed according to the area attribute of each section of the link and the service cross-domain transit node specifically comprises the following steps:
extracting the service starting node, all the service cross-domain transit nodes and the service terminating nodes contained in the shortest service path of the service to be processed to form a first node set;
dividing the service to be processed into a plurality of service segments according to the first node set, wherein the service segments are formed by one or more segments of links between two adjacent nodes in the first node set;
for each service segment of the service to be processed, acquiring an intersection area network of an area network to which each segment of links in the service segment belong, determining the intersection area network as an area attribute of the service segment, and storing the intersection area network into a service segment bearing area network group corresponding to the service segment;
and connecting the service segment bearing area network groups corresponding to all the service segments of the service to be processed in series to obtain the service bearing area network group of the service to be processed.
6. The method for planning service domain division bearer based on the multi-area optical network system according to claim 1, wherein the area attribute of the link includes an area network to which the link belongs, and the determining the service bearer area network group of the service to be processed according to the area attribute of each segment of the link includes:
extracting the service starting node and the service ending node contained in the shortest service path of the service to be processed to form a second node set;
determining the service to be processed as a service segment according to the second node set, wherein the service segment is formed by one or more links between the service starting node and the service ending node;
and for the service segment of the service to be processed, acquiring an intersection area network of an area network to which each segment of links in the service segment belong, taking the intersection area network as the area attribute of the service segment, and storing the intersection area network into a service segment bearing area network group corresponding to the service segment as a service bearing area network group of the service to be processed.
7. The method for planning service domain division bearer based on a multi-area optical network system according to claim 5 or 6, wherein after determining the service bearer area network group of the service to be processed, the method further comprises:
Judging whether the number of regional networks included in a service segment bearing regional network group corresponding to the service segment is greater than or equal to a preset number for any service segment in the service to be processed;
and when the judgment result is yes, distributing the service segment to one of the regional networks according to a load balancing algorithm.
8. The service domain-division bearer planning method based on the multi-area optical network system according to claim 5 or 6, wherein the service to be processed is an associated service group, the associated service group comprises a first service group and a second service group, the first service group comprises at least one service, the second service group comprises at least one service, and any service in the first service group and any service in the second service group are associated services;
the method further comprises the steps of:
acquiring shared risk link group information, wherein the shared risk link group information comprises multi-section link information of the same optical cable or the same-ditch and same-pipeline optical cables;
and determining a shortest service path of the service to be processed according to a shortest path algorithm, the basic information and the service requirement information, wherein the determining comprises the following steps:
Calculating a first shortest path of the first service group according to a shortest path algorithm, the basic information and the service demand information of the first service group;
determining risk links corresponding to all links of the first shortest path according to the shared risk link group information;
disconnecting all links of the first shortest path and risk links corresponding to all links of the first shortest path;
and calculating a second shortest path of the second service group according to a shortest path algorithm, the basic information, the service demand information of the second service group and the unbroken link.
9. The method for traffic domain-division bearer planning based on a multi-area optical network system according to claim 8, further comprising:
determining all first service segments contained in the first service group, the number of services borne by each first service segment, and all second service segments contained in the second service group;
judging whether the number of regional networks included in a service segment bearing regional network group corresponding to any one of the first service segments is greater than or equal to a preset number; when the judging result is yes, judging whether target second service segments which are intersected with the regional network included by the service segment bearing regional network group corresponding to the first service segment exist in all the second service segments; if the target second service segment exists, updating the area network of the service segment bearing area network group corresponding to the first service segment and the area network of the service segment bearing area network group corresponding to the target second service segment into an intersecting area network of the first service segment and the target second service segment; and if the target second service segment does not exist, uniformly distributing the service number borne by the first service segment to the regional network of the service segment bearing regional network group corresponding to the first service segment according to a load balancing algorithm and the service number borne by the first service segment.
10. A service domain-division bearer planning device based on a multi-area optical network system, the device comprising:
the information acquisition module is used for acquiring basic information of each area network in the multi-area optical network system and acquiring service demand information of a service to be processed, wherein the basic information comprises node information and link information, and the service demand information comprises a service starting node and a service terminating node of the service to be processed;
the path planning module is used for determining the shortest service path of the service to be processed according to a shortest path algorithm, the basic information and the service demand information;
the attribute acquisition module is used for acquiring the regional attribute of each section of link in the shortest service path;
the judging module is used for judging whether a service cross-domain transit node exists in the path nodes included in the shortest service path according to the regional attribute of each link in the shortest service path;
the determining module is configured to determine, if the judging module judges that the service cross-domain transit node exists in the path node included in the shortest service path, a service bearer area network group of the service to be processed according to the area attribute of each link and the service cross-domain transit node;
The determining module is further configured to determine, if the judging module judges that the path node included in the shortest service path does not include the service cross-domain transit node, a service carrying area network group of the service to be processed according to an area attribute of each link.
CN202110971975.9A 2021-08-24 2021-08-24 Service domain bearing planning method and device based on multi-area optical network system Active CN114124794B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110971975.9A CN114124794B (en) 2021-08-24 2021-08-24 Service domain bearing planning method and device based on multi-area optical network system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110971975.9A CN114124794B (en) 2021-08-24 2021-08-24 Service domain bearing planning method and device based on multi-area optical network system

Publications (2)

Publication Number Publication Date
CN114124794A CN114124794A (en) 2022-03-01
CN114124794B true CN114124794B (en) 2023-12-26

Family

ID=80440952

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110971975.9A Active CN114124794B (en) 2021-08-24 2021-08-24 Service domain bearing planning method and device based on multi-area optical network system

Country Status (1)

Country Link
CN (1) CN114124794B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115086807B (en) * 2022-04-26 2024-04-30 广东省电信规划设计院有限公司 All-optical network service recovery method and device based on WSON
CN115022230B (en) * 2022-05-31 2023-11-24 中国人民解放军国防科技大学 Communication path planning method and device

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018099290A1 (en) * 2016-12-01 2018-06-07 华为技术有限公司 Message transmission method and apparatus
CN108513333A (en) * 2018-02-12 2018-09-07 广州盛之焰信息科技有限公司 A kind of communication means of multi-hop ad hoc network network
CN109257091A (en) * 2018-09-18 2019-01-22 北京邮电大学 Global load balancing star ground contract network network device and method
CN110446122A (en) * 2019-05-31 2019-11-12 广东电网有限责任公司 A kind of cross-domain collaboration resource allocation methods of fiber radio integration network
WO2019218649A1 (en) * 2018-05-16 2019-11-21 南京中兴新软件有限责任公司 Method and device for acquiring route of software-defined network and storage medium
CN110995590A (en) * 2019-10-22 2020-04-10 中国电子科技集团公司第七研究所 Efficient routing method under distributed domain network
CN111750862A (en) * 2020-06-11 2020-10-09 深圳优地科技有限公司 Multi-region-based robot path planning method, robot and terminal equipment

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018099290A1 (en) * 2016-12-01 2018-06-07 华为技术有限公司 Message transmission method and apparatus
CN108513333A (en) * 2018-02-12 2018-09-07 广州盛之焰信息科技有限公司 A kind of communication means of multi-hop ad hoc network network
WO2019218649A1 (en) * 2018-05-16 2019-11-21 南京中兴新软件有限责任公司 Method and device for acquiring route of software-defined network and storage medium
CN109257091A (en) * 2018-09-18 2019-01-22 北京邮电大学 Global load balancing star ground contract network network device and method
CN110446122A (en) * 2019-05-31 2019-11-12 广东电网有限责任公司 A kind of cross-domain collaboration resource allocation methods of fiber radio integration network
CN110995590A (en) * 2019-10-22 2020-04-10 中国电子科技集团公司第七研究所 Efficient routing method under distributed domain network
CN111750862A (en) * 2020-06-11 2020-10-09 深圳优地科技有限公司 Multi-region-based robot path planning method, robot and terminal equipment

Also Published As

Publication number Publication date
CN114124794A (en) 2022-03-01

Similar Documents

Publication Publication Date Title
CN114124794B (en) Service domain bearing planning method and device based on multi-area optical network system
CN111092749B (en) Region grid division method and device for full service
US6374202B1 (en) Processing data signals
CN104579965B (en) Support two layers of path calculation method of photoelectricity and system of a variety of constraints policies
CN110996196B (en) Optimal route optimizing method for optical transmission network optical path fiber core utilization
CN109429117B (en) Routing method and device
JPH11331925A (en) Operating method for radio electric communication system
CN105007220A (en) Inter-domain route management system, inter-domain route management method, domain adapters and transmission network
IL133083A0 (en) Method and system for management of network domains
CN104348691A (en) Fiber link scheduling method, equipment and system
CN113225259B (en) Communication network route planning method
CN108649578B (en) Method and device for adjusting grid structure and optimizing networking mode of high and medium voltage urban network
Straub et al. Multi-period planning of WDM-networks: Comparison of incremental and EoL approaches
CN109842522B (en) Method and system for configuring communication routing resources
Shahid et al. Comparative analysis of protection schemes for fixed mobile converged access networks based on hybrid PON
CA2001665C (en) Real-time network routing
CN113922916B (en) ROADM all-optical network planning method and device based on WSON function
CN107612725B (en) Planning method for power distribution communication access network
CN108174446A (en) The network node link circuit resource combined distributing method that a kind of resource occupation degree minimizes
CN102625196B (en) Optimal routing computing method for variable bandwidth optical network
CN107294853B (en) Power communication network path optimization method
Agata et al. A design algorithm for ring topology centralized-radio-access-network
CN114245245B (en) Power service channel resource allocation method and device based on multilink failure
CN110572324B (en) Link recommendation method based on meteor trail communication network
CN112580177A (en) Power distribution wiring method, system, equipment and storage medium

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