CN115208744B - Error positioning method under multiple data center nodes and solving method thereof - Google Patents

Error positioning method under multiple data center nodes and solving method thereof Download PDF

Info

Publication number
CN115208744B
CN115208744B CN202110373873.7A CN202110373873A CN115208744B CN 115208744 B CN115208744 B CN 115208744B CN 202110373873 A CN202110373873 A CN 202110373873A CN 115208744 B CN115208744 B CN 115208744B
Authority
CN
China
Prior art keywords
switch
jumping
data center
error
judging result
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
CN202110373873.7A
Other languages
Chinese (zh)
Other versions
CN115208744A (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.)
Hlj E Link Network Corp ltd
Original Assignee
Hlj E Link Network Corp 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 Hlj E Link Network Corp ltd filed Critical Hlj E Link Network Corp ltd
Priority to CN202110373873.7A priority Critical patent/CN115208744B/en
Publication of CN115208744A publication Critical patent/CN115208744A/en
Application granted granted Critical
Publication of CN115208744B publication Critical patent/CN115208744B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06Management of faults, events, alarms or notifications
    • H04L41/0677Localisation of faults
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12Discovery or management of network topologies
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/55Prevention, detection or correction of errors

Landscapes

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

Abstract

The invention discloses a method for positioning errors under multiple data center nodes and a solution method 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 method thereof, which can evaluate the current state of a data center through processing activity information among the data center nodes in a complex network environment and further obtain a preferred access solution path for the current incomplete task and the future task in the error data center through a network topology analysis algorithm.

Description

Error positioning method under multiple data center nodes and solving method thereof
Technical Field
The invention relates to the technical field of network defense, in particular to a multi-data center node error positioning method and a solution method thereof.
Background
Error localization methods refer to methods of locating data centers where errors occur in a complex network environment. Which uses a specific algorithm or architecture to ensure that the data center where the error occurred is found. Error resolution refers to a method of providing a preferred new task access resolution path for currently unfinished tasks and upcoming tasks in an error data center. It uses specific algorithms to ensure that the currently incomplete tasks and the upcoming tasks in the error data center are reasonably reassigned and properly executed in a timely manner. The method provides the service provider with the capability of screening the error data center, the capability of avoiding delay of completing the task, 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.
The existing error locating method and the existing error locating solution are mostly simple and single schemes in most applications, for example, network errors are located according to PING values and a first come first go solution is implemented. In fact, in some cases, a series of adverse chain reactions such as failure or inaccuracy of positioning of the data center, short-time congestion and reduced task processing efficiency are caused. Also classical error localization methods and their solutions lack the ability to localize the data center node where the error occurred and to provide a preferred error solution based on dynamic environmental factors under the data center node. Based on the above, the invention provides a method for positioning errors under a multi-data center node and a solution method thereof.
Disclosure of Invention
The present invention is directed to a method for locating errors under multiple data center nodes and a solution thereof, which are proposed to solve the above technical problems, and can evaluate the current state of a data center switch by processing activity information among the data center nodes in a complex network environment and further obtain a preferred access solution path for the current incomplete tasks and the upcoming tasks in the error data center by a network topology analysis algorithm.
In order to achieve the above purpose, the present invention adopts the following technical scheme:
a method for positioning errors under a multi-data center node and a solution method thereof are provided, wherein the method comprises the following steps:
s1, starting an error positioning algorithm, and continuously executing the step S2;
s2, setting an error positioning algorithm variable, and continuously executing the step S3;
s3, inquiring the current state of a kth switch in a qth data center, if the judging result is that the switch is in an open state, jumping to an executing step S4, and if the judging result is that the switch is in a closed state, jumping to an executing step S5;
s4, assigning k to R m, and continuing to execute step S16;
s5, detecting the number of switches of the kth switch in the qth data center, if the judging result is that the kth switch has only one downlink switch, jumping to an executing step S6, if the judging result is that the kth switch has more than one downlink switch, jumping to an executing step S7, and if the judging result is that the kth switch has no downlink switch, jumping to an executing step S8;
s6, detecting the state of the downlink switch, if the judging result is that the switch is in an open state, jumping to an executing step S9, and if the judging result is that the switch is in a closed state, jumping to an executing step S10;
s7, detecting the states of all downlink switches, if the judging result is that all downlink switches are in an open state, jumping to an executing step S15, and if the judging result is that the number of switches in a closed state is more than or equal to 1, jumping to an executing step S12;
s8, giving a [ j ] to k, setting j=j+1, and returning to the execution step S3;
s9, taking the downlink k+1 switch as an error occurrence place, and jumping to execute the step S11;
s10, giving k+1 to k, and returning to the execution step S3;
s11, assigning k+1 to R < m > and setting m=m+1, and jumping to execute step S16;
s12, the number of the nearest downstream switches is given to n, the codes of the switches are respectively given to A [ i+1], A [ i+2],. A [ i+n ] is set to j=j+1, and the step S13 is continuously executed;
s13, comparing the variables i and j, if the judgment result is that j is greater than i, jumping to the execution step S16, and if the judgment result is that j is less than or equal to i, jumping to the execution step S14;
s14, giving a [ j ] to k, setting j=j+1, and returning to the execution step S3;
s15, all the downlink switch numbers are assigned to R < m >, and the step S16 is executed;
s16, stopping the error positioning algorithm, outputting an array R </SUB > ], and jumping to execute the step S17;
s17, defining the latest downstream switch coded by the switch in the array R as the place where the error occurs, and continuing to execute the step S18;
s18, removing the accessible network list from the place where the error occurs, and continuing to execute the step S19;
and S19, applying a network topology analysis algorithm to obtain 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.
Preferably, in the steps S8 and S14, a j is assigned to k and j=j+1 is set, but the steps are associated with different sub-flows and returned to different execution steps.
The beneficial effects of the invention are as follows:
the invention relates to an error positioning method under a multi-data center node and a solution method thereof, which can be used for positioning an error occurrence place by evaluating the current state of a data center switch and applying the error positioning algorithm in a complex network environment, and further can be used for obtaining a preferred access solution path for the current unfinished task and the coming task in the error data center by a network topology analysis algorithm. Compared with the traditional method, the method can deeply consider the dynamic change of the state of each switch in the network, effectively obtain the place where the error occurs, and solve the problem of access path reconstruction.
Drawings
FIG. 1 is a block diagram of the error locating method and its solution in the multi-data center node of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments.
The invention provides a method for locating errors under multiple data center nodes and a solution thereof, as shown in figure 1, when an error locating algorithm is started, an error algorithm variable is initially set, a user or a service provider can freely inquire the current state of a kth switch in a qth data center, if the switch is in an open state, the variable k is assigned to an array R [ m ], then the error locating algorithm is stopped and the array R [ is output, the latest downstream switch coded by the switch in the array R [ is defined as an error occurrence place, the defined error occurrence place is removed from an accessible network list, and then a network topology analysis algorithm is applied to obtain a preferred target data center and a preferred access network based on the current resource access condition of each data center node and accessible network; if the switch is in a closed state, detecting the number of switches in the kth switch downstream in the data center, if the downstream has no switch, assigning a [ j ] to k and setting j=j+1 and returning to the current state of the switch in the next data center to be queried freely, if the downstream switch has only one, querying the state of the k+1 downstream switch, if the k+1 switch is in an open state, defining the k+1 downstream switch as an error occurrence place and assigning k+1 to R [ m ] and setting m=m+1, then suspending the error localization algorithm and outputting an array R [ j ], and defining the latest downstream switch encoded by the switch in the array R [ j ] as an error occurrence place, removing the defined error occurrence place from the accessible network list, then applying a network topology analysis algorithm to obtain a preferred target data center and a preferred access network based on the current resource access condition of each data center node and the accessible network, if the k+1 switch is in a closed state, assigning k+1 to k and returning to be queried freely, if the current state of the k+1 downstream switch is in the next data center is in a closed state, detecting that the k+1 downstream switch is in the current state is greater than the number of the switch in the current state of the data center, and outputting an array R [ j ] is greater than the number of the latest switch in the array r+1 ] and outputting the array R [ j ] as an error localization algorithm, and comparing the latest downstream switch coded in the array R [ j ] to the array j ] to be greater than the latest n+j ] and the number of switches in the array j+1, defining the latest downstream switch coded by the switch in the array R as an error occurrence place, removing the accessible network list from the defined error occurrence place, then applying a network topology analysis algorithm to obtain a preferred target data center and a preferred access network 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 and setting j=j+1 and returning to freely inquire the current state of the switch in the next data center, if all downstream switches are in an open state, assigning all downstream switch numbers to R [ m ] and then stopping the error positioning algorithm and outputting the array R [ j ], defining the latest downstream switch coded by the switch in the array R [ j ] as an error occurrence place, removing the defined error occurrence place from the accessible network list, and then applying the network topology analysis algorithm to obtain the preferred target data center and the preferred access network based on the current resource access condition of each data center node and the accessible network.
The present invention is not limited to the above-mentioned embodiments, and any person skilled in the art, based on the technical solution of the present invention and the inventive concept thereof, can be replaced or changed within the scope of the present invention.

Claims (2)

1. The method for positioning the error under the nodes of the multiple data centers and the solution method thereof are characterized by comprising the following steps:
s1, starting an error positioning algorithm, and continuously executing the step S2;
s2, setting an error positioning algorithm variable, and continuously executing the step S3;
s3, inquiring the current state of a kth switch in a qth data center, if the judging result is that the switch is in an open state, jumping to an executing step S4, and if the judging result is that the switch is in a closed state, jumping to an executing step S5;
s4, assigning k to R m, and continuing to execute step S16;
s5, detecting the number of switches of the kth switch in the qth data center, if the judging result is that the kth switch has only one downlink switch, jumping to an executing step S6, if the judging result is that the kth switch has more than one downlink switch, jumping to an executing step S7, and if the judging result is that the kth switch has no downlink switch, jumping to an executing step S8;
s6, detecting the state of the downlink switch, if the judging result is that the switch is in an open state, jumping to an executing step S9, and if the judging result is that the switch is in a closed state, jumping to an executing step S10;
s7, detecting the states of all downlink switches, if the judging result is that all downlink switches are in an open state, jumping to an executing step S15, and if the judging result is that the number of switches in a closed state is more than or equal to 1, jumping to an executing step S12;
s8, giving a [ j ] to k, setting j=j+1, and returning to the execution step S3;
s9, taking the downlink k+1 switch as an error occurrence place, and jumping to execute the step S11;
s10, giving k+1 to k, and returning to the execution step S3;
s11, assigning k+1 to R < m > and setting m=m+1, and jumping to execute step S16;
s12, the number of the nearest downstream switches is given to n, the codes of the switches are respectively given to A [ i+1], A [ i+2],. A [ i+n ] is set to j=j+1, and the step S13 is continuously executed;
s13, comparing the variables i and j, if the judgment result is that j is greater than i, jumping to the execution step S16, and if the judgment result is that j is less than or equal to i, jumping to the execution step S14;
s14, giving a [ j ] to k, setting j=j+1, and returning to the execution step S3;
s15, all the downlink switch numbers are assigned to R < m >, and the step S16 is executed;
s16, stopping the error positioning algorithm, outputting an array R </SUB > ], and jumping to execute the step S17;
s17, defining the latest downstream switch coded by the switch in the array R as the place where the error occurs, and continuing to execute the step S18;
s18, removing the accessible network list from the place where the error occurs, and continuing to execute the step S19;
and S19, applying a network topology analysis algorithm to obtain 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.
2. The method for positioning errors under nodes of multiple data centers according to claim 1, wherein in the steps S8 and S14, a [ j ] is assigned to k and j=j+1 is set, but the steps are associated with different sub-flows and returned to different execution steps.
CN202110373873.7A 2021-04-09 2021-04-09 Error positioning method under multiple data center nodes and solving method thereof Active CN115208744B (en)

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 CN115208744A (en) 2022-10-18
CN115208744B true 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 (3)

* Cited by examiner, † Cited by third party
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
CN110601888A (en) * 2019-09-10 2019-12-20 清华大学 Deterministic fault detection and positioning method and system in time-sensitive network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10298435B2 (en) * 2015-06-08 2019-05-21 Quanta Computer Inc. Server link state detection and notification

Patent Citations (3)

* Cited by examiner, † Cited by third party
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
CN110601888A (en) * 2019-09-10 2019-12-20 清华大学 Deterministic fault detection and positioning method and system in time-sensitive network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
高速公路机电设备运维数据采集系统研究;刘阳;杜文良;;西部交通科技(第01期);全文 *

Also Published As

Publication number Publication date
CN115208744A (en) 2022-10-18

Similar Documents

Publication Publication Date Title
Zhang et al. Optimal cooperative sensing scheduling for energy-efficient cognitive radio networks
Amiri et al. Controller selection in software defined networks using best-worst multi-criteria decision-making
JP2003050988A5 (en)
Liu et al. Firm real-time system scheduling based on a novel QoS constraint
CN112020098B (en) Load balancing method, device, computing equipment and computer storage medium
CN113220483A (en) Switching method and system for block chain consensus main node
Alhammadi et al. Fuzzy logic based negotiation approach for spectrum handoff in cognitive radio network
CN115208744B (en) Error positioning method under multiple data center nodes and solving method thereof
Maheshwari et al. A fuzzy logic based approach to spectrum assignment in cognitive radio networks
CN116244081B (en) Multi-core calculation integrated accelerator network topology structure control system
CN116860789A (en) Data distribution optimization method and distributed database system
CN101199162B (en) Method, system and device for controlling communication network
CN118138590A (en) Data center load balancing method
CN116306311A (en) Automatic spraying equipment control method and system
Elattar et al. Reliable multipath communication approach for internet-based cyber-physical systems
CN105373451A (en) Virtual machine placement method and apparatus
Krommenacker et al. Genetic algorithms for industrial Ethernet network design
Jara Estupiñan et al. Optimal value of past samples for decision making in cognitive radio networks
CN1181697C (en) Frame offset allocation method
CN112532438B (en) Method and device for determining communication network structure of alliance chain and electronic equipment
CN113411819B (en) 5G NFV slice reconfiguration method, system and wireless communication system
US11842782B2 (en) Phased parameterized combinatoric testing for a data storage system
CN115484159B (en) Network demand and resource supply determining system and method
CN115208818B (en) QoS routing method based on genetic algorithm
CN117880605B (en) Short message video quick playing method and system based on 5G technology

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