CN115208744A - Error positioning method under multi-data center node and solution thereof - Google Patents
Error positioning method under multi-data center node and solution thereof Download PDFInfo
- Publication number
- CN115208744A CN115208744A CN202110373873.7A CN202110373873A CN115208744A CN 115208744 A CN115208744 A CN 115208744A CN 202110373873 A CN202110373873 A CN 202110373873A CN 115208744 A CN115208744 A CN 115208744A
- Authority
- CN
- China
- Prior art keywords
- switch
- data center
- execute
- judgment result
- jumping
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0677—Localisation of faults
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/55—Prevention, detection or correction of errors
Abstract
The invention discloses a method for positioning errors under multiple data center nodes and a solution thereof. Network node activity information processing is used to process activity information between various data center nodes in a complex network environment. The network topology analysis algorithm is used for relevant analysis of the network topology graph. The invention provides an error positioning method under multiple data center nodes and a solution thereof, which can evaluate the current state of a data center by processing based on activity information among the data center nodes in a complex network environment and further obtain an optimal access solution path for the current uncompleted tasks and the upcoming tasks in the error data center by a network topology analysis algorithm.
Description
Technical Field
The invention relates to the technical field of network defense, in particular to a method for positioning errors under multiple data center nodes and a solution thereof.
Background
The error location method refers to a method of locating a data center in which an error occurs in a complicated network environment. It uses a specific algorithm or architecture to ensure that the data center in which the error occurred is found. The error resolution method refers to a method of providing a preferred new task access resolution path for a current uncompleted task and an upcoming task in an error data center. It uses specific algorithms to ensure that the current incomplete tasks and upcoming tasks in the wrong data center are reasonably redistributed and properly executed in a timely manner. The method provides the capability of screening wrong data centers, the capability of avoiding delaying the completion of tasks, the capability of improving the task completion quality, the capability of dynamically adjusting based on the environment and the capability of further improving the service for service providers.
Most of the existing error locating methods and solutions thereof are simple and unified solutions in most applications, such as locating network errors based on PING values and implementing a first come first served solution. In fact, in some cases, the data center positioning is failed or inaccurate and short-time congestion is caused, and a series of adverse chain reactions such as reduction of task processing efficiency are caused. Moreover, classical error location methods and solutions thereof also lack the ability to locate the data center node where the error occurred and provide a preferred error solution based on the dynamic environmental factors under multiple data center nodes. Based on the method, the invention provides a method for positioning errors under multiple data center nodes and a solution thereof.
Disclosure of Invention
The present invention is directed to a method for error location under multiple data center nodes and a solution thereof, which are proposed to solve the above technical problems, and can provide an access solution path for the current incomplete task and the upcoming task in the error data center in a complex network environment by evaluating the current state of a data center switch based on the processing of activity information between each data center node and further by a network topology analysis algorithm to obtain a preference.
In order to achieve the purpose, the invention adopts the following technical scheme:
a method for positioning errors under multiple data center nodes and a solution thereof are disclosed, the method comprises the following steps:
s1, starting an error positioning algorithm and continuing to execute the step S2;
s2, setting error positioning algorithm variables and continuing to execute the step S3;
s3, inquiring the current state of a kth switch in the qth data center, and if the judgment result is that the switch is in an open state, skipping to the step S4, and if the judgment result is that the switch is in a closed state, skipping to the step S5;
s4, assigning k to Rm, and continuing to execute the step S16;
s5, detecting the number of descending switches of a kth switch in the qth data center, if the judgment result is that only one descending switch exists, jumping to the step S6, if the judgment result is that more than one descending switch exists, jumping to the step S7, and if the judgment result is that no descending switch exists, jumping to the step S8;
s6, detecting the state of the downlink switch, and jumping to the step S9 if the judgment result is that the switch is in an open state, or jumping to the step S10 if the judgment result is that the switch is in a closed state;
s7, detecting the states of all downlink switches, and jumping to the step S15 if the judgment result is that all downlink switches are in an open state, or jumping to the step S12 if the judgment result is that the number of switches in a closed state is more than or equal to 1;
s8, assigning A [ j ] to k, setting j = j +1, and returning to execute the step S3;
s9, the downlink k +1 switch is a place where the error occurs, and the step S11 is skipped to;
s10, assigning k +1 to k, and returning to the step S3;
s11, assigning k +1 to R [ m ] and setting m = m +1, and jumping to execute the step S16;
s12, assigning the number of the nearest downlink switches to n, assigning the codes of the switches to A [ i +1], A [ i +2],. And A [ i + n ], setting j = j +1, and continuing to execute the step S13;
s13, comparing the variables i and j, if the judgment result is that the j is larger than the i, jumping to an execution step S16, and if the judgment result is that the j is smaller than or equal to the i, jumping to an execution step S14;
s14, assigning a [ j ] to k and setting j = j +1, and returning to execute step S3;
s15, assigning all the downlink exchanger numbers to Rm, and jumping to execute the step S16;
s16, stopping the error positioning algorithm, outputting an array R [ ], and jumping to execute the step S17;
s17, defining the nearest downlink exchanger of the exchanger codes in the array R as an error occurrence place, and continuously executing the step S18;
s18, removing the accessible network list from the error occurrence place, and continuing to execute the step S19;
and S19, obtaining a preferred target data center and a preferred access network based on the current resource access conditions of each data center node and the accessible network by applying a network topology analysis algorithm.
Preferably, in the steps S8 and S14, both a [ j ] is assigned to k and j = j +1 is set, but the method belongs to a different sub-process and returns to a different execution step.
The invention has the beneficial effects that:
the invention relates to an error positioning method under multiple data center nodes and a solution thereof, which can position the error occurrence place by evaluating the current state of a data center switch and applying an error positioning algorithm in a complex network environment, and further obtain an optimal access solution path for the current unfinished task and the task in the error data center by a network topology analysis algorithm. Compared with the traditional method, the method can deeply consider the state dynamic change of each exchanger in the network, effectively make the place where the error occurs, and simultaneously solve the problem of access path reconstruction.
Drawings
FIG. 1 is a block diagram structure diagram of an error location method under multiple data center nodes and a solution thereof.
Detailed Description
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 only a part of the embodiments of the present invention, and not all of the embodiments.
The invention provides a fault positioning method under multiple data center nodes and a solution thereof, as shown in figure 1, when a fault positioning algorithm is started, a fault algorithm variable is initially set, a user or a service provider can freely inquire the current state of a kth exchanger in a qth data center, if the exchanger is in an open state, a variable k is assigned to an array R [ m ], then the fault positioning algorithm is stopped and the array R [ ]isoutput, the nearest downlink exchanger of an exchanger code in the array R [ ] is defined as a fault occurrence place, an accessible network list is removed from the defined fault occurrence place, and then a preferred target data center and a preferred access network are obtained by applying a network topology analysis algorithm based on the current resource access conditions of each data center node and the accessible network; if the switch is in a closed state, detecting the number of switches descending at the kth switch in the qth data center, if the switch does not descend, assigning A [ j ] to k and setting j = j +1 and returning to continue freely inquiring the current state of the switch in the next data center, if the switch only descends, inquiring the state of the k +1 descending switch, if the k +1 switch is in an open state, defining the k +1 descending switch as an error occurrence place, assigning k +1 to R [ m ] and setting m = m +1, then stopping an error positioning algorithm and outputting an array R [ ], defining the nearest descending switch of the switch codes in the array R [ ]asthe error occurrence place, removing the defined error occurrence place from an accessible network list, then, a network topology analysis algorithm is applied to obtain an optimal target data center and an optimal access network based on the current resource access condition of each data center node and the accessible network, if a k +1 switch is in a closed state, k +1 is assigned to k and the current state of the switches in the next data center is continuously and freely inquired, if the number of downlink switches is more than one, the states of all downlink switches are detected, if the number of the switches in the closed state of all the downlink switches is more than or equal to 1, the number of the nearest downlink switches is assigned to n and the codes of the switches are respectively assigned to A [ i +1], A [ i +2], [ a ] and A [ i + n ] and j = j +1 are set, then a variable i and j are compared, if j is more than i, then an error positioning algorithm is stopped and an array R is output, and the nearest downlink switch code in the array R is defined as an error occurrence place, removing the accessible network list from the defined error occurrence place, then obtaining a preferred target data center and a preferred access network by applying a network topology analysis algorithm based on the current resource access condition of each data center node and the accessible network, if j is less than or equal to i, assigning A [ j ] to k, setting j = j +1, returning to continuously and freely inquire the current state of the switch in the next data center, if all the downstream switches are in an open state, assigning all the downstream switch numbers to R [ m ], then stopping the error positioning algorithm and outputting an array R [ ], defining the nearest downstream switch of the switch codes in the array R [ ] as the error occurrence place, removing the accessible network list from the defined error occurrence place, and then obtaining the preferred target data center and the preferred access network by applying the network topology analysis algorithm based on the current resource access condition of each data center node and the accessible network.
The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art should be able to cover the technical scope of the present invention and the equivalent alternatives or modifications according to the technical solution and the inventive concept of the present invention within the technical scope of the present invention.
Claims (2)
1. A method for positioning errors under multiple data center nodes and a solution thereof are characterized in that the method comprises the following steps:
s1, starting an error positioning algorithm and continuing to execute the step S2;
s2, setting error positioning algorithm variables and continuing to execute the step S3;
s3, inquiring the current state of a kth switch in the qth data center, and if the judgment result is that the switch is in an open state, skipping to the step S4, and if the judgment result is that the switch is in a closed state, skipping to the step S5;
s4, assigning k to Rm, and continuing to execute the step S16;
s5, detecting the number of downstream switches of a kth switch in a qth data center, if the judgment result is 'only one downstream switch', skipping to the step S6, if the judgment result is 'more than one downstream switch', skipping to the step S7, and if the judgment result is 'no downstream switch', skipping to the step S8;
s6, detecting the state of the downlink switch, and jumping to the step S9 if the judgment result is that the switch is in an open state, or jumping to the step S10 if the judgment result is that the switch is in a closed state;
s7, detecting the states of all downlink switches, and jumping to the step S15 if the judgment result is that all downlink switches are in an open state, or jumping to the step S12 if the judgment result is that the number of switches in a closed state is more than or equal to 1;
s8, assigning a [ j ] to k and setting j = j +1, and returning to execute step S3;
s9, the downlink k +1 switch is a place where the error occurs, and the step S11 is skipped to;
s10, assigning k +1 to k, and returning to the step S3;
s11, assigning k +1 to R [ m ] and setting m = m +1, and jumping to execute the step S16;
s12, assigning the number of the nearest downlink switches to n, assigning the codes of the switches to A [ i +1], A [ i +2],. And A [ i + n ], setting j = j +1, and continuing to execute the step S13;
s13, comparing the variables i and j, if the judgment result is that the j is larger than the i, jumping to an execution step S16, and if the judgment result is that the j is smaller than or equal to the i, jumping to an execution step S14;
s14, assigning a [ j ] to k and setting j = j +1, and returning to execute step S3;
s15, assigning all the downlink exchanger numbers to Rm, and jumping to execute the step S16;
s16, stopping the error positioning algorithm, outputting an array R [ ], and jumping to execute the step S17;
s17, defining the nearest downlink switch of the switch codes in the array R as an error occurrence place, and continuing to execute the step S18;
s18, removing the accessible network list from the error occurrence place, and continuing to execute the step S19;
and S19, obtaining a preferred target data center and a preferred access network based on the current resource access conditions of each data center node and the accessible network by applying a network topology analysis algorithm.
2. The method as claimed in claim 1, wherein in each of the steps S8 and S14, a [ j ] is assigned to k and j = j +1, but the sub-processes are subordinate to different sub-processes and return to different execution steps.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110373873.7A CN115208744B (en) | 2021-04-09 | 2021-04-09 | Error positioning method under multiple data center nodes and solving method thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110373873.7A CN115208744B (en) | 2021-04-09 | 2021-04-09 | Error positioning method under multiple data center nodes and solving method thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115208744A true CN115208744A (en) | 2022-10-18 |
| CN115208744B CN115208744B (en) | 2023-09-26 |
Family
ID=83570315
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110373873.7A Active CN115208744B (en) | 2021-04-09 | 2021-04-09 | Error positioning method under multiple data center nodes and solving method thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115208744B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5392328A (en) * | 1993-02-04 | 1995-02-21 | Bell Communications Research, Inc. | System and method for automatically detecting root causes of switching connection failures in a telephone network |
| CN102480500A (en) * | 2010-11-26 | 2012-05-30 | 黑龙江亿林网络技术服务有限公司 | Distributed harmful information management system and method |
| US20160359982A1 (en) * | 2015-06-08 | 2016-12-08 | Quanta Computer Inc. | Server link state detection and notification |
| CN110601888A (en) * | 2019-09-10 | 2019-12-20 | 清华大学 | Deterministic fault detection and positioning method and system in time-sensitive network |
-
2021
- 2021-04-09 CN CN202110373873.7A patent/CN115208744B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5392328A (en) * | 1993-02-04 | 1995-02-21 | Bell Communications Research, Inc. | System and method for automatically detecting root causes of switching connection failures in a telephone network |
| CN102480500A (en) * | 2010-11-26 | 2012-05-30 | 黑龙江亿林网络技术服务有限公司 | Distributed harmful information management system and method |
| US20160359982A1 (en) * | 2015-06-08 | 2016-12-08 | Quanta Computer Inc. | Server link state detection and notification |
| CN110601888A (en) * | 2019-09-10 | 2019-12-20 | 清华大学 | Deterministic fault detection and positioning method and system in time-sensitive network |
Non-Patent Citations (1)
| Title |
|---|
| 刘阳;杜文良;: "高速公路机电设备运维数据采集系统研究", 西部交通科技, no. 01 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115208744B (en) | 2023-09-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP2003050988A5 (en) | ||
| US9503919B2 (en) | Wireless communication network using multiple key performance indicators and deviations therefrom | |
| CN109710511B (en) | AB test method, device, server and storage medium | |
| Zhang et al. | Optimal cooperative sensing scheduling for energy-efficient cognitive radio networks | |
| US5724263A (en) | Automatic temporospatial pattern analysis and prediction in a telecommunications network using rule induction | |
| Liu et al. | Firm real-time system scheduling based on a novel QoS constraint | |
| CN113220483A (en) | Switching method and system for block chain consensus main node | |
| CN112020098B (en) | Load balancing method, device, computing equipment and computer storage medium | |
| CN100461707C (en) | Method and system for realizing automatic detection for simple network managing protocol agent | |
| US20160014617A1 (en) | Wireless Communication Network Performance and Robustness Tuning and Optimization Using Deviations in Multiple Key Performance Indicators | |
| Alhammadi et al. | Fuzzy logic based negotiation approach for spectrum handoff in cognitive radio network | |
| CN115208744A (en) | Error positioning method under multi-data center node and solution thereof | |
| Nunes et al. | State of the art on microservices autoscaling: An overview | |
| CN101199162A (en) | Binary class based control | |
| CN117527479A (en) | Soft bus networking connection method, device, equipment and storage medium | |
| CN116860789A (en) | Data distribution optimization method and distributed database system | |
| Elattar et al. | Reliable multipath communication approach for internet-based cyber-physical systems | |
| CN111654401B (en) | Network segment switching method, device, terminal and storage medium of monitoring system | |
| WO2022152967A1 (en) | Analyzing operation of communications network | |
| CN113935472A (en) | Model scheduling processing method, device, equipment and storage medium | |
| CN114327925A (en) | Power data real-time calculation scheduling optimization method and system | |
| CN112925831A (en) | Big data mining method and big data mining service system based on cloud computing service | |
| CN110674042A (en) | Concurrency performance testing method and device | |
| KR101073495B1 (en) | A Method of Dynamic Adaptation for Services on SOA | |
| Ploennigs et al. | Diagnosis and consulting for control network performance engineering of CSMA-based networks |
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 |