CN109547150B - Non-interference point selection method and device for optical switch - Google Patents

Non-interference point selection method and device for optical switch Download PDF

Info

Publication number
CN109547150B
CN109547150B CN201811271545.0A CN201811271545A CN109547150B CN 109547150 B CN109547150 B CN 109547150B CN 201811271545 A CN201811271545 A CN 201811271545A CN 109547150 B CN109547150 B CN 109547150B
Authority
CN
China
Prior art keywords
point
grid
channel
points
matched
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
CN201811271545.0A
Other languages
Chinese (zh)
Other versions
CN109547150A (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.)
Accelink Technologies Co Ltd
Original Assignee
Accelink Technologies 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 Accelink Technologies Co Ltd filed Critical Accelink Technologies Co Ltd
Priority to CN201811271545.0A priority Critical patent/CN109547150B/en
Publication of CN109547150A publication Critical patent/CN109547150A/en
Application granted granted Critical
Publication of CN109547150B publication Critical patent/CN109547150B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J14/00Optical multiplex systems
    • H04J14/02Wavelength-division multiplex systems
    • H04J14/0201Add-and-drop multiplexing
    • H04J14/0202Arrangements therefor
    • GPHYSICS
    • G02OPTICS
    • G02BOPTICAL ELEMENTS, SYSTEMS OR APPARATUS
    • G02B6/00Light guides; Structural details of arrangements comprising light guides and other optical elements, e.g. couplings
    • G02B6/24Coupling light guides
    • G02B6/26Optical coupling means
    • G02B6/35Optical coupling means having switching means
    • G02B6/351Optical coupling means having switching means involving stationary waveguides with moving interposed optical elements
    • G02B6/3512Optical coupling means having switching means involving stationary waveguides with moving interposed optical elements the optical element being reflective, e.g. mirror
    • G02B6/3518Optical coupling means having switching means involving stationary waveguides with moving interposed optical elements the optical element being reflective, e.g. mirror the reflective optical element being an intrinsic part of a MEMS device, i.e. fabricated together with the MEMS device
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J14/00Optical multiplex systems
    • H04J14/02Wavelength-division multiplex systems
    • H04J14/0201Add-and-drop multiplexing
    • H04J14/0202Arrangements therefor
    • H04J14/0205Select and combine arrangements, e.g. with an optical combiner at the output after adding or dropping
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J14/00Optical multiplex systems
    • H04J14/02Wavelength-division multiplex systems
    • H04J14/0201Add-and-drop multiplexing
    • H04J14/0202Arrangements therefor
    • H04J14/0206Express channels arrangements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J14/00Optical multiplex systems
    • H04J14/02Wavelength-division multiplex systems
    • H04J14/0201Add-and-drop multiplexing
    • H04J14/0202Arrangements therefor
    • H04J14/021Reconfigurable arrangements, e.g. reconfigurable optical add/drop multiplexers [ROADM] or tunable optical add/drop multiplexers [TOADM]
    • H04J14/0212Reconfigurable arrangements, e.g. reconfigurable optical add/drop multiplexers [ROADM] or tunable optical add/drop multiplexers [TOADM] using optical switches or wavelength selective switches [WSS]

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Optics & Photonics (AREA)
  • Image Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The embodiment of the invention provides a method and a device for selecting a non-interference point of an optical switch, wherein the method comprises the following steps: dividing the channel points of the optical switch into a plurality of small groups; aiming at any group, establishing a grid point matrix of the group, wherein the grid point matrix consists of a plurality of grid points; if the relation between any grid point and any channel point in the group meets a first preset rule, adding the channel point into a channel point set of the grid point; selecting a grid point to be matched of the group based on the size of the channel point set of each grid point in the group; and regarding all the subgroups, if the relation between the grid points to be matched of every two subgroups meets a second preset condition, taking the grid points to be matched of every subgroup as non-interference points. The method and the device provided by the embodiment of the invention realize the automatic selection of the interference-free point of the optical switch, improve the selection rate and the accuracy of the interference-free point and provide conditions for the optical switch to realize the high-efficiency and accurate interference-free channel switching.

Description

Non-interference point selection method and device for optical switch
Technical Field
The embodiment of the invention relates to the technical field of optical waveguide coupling, in particular to a method and a device for selecting a non-interference point for an optical switch.
Background
The Optical switch and the Optical switch array are used as key devices in Optical Add-Drop Multiplexer (OADM) equipment, Optical Cross-Connect (OXC) equipment and Optical routing equipment, have functions of controlling on-off and wavelength conversion of signals in the same channel or different channels, and have important significance in solving wavelength contention in the current complex network, improving wavelength reuse rate and flexibly configuring the network.
A two-dimensional Micro Electro Mechanical System (MEMS OSW) Optical Switch is used as a novel Optical Switch in an Optical Switch series, and has the characteristics of small size, low cost, low power consumption, high speed, low loss and the like, so that the demand of an Optical communication network for the MEMS OSW is increasing.
The selection of a non-interference (Hitless) point is a key link for controlling the signal on-off and channel switching of the MEMS OSW optical switch. How to select the Hitless point in an efficient and accurate manner in the mass production process is particularly important. At present, the Hitless point selection method for the mainstream 1 x 16 optical switch has huge calculation amount and is mainly completed by a manual screening method. The manual screening work efficiency is lower, and the screening result has inaccuracy.
Disclosure of Invention
The embodiment of the invention provides a method and a device for selecting an interference-free point of an optical switch, which are used for solving the problems of low efficiency and low accuracy of the existing method for selecting the interference-free point of the optical switch.
In one aspect, an embodiment of the present invention provides a method for selecting a non-interference point for an optical switch, including:
dividing the channel points of the optical switch into a plurality of small groups;
aiming at any group, establishing a grid point matrix of the group, wherein the grid point matrix consists of a plurality of grid points;
if the relationship between any grid point in the group and any channel point in the group meets a first preset rule, adding the channel point into the channel point set of the grid point;
selecting a grid point to be matched of the group from all grid points of the group based on the size of the channel point set of each grid point in the group;
and regarding all the subgroups, if the relation between the grid points to be matched of every two subgroups meets a second preset condition, taking the grid points to be matched of every subgroup as non-interference points.
In another aspect, an embodiment of the present invention provides a non-interference point selection apparatus for an optical switch, including:
the grouping unit is used for dividing the channel points of the optical switch into a plurality of subgroups;
the grid unit is used for establishing a grid point matrix of any group, and the grid point matrix consists of a plurality of grid points;
the grouping selection unit is used for adding the channel point into a channel point set of the grid point if the relationship between any grid point in the group and any channel point in the group meets a first preset rule;
a to-be-matched point selecting unit, configured to select a to-be-matched grid point of the group from all grid points of the group based on the size of the channel point set of each grid point in the group;
and the matching selection unit is used for aiming at all the groups, and taking the grid points to be matched of each group as non-interference points if the relation between the grid points to be matched of every two groups meets a second preset condition.
In still another aspect, an embodiment of the present invention provides an electronic device, which includes a processor, a communication interface, a memory and a bus, wherein the processor, the communication interface, and the memory communicate with each other via the bus, and the processor can call logic instructions in the memory to execute the unperturbed point selection method for an optical switch as described above.
In yet another aspect, embodiments of the present invention provide a non-transitory computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the method for glitch-free selection for an optical switch as described above.
The method and the device for selecting the non-interference point for the optical switch provided by the embodiment of the invention select the grid point to be matched based on the grid point matrix of each group, determine the non-interference point of each group through the grid points to be matched of every two groups, realize the automatic selection of the non-interference point of the optical switch, improve the selection rate and the accuracy of the non-interference point, and provide conditions for the optical switch to realize the high-efficiency and accurate non-interference channel switching.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.
Fig. 1 is a schematic flow chart of a glitch-free point selection method for an optical switch according to an embodiment of the present invention;
fig. 2 is a schematic diagram of grouping optical switch channel points according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a grid point matrix according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of interference free point selection provided by an embodiment of the present invention;
fig. 5 is a schematic structural diagram of a non-interference point selection device for an optical switch according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
At present, the selection of the interference-free points of the optical switch is mainly realized by manual screening, the working efficiency is lower, and the screening result has inaccuracy. In view of the above problems, embodiments of the present invention provide a method for selecting a non-interference point for an optical switch. Fig. 1 is a schematic flow chart of a method for selecting a non-interference point for an optical switch according to an embodiment of the present invention, as shown in fig. 1, the method includes:
the channel points of the optical switch are divided into several subgroups 110.
In particular, each subgroup comprises a number of channel points. Here, the number of subgroups can be determined according to the number of channel points of the optical switch, and each subgroup can be selected to obtain one interference-free point through the subsequent steps, i.e. the number of subgroups is consistent with the number of interference-free points of the optical switch. If the number of the channel points of the optical switch is more, a larger number of non-interference points can be correspondingly arranged, so that the channel switching of the subsequent optical switch is facilitated. The embodiment of the invention does not specifically limit the grouping quantity and the grouping rule of the channel points.
After grouping the channel points, the kth subgroup K is given by:
K={Chk_1,Chk_2,...,Chk_l};
where l is the number of channel points in the subgroup K, Chk_iIs the ith channel point, Ch, in subgroup Kk_iAs shown in the following formula:
Chk_i=(Xk_i,Yk_i);
in the formula, Xk_iAnd Yk_iAre respectively channel points Chk_iThe abscissa and the ordinate.
And 120, establishing a grid point matrix of any group, wherein the grid point matrix is composed of a plurality of grid points.
Specifically, after grouping is completed, a grid point matrix is respectively established for each group. Here, the size of the grid in the grid point matrix may be determined according to actual requirements, for example, if a non-interference point needs to be calculated quickly, a larger grid is selected, and for example, if a non-interference point with higher accuracy is needed, a smaller grid is selected. The number of grid points in the grid point matrix is related to the number of channel points in the subgroup and the size of the grid.
In subgroup K, the minimum value on the abscissa is assumed to be Xk_minThe minimum value of the vertical axis is Yk_minAnd if the size of the grid division is Unit, establishing a grid point matrix G based on the group KkAs follows:
Figure BDA0001846099750000041
wherein m and n are grid point matrix GkNumber of columns and rows, PijIs GkGrid point of ith row and jth column, PijAs follows:
Pij=(Unit×i+Xk_min,Unit×j+Yk_min)。
130, if the relationship between any grid point in the group and any channel point in the group satisfies a first predetermined rule, adding the channel point to the channel point set of the grid point.
Specifically, in any group, any grid point is selected, whether the relationship between each channel point in the group and the grid point meets a first preset rule is judged, and the channel points meeting the first preset rule are added into the channel point set of the grid point. The above operation is performed on each grid point in the group, and a channel point set of each grid point in the group is obtained. The channel point set of any grid point is composed of all channel points in the subgroup, the relation between which and the grid point can meet a first preset rule.
Here, the first preset rule is a standard predefined for a relationship between a grid point and a channel point in the same group, and the first preset rule may define a distance between the grid point and the channel point, and may also define a distance or an included angle between a connection line formed by the grid point and the channel point and another channel point in the same group, where the definition may be a preset interval range, and may also be a maximum value or a minimum value, and this is not specifically defined in the embodiment of the present invention.
And 140, selecting the grid point to be matched of the subgroup from all the grid points of the subgroup based on the size of the channel point set of each grid point in the subgroup.
Specifically, the grid point to be matched is a grid point selected from the small group based on the size of the channel point set of each grid point in the small group. Here, the size of the channel point set of the grid points is taken as a selection basis, which may be to select the grid point with the largest channel point set, or to randomly select one grid point from the grid points with the channel point set larger than a preset number of channel points, and the like.
And 150, regarding all the subgroups, if the relation between the grid points to be matched of every two subgroups meets a second preset condition, taking the grid points to be matched of every subgroup as non-interference points.
Specifically, after obtaining the grid points to be matched of each group, combining the groups in pairs, judging whether the relationship between the grid points to be matched of each two groups can meet a second preset condition, if the relationship between the grid points to be matched of each two groups can meet the second preset condition, confirming that the grid points to be matched of all the groups can meet the requirement of an interference-free point, and taking the grid points to be matched of each group as an interference-free point to obtain the interference-free points of the groups. It should be noted that, only when all the subgroups are combined pairwise and all the subgroups meet the second preset condition, the grid point to be matched of each subgroup is taken as an interference-free point.
Here, the second preset rule is a standard predefined for a relationship between grid points to be matched in any two subgroups, and the second preset rule may define a distance between a grid point to be matched in any one subgroup and a grid point to be matched in another subgroup, a distance or an included angle between a connection line formed by the grid point to be matched and a channel point in any one subgroup and a grid point to be matched in another subgroup, or a number of channel points in any one subgroup that can satisfy the above definition. The limitation may be a preset interval range, or may be a maximum value or a minimum value, and this is not specifically limited in the embodiment of the present invention.
The non-interference point selection method provided by the embodiment of the invention selects the grid points to be matched based on the grid point matrix of each group, determines the non-interference points of each group through the grid points to be matched of every two groups, realizes the automatic selection of the non-interference points of the optical switch, improves the selection rate and the accuracy of the non-interference points, and provides conditions for the optical switch to realize the high-efficiency and accurate non-interference channel switching.
Based on the above embodiment, the first preset rule includes at least one of a first two-point distance rule, a first included angle rule, and a first dot-line distance rule.
Here, the first two-point distance rule, the first included angle rule, and the first dot-line distance rule are set for a relationship between any grid point in any one of the groups and any channel point in the group, and the first preset rule may be only one of the first two-point distance rule, the first included angle rule, and the first dot-line distance rule, and may further include any two or three of the rules.
The first two-point rule is used for limiting the distance between any grid point in any one group and any channel point in the group, and if the distance between any grid point in any one group and any channel point in the group is larger than a first preset two-point distance, the relation between the grid point and the channel point is confirmed to meet the first two-point distance rule; otherwise, the relationship between the grid point and the channel point does not satisfy the first two-point distance rule. Here, too large distance between the first preset two points may result in that no interference point can be found, and too small distance may not ensure that no interference exists between the channel point and the grid point, so that the distance between the first preset two points needs to be set according to actual requirements.
Taking group K as an example, grid points P in group KijDistance relation matrix D with all channel points in subgroup Kk_ijAs follows:
Dk_ij=[DR1,DR2,...,DRi,...,DRl];
in the formula, DRiIndicates the ith channel point Ch in the subgroup Kk_iAnd grid point PijWhether the relationship between satisfies the first two-point distance rule, i.e., DRiDenotes Chk_iAnd PijWhether the distance between the two points is greater than the first preset two-point distance Dis _ lim.
If DRi1, then denotes Chk_iAnd PijThe relationship between satisfies the first two-point distance rule, Chk_iAnd PijThe distance between them is greater than Dis _ lim, the formula is as follows:
(Unit×i+Xk_min-Xk_i)2+(Unit×j+Yk_min-Yk_i)2≥Dis_lim2
if DRiWhen equal to 0, it represents Chk_iAnd PijThe relationship between does not satisfy the first two-point distance rule, Chk_iAnd PijThe distance between the two is less than or equal to Dis _ lim, and the formula is as follows:
(Unit×i+Xk_min-Xk_i)2+(Unit×j+Yk_min-Yk_i)2≤Dis_lim2
the first included angle rule is used for limiting an included angle which is formed by any channel point in any one group and each channel point in the rest of the group and takes any grid point as a vertex, and if the included angle which is formed by any channel point and each channel point in the rest of the group and takes the grid point as the vertex is larger than a first preset angle, the relation between the grid point and the channel point is confirmed to meet the first included angle rule; otherwise, the relation between the grid point and the channel point does not satisfy the first angle rule. Here, the first preset angle is too large, which may result in that no interference point can be found, and the first preset angle is too small, which may not ensure that no interference exists between the channel point and the grid point, so the first preset angle needs to be set according to actual requirements.
Taking group K as an example, grid points P in group KijAngle relation matrix A with all channel points in subgroup Kk_ijAs follows:
Figure BDA0001846099750000071
in the formula, ARijIndicates the ith channel point Ch in the subgroup Kk_iAnd the jth channel point Chk_jFormed with grid points PijIs whether the included angle of the vertex is larger than a first preset angle Ang _ lim.
If ARij1, then denotes Chk_iAnd Chk_jFormed with PijFor the included angle of the vertex greater than Ang _ lim, the formula is as follows:
Figure BDA0001846099750000072
if ARijWhen equal to 0, it represents Chk_iAnd Chk_jFormed with PijThe included angle of the vertexes is less than or equal to Ang _ lim, and the formula is as follows:
Figure BDA0001846099750000073
in the formula, DisijIs Chk_iAnd Chk_jDistance between, DisChi_PijIs Chk_iAnd PijDistance between, DisChj_PijIs Chk_jAnd PijThe distance between them.
Grid point PijAngle relation matrix A with all channel points in subgroup Kk_ijMedium, if channel point Chk_iCorresponding one line [ ARi1ARi2... ARil]In addition to ARiiWhen all the other bits are 1, confirming the channel point Ch in the subgroup Kk_iWith each of the other channel points forming a grid point PijThe included angles of the vertexes are all larger than a first preset angle, PijAnd Chk_iThe relationship between them satisfies the first angle rule.
The first point-line distance rule is used for limiting the distance from any channel point in any one group to the connecting line between each other channel point in the group and the grid point, and if the distance from any channel point to the connecting line between each other channel point in the group and the grid point is larger than a first preset point-line distance, the relation between the grid point and the channel point is confirmed to meet the first point-line distance rule; otherwise, the relationship between the grid point and the channel point does not satisfy the first dot-line distance rule. Here, too large distance of the first preset dot line may result in that no interference point can be found, and too small distance easily causes light leakage, so that the distance of the first preset dot line needs to be set according to actual requirements.
Taking group K as an example, grid points P in group KijDot-line matrix D L with all channel points in subgroup Kk_ijAs follows:
Figure BDA0001846099750000081
in the formula, D L RijIndicates the ith channel point Ch in the subgroup Kk_iTo the jth channel point Chk_jAnd a grid point PijWhether the distance of the connecting line between is greater than the first Dot line distance Dot _ L ine _ lim.
If D L Rij1, then denotes Chk_iTo Chk_jAnd PijDistance Dis of the connecting line therebetweenChi_ChjPijGreater than Dot _ L ine _ lim Ang _ lim, the formula is as follows:
DisChi_ChjPij>Dot_Line_lim;
if D L RijWhen equal to 0, it represents Chk_iTo Chk_jAnd PijDistance Dis of the connecting line therebetweenChi_ChjPijDot _ L ine _ lim Ang _ lim or less, as shown in the following formula:
DisChi_ChjPij≤Dot_Line_lim。
grid point PijDot-line matrix D L with all channel points in subgroup Kk_ijMedium, if channel point Chk_iCorresponding one row [ D L Ri1DLRi2...DLRil]In addition to D L RiiWhen all the other bits are 1, confirming the channel point Ch in the subgroup Kk_iTo each of the other channel points and grid points PijAre all greater than a first point distance, PijAnd Chk_iThe relationship between satisfies the first dot line distance rule.
Based on any of the above embodiments, step 130 specifically includes: and if the relationship between any grid point in any group and any channel point in the group meets a first two-point distance rule, a first included angle rule and a first point-line distance rule, confirming that the relationship between the grid point and the channel point meets a first preset rule, and adding the channel point into the channel point set of the grid point.
Specifically, the first preset rule includes a first two-point distance rule, a first included angle rule and a first point-line distance rule, and if and only if the relationship between any grid point and any channel point in any one group simultaneously satisfies three rules of the first preset rule, it is determined that the relationship between the grid point and the channel point satisfies the first preset rule, and the channel point is added to the channel point set of the grid point.
Based on any of the above embodiments, step 140 specifically includes: and arranging each grid point in any group according to the sequence of the channel point set from large to small, constructing a grid point sequence, and selecting the grid point arranged at the head of the grid point sequence as the grid point to be matched of the group.
Specifically, the grid point to be matched is a grid point with the largest channel point set selected from the small group based on the size of the channel point set of each grid point in the small group. Here, the size of the channel point set is the number of channel points included in the channel point set.
Taking the group K as an example, establishing a channel point set matrix CG of each grid point in the group Kk. At the matrix CGkAnd the distance between each grid point and the channel point in the corresponding channel point set meets a first two-point distance rule, the included angle between each two channel points in the channel point set and the channel point taking the grid point as the vertex meets a first included angle rule, and the distance between each channel point in the channel point set and the connecting line of the grid point and other channel points meets the first point-line distance rule. Channel point aggregation matrix CGkAs follows:
Figure BDA0001846099750000091
in the formula, CGijIs a grid point PijSet of channel points.
Gathering channel points into a matrix CGkThe channel point sets corresponding to each grid point in the grid point sequence are sequenced according to the order of the number of the channel points from more to less to obtain a grid point sequence CG _ Sortk
CG_Sortk={Pmax,...,Pmin};
In the formula, PmaxFor the grid point with the largest set of channel points in the subgroup K, i.e. the subgroup K to be matchedGrid points.
Based on any of the above embodiments, step 150 specifically includes:
and 151, for all the subgroups, in any two subgroups, if the relationship between the grid points to be matched of the two subgroups and any channel point in the channel point sets of the grid points to be matched meets a second combination rule, adding the channel point into the combined channel point set of the two subgroups.
Specifically, all the subgroups are combined pairwise, and whether the relationship between the grid points to be matched of each two subgroups can meet a second preset condition or not is judged according to the combination of any two subgroups. Here, the second preset rule includes a second combination rule in step 151, that is, a relationship between each two subgroups of grid points to be matched and any one channel point in the set of channel points thereof is defined. Let any two subgroups be subgroup A and subgroup B, whose grid points to be matched are Pmax_AAnd Pmax_BGrid point P to be matched of subgroup Amax_AIs Ch as any channel point in the channel point setA_xGrid point P to be matched of subgroup Bmax_BIs Ch as any channel point in the channel point setB_xIf the grid points P to be matched of the group A and the group B are the samemax_AAnd Pmax_BAnd channel point ChA_xSatisfy the second combination rule, the channel point Ch is setA_xAdding the channel points into the combined channel point set of the group A and the group B; if the grid points P to be matched of the group A and the group Bmax_AAnd Pmax_BAnd channel point ChB_xSatisfy the second combination rule, the channel point Ch is setB_xAdd to the combined channel point set of panel a and panel B.
Here, the second combination rule is a standard which is formulated in advance for a relationship between grid points to be matched in any two subgroups and any one channel point in the channel point set thereof, and the second combination rule may define a distance and/or an included angle between a connection line formed by the grid points to be matched and the channel points in any one subgroup and the grid points to be matched in another subgroup, where the definition may be a preset interval range, and may also be a maximum value or a minimum value, which is not specifically defined in the embodiment of the present invention.
152, if the number of the channel points in the combined channel point set of each two subgroups is greater than or equal to the preset number, taking the grid point to be matched of each subgroup as an interference-free point.
Specifically, after every two subgroups of combined channel point sets are obtained, the number of channel points in each combined channel point set is compared with a preset number, and if and only if the number of channel points in each two subgroups of combined channel point sets is greater than or equal to the preset number, the grid points to be matched of each subgroup are used as non-interference points.
Based on any of the above embodiments, step 151 specifically includes: for all the subgroups, in any two subgroups, if the distance from a connecting line between the grid point to be matched of any subgroup and any channel point in the channel point set of the grid point to be matched to the grid point to be matched of another subgroup is greater than a second preset distance, and an included angle formed by the channel point and the grid point to be matched of another subgroup with the grid point to be matched of the subgroup as a vertex is greater than a second preset angle, adding the channel point to the combined channel point set of the two subgroups.
Specifically, the following distinction is made by a group a and a group B, where the group a is either one and the group B is the other. Suppose the grid points to be matched of the subgroup A and the subgroup B are respectively Pmax_AAnd Pmax_BGrid point P to be matched of subgroup Amax_AIs Ch as any channel point in the channel point setA_xGrid point P to be matched of subgroup Amax_AAnd channel point ChA_xThe connecting line between is L inePmax_A-CHA_xIf the grid point P to be matched of the subgroup Bmax_BTo line L inePmax_A-CHA_xIs greater than a second predetermined distance and is determined by the channel point ChA_xWith the grid point P to be matched of subgroup Bmax_BFormed grid points P to be matched in small groups Amax_AIf the included angle of the vertex is larger than a second preset angle, the channel point Ch is setA_xAdd to the combined channel point set of panel a and panel B.
Based on any of the above embodiments, after step 140, the method further includes: for all the subgroups, if the relation between the grid points to be matched of any two subgroups does not meet the second preset condition, updating the grid point to be matched of any one subgroup of any two subgroups to be the next grid point of the grid points to be matched in the grid point sequence of the subgroup.
Specifically, after the grid points to be matched of each group are obtained in step 140, all the groups are combined two by two, and whether each combination meets the second preset condition is respectively determined. And if the relation between the grid points to be matched of any two subgroups does not meet the second preset condition, updating the grid points to be matched of any one subgroup. The original grid point to be matched is the grid point sequence CG _ Sort from the small groupkThe updated grid point to be matched is the next position of the original grid point to be matched in the grid point sequence, namely the updated grid point to be matched is the grid point with the largest corresponding channel point set except the original grid point to be matched in the group.
And after the updating of the grid points to be matched is completed, executing the step 150 to obtain the non-interference points.
In order to better understand and apply a method for selecting a non-interference point for an optical switch, which is proposed by the present invention, the present invention is exemplified below, and the present invention is not limited to the following examples.
The channel points of the optical switch are divided into several sub-groups 201. In this example, the optical switch is a 1 × 16 optical switch, fig. 2 is a schematic diagram of grouping the channel points of the optical switch provided in the embodiment of the present invention, and as shown in fig. 2, the 16 channel points of the optical switch are divided into two sub-groups, i.e., a sub-group a and a sub-group B.
202, establishing grid point matrixes for the subgroup a and the subgroup B, respectively fig. 3 is a schematic diagram of a grid point matrix provided by the embodiment of the invention, and as shown in fig. 3, establishing 5 × 7 a grid point matrix G based on the channel points in the subgroup aAEstablishing a grid point matrix G of 6 × 7 based on the channel points in the subgroup BB
203, grid point matrix G for subgroup AATo any of the channel points Ch in the subgroup A and the grid pointA_iWhether the relation between the two points satisfies a first two-point distance rule, a first included angle rule and a first point-line distance rule or not, if so, the channel point Ch is determinedA_iJoin the set of channel points for that grid point. And sequentially judging the relation between the grid point and each channel point in the group A until the maximum channel point set of the grid point is obtained.
Obtaining the group A grid point matrix G according to the methodAIs selected for each grid point in the set of channel points.
204, arranging each grid point in the subgroup A according to the descending order of the channel point set, and constructing a grid point sequence CG _ SortASelecting a grid point sequence CG _ SortAThe first grid point is used as the grid point P to be matched of the subgroup Amax_A°
In addition, the small group B grid point matrix G is obtained according to the methodBThen the grid point sequence CG _ Sort of the subgroup B is obtainedBAnd the grid point P to be matchedmax_B
205, combining the group A and the group B, if the grid point P to be matched of the group Amax_AAnd any channel point Ch in subgroup AA_xConnecting the grid point P to be matched with the group Bmax_BIs greater than a second predetermined distance and is determined by the channel point ChA_xWith the grid point P to be matched of subgroup Bmax_BFormed grid points P to be matched in small groups Amax_AIf the included angle of the vertex is larger than a second preset angle, the channel point Ch is setA_xAdd to the combined channel point set of panel a and panel B. Successively substituting each channel point in subgroup A into ChA_xAnd (6) judging.
If the grid point P to be matched of the subgroup Bmax_BAnd any channel point Ch in subgroup BB_xConnecting the lines to the grid points P to be matched of the subgroup Amax_AIs greater than a second predetermined distance and is determined by the channel point ChB_xWith the grid point P to be matched of subgroup Amax_AFormed grid points P to be matched in subgroup Bmax_BIf the included angle of the vertex is larger than a second preset angle, the channel point Ch is setB_xAdd to the combined channel point set of panel a and panel B. Successively substituting each channel point in subgroup B into ChB_xAnd (6) judging.
206, fig. 4 is a schematic diagram of selecting a non-interference point according to an embodiment of the present invention, and referring to fig. 4, if the number of channel points in the combined channel point set of the group a and the group B is greater than or equal to a predetermined number, P is determinedmax_AAnd Pmax_BAs a non-interference point. In this example, the preset number is 10.
If the number of the channel points in the combined channel point set of the group A and the group B is less than the preset number, updating the matched grid points of the group A into a grid point sequence CG _ SortAMiddle Pmax_AOr update the matching grid point of the subgroup B to the grid point sequence CG _ SortBMiddle Pmax_BNext bit and step 205 is re-executed.
The non-interference point selection method provided by the example selects the grid points to be matched based on the grid point matrix of each group, determines the non-interference points of each group through the grid points to be matched of every two groups, realizes the automatic selection of the non-interference points of the optical switch, improves the selection rate and the accuracy of the non-interference points, and provides conditions for the optical switch to realize the high-efficiency and accurate non-interference channel switching.
Based on any of the above method embodiments, fig. 5 is a schematic structural diagram of the non-interference point selection apparatus for an optical switch according to an embodiment of the present invention, and as shown in fig. 5, the non-interference point selection apparatus for an optical switch includes a grouping unit 510, a grid unit 520, a grouping selection unit 530, a point-to-be-matched selection unit 540, and a matching selection unit 550.
The grouping unit 510 is configured to divide the channel points of the optical switch into a plurality of subgroups;
the grid unit 520 is configured to establish, for any one group, a grid point matrix of the group, where the grid point matrix is formed by a plurality of grid points;
the grouping selection unit 530 is configured to add a channel point to a channel point set of the grid point if a relationship between any grid point in the group and any channel point in the group satisfies a first preset rule;
the to-be-matched point selecting unit 540 is configured to select a to-be-matched grid point of the group from all grid points of the group based on the size of the channel point set of each grid point in the group;
the matching selection unit 550 is configured to, for all the subgroups, if a relationship between the grid points to be matched of each two subgroups satisfies a second preset condition, take the grid points to be matched of each subgroup as an interference-free point.
The non-interference point selection device provided by the embodiment of the invention selects the grid points to be matched based on the grid point matrix of each group, determines the non-interference points of each group through the grid points to be matched of every two groups, realizes the automatic selection of the non-interference points of the optical switch, improves the selection rate and the accuracy of the non-interference points, and provides conditions for the optical switch to realize the high-efficiency and accurate non-interference channel switching.
Based on any of the above embodiments, the first preset rule includes at least one of a first two-point distance rule, a first included angle rule, and a first point-line distance rule;
correspondingly, for any grid point in any subgroup and any channel point in that subgroup:
if the distance between any grid point in the group and any channel point in the group is greater than the first preset two-point distance, determining that the relationship between the grid point and the channel point meets a first two-point distance rule;
if the included angle formed by the channel point and each channel point in the group by taking the grid point as the vertex is larger than a first preset angle, determining that the relation between the grid point and the channel point meets a first included angle rule;
and if the distance from the channel point to the connecting line between each of the rest channel points in the group and the grid point is greater than the first preset point-line distance, determining that the relation between the grid point and the channel point meets the first point-line distance rule.
Based on any of the above embodiments, the grouping selection unit 530 is specifically configured to:
and if the relationship between any grid point in the group and any channel point in the group meets a first two-point distance rule, a first included angle rule and a first point-line distance rule, confirming that the relationship between the grid point and the channel point meets a first preset rule, and adding the channel point into the channel point set of the grid point.
Based on any of the above embodiments, the to-be-matched point selecting unit 540 is specifically configured to:
and arranging each grid point in the group according to the descending order of the channel point set, constructing a grid point sequence, and selecting the grid point arranged at the head of the grid point sequence as the grid point to be matched of the group.
Based on any of the above embodiments, the matching selection unit 550 specifically includes a combination set subunit and a set judgment subunit;
the combined set subunit is used for aiming at all the subgroups and any two subgroups, and if the relationship between the grid points to be matched of the two subgroups and any channel point in the channel point sets meets a second combination rule, the channel point is added into the combined channel point set of the two subgroups;
and the set judgment subunit is used for taking the grid points to be matched of each group as non-interference points if the number of the channel points in the combined channel point set of each two groups is greater than or equal to the preset number.
Based on any of the above embodiments, the combined set subunit is specifically configured to:
for all the subgroups, in any two subgroups, if the distance from a connecting line between a grid point to be matched of any subgroup and any channel point in a channel point set thereof to a grid point to be matched of another subgroup is greater than a second preset distance, and an included angle formed by the channel point in the subgroup and the grid point to be matched of the other subgroup with the grid point to be matched of the subgroup as a vertex is greater than a second preset angle, adding the channel point to a combined channel point set of the two subgroups.
Based on any embodiment, the system further comprises an updating unit;
the updating unit is used for updating the grid point to be matched of any one of the two subgroups to the next grid point of the grid point to be matched in the grid point sequence of the subgroup if the relation between the grid points to be matched of any two subgroups does not meet a second preset condition.
Fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present invention, and as shown in fig. 6, the electronic device includes: a processor 601, a communication Interface 602, a memory 603 and a bus 604, wherein the processor 601, the communication Interface 602 and the memory 603 complete communication with each other through the bus 604. The processor 601 may call logic instructions in the memory 603 to perform methods including, for example: dividing the channel points of the optical switch into a plurality of small groups; aiming at any group, establishing a grid point matrix of the group, wherein the grid point matrix consists of a plurality of grid points; if the relationship between any grid point in the group and any channel point in the group meets a first preset rule, adding the channel point into the channel point set of the grid point; selecting a grid point to be matched of the group from all grid points of the group based on the size of the channel point set of each grid point in the group; and regarding all the subgroups, if the relation between the grid points to be matched of every two subgroups meets a second preset condition, taking the grid points to be matched of every subgroup as non-interference points.
An embodiment of the present invention discloses a computer program product, which includes a computer program stored on a non-transitory computer readable storage medium, where the computer program includes program instructions, and when the program instructions are executed by a computer, the computer can execute the method provided by the above method embodiments, for example, the method includes: dividing the channel points of the optical switch into a plurality of small groups; aiming at any group, establishing a grid point matrix of the group, wherein the grid point matrix consists of a plurality of grid points; if the relationship between any grid point in the group and any channel point in the group meets a first preset rule, adding the channel point into the channel point set of the grid point; selecting a grid point to be matched of the group from all grid points of the group based on the size of the channel point set of each grid point in the group; and regarding all the subgroups, if the relation between the grid points to be matched of every two subgroups meets a second preset condition, taking the grid points to be matched of every subgroup as non-interference points.
The present embodiments provide a non-transitory computer-readable storage medium storing computer instructions that cause a computer to perform the methods provided by the above method embodiments, for example, including: dividing the channel points of the optical switch into a plurality of small groups; aiming at any group, establishing a grid point matrix of the group, wherein the grid point matrix consists of a plurality of grid points; if the relationship between any grid point in the group and any channel point in the group meets a first preset rule, adding the channel point into the channel point set of the grid point; selecting a grid point to be matched of the group from all grid points of the group based on the size of the channel point set of each grid point in the group; and regarding all the subgroups, if the relation between the grid points to be matched of every two subgroups meets a second preset condition, taking the grid points to be matched of every subgroup as non-interference points.
Those of ordinary skill in the art will understand that: all or part of the steps for implementing the method embodiments may be implemented by hardware related to program instructions, and the program may be stored in a computer readable storage medium, and when executed, the program performs the steps including the method embodiments; and the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.
The above-described embodiments of the communication device and the like are merely illustrative, and units illustrated as separate components may or may not be physically separate, and components displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium, such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods of the various embodiments or some parts of the embodiments.
Finally, it should be noted that: the above embodiments are only used for illustrating the technical solutions of the embodiments of the present invention, and are not limited thereto; although embodiments of the present invention have been described in detail with reference to the foregoing embodiments, those skilled in the art will understand that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.

Claims (9)

1. A method of clear point selection for an optical switch, comprising:
dividing the channel points of the optical switch into a plurality of small groups;
aiming at any group, establishing a grid point matrix of the group, wherein the grid point matrix is composed of a plurality of grid points;
if the relationship between any grid point in any group and any channel point in any group meets a first preset rule, adding any channel point into a channel point set of any grid point;
selecting grid points to be matched of any subgroup from all the grid points of any subgroup based on the size of the channel point set of each grid point in any subgroup;
for all the subgroups, if the relation between the grid points to be matched of every two subgroups meets a second preset condition, taking the grid points to be matched of every subgroup as non-interference points;
the first preset rule is a standard which is preset aiming at the relation between grid points and channel points in the same group, and is used for limiting at least one of the distance between the grid points and the channel points and the distance and included angle between a connecting line formed by the grid points and the channel points and other channel points in the same group;
the second preset condition is a standard which is preset for the relationship between the grid points to be matched in any two groups, and is used for limiting at least one of the distance between the grid points to be matched in any one group and the grid points to be matched in another group, and the distance and included angle between a connecting line formed by the grid points to be matched in any one group and the channel points and the grid points to be matched in another group.
2. The method of claim 1, wherein the first predetermined rule comprises at least one of a first two-point distance rule, a first angle rule, and a first dot-line distance rule;
correspondingly, for any one of the grid points in any subgroup and any one of the channel points in the any subgroup:
if the distance between any grid point in any group and any channel point in any group is greater than a first preset two-point distance, determining that the relationship between any grid point and any channel point meets the first two-point distance rule;
if the included angle formed by any channel point and each of the rest channel points in any group and taking any grid point as a vertex is larger than a first preset angle, determining that the relationship between any grid point and any channel point meets the first included angle rule;
and if the distance from any channel point to the connecting line between each of the rest channel points in any group and any grid point is greater than a first preset point-line distance, determining that the relationship between any grid point and any channel point meets the first point-line distance rule.
3. The method according to claim 2, wherein the adding any channel point to the set of channel points of any grid point if a relationship between any grid point in any subgroup and any channel point in any subgroup satisfies a first preset rule specifically includes:
if the relationship between any grid point in any group and any channel point in any group meets the first two-point distance rule, the first included angle rule and the first point-line distance rule, determining that the relationship between any grid point and any channel point meets a first preset rule, and adding any channel point into the channel point set of any grid point.
4. The method according to claim 1, wherein the selecting grid points to be matched of any subgroup from all the grid points of any subgroup based on a size of a set of channel points of each grid point of the any subgroup comprises:
and arranging each grid point in any group according to the descending order of the channel point set, constructing a grid point sequence, and selecting the grid point arranged at the head of the grid point sequence as the grid point to be matched of any group.
5. The method according to claim 1, wherein, for all the subgroups, if a relationship between the grid points to be matched of every two subgroups satisfies a second preset condition, the taking the grid points to be matched of each subgroup as an interference-free point specifically includes:
for all the subgroups, in any two subgroups, if the relationship between the grid points to be matched of any two subgroups and any one of the channel points in the channel point sets meets a second combination rule, adding any one of the channel points into a combined channel point set of any two subgroups;
if the number of the channel points in the combined channel point set of each two subgroups is greater than or equal to a preset number, taking the grid points to be matched of each subgroup as non-interference points;
for all the subgroups, in any two subgroups, if a relationship between the grid points to be matched of any two subgroups and any one of the channel points in the channel point sets thereof satisfies a second combination rule, adding any one of the channel points to a combined channel point set of any two subgroups, specifically including:
for all the subgroups, in any two subgroups, if a distance from a connecting line between the grid point to be matched of any one subgroup and any one of the channel point sets thereof to the grid point to be matched of another subgroup is greater than a second preset distance, and an included angle formed by the grid point to be matched of any one subgroup and the grid point to be matched of another subgroup with the grid point to be matched of any one subgroup as a vertex is greater than a second preset angle, adding any one channel point to a combined channel point set of any two subgroups.
6. The method of claim 4, wherein the selecting grid points to be matched of any subgroup from all the grid points of the any subgroup based on a size of the set of channel points of each grid point of the any subgroup, further comprises:
for all the subgroups, if the relationship between the grid points to be matched of any two subgroups does not satisfy a second preset condition, updating the grid point to be matched of any one subgroup of the two subgroups to be a next grid point of the grid points to be matched in the grid point sequence of any one subgroup.
7. A clear point selection device for an optical switch, comprising:
the grouping unit is used for dividing the channel points of the optical switch into a plurality of subgroups;
the grid unit is used for establishing a grid point matrix of any group aiming at any group, and the grid point matrix is composed of a plurality of grid points;
a grouping selection unit, configured to add any one channel point to a channel point set of any one grid point if a relationship between any one grid point in any one group and any one channel point in any one group satisfies a first preset rule;
a to-be-matched point selecting unit, configured to select a to-be-matched grid point of any one subgroup from all the grid points of the any subgroup based on a size of a channel point set of each grid point in the any subgroup;
the matching selection unit is used for aiming at all the subgroups, and if the relation between the grid points to be matched of every two subgroups meets a second preset condition, the grid points to be matched of every subgroup are used as non-interference points;
the first preset rule is a standard which is preset aiming at the relation between grid points and channel points in the same group, and is used for limiting at least one of the distance between the grid points and the channel points and the distance and included angle between a connecting line formed by the grid points and the channel points and other channel points in the same group;
the second preset condition is a standard which is preset for the relationship between the grid points to be matched in any two groups, and is used for limiting at least one of the distance between the grid points to be matched in any one group and the grid points to be matched in another group, and the distance and included angle between a connecting line formed by the grid points to be matched in any one group and the channel points and the grid points to be matched in another group.
8. An electronic device comprising a processor, a communication interface, a memory and a bus, wherein the processor, the communication interface and the memory communicate with each other via the bus, and the processor can call logic instructions in the memory to execute the glitch-free selection method for the optical switch according to any one of claims 1 to 6.
9. A non-transitory computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, implements the method for glitch-free selection of an optical switch according to any one of claims 1 to 6.
CN201811271545.0A 2018-10-29 2018-10-29 Non-interference point selection method and device for optical switch Active CN109547150B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811271545.0A CN109547150B (en) 2018-10-29 2018-10-29 Non-interference point selection method and device for optical switch

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811271545.0A CN109547150B (en) 2018-10-29 2018-10-29 Non-interference point selection method and device for optical switch

Publications (2)

Publication Number Publication Date
CN109547150A CN109547150A (en) 2019-03-29
CN109547150B true CN109547150B (en) 2020-07-31

Family

ID=65845960

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811271545.0A Active CN109547150B (en) 2018-10-29 2018-10-29 Non-interference point selection method and device for optical switch

Country Status (1)

Country Link
CN (1) CN109547150B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113484956B (en) * 2021-06-15 2022-12-06 昂纳信息技术(深圳)有限公司 Optical switch channel switching method, system, optical switch and storage medium

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101784930A (en) * 2007-03-26 2010-07-21 雀莱斯企业股份有限公司 Optical switch module

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5920539A (en) * 1995-01-25 1999-07-06 Discovision Associates Apparatus and method for suppression of electromagnetic emissions having a groove on an external surface for passing an electrical conductor
US7224465B2 (en) * 2002-10-15 2007-05-29 University Of Maryland Fiber tip based sensor system for measurements of pressure gradient, air particle velocity and acoustic intensity
US9124369B2 (en) * 2013-01-18 2015-09-01 Nec Laboratories America, Inc. Multi-direction variable optical transceiver

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101784930A (en) * 2007-03-26 2010-07-21 雀莱斯企业股份有限公司 Optical switch module

Also Published As

Publication number Publication date
CN109547150A (en) 2019-03-29

Similar Documents

Publication Publication Date Title
Parks et al. Selective breeding in a multiobjective genetic algorithm
CN106817288A (en) A kind of data centre network system and signal transmission system
CN110908799A (en) Communication method, device, equipment and medium in distributed training
CN109547150B (en) Non-interference point selection method and device for optical switch
CN104144475A (en) Method, access points and sites for realizing multipoint cooperative transmission
CN105022377A (en) Petri-network-based control method for automatic manufacture system
CN109474341A (en) A kind of fiber optic network and its network topological method
CN103384354A (en) Optimum design method of optical distribution network of passive optical network
CN104184613A (en) Method and apparatus for sharing passive optical network
CN106487586A (en) A kind of self-organized network topology method for building up and device
CN104579696A (en) Optical fiber switch system and optical fiber switch
CN105245283A (en) Optical separator position determination method and device
CN104618026A (en) Design method of optical fiber interconnection system
CN106054322A (en) Method for extending number of ports of wavelength selection switch
CN105681932A (en) Optical switch supporting large-scale and all-optical interconnection
CN105516830A (en) Wavelength switching-based data center optical network communication method and system
CN101753463A (en) Multichannel transmission load balancing method and device
CN106054319A (en) Wavelength selection switch adopting irregular distance output port array
CN102710431A (en) Method for automatically designing topology of business-driven transmission network
CN106055509A (en) Optical fiber communication system and configuration method of optical fiber communication
CN108235244B (en) Method and device for automatically arranging base stations in network planning simulation
CN107079205B (en) PIC type optical switch matrix routing configuration method and device
CN104618053B (en) Signal interconnection method and Base Band Unit based on WDM
CN104333875B (en) A kind of frequency method of adjustment and device
CN107995643B (en) Network element parameter prediction optimization method and device based on data driving

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