Optical network slicing scheduling method, scheduling device, network management system and storage medium

Abstract

The present disclosure provides an optical network splicing scheduling method, a scheduling device, a network management system and a storage medium, and relates to the technical field of communication. The optical network splicing scheduling method comprises the following steps: configuring splicing task parameters based on collected optical network splicing information to be scheduled; calling splicing rules in a splicing rule library based on the splicing task parameters; scheduling splicing tasks for optical network nodes based on the splicing rules to obtain a pre-scheduling scheme; detecting whether the pre-scheduling scheme has scheduling resource conflicts, and iteratively optimizing the pre-scheduling scheme until a target scheduling scheme is obtained. Through the technical scheme of the present disclosure, the workload of the splicing administrator is reduced, and the daily splicing is ensured to be conflict-free, thereby improving the work efficiency, saving human resources, and improving the intelligent level of the optical network.

Description

TECHNICAL FIELD

[0001] The present disclosure relates to the field of communication technology, and in particular, to an optical network cutting scheduling method, an optical network cutting scheduling device, a network management system and a computer readable storage medium. BACKGROUND

[0002] With the development of optical networks in the direction of super large networking, super long distance, super large capacity and intelligentization, a large number of optical network cutting tasks are generated accordingly. Optical network cutting refers to adjusting the line or device of the running optical network, and unreasonable cutting task scheduling may cause the optical network to be paralyzed. The current method of relying on the experience of cutting administrators to manually schedule and then calling a system conflict judgment algorithm to verify the result is time-consuming and inefficient.

[0003] It should be noted that the information disclosed in the above background section is only used to strengthen the understanding of the background of the present disclosure, and therefore can include information that does not constitute prior art known to those of ordinary skill in the art. SUMMARY

[0004] The purpose of the present disclosure is to provide an optical network cutting scheduling method, device, network management system and storage medium, which at least partially overcomes the problem of low efficiency caused by relying on the experience of cutting administrators to manually schedule in the related art.

[0005] Other characteristics and advantages of the present disclosure will become apparent from the following detailed description, or will be learned by practice of the present disclosure.

[0006] According to one aspect of the present disclosure, an optical network cutting scheduling method is provided, comprising: configuring cutting task parameters based on collected optical network cutting information to be scheduled; calling cutting rules in a cutting rule library based on the cutting task parameters; scheduling cutting tasks for optical network nodes based on the cutting rules to obtain a pre-scheduling scheme; detecting that the pre-scheduling scheme has scheduling resource conflicts, and iteratively optimizing the pre-scheduling scheme until a target scheduling scheme is obtained, to publish a cutting operation based on the target scheduling scheme.

[0007] In one embodiment, the configuration of cutting task parameters based on the collected optical network cutting information to be scheduled comprises: configuring at least one of the cutting type, cutting area, cutting risk level, scheduling days and maximum iteration number of the iterative optimization of the optical network cutting based on the optical network cutting information.

[0008] In an embodiment, the calling the switching rule in the switching rule library based on the switching task parameter comprises: calling the matched expert rule and network topology rule from the switching rule library based on the switching area, the risk level, the switching type, the scheduling days and the maximum iteration number; and generating the switching rule based on the expert rule and the network topology rule.

[0009] In an embodiment, the scheduling the switching task for the optical network node based on the switching rule comprises: generating a multi-layer switching topology graph of the switching task based on the network topology rule and the optical network node; and connecting the inter-layer task and the intra-layer task in the multi-layer switching topology graph based on the expert rule and the full connection condition to schedule the switching task.

[0010] In an embodiment, the generating the multi-layer switching topology graph of the switching task based on the network topology rule and the optical network node comprises: generating a corresponding time task node based on the scheduling days to construct a top layer topology; generating at least one layer of type task nodes of a lower layer topology based on the optical network node and the corresponding switching type; sorting the at least one layer of type task nodes of the lower layer topology based on the switching risk level; and obtaining the multi-layer switching topology graph based on the top layer topology and the sorted at least one layer of lower layer topology.

[0011] In an embodiment, the connecting the inter-layer task and the intra-layer task in the multi-layer switching topology graph based on the expert rule and the full connection condition comprises: for each sorted time task node, determining the type task nodes having the upper and lower layer connection relationship and the type task nodes having the same layer connection relationship in the corresponding lower layer topology based on the full connection condition; determining the unit time switching task control amount, the switching region dispersion principle and the regional switching risk control amount based on the expert rule; and connecting the inter-layer task and the intra-layer task based on the upper and lower layer connection relationship and the same layer connection relationship by taking the unit time switching task control amount, the switching region dispersion principle and the regional switching risk control amount as the restriction condition.

[0012] In an embodiment, the scheduling the switching task for the optical network node based on the switching rule to obtain a pre-scheduling scheme comprises: in the process of scheduling the switching task, if it is detected that there is a task node conflict, processing the node conflict based on a task conflict processing rule to obtain the pre-scheduling scheme.

[0013] In one embodiment, if it is detected that there is a task node conflict, the node conflict is handled based on a task conflict handling rule, including: in a cut task scheduling process, for each of the sorted time task nodes, if it is detected that there is a routing conflict and / or a regional conflict, it is determined that there is a task node conflict; if there is a conflict between the time task nodes of the top topology and the type task nodes of the lower topology, the conflicting type task nodes are adjusted; if there is a conflict between the type task nodes of the same layer, the type task nodes with low risk levels are preferentially adjusted; if there is a conflict between the type task nodes of the next layer and the type task nodes of the previous layer or the time task nodes, the type task nodes of the next layer are preferentially adjusted.

[0014] In one embodiment, if it is detected that there is a task node conflict, the node conflict is handled based on a task conflict handling rule, including: in a cut task scheduling process, for each of the sorted time task nodes, if it is detected that there is a routing conflict and / or a regional conflict, it is determined that there is a task node conflict; if there is a conflict between the time task nodes of the top topology and the type task nodes of the lower topology, the conflicting type task nodes are adjusted; if there is a conflict between the type task nodes of the same layer, the type task nodes with low risk levels are preferentially adjusted; if there is a conflict between the type task nodes of the next layer and the type task nodes of the previous layer or the time task nodes, the type task nodes of the next layer are preferentially adjusted.

[0015] In one embodiment, the inter-layer tasks and intra-layer tasks in the multi-layer cut topology graph are connected based on the expert rules and full connection conditions to perform the cut task scheduling, and further including: after completing the connection operation of the inter-layer tasks and intra-layer tasks in the lower topology corresponding to one time task node, the connected time task nodes and type task nodes are deleted from the multi-layer cut topology graph, and a new multi-layer cut topology graph is formed.

[0016] In one embodiment, further including: based on the identification and analysis results of the scheduling resource conflicts, an optimization rule is generated; based on a self-learning mechanism, the optimization rule is added to the cut rule library to optimize the cut rules based on the optimization rule.

[0017] In one embodiment, the detecting that the pre-scheduling scheme has a scheduling resource conflict, iteratively optimizing the pre-scheduling scheme based on the long-distance resource library until a target scheduling scheme is obtained, further includes: if there is still a task conflict after iteratively optimizing the pre-scheduling scheme based on the long-distance resource library in the cut-over task scheduling of the last day of the scheduling days, generating a cut-over left task.

[0018] According to another aspect of the present disclosure, there is provided an optical network cut-over scheduling apparatus, comprising: a configuration module configured to configure a cut-over task parameter based on collected optical network cut-over information to be scheduled; a calling module configured to call a cut-over rule in a cut-over rule library based on the cut-over task parameter; a processing module configured to schedule a cut-over task for an optical network node based on the cut-over rule to obtain a pre-scheduling scheme; and an optimization module configured to detect that the pre-scheduling scheme has a scheduling resource conflict, iteratively optimize the pre-scheduling scheme until a target scheduling scheme is obtained, and issue a cut-over operation based on the target scheduling scheme.

[0019] According to still another aspect of the present disclosure, there is provided a network management system, comprising: a processor; and a memory storing executable instructions of the processor; the processor being configured to execute the optical network cut-over scheduling method of the first aspect described above via execution of the executable instructions.

[0020] According to yet another aspect of the present disclosure, there is provided a computer readable storage medium having stored thereon a computer program, the computer program being executed by a processor to implement the optical network cut-over scheduling method described above.

[0021] The optical network cut-over scheduling scheme provided by the embodiments of the present disclosure, when the optical network cut-over information to be scheduled is obtained, corresponding cut-over task parameters are configured, and further matching cut-over rules are extracted from the cut-over rule library based on the cut-over task parameters, so as to schedule a cut-over task for an optical network node composed of cable nodes and device nodes based on the cut-over rules and the cut-over information, realize scheduling of the cut-over task, and in the scheduling process, based on the scheduling processing based on the cut-over rules, further based on the detection operation of the scheduling resource conflict, automatic analysis and scheduling optimization of the pre-scheduling scheme are performed, the target scheduling scheme is automatically generated, the cut-over administrator only needs to submit the target scheduling scheme to the system and then perform review and verification, the automatic generation of the optical network scheduling task is realized, the work load of the cut-over administrator is reduced, the daily cut-over is facilitated to be conflict-free, the work efficiency is improved, the human resources are saved, and the intelligent level of the optical network is improved.

[0022] It should be understood that the foregoing general description and the following detailed description are only exemplary and explanatory, and cannot limit the present disclosure. BRIEF DESCRIPTION OF DRAWINGS

[0023] The accompanying drawings, which are incorporated herein and form a part of the specification, illustrate embodiments consistent with the present disclosure and, together with the description, further serve to explain the principles of the disclosure. It is to be expressly understood, however, that the drawings are included merely for purposes of illustration and description and are not intended as part of the specification. Further, the detailed description is inclusive of illustrative embodiments that are not necessarily mutually exclusive.

[0024] Figure 1 A flow chart of a method for optical network service turn-up scheduling in an embodiment of the present disclosure is shown;

[0025] Figure 2 A flow chart of another method for optical network service turn-up scheduling in an embodiment of the present disclosure is shown;

[0026] Figure 3 A multi-layer turn-up topology in an embodiment of the present disclosure is shown;

[0027] Figure 4 A conflict detection diagram of a turn-up scheduling scheme in an embodiment of the present disclosure is shown;

[0028] Figure 5 A diagram of another optical network service turn-up scheduling system in an embodiment of the present disclosure is shown;

[0029] Figure 6 A diagram of a turn-up scheduling module in another optical network service turn-up scheduling scheme in an embodiment of the present disclosure is shown;

[0030] Figure 7 A flow chart of another method for optical network service turn-up scheduling in an embodiment of the present disclosure is shown;

[0031] Figure 8 A diagram of an optical network service turn-up scheduling apparatus in an embodiment of the present disclosure is shown;

[0032] Figure 9 A block diagram of a network system in an embodiment of the present disclosure is shown. DETAILED DESCRIPTION

[0033] Example implementations will now be described more fully with reference to the accompanying drawings. Example implementations may, however, be implemented in many different forms and should not be construed as limited to the implementations set forth herein; rather, these implementations are provided so that this disclosure will be thorough and complete, and will fully convey the scope of example implementations to those skilled in the art. The features, structures, or characteristics described in connection with the embodiments disclosed herein can be combined in any suitable manner in one or more embodiments.

[0034] In addition, the accompanying drawings are only schematic and are non-limiting illustrative of the disclosure. Identical reference signs denote identical or similar parts throughout the figures. Some of the blocks in the drawings are functional entities that may be implemented in software, or in one or more hardware modules or integrated circuits, or in different network and / or processor devices and / or microcontroller devices.

[0035] Since the transmission splicing has a huge impact on the network and service, the current transmission splicing management is facing the problems of large number of transmission splicing, the need for accurate conflict judgment, etc. The traditional method is to rely on the experience of splicing administrators to manually arrange the schedule and call the system conflict judgment algorithm to verify the result, which leads to that the splicing schedule is the most time-consuming work, and at least 1-2 days are needed to complete each period.

[0036] In the present disclosure, based on expert rules and network topology rules, the splicing tasks are arranged by using a hierarchical scheduling strategy, and the scheduling resource conflicts of the splicing conflict judgment module are automatically analyzed and fed back to perfect the scheduling scheme and related rules. The present patent automatically arranges the splicing, which reduces the work load of the splicing administrator. The splicing administrator only needs to submit the planned splicing to the system and then perform review and verification to ensure that there is no conflict in daily splicing, which greatly improves the work efficiency and saves human resources.

[0037] In the following, the steps of the optical network splicing scheduling method in the present example embodiment will be described in more detail in conjunction with the accompanying drawings and examples.

[0038] Figure 1 A flow chart of an optical network splicing scheduling method in an embodiment of the present disclosure is shown.

[0039] As shown in Figure 1 An optical network splicing scheduling method according to one embodiment of the present disclosure is applied to an edge node in the edge cloud architecture, which includes the following steps:

[0040] In step S102, the splicing task parameters are configured based on the collected optical network splicing information to be arranged.

[0041] The optical network splicing information to be arranged includes the nodes in the optical network node that need to be arranged for splicing, etc.

[0042] The splicing task parameters include at least one of the splicing type, the splicing area, the splicing risk level, the scheduling days, and the maximum number of iteration optimization of the splicing of the optical network.

[0043] Specifically, the splicing types include, but are not limited to, optical cable splicing and device splicing, etc., the splicing area can be taken as a provincial geographical area unit, and the splicing risk levels are specifically first, second and third levels, etc.

[0044] In addition, the splicing task parameters can also include an operator, a system name and a relay end, etc.

[0045] In step S104, the splicing rules in the splicing rule library are called based on the splicing task parameters.

[0046] The splicing rule library is a database of pre-stored splicing rules, and the splicing rules include, but are not limited to, expert rules and network topology rules obtained by manually scheduling according to the experience of splicing administrators, etc.

[0047] In step S106, the splicing task scheduling of the optical network node is performed based on the splicing rules, and a pre-scheduling scheme is obtained.

[0048] Exemplarily, the splicing tasks include, but are not limited to, optical cable splicing tasks and device splicing tasks, etc.

[0049] The splicing task scheduling of the optical network node based on the splicing rules means that the optical cable splicing tasks and the device splicing tasks, etc. that need to be processed in the optical network node in each scheduling day are determined based on the splicing rules.

[0050] Exemplarily, the task node conflicts include, but are not limited to, the conflicts between the optical cable splicing tasks and the device splicing tasks, etc.

[0051] In step S108, it is detected that the pre-scheduling scheme has scheduling resource conflicts, the pre-scheduling scheme is iteratively optimized, until a target scheduling scheme is obtained, and the splicing operation is issued based on the target scheduling scheme.

[0052] Since the splicing rules in the splicing rule library, i.e., the known expert rules and network topology rules, etc. cannot cover all the conflicts in the existing network, it is necessary to further detect whether there are scheduling resource conflicts.

[0053] In this embodiment, when the optical network splicing information to be scheduled is acquired, the splicing task parameters are configured accordingly, and further based on the splicing task parameters, the matched splicing rules are extracted from the splicing rule library to schedule the splicing task of the optical network node composed of the cable node and the device node based on the splicing rules and the splicing information, so as to realize the scheduling of the splicing task, and in the scheduling process, based on the scheduling processing based on the splicing rules, further based on the detection operation of the scheduling resource conflict, the automatic analysis and scheduling optimization of the pre-scheduling scheme are carried out, the automatic generation of the target scheduling scheme is realized, the splicing administrator only needs to submit the target scheduling scheme to the system and then perform review and verification, the automatic generation of the optical network scheduling task is realized, which can reduce the workload of the splicing administrator, is conducive to ensuring that the daily splicing does not conflict, so as to improve the work efficiency, save human resources, and improve the intelligent level of the optical network.

[0054] In one embodiment, the splicing task parameters are configured based on the collected optical network splicing information to be scheduled, including configuring the scheduling days and the maximum iteration number based on the optical network splicing information.

[0055] Among them, the scheduling days can be decomposed into multiple scheduling tasks.

[0056] The maximum iteration number can ensure the effect and efficiency of the iteration optimization operation.

[0057] In one embodiment, the splicing rules in the splicing rule library are called based on the splicing task parameters, including:

[0058] Based on the splicing area, the risk level, the splicing type, the scheduling days and the maximum iteration number, the matched expert rules and network topology rules are called from the splicing rule library.

[0059] Among them, the expert rules called based on the splicing area and the risk level include but are not limited to: total amount of route splicing risk control, including daily line and device splicing upper limit, splicing regional dispersion principle, distributed according to large area to prevent concentration in the same large area, provincial splicing risk control, including daily same province trunk line splicing, etc., which can be continuously improved during the scheduling process.

[0060] The network topology rules include but are not limited to: conflict rules according to network topology, such as main and standby route conflicts of Xilanwu and Langwu optical cable, regional conflicts, etc., which can be continuously improved during the scheduling process,

[0061] The splicing rules are generated based on the expert rules and the network topology rules.

[0062] In the embodiment, by generating the splicing rules based on the expert rules and the network topology rules, the splicing experience and the actual deployed optical network structure can be combined to schedule the splicing tasks, so as to ensure the reliability of the splicing task scheduling.

[0063] In one embodiment, the scheduling of the splicing tasks of the optical network node based on the splicing rules comprises: generating a multi-layer splicing topology graph of the splicing tasks based on the network topology rules and the optical network node; and connecting the inter-layer tasks and the intra-layer tasks in the multi-layer splicing topology graph based on the expert rules and the full connection condition, to schedule the splicing tasks.

[0064] The full connection condition means that the selected task node and all the selected task nodes have a connection relationship.

[0065] In the embodiment, in the scheduling of the splicing tasks, based on the processing mechanism of the hierarchical topology scheduling, the device splicing and the optical cable splicing can be processed in parallel without conflict, so as to ensure the effectiveness of the splicing task scheduling in the application.

[0066] As shown in FIG. 2, Figure 2 In one embodiment, the generating of the multi-layer splicing topology graph of the splicing tasks based on the network topology rules and the optical network node comprises:

[0067] In step S202, the time task nodes corresponding to the scheduling days are generated to construct a top layer topology.

[0068] In step S204, the type task nodes of at least one lower layer topology are generated based on the optical network node and the corresponding splicing type.

[0069] In step S206, the time task nodes of the top layer topology and the type task nodes of the lower layer topology are sorted based on the risk level.

[0070] In step S208, the multi-layer splicing topology graph is obtained based on the top layer topology and the at least one sorted lower layer topology.

[0071] As shown in FIG. 3, Figure 3 The A layer task corresponds to the scheduling days, and the optical cable splicing of other operators can be selected, the B layer task is the optical cable splicing except the A layer, and the C layer task is the device splicing. The splicing tasks are divided into three layers of ABC, the A layer task is not connected, and for the connection of the inter-layer tasks and the intra-layer tasks of the B layer and the C layer, if there is a network structure conflict or the same province, the connection is not performed, otherwise the connection is performed.

[0072] As shown in FIG. 4, Figure 2 In one embodiment, the connecting of the inter-layer tasks and the intra-layer tasks in the multi-layer splicing topology graph based on the expert rules and the full connection condition comprises:

[0073] In step S210, for each time task node in the sorted order, in the corresponding lower layer topology, type task nodes having an upper and lower layer connection relationship and type task nodes having an intra-layer connection relationship are determined based on the full connection condition.

[0074] In step S212, the unit time splicing task control amount, the splicing region dispersion principle, and the region splicing risk control amount are determined based on expert rules.

[0075] In step S214, the unit time splicing task control amount, the splicing region dispersion principle, and the region splicing risk control amount are used as restriction conditions to connect inter-layer tasks and intra-layer tasks based on the upper and lower layer connection relationship and the intra-layer connection relationship.

[0076] In this embodiment, based on the scheduling days and the optical network nodes, a multi-layer splicing topology graph is generated, and based on expert rules and network topology rules, a hierarchical scheduling strategy is used to schedule the splicing tasks, as shown in FIG. 6. Figure 3 As shown in FIG. 6, first, A1 is selected for screening, and according to the sequence number size, the graph points connected to A1 in the B layer are selected first. The selected B layer nodes need to meet the full connection condition. Then, the same rule is used to select tasks in the C layer. After the scheduling of tasks in one day is completed, A2 is selected for the splicing screening of the next day, and the same process is repeated until the splicing screening of the Nth day is completed, so as to automatically generate a pre-scheduling scheme.

[0077] In one embodiment, the optical network nodes are scheduled for splicing tasks based on splicing rules to obtain a pre-scheduling scheme, including: in the process of scheduling splicing tasks, if it is detected that there is a task node conflict, the node conflict is handled based on a task conflict handling rule to obtain a pre-scheduling scheme.

[0078] In one embodiment, if it is detected that there is a task node conflict, the node conflict is handled based on a task conflict handling rule, including:

[0079] In the process of scheduling splicing tasks, for each time task node in the sorted order, if it is detected that there is a routing conflict and / or a region conflict, it is determined that there is a task node conflict.

[0080] The task node conflict includes but is not limited to a splicing task affecting an optical network path detected based on network topology rules, or a splicing task affecting the normal operation of an optical network detected based on expert rules, etc.

[0081] If there is a conflict between the time task node of the top layer topology and the type task node of the lower layer topology, the type task node in conflict is adjusted.

[0082] The type task node includes a cable splicing task and a device splicing task, etc.

[0083] If the type task nodes of the same layer conflict, the type task node with a low risk level is adjusted preferentially.

[0084] The high and low risk levels can also be determined based on expert rules and / or network topology rules.

[0085] If the type task node of the next layer conflicts with the type task node of the previous layer or with the time task node, the type task node of the next layer is adjusted preferentially.

[0086] The type task node of the next layer has a simpler network relationship relative to the type task node of the previous layer, and thus the type task node of the next layer is adjusted preferentially, and the reliability of implementation is higher.

[0087] In this embodiment, as shown in FIG. 4, if the A-layer graph point conflicts with the B-layer graph point, the B-layer graph point is adjusted preferentially, if the B-layer graph point conflicts with the B-layer graph point, the graph point with a low risk level is adjusted preferentially, and if the C-layer graph point conflicts with the A-layer or B-layer graph point, the C-layer graph point is adjusted preferentially. Figure 3 In one embodiment, the pre-scheduling scheme is detected to have scheduling resource conflicts, and the pre-scheduling scheme is iteratively optimized for scheduling until a target scheduling scheme is obtained, including: for each time task node corresponding to the pre-scheduling scheme, performing online verification based on a long-distance resource library.

[0088] The long-distance resource library includes, but is not limited to, cable equipment resources in long-distance and associated relationship resources between the cable equipment, and the like. Since known expert rules and network topology rules cannot cover all conflicts in the online network, for the pre-scheduling scheme, the long-distance resource library is called to verify whether there is a conflict in the online network, so that when it is detected that the online network has scheduling resource conflicts, the pre-scheduling scheme is iteratively optimized for scheduling until a target scheduling scheme is obtained.

[0089] Exemplarily, the online verification includes, but is not limited to, that the cable with a master-slave relationship cannot be simultaneously cut and connected.

[0090] If it is determined based on the result of the online verification that the pre-scheduling scheme does not have scheduling resource conflicts, the pre-scheduling scheme is determined as the target scheduling scheme.

[0091] If it is determined based on the result of the online verification that the pre-scheduling scheme has scheduling resource conflicts, the pre-scheduling scheme is iteratively optimized for rescheduling based on the scheduling resource conflicts.

[0092] If the scheduling resource conflicts still exist when the iteration number of the iterative optimization for rescheduling reaches the maximum iteration number, a scheduling processing request is generated, and the scheduling processing request is used to request the scheduling opinion of an administrator.

[0093] If the scheduling resource conflict disappears and the number of iteration times of re-scheduling does not reach the maximum iteration times, output the target scheduling scheme.

[0094] In this embodiment, based on the expert rules and network topology rules, the switching tasks are scheduled by using the hierarchical scheduling strategy, and the scheduling resource conflicts of the switching conflict judgment module are automatically analyzed and fed back to perfect the scheduling scheme and the related rules. Further, the pre-scheduling scheme is reviewed and verified by calling the optical network resources in the long-distance resource library for online verification, so that the daily switching does not conflict, which greatly improves the work efficiency, saves human resources, and improves the intelligent level of the optical network.

[0095] As shown in Figure 4 The switching scheduling unit 402 and the conflict judgment unit 406 interact, specifically including: the switching scheduling unit 402 calls rules from the rule library 404, schedules the switching tasks based on the called rules, obtains a pre-scheduling scheme, inputs the pre-scheduling scheme into the conflict judgment unit 406 for conflict judgment, in the conflict judgment unit 406, verifies the pre-scheduling scheme online based on the long-distance resource library 408, feeds back the switching scheduling resource conflict obtained by the conflict verification to the switching scheduling unit 402 for re-scheduling, and optimizes the rules in the re-scheduling process, and feeds back the optimized rules to the rule library 404.

[0096] In one embodiment, the inter-layer tasks and intra-layer tasks in the multi-layer switching topology graph are connected based on the expert rules and full connection conditions to schedule the switching tasks, and further comprising:

[0097] After completing the connection operation of the inter-layer tasks and intra-layer tasks in the lower layer topology corresponding to a time task node, the connected time task node and type task node are deleted from the multi-layer switching topology graph, and a new multi-layer switching topology graph is formed.

[0098] In one embodiment, further comprising: generating an optimized rule based on the identification and analysis results of the scheduling resource conflict; adding the optimized rule to the switching rule library based on a self-learning mechanism to optimize the switching rules based on the optimized rule.

[0099] In this embodiment, by combining the automatic scheduling and conflict verification in intelligent switching, based on the interaction between the automatic scheduling and the conflict verification, the existing rule library can be perfected in the processing process based on the self-learning mechanism in the interaction process, so that the scheduling processing effect is further improved in the next switching task scheduling process.

[0100] In one embodiment, it is detected that the pre-scheduling scheme has scheduling resource conflict, the pre-scheduling scheme is iteratively optimized based on the long-distance resource library until the target scheduling scheme is obtained, and further comprising:

[0101] If there is still a task conflict after the pre-scheduling scheme is iteratively optimized based on the long-distance resource library in the last day of the scheduling day, a handover leftover task is generated.

[0102] In this embodiment, if there is still a conflicting handover in the last day of the scheduling operation, the aforementioned handover conflict adjustment rule is adjusted, and the handover left in the handover pool is left as a leftover handover for arrangement in the next period.

[0103] As shown in Figure 5 The intelligent handover scheduling system of the optical network according to the present disclosure includes:

[0104] The input port 502, the processing module 504, the handover scheduling module 506, and the output port 508.

[0105] The input port 502 is configured to receive the optical network handover information to be scheduled based on the input of the optical network node.

[0106] The processing module 504 is configured to configure the handover task parameters based on the collected optical network handover information to be scheduled, and the handover task parameters include the related parameters of the handover scheduling task, the scheduling days N, and the maximum number of iterations.

[0107] The handover task parameters are input to the handover scheduling module 506, and the target handover scheme is output by the handover scheduling module 506.

[0108] The output port 508 is configured to output the target scheduling scheme, notify the administrator to confirm, and issue the handover operation according to the target scheduling scheme.

[0109] The input content of the intelligent handover scheduling module is shown in Table 1.

[0110] Table 1

[0111]

[0112] The output content of the intelligent handover scheduling module is shown in Table 2.

[0113] Table 2

[0114] Output information name Description Scheduling scheme Tasks that need to be cut in the first phase (N days) Request administrator confirmation Cannot get a suitable scheduling scheme, request manual scheduling

[0115] As shown in Figure 6 The handover scheduling module includes a handover scheduling unit 602, a handover rule library 604, a conflict judgment unit 606, and a long-distance resource library 608.

[0116] The handover scheduling unit 602 receives handover task parameters, and calls expert rules and network topology rules from the handover rule library 604 based on the handover task parameters, generates a hierarchical scheduling strategy based on the expert rules and the network topology rules, obtains a one-day scheduling by using the hierarchical scheduling strategy and scheduling resource conflicts fed back by the conflict judgment unit 606, and records the iteration number at this time. At the same time, the handover scheduling unit 602 analyzes the conflict handover task, perfects the relevant rules, and feeds back to the handover rule library 604. In addition, the pre-scheduling scheme and the maximum iteration number are fed back to the conflict judgment unit 606. The conflict judgment unit 606 calls the long-distance resource library 608 to judge whether the pre-scheduling scheme has conflicts. If there is a conflict at this time, and the iteration number is less than the maximum iteration number, the handover scheduling unit 602 is returned to analyze the scheduling resource conflicts and reschedule.

[0117] Exemplarily, the intelligent handover module includes a handover scheduling unit 602, a handover rule library 604, a conflict judgment unit 606, and a long-distance resource library 608. By defining the interface of the intelligent handover scheduling module and the existing network management system, the input and output parameters are clarified, the functions are required, and the interaction between the handover scheduling unit 602 and the conflict verification unit 606 is defined.

[0118] In addition, in the intelligent handover scheduling module, a hierarchical scheduling processing mechanism is proposed, so as to realize the automation, intelligentization and unification of the management and maintenance of the handover task in the actual intelligent management and control system, help the operator save human resources, and improve the work efficiency.

[0119] In the handover scheduling unit 602, the tasks in each layer are sorted from high to low according to the risk level. First, A1 starts to select, according to the size of the serial number, the graph points in the B layer connected with it, and the selected graph points in the B layer need to meet the full connection condition. Then, the tasks in the C layer are selected according to the same rule. Then, A2 starts the second day of handover selection, and the same is true for the Nth day of handover selection.

[0120] After the handover scheduling of each day is completed, the handover scheduling scheme table is stored, and the graph points corresponding to the handover scheduling of the day are deleted from the hierarchical topology graph to form a new handover hierarchical topology graph.

[0121] In addition, for the interaction between the handover scheduling unit 602 and the conflict verification unit 606, if the A layer graph point conflicts with the B layer graph point, the B layer graph point is adjusted first, if the B layer graph point conflicts with the B layer graph point, the graph point with a low risk level is adjusted first, and if the C layer graph point conflicts with the A layer or B layer graph point, the C layer graph point is adjusted first.

[0122] The conflict judgment result is identified and analyzed, new rules are formed, and are added to the cut rule library 604. The intelligent cut scheduling module has a self-learning function, which is continuously improved, and the intelligent scheduling efficiency is continuously improved. Once iteration is to verify the conflict judgment, and the scheduling is performed again. If there is still a conflict cut in the N-day cut screening, the cut is adjusted according to the foregoing cut conflict adjustment rule, and finally the cut left in the to-be-cut pool is left as a legacy cut and is arranged in the next period.

[0123] The interaction data content in the intelligent cut scheduling module is shown in Table 3.

[0124] Table 3

[0125]

[0126] As shown in Figure 7 , the optical network cut scheduling method according to another embodiment of the present disclosure comprises:

[0127] Step S702, the network management system collects the cut information to be scheduled.

[0128] Step S704, the network management system inputs the to-be-cut scheduling task and related data, scheduling days, maximum iteration times, etc. into the cut scheduling unit, and the cut scheduling unit calls the existing rules in the rule library.

[0129] Step S706, the cut scheduling unit obtains the scheduling of one day by using the hierarchical scheduling strategy and the scheduling resource conflict fed back by the conflict judgment unit, and the network topology rules and expert rules extracted in the rule library, and analyzes the conflict cut task to perfect the related rules and feedback to the rule library.

[0130] Step S708, the conflict judgment unit calls the long-distance resource library to judge whether the scheduling scheme has a conflict.

[0131] Step S710, if there is a conflict at this time, and the iteration times are less than the maximum iteration times, return to the cut scheduling unit to analyze the scheduling resource conflict and reschedule.

[0132] Step S712, if the iteration times are greater than the iteration times, request the administrator's opinion.

[0133] Step S714, if the scheduling scheme has no conflict through the conflict judgment unit, record the scheduling scheme of the day, and delete the related cut task in the to-be-cut task.

[0134] Step S716, reschedule the next day until the N-day scheduling is completed.

[0135] Step S718, the network management system outputs the scheduling scheme and notifies the administrator to confirm.

[0136] Step S720, the network management system publishes the switching operation according to the switching scheduling scheme.

[0137] It should be noted that the above-described figures are only schematic illustrations of the processes included in the method according to the exemplary embodiments of the present application, and are not intended to limit the purposes. It is easy to understand that the processes shown in the above-described figures do not indicate or limit the time sequence of the processes. In addition, it is also easy to understand that the processes can be executed synchronously or asynchronously, for example, in multiple modules.

[0138] The optical network switching scheduling device 800 according to the embodiments of the present application will be described below with reference to Figure 8 Figure 8 The optical network switching scheduling device 800 shown is only an example, and should not bring any limitation to the functions and use range of the embodiments of the present application.

[0139] The optical network switching scheduling device 800 is in the form of a hardware module. The components of the optical network switching scheduling device 800 can include but are not limited to: a configuration module 802 for configuring switching task parameters based on the collected optical network switching information to be scheduled; a calling module 804 for calling switching rules in a switching rule library based on the switching task parameters; a processing module 806 for scheduling switching tasks for optical network nodes based on the switching rules to obtain a pre-scheduling scheme; an optimization module 808 for detecting that the pre-scheduling scheme has scheduling resource conflicts, and iteratively optimizing the pre-scheduling scheme until a target scheduling scheme is obtained, to publish a switching operation based on the target scheduling scheme.

[0140] Those skilled in the art can understand that various aspects of the present application can be implemented as a system, a method or a program product. Therefore, various aspects of the present application can be embodied as a complete hardware embodiment, a complete software embodiment (including firmware, microcode, etc.), or an embodiment combining hardware and software aspects, which can be collectively referred to as "circuitry", "module" or "system" here.

[0141] The network management system 900 according to this embodiment of the present application will be described below with reference to Figure 9 Figure 9 The network management system 900 shown is only an example, and should not bring any limitation to the functions and use range of the embodiments of the present application.

[0142] As Figure 9 shown, the network management system 900 is in the form of a general computing device. The components of the network management system 900 can include but are not limited to: the above-described at least one processing unit 910, the above-described at least one storage unit 920, and a bus 930 connecting different system components, including the storage unit 920 and the processing unit 910. ​​

[0143] The storage unit stores program codes which can be executed by the processing unit 910, so that the processing unit 910 performs the steps according to various exemplary embodiments of the present application described in the above "Exemplary Methods" section of the present specification. For example, the processing unit 910 can perform the schemes described in steps S102 to S109 as shown in FIG. 10. Figure 1 The storage unit stores program codes which can be executed by the processing unit 910, so that the processing unit 910 performs the steps according to various exemplary embodiments of the present application described in the above "Exemplary Methods" section of the present specification. For example, the processing unit 910 can perform the schemes described in steps S102 to S109 as shown in FIG. 10.

[0144] The storage unit 920 can include a readable medium in the form of volatile storage such as a random access memory (RAM) 9201 and / or cache memory 9202, and also can include a non-volatile storage such as a read-only memory (ROM) 9203.

[0145] The storage unit 920 also can include a program / utility 9204 having a set (at least one) of program modules 9205 such as an operating system, one or more application programs, other program modules, and program data, each of which gives the network management system 900 its functionality, collectively or some combination thereof.

[0146] The bus 930 can represent one or more of several types of bus structures, including a storage bus or bus controller, a peripheral bus, a graphics acceleration port, a processor or local bus using any of a variety of bus architectures, etc.

[0147] The network management system 900 also can communicate with one or more external devices 970 such as a keyboard or a pointing device, a Bluetooth device, etc.; other devices such as devices that enable a user to interact with the network management system 900; and / or any devices (e.g., a router, a modem, a peer to peer device, etc.) that enable the network management system 900 to communicate with one or more other computing devices. Such communication can occur via the input / output (I / O) interface(s) 950. Still yet, the network management system 900 can communicate with one or more networks such as a local area network (LAN), a general wide area network (WAN), and / or a public network such as the Internet, via the network adapter 960. As depicted, the network adapter 960 communicates with the other components of the network management system 900 via the bus 930. It should be appreciated that the network management system 900 can be a part of another device or system, e.g., a server farm, a client system, another network component, etc.; and the depicted components can be implemented as part of that other device or system. In this regard, it should be appreciated that the network management system 900 can be a standalone system or can be part of a larger system; e.g., a server farm, a client system, another network component, etc.

[0148] Those skilled in the art can easily understand from the above description of the embodiments that the example embodiments described herein can be implemented by software or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a U disk, a mobile hard disk, etc.) or on a network, and includes a number of instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network management system, etc.) to perform the method according to the embodiments of the present disclosure.

[0149] In the example embodiments of the present disclosure, a computer readable storage medium is also provided, on which a program product capable of implementing the above method of the present disclosure is stored. In some possible embodiments, various aspects of the present disclosure can also be implemented in the form of a program product, which includes program codes for causing a network management system to perform the steps according to various example embodiments of the present disclosure described in the above "example method" section of the present disclosure when the program product is run on the network management system.

[0150] The program product for implementing the above method according to the embodiments of the present disclosure can take the form of a portable compact disc read-only memory (CD-ROM) and include program codes, and can be run on an electronic device such as a personal computer. However, the program product of the present disclosure is not limited to this, and in this document, the readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, device, or apparatus.

[0151] The program product can take any combination of one or more readable media. The readable medium can be a readable signal medium or a readable storage medium. The readable storage medium may, for example, be but is not limited to an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or apparatus, or any combination of the above. More specific examples (non-exhaustive list) of readable storage media include an electrical connection having one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0152] A computer readable signal medium can include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal can take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium can be any computer readable medium that can be involved in

[0153] The code can be transmitted in any form, including, but not limited to, radio frequency, optical, electrical, or the like, or any suitable combination thereof.

[0154] The program code can be implemented in any of a variety of programming languages, including, but not limited to, Java, C++, or the like, and can be executed by one or more of a variety of operating systems. The program code can be executed on a single computer, on a plurality of computers, or on a plurality of computing devices connected by a network. The computing devices can be connected by a network in any form, including, but not limited to, a local area network (LAN) or a wide area network (WAN), or the like, or any suitable combination thereof.

[0155] It should be noted that, although the above detailed description refers to several modules or units of the device for action execution, such a division is not mandatory. Indeed, according to an embodiment of the present disclosure, features and functionalities of two or more modules or units described above can be embodied in one module or unit. Conversely, features and functionalities of one module or unit described above can be further divided into several modules or units.

[0156] Moreover, although the various steps of the methods of the present disclosure are described in a particular order in the figures, this is not mandatory. Indeed, the steps can be performed in a different order, or some of them can be omitted, some can be combined into a single step, and / or one step can be split into several steps, etc.

[0157] Those skilled in the art can easily understand that the example embodiments described herein can be implemented by software, or by software in combination with necessary hardware, through the above description of the embodiments. Therefore, the technical solutions according to the embodiments of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash disk, a mobile hard disk, or the like) or a network, and includes a number of instructions to enable a computing device (which can be a personal computer, a server, a mobile terminal, or a network management system, etc.) to perform the methods according to the embodiments of the present disclosure.

[0158] Other embodiments of the present disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the application disclosed herein. It is intended that the present disclosure cover any and all variations of the present disclosure that come within the scope of the following claims and their equivalents. It is intended that the specification and examples be considered exemplary only, with the true scope and spirit of the present disclosure being indicated by the following claims.

Claims

1. A method of optical network grooming scheduling, the method comprising: The method comprises the following steps: configuring a task parameter of a cut based on collected cut information of an optical network to be scheduled, the task parameter of the cut comprising a cut type, a scheduling day number and a cut risk level; calling a cut rule in a cut rule library based on the task parameter of the cut; scheduling a cut task for an optical network node based on the cut rule, comprising: generating a corresponding time task node based on the scheduling day number to construct a top-level topology; generating at least one type task node of a lower-level topology based on the optical network node and the corresponding cut type; sorting the at least one type task node of the lower-level topology based on the cut risk level, and combining the top-level topology to obtain a multi-layer cut topology graph; determining the type task node having an upper-lower layer connection relationship and the type task node having an intra-layer connection relationship in the lower-level topology corresponding to the time task node after sorting based on a full connection condition; determining a unit time cut task control amount, a cut region dispersion principle and a region cut risk control amount based on an expert rule, and taking them as a limiting condition; connecting an inter-layer task and an intra-layer task in the multi-layer cut topology graph based on the upper-lower layer connection relationship and the intra-layer connection relationship to obtain a pre-scheduling scheme; detecting that the pre-scheduling scheme has a scheduling resource conflict, iteratively optimizing the pre-scheduling scheme based on a long-distance resource library until a target scheduling scheme is obtained, and publishing a cut operation based on the target scheduling scheme.

2. The optical network grooming scheduling method of claim 1, wherein, The method of configuring a task parameter of a cut based on collected cut information of an optical network to be scheduled comprises: configuring at least one of the cut type, the cut region, the cut risk level, the scheduling day number and the maximum iteration number of the iteration optimization of the cut of the optical network based on the cut information of the optical network.

3. The optical network grooming scheduling method of claim 2, wherein, The method of calling a cut rule in a cut rule library based on the task parameter of the cut comprises: calling a matching expert rule and a network topology rule from the cut rule library based on the cut region, the cut risk level, the cut type, the scheduling day number and the maximum iteration number; and generating the cut rule based on the expert rule and the network topology rule. The method of scheduling a cut task for an optical network node based on the cut rule to obtain a pre-scheduling scheme further comprises:

4. The optical network grooming scheduling method of claim 1, wherein, during the scheduling of the cut task, if a task node conflict is detected, processing the node conflict based on a task conflict processing rule to obtain the pre-scheduling scheme. The method of processing the node conflict based on the task conflict processing rule if a task node conflict is detected comprises:

5. The optical network grooming scheduling method of claim 1, wherein, during the scheduling of the cut task, for each time task node after sorting, if a routing conflict and / or a region conflict is detected, it is determined that there is a task node conflict; if there is a conflict between the time task node of the top-level topology and the type task node of the lower-level topology, the type task node in conflict is adjusted; if the type task nodes in the same layer are in conflict, the type task node with a low risk level is preferentially adjusted. ​ If a conflict exists between the type task node of the next layer and the type task node of the previous layer or the time task node, the type task node of the next layer is adjusted in priority.

6. The optical network grooming scheduling method of claim 4, wherein, The detection of the pre-scheduling scheme existing scheduling resource conflicts, the pre-scheduling scheme is iteratively optimized for scheduling until a target scheduling scheme is obtained, comprising: For each pre-scheduling scheme corresponding to the time task node, the long-distance resource library is executed based on the online verification; If the pre-scheduling scheme is determined to exist the scheduling resource conflict based on the result of the online verification, the pre-scheduling scheme is determined as the target scheduling scheme; If the pre-scheduling scheme is determined to exist the scheduling resource conflict based on the result of the online verification, the pre-scheduling scheme is iteratively optimized for rescheduling based on the scheduling resource conflict; If the iteration number of the iterative optimization of the rescheduling reaches the maximum iteration number, the scheduling processing request is generated if the scheduling resource conflict still exists, and the scheduling processing request is used to request the scheduling opinion of the administrator; If the scheduling resource conflict disappears and the iteration number of the rescheduling does not reach the maximum iteration number, the target scheduling scheme is output.

7. The optical network grooming scheduling method of claim 6, wherein, The connection of the inter-layer task and the intra-layer task in the multi-layer splicing topology graph based on the expert rules and the full connection condition is performed to perform the splicing task scheduling, and further comprising: After completing the connection operation of the inter-layer task and the intra-layer task in the lower layer topology corresponding to one time task node, the connected time task node and type task node are deleted from the multi-layer splicing topology graph, and a new multi-layer splicing topology graph is formed.

8. The optical network grooming scheduling method of claim 4, wherein, Further comprising: Based on the identification and analysis result of the scheduling resource conflict, an optimization rule is generated; Based on the self-learning mechanism, the optimization rule is added to the splicing rule library to optimize the splicing rule based on the optimization rule.

9. The optical network grooming scheduling method of any of claims 2-8, wherein, The detection of the pre-scheduling scheme existing scheduling resource conflicts, the pre-scheduling scheme is iteratively optimized for scheduling based on the long-distance resource library, until a target scheduling scheme is obtained, further comprising: If there is still a task conflict in the splicing task scheduling of the last day of the scheduling days, the pre-scheduling scheme is iteratively optimized for scheduling based on the long-distance resource library, and a splicing remaining task is generated.

10. An optical network grooming schedule apparatus, characterized by: Comprising: A configuration module configured to configure splicing task parameters based on the collected optical network splicing information to be scheduled, the splicing task parameters including splicing type, scheduling days, and splicing risk level; A calling module configured to call splicing rules in a splicing rule library based on the splicing task parameters; The processing module is configured to schedule a switching task of an optical network node based on the switching rule, including: generating a corresponding time task node based on the scheduling days to construct a top-level topology; generating at least one layer of lower-level topology type task nodes based on the optical network node and the corresponding switching type; sorting the at least one layer of lower-level topology type task nodes based on the switching risk level, and combining the top-level topology to obtain a multi-layer switching topology graph; determining the type task nodes with upper and lower layer connection relationship and the type task nodes with this layer connection relationship in the lower topology corresponding to the sorted time task node based on the full connection condition; determining the switching task control amount per unit time, the switching region dispersion principle and the region switching risk control amount based on the expert rule, and taking them as the limiting conditions, connecting the inter-layer tasks and intra-layer tasks in the multi-layer switching topology graph based on the upper and lower layer connection relationship and the this layer connection relationship to obtain a pre-scheduling scheme; The optimization module is configured to detect that the pre-scheduling scheme has a scheduling resource conflict, and iteratively optimize the pre-scheduling scheme until a target scheduling scheme is obtained, so as to publish a switching operation based on the target scheduling scheme.

11. A network management system, characterized by comprising: Comprise: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute the optical network switching scheduling method of any one of claims 1-9 by executing the executable instructions.

12. A computer readable storage medium having stored thereon a computer program, characterized in that, The computer program is executed by the processor to realize the optical network switching scheduling method of any one of claims 1-9.

Images