CN113301170A - Data processing method based on communication node - Google Patents

Data processing method based on communication node Download PDF

Info

Publication number
CN113301170A
CN113301170A CN202110847086.1A CN202110847086A CN113301170A CN 113301170 A CN113301170 A CN 113301170A CN 202110847086 A CN202110847086 A CN 202110847086A CN 113301170 A CN113301170 A CN 113301170A
Authority
CN
China
Prior art keywords
communication node
communication
level
waiting time
transmitted
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
Application number
CN202110847086.1A
Other languages
Chinese (zh)
Other versions
CN113301170B (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.)
Hunan Sanxiang Bank Co Ltd
Original Assignee
Hunan Sanxiang Bank 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 Hunan Sanxiang Bank Co Ltd filed Critical Hunan Sanxiang Bank Co Ltd
Priority to CN202110847086.1A priority Critical patent/CN113301170B/en
Publication of CN113301170A publication Critical patent/CN113301170A/en
Application granted granted Critical
Publication of CN113301170B publication Critical patent/CN113301170B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/56Provisioning of proxy services
    • 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/08Configuration management of networks or network elements
    • H04L41/0893Assignment of logical groups to network elements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network

Abstract

The invention relates to a data processing method based on a communication node, which comprises the steps of evaluating the communication node to obtain the safety factor of the communication node if the communication node is reached and the information to be transmitted does not reach a preset appointed communication node in the communication process, and staying for a first waiting time T1 at the communication node to enable the communication node to obtain the compensation safety value of other communication nodes if the safety factor of the communication node is less than a safety standard coefficient S0; and adjusting the safety factor of the communication node according to the number of the compensation safety values acquired by the communication node, and continuing to transfer the information to be transmitted when the safety factor S of the communication node is larger than or equal to a safety standard coefficient S0. In the communication process, if the communication node cannot normally communicate due to low safety factor, the other communication nodes providing the compensation safety value can compensate the safety factor of the communication node, so that the safety of the transfer of the information to be transmitted is improved.

Description

Data processing method based on communication node
Technical Field
The invention relates to the field of data processing, in particular to a data processing method based on communication nodes.
Background
In a stand-alone system used before a distributed system appears, once problems occur in an operating system, a hard disk, a network and the like of a server, problems such as service interruption, data loss and the like may occur.
Each node used in the system may have a single point fault and suddenly does not work, network delays of a larger or smaller or larger or smaller network delays between nodes may occur, and a network between nodes may have problems. From a technical point of view, problems that may occur are basically considered to occur in the morning and in the evening. There are a number of problems to say that the balance between probability and cost benefit is. Therefore, a distributed system is designed to normally provide external services, and the design of the distributed system is designed to solve the problems.
However, the existing distributed system has the problem of communication interruption in the service process, which affects normal communication.
Disclosure of Invention
Therefore, the invention provides a data processing method based on communication nodes, which can solve the problem of communication interruption in the service process.
In order to achieve the above object, the present invention provides a data processing method based on a communication node, including:
setting a communication node, wherein the communication node is used for transferring information to be transmitted, the starting point of the communication node is a communication starting point, the end point of the communication node is a communication end point, and at least one communication node is arranged between the communication starting point and the communication end point;
setting a communication period, transporting to a receiving point in the communication period, and installing a positioning device on the receiving point to determine the time node;
selecting a transfer node of the information to be transmitted according to the acquired time node, so that the information to be transmitted correspondingly reaches a communication destination when the information reaches a receiving place;
if the information to be transmitted reaches the communication node and does not reach the preset designated communication node in the communication process, evaluating the communication node to obtain the safety coefficient of the communication node, and if the safety coefficient of the communication node is less than a safety standard coefficient S0, staying at the communication node for a first waiting time T1 to enable the communication node to obtain the compensation safety value of other communication nodes;
and adjusting the safety factor of the communication node according to the number of the compensation safety values acquired by the communication node, and when the safety factor S of the communication node is larger than or equal to a safety standard coefficient S0, continuing to transport and correspondingly continuing to transfer the information to be transmitted.
Further, if the safety factor of the communication node is still less than the safety standard coefficient S0 after the first waiting time T1 is finished, increasing a second waiting time T2, and adjusting the safety factor of any communication node by a standard waiting time T0 in advance, wherein the sum of the first waiting time T1 and the second waiting time T2 is less than or equal to the standard waiting time T0, determining a time array list adopted in the process of adjusting the safety factor to the standard safety factor by the communication node, wherein the time array list arranges the actual waiting times according to the sequence;
when the safety factor of the next communication node does not meet the standard safety factor, the length of the first waiting time is adjusted, so that the adjustment times of the next communication node are reduced.
Further, for any communication node, in determining the security level of any communication node, a first level S1, a second level S2, and a third level S3 are set in advance, wherein S1< S2< S3,
if the security level S of any communication node is larger than or equal to the third level S3, directly transferring the information to be transmitted;
if the third level S3> security level S ≧ the second level S2, then shorten the first wait time T1 to k1 XT 1, where k1 is 0.1-0.5;
if the second level S2> the security level S is not less than the first level S1, the first waiting time T1 is shortened to k2 × T1, wherein k2 is 0.6-0.9;
if the security level S < the first level S1, the first waiting time T1, the second waiting time T3 and the third waiting time T3 are sequentially adjusted without adjusting the first level time T1, wherein T1+ T2+ T3= the standard waiting time T0.
Further, the security level S = Sa + Sbi, where i =1, 2, 3, n-1, Sa represents the security level of the current communication node, and Sbi represents an additional security level corresponding to a compensated security value provided by a communication node other than the current node, where n communication nodes are provided.
Further, when the security level coefficient S of the communication node is greater than the security standard coefficient S0, k1 and k2 are corrected according to the difference between the security level coefficient S of the communication node and the security standard coefficient S0 to achieve correction of the first latency according to the degree of security level deviation of the communication node.
Further, the correcting the first waiting time according to the security level deviation degree of the communication node includes:
if (S-S0)/S0 is not less than 5, correcting k1 to be k1 '= (S-S0)/S0 × k1, and correcting k2 to be k 2' = (S-S0)/S0 × k 2;
if (S-S0)/S0 <5, k1 is corrected to k1 =2 × (S-S0)/S0 × k1, and k2 is corrected to k2 =2 × (S-S0)/S0 × k 2.
Further, a transfer standard speed V0 is set in the processor, if the transfer of the information to be transmitted for a plurality of times is completed within the preset period, and if the transfer speed of at least half of the information to be transmitted is greater than or equal to the transfer standard speed V0 in the information to be transmitted for a plurality of times, it indicates that the processing speed is good, and the processing capability of the communication node for the information to be transmitted is excellent.
Furthermore, a first intermediate rotation speed V1 and a second intermediate rotation speed V2 are also arranged in the processor, when the intermediate rotation speed of the information to be transmitted of any communication node is determined, if the actual intermediate rotation speed is between the first intermediate rotation speed and the second intermediate rotation speed, the processing speed of the communication node is moderate, the actual need is met, and the communication node can be continuously maintained without adjustment;
if the actual intermediate rotation speed of the communication node is not between the first intermediate rotation speed and the second intermediate rotation speed, the current intermediate rotation speed of the communication node is too high or too low, and the actual requirement is not met, at this time, the number of the communication nodes needs to be adjusted, if the intermediate rotation speed of the communication node is too high, the number of the communication nodes between the communication node and a communication destination is increased, and if the intermediate rotation speed of the communication node is too low, the number of the communication nodes between the communication node and the communication destination is reduced.
Compared with the prior art, the method has the advantages that the safety factor of the communication node where the information to be transmitted is located is determined according to the time node in the communication process, if the safety factor of the communication node is low at any moment, the waiting time is increased, the safety factor of the communication node is improved within the waiting time in such a way that the compensation safety value of other communication nodes is obtained, and therefore in the communication process, if the communication node cannot normally communicate due to the low safety factor, the safety factor of the communication node can be compensated by the other communication nodes providing the compensation safety value, and the safety of transferring the information to be transmitted is improved.
Particularly, the adjusting capacity of the communication node for the safety factor of the communication node is determined by gradually increasing the time length, so that the adjusting capacity of the corresponding communication node is determined according to the waiting time sum, the safety evaluation of the communication node is facilitated, and the safety of the transfer of the information to be transmitted is improved.
Particularly, a first level, a second level and a third level are set, the actual position of the actual safety level is judged, the first waiting time is adjusted according to the level of the actual safety level, if the actual safety level is higher, the information to be transmitted is directly transferred, if the safety level is the lowest, after the first waiting time is adopted, the first waiting time and the immediate transfer are performed, if other safety levels are between the lowest safety level and the highest safety level, the first level time is shortened to different degrees by adopting k1 and k2, so that the adjustment of the safety level by the communication node is completed after the corresponding waiting time, the safety of the corresponding safety node is improved, and the safety and the efficiency of the information to be transmitted are improved.
Particularly, the security level of any communication node is determined, the security level of each communication node is composed of a security level of the communication node and an additional security level corresponding to a compensation security value provided by other communication nodes, for any communication node, the communication node can request other communication nodes except the communication node to give the compensation security value, and certainly, some communication nodes have no traffic with the current communication node because the compensation security value cannot be provided for the communication node, so that the additional security level provided by the communication node is 0, that is, the security level of the communication node cannot be influenced.
Particularly, by comparing the difference value between the security level coefficient of the communication node and the standard security coefficient, and correcting k1 and k2 according to the difference value, if the difference value is large, the deviation degree from the standard security coefficient S0 is large, the security coefficient is higher, if the difference value is small, the deviation degree from the standard security coefficient is small, and the deviation degree is slightly higher than the standard security coefficient, so that when the deviation degree is large and the security coefficient is high, k1 and k2 can be greatly reduced, the first waiting time is further shortened, the transfer waiting time is reduced, and the transfer efficiency of the information to be transmitted is improved.
Particularly, the performance capability of the communication node in the actual settlement process of the information to be transmitted is determined by evaluating the intermediate rotation speed of the communication node, the settlement process is evaluated, the comprehensive evaluation of the performance of each settlement in the financial settlement process is controlled, the safety of the information to be transmitted at each communication node in the transfer process is realized, and the safety of the information to be transmitted from the communication starting point to the communication destination is greatly improved.
Particularly, the intermediate rotation speed of the communication nodes is determined, and the number of the communication nodes is adjusted according to the intermediate rotation speed, so that the time of the information to be transmitted in the transfer process is stable, the information to be transmitted is transferred at regular time, and the safety and the stability of the information to be transmitted are improved.
Drawings
Fig. 1 is a flowchart of a data processing method based on a communication node according to an embodiment of the present invention.
Detailed Description
In order that the objects and advantages of the invention will be more clearly understood, the invention is further described below with reference to examples; it should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Preferred embodiments of the present invention are described below with reference to the accompanying drawings. It should be understood by those skilled in the art that these embodiments are only for explaining the technical principle of the present invention, and do not limit the scope of the present invention.
It should be noted that in the description of the present invention, the terms of direction or positional relationship indicated by the terms "upper", "lower", "left", "right", "inner", "outer", etc. are based on the directions or positional relationships shown in the drawings, which are only for convenience of description, and do not indicate or imply that the device or element must have a specific orientation, be constructed in a specific orientation, and be operated, and thus, should not be construed as limiting the present invention.
Furthermore, it should be noted that, in the description of the present invention, unless otherwise explicitly specified or limited, the terms "mounted," "connected," and "connected" are to be construed broadly, and may be, for example, fixedly connected, detachably connected, or integrally connected; can be mechanically or electrically connected; they may be connected directly or indirectly through intervening media, or they may be interconnected between two elements. The specific meanings of the above terms in the present invention can be understood by those skilled in the art according to specific situations.
Referring to fig. 1, a data processing method based on a communication node according to an embodiment of the present invention includes:
step S100: setting a communication node, wherein the communication node is used for transferring information to be transmitted, the starting point of the communication node is a communication starting point, the end point of the communication node is a communication end point, and at least one communication node is arranged between the communication starting point and the communication end point;
step S200: setting a communication period, and selecting a transfer node of information to be transmitted according to a pre-acquired time node in the communication period so as to enable the information to be transmitted to reach a communication end point at a specified time node;
step S300: if the information to be transmitted by the communication node does not reach the designated communication node within the preset time in the communication process, evaluating the communication node to obtain the safety factor of the communication node, and if the safety factor of the communication node is less than the safety standard coefficient S0, staying the information to be transmitted at the communication node for a first waiting time T1 so that the communication node obtains the compensation safety value of other communication nodes;
step S400: and adjusting the safety factor of the communication node according to the number of the compensation safety values acquired by the communication node, and when the safety factor S of the communication node is more than or equal to a safety standard coefficient S0, continuing to transfer the information to be correspondingly transmitted.
Specifically, in the data processing method based on the communication node provided in the embodiment of the present invention, the waiting time is increased in the communication process, so that the communication node increases its own security coefficient within the waiting time, and the increased manner is to obtain the compensated security value of the other communication node, so that in the communication process, if the communication node cannot communicate, the security coefficient of the communication node can be supplemented by the other communication node providing the compensated security value, so as to continue to communicate, thereby improving the security of the transfer of the information to be transmitted and the security of settlement.
Specifically, if the security coefficient of the communication node is still less than the security standard coefficient S0 after the first waiting time T1 is ended, increasing a second waiting time T2, wherein the standard waiting time T0 is preset for adjusting the security coefficient of any communication node, the sum of the first waiting time T1 and the second waiting time T2 is less than or equal to the standard waiting time T0, and determining a time array list adopted in the process of adjusting the security coefficient to the standard security coefficient by the communication node, wherein the time array list arranges the actual waiting times according to the sequence;
when the safety factor of the next communication node does not meet the standard safety factor, the length of the first waiting time is adjusted, so that the adjustment times of the next communication node are reduced.
Specifically, the data processing method based on the communication node determines the adjustment capability of the communication node for the safety factor of the communication node itself by gradually increasing the time length, and determines the adjustment capability of the corresponding communication node according to the total waiting time, so that the security of the communication node can be conveniently evaluated, and the security of the transfer of the information to be transmitted can be improved.
Specifically, for an arbitrary communication node, in determining the security level of the arbitrary communication node, a first level S1, a second level S2, and a third level S3 are set in advance, wherein S1< S2< S3,
if the security level S of any communication node is larger than or equal to the third level S3, directly transferring the information to be transmitted;
if the third level S3> security level S ≧ the second level S2, then shorten the first wait time T1 to k1 XT 1, where k1 is 0.1-0.5;
if the second level S2> the security level S is not less than the first level S1, the first waiting time T1 is shortened to k2 × T1, wherein k2 is 0.6-0.9;
if the security level S < the first level S1, the first waiting time T1, the second waiting time T3 and the third waiting time T3 are sequentially adjusted without adjusting the first level time T1, wherein T1+ T2+ T3= the standard waiting time T0.
Specifically, the data processing method based on the communication node according to the embodiment of the present invention sets the first level, the second level and the third level, by judging the actual position of the actual safety level and adjusting the first waiting time according to the level of the actual safety level, if the actual safety level is higher, directly transferring the information to be transmitted, if the security level is the lowest, after adopting the first waiting time, between the first waiting time and the instant transit, if other security levels are between the lowest security level and the highest security level, and shortening the first-level time to different degrees by adopting k1 and k2, so that the adjustment of the communication node on the security level is completed after the corresponding waiting time, the security of the corresponding communication node is improved, and the security and the efficiency of the transfer of the information to be transmitted are improved.
Specifically, the security level S = Sa + Sbi, where i =1, 2, 3, n-1, Sa represents the security level of the current communication node, and Sbi represents an additional security level corresponding to a compensated security value provided by a communication node other than the current node, where n communication nodes are provided.
Specifically, the data processing method based on the communication node according to the embodiment of the present invention determines the security level of any communication node, where the security level of each communication node is composed of its own security level and an additional security level corresponding to a compensation security value provided by another communication node, and for any communication node, the communication node may request another communication node except itself to give the compensation security value, and certainly, some communication nodes do not communicate with the current communication node, because the compensation security value cannot be provided for the communication node, the additional security level given by the communication node is 0, that is, the security level of the communication node cannot be affected.
Specifically, when the security level coefficient S of the communication node is greater than the security standard coefficient S0, k1 and k2 are corrected according to the difference between the security level coefficient S of the communication node and the security standard coefficient S0 to achieve correction of the first latency according to the degree of security level deviation of the communication node.
Specifically, the data processing method based on the communication node according to the embodiment of the present invention compares the difference between the security level coefficient of the communication node and the standard security coefficient, and corrects k1 and k2 according to the difference, if the difference is large, it indicates that the deviation degree from the standard security coefficient S0 is large, it indicates that the security coefficient is higher, if the difference is small, it indicates that the deviation degree from the standard security coefficient is small, and is slightly higher than the standard security coefficient, so that when the deviation degree is large and the security coefficient is high, k1 and k2 can be greatly reduced, thereby shortening the first waiting time, reducing the transfer waiting time, and improving the transfer efficiency of the information to be transmitted.
Specifically, the correcting the first waiting time according to the security level deviation degree of the communication node includes:
if (S-S0)/S0 is not less than 5, correcting k1 to be k1 '= (S-S0)/S0 × k1, and correcting k2 to be k 2' = (S-S0)/S0 × k 2;
if (S-S0)/S0 <5, k1 is corrected to k1 =2 × (S-S0)/S0 × k1, and k2 is corrected to k2 =2 × (S-S0)/S0 × k 2.
Specifically, in the data processing method based on the communication node provided by the embodiment of the present invention, the first waiting time is corrected according to the deviation degree of the security level of the communication node, and the larger the deviation degree is, the higher the security level is, and the first waiting time is correspondingly extended, so that the speed of transferring the information to be transferred is increased, and the transfer efficiency is improved on the basis of ensuring the security of the information to be transferred.
Specifically, a transfer standard speed V0 is set in the processor, and if the transfer of several times of information to be transmitted is completed within a preset period, and if at least half of the information to be transmitted in the several times of information to be transmitted has a rotation speed greater than or equal to the transfer standard speed V0, it indicates that the processing speed is good, and the processing capability of the communication node for the information to be transmitted is excellent.
Specifically, the data processing method based on the communication node provided by the embodiment of the invention evaluates the middle rotation speed of the communication node to determine the performance capability of the communication node in the actual settlement process of the information to be transmitted, so as to realize the evaluation of the settlement process, and control the comprehensive evaluation of the performance of each settlement in the financial settlement process, so as to realize the safety of the information to be transmitted at each communication node in the transfer process, and greatly improve the safety of the information to be transmitted from the communication starting point to the communication ending point.
Specifically, a first intermediate rotation speed V1 and a second intermediate rotation speed V2 are further provided in the processor, and when the intermediate rotation speed of the information to be transmitted by any communication node is determined, if the actual intermediate rotation speed is between the first intermediate rotation speed and the second intermediate rotation speed, it indicates that the processing speed of the communication node is moderate, and the processing speed meets the actual requirement, and can be continuously maintained without adjustment;
if the actual intermediate rotation speed of the communication node is not between the first intermediate rotation speed and the second intermediate rotation speed, the current intermediate rotation speed of the communication node is too high or too low, and the actual requirement is not met, at this time, the number of the communication nodes needs to be adjusted, if the intermediate rotation speed of the communication node is too high, the number of the communication nodes between the communication node and a communication destination is increased, and if the intermediate rotation speed of the communication node is too low, the number of the communication nodes between the communication node and the communication destination is reduced.
Specifically, according to the data processing method based on the communication nodes provided by the embodiment of the invention, the intermediate rotation speed of the communication nodes is determined, and the number of the communication nodes is adjusted according to the intermediate rotation speed, so that the time of the information to be transmitted in the transfer process is stable, the information to be transmitted is transferred at regular time, and the safety and the stability of the information to be transmitted are improved.
So far, the technical solutions of the present invention have been described in connection with the preferred embodiments shown in the drawings, but it is easily understood by those skilled in the art that the scope of the present invention is obviously not limited to these specific embodiments. Equivalent changes or substitutions of related technical features can be made by those skilled in the art without departing from the principle of the invention, and the technical scheme after the changes or substitutions can fall into the protection scope of the invention.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention; various modifications and alterations to this invention will become apparent to those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (8)

1. A data processing method based on a communication node, comprising:
setting a communication node, wherein the communication node is used for transferring information to be transmitted, the starting point of the communication node is a communication starting point, the end point of the communication node is a communication end point, and at least one communication node is arranged between the communication starting point and the communication end point;
setting a communication period, and selecting a transfer node of information to be transmitted according to a pre-acquired time node in the communication period so as to enable the information to be transmitted to reach a communication end point at a specified time node;
if the information to be transmitted by the communication node does not reach the designated communication node within the preset time in the communication process, evaluating the communication node to obtain the safety factor of the communication node, and if the safety factor of the communication node is less than the safety standard coefficient S0, staying the information to be transmitted at the communication node for a first waiting time T1 so that the communication node obtains the compensation safety value of other communication nodes;
and adjusting the safety factor of the communication node according to the number of the compensation safety values acquired by the communication node, and when the safety factor S of the communication node is more than or equal to a safety standard coefficient S0, continuing to transfer the information to be correspondingly transmitted.
2. The communication node-based data processing method of claim 1,
if the safety factor of the communication node is still less than a safety standard coefficient S0 after the first waiting time T1 is finished, increasing a second waiting time T2, and adjusting the safety factor of any communication node, wherein the sum of the first waiting time T1 and the second waiting time T2 is not more than a standard waiting time T0, determining a time array list adopted in the process of adjusting the safety factor to the standard safety factor by the communication node, and arranging the actual waiting time according to the sequence;
when the safety factor of the next communication node does not meet the standard safety factor, the length of the first waiting time is adjusted, so that the adjustment times of the next communication node are reduced.
3. The communication node-based data processing method of claim 2,
for any communication node, when determining the security level of any communication node, a first level S1, a second level S2, and a third level S3 are set in advance, wherein S1< S2< S3,
if the security level S of any communication node is larger than or equal to the third level S3, directly transferring the information to be transmitted;
if the third level S3> security level S ≧ the second level S2, then shorten the first wait time T1 to k1 XT 1, where k1 is 0.1-0.5;
if the second level S2> the security level S is not less than the first level S1, the first waiting time T1 is shortened to k2 × T1, wherein k2 is 0.6-0.9;
if the security level S < the first level S1, the first waiting time T1, the second waiting time T3 and the third waiting time T3 are sequentially adjusted without adjusting the first level time T1, wherein T1+ T2+ T3= the standard waiting time T0.
4. The communication node-based data processing method of claim 3,
the security level S = Sa + Sbi, where i =1, 2, 3, n-1, Sa represents the security level of the current communication node, and Sbi represents an additional security level corresponding to a compensated security value provided by a communication node other than the current node, where n communication nodes are provided.
5. The communication node-based data processing method of claim 4,
when the security level coefficient S of the communication node is larger than the security standard coefficient S0, k1 and k2 are corrected according to the difference value between the security level coefficient S of the communication node and the security standard coefficient S0, so that the first waiting time is corrected according to the security level deviation degree of the communication node.
6. The communication node-based data processing method of claim 5,
the correcting the first waiting time according to the security level deviation degree of the communication node comprises:
if (S-S0)/S0 is not less than 5, correcting k1 to be k1 '= (S-S0)/S0 × k1, and correcting k2 to be k 2' = (S-S0)/S0 × k 2;
if (S-S0)/S0 <5, k1 is corrected to k1 =2 × (S-S0)/S0 × k1, and k2 is corrected to k2 =2 × (S-S0)/S0 × k 2.
7. The communication node-based data processing method of claim 6,
the processor is internally provided with a transfer standard speed V0, if the transfer of a plurality of times of information to be transmitted is completed in a preset period, and if the transfer speed of at least more than half of the information to be transmitted is greater than or equal to the transfer standard speed V0 in the plurality of times of information to be transmitted, the processing speed is good, and the processing capacity of the communication node on the information to be transmitted is excellent.
8. The communication node-based data processing method of claim 7,
the processor is also internally provided with a first intermediate rotation speed V1 and a second intermediate rotation speed V2, when the intermediate rotation speed of the information to be transmitted of any communication node is determined, if the actual intermediate rotation speed is between the first intermediate rotation speed and the second intermediate rotation speed, the processing speed of the communication node is moderate, the actual need is met, and the communication node can be continuously maintained without adjustment;
if the actual intermediate rotation speed of the communication node is not between the first intermediate rotation speed and the second intermediate rotation speed, the current intermediate rotation speed of the communication node is too high or too low, and the actual requirement is not met, at this time, the number of the communication nodes needs to be adjusted, if the intermediate rotation speed of the communication node is too high, the number of the communication nodes between the communication node and a communication destination is increased, and if the intermediate rotation speed of the communication node is too low, the number of the communication nodes between the communication node and the communication destination is reduced.
CN202110847086.1A 2021-07-27 2021-07-27 Data processing method based on communication node Active CN113301170B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110847086.1A CN113301170B (en) 2021-07-27 2021-07-27 Data processing method based on communication node

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110847086.1A CN113301170B (en) 2021-07-27 2021-07-27 Data processing method based on communication node

Publications (2)

Publication Number Publication Date
CN113301170A true CN113301170A (en) 2021-08-24
CN113301170B CN113301170B (en) 2021-10-19

Family

ID=77331050

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110847086.1A Active CN113301170B (en) 2021-07-27 2021-07-27 Data processing method based on communication node

Country Status (1)

Country Link
CN (1) CN113301170B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114124577A (en) * 2022-01-25 2022-03-01 湖南三湘银行股份有限公司 Safety management and control method based on block chain intelligent contract

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101282302A (en) * 2008-05-29 2008-10-08 腾讯科技(深圳)有限公司 Data transfer method, system, client and server
CN102868710A (en) * 2011-07-05 2013-01-09 中兴通讯股份有限公司 Method device and system for interaction of messages of peer-to-peer network
CN103384259A (en) * 2012-05-04 2013-11-06 上海聚力传媒技术有限公司 Method, device, equipment and system for adjusting transmission speed of peer nodes
US20140325086A1 (en) * 2013-04-25 2014-10-30 Peerialism AB Method and Device for Centralized Peer Arrangement In P2P Overlay Networks
CN105024942A (en) * 2015-05-29 2015-11-04 桂林电子科技大学 Dynamic flow monitoring method
CN105227602A (en) * 2014-06-20 2016-01-06 北京新媒传信科技有限公司 A kind of method of load balancing, client, registrar and system
US20170085573A1 (en) * 2014-06-09 2017-03-23 Yulong Computer Telecommunication Scientific (Shenzhen) Co., Ltd. Data Transmission Method and Apparatus
CN107333258A (en) * 2017-07-31 2017-11-07 努比亚技术有限公司 Data packet transmission system and method
CN110311753A (en) * 2019-06-21 2019-10-08 杭州飞步科技有限公司 Communication means, device, node, storage medium and system
CN111683013A (en) * 2020-06-08 2020-09-18 腾讯科技(深圳)有限公司 Routing method of acceleration network and acceleration network

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101282302A (en) * 2008-05-29 2008-10-08 腾讯科技(深圳)有限公司 Data transfer method, system, client and server
CN102868710A (en) * 2011-07-05 2013-01-09 中兴通讯股份有限公司 Method device and system for interaction of messages of peer-to-peer network
CN103384259A (en) * 2012-05-04 2013-11-06 上海聚力传媒技术有限公司 Method, device, equipment and system for adjusting transmission speed of peer nodes
US20140325086A1 (en) * 2013-04-25 2014-10-30 Peerialism AB Method and Device for Centralized Peer Arrangement In P2P Overlay Networks
US20170085573A1 (en) * 2014-06-09 2017-03-23 Yulong Computer Telecommunication Scientific (Shenzhen) Co., Ltd. Data Transmission Method and Apparatus
CN105227602A (en) * 2014-06-20 2016-01-06 北京新媒传信科技有限公司 A kind of method of load balancing, client, registrar and system
CN105024942A (en) * 2015-05-29 2015-11-04 桂林电子科技大学 Dynamic flow monitoring method
CN107333258A (en) * 2017-07-31 2017-11-07 努比亚技术有限公司 Data packet transmission system and method
CN110311753A (en) * 2019-06-21 2019-10-08 杭州飞步科技有限公司 Communication means, device, node, storage medium and system
CN111683013A (en) * 2020-06-08 2020-09-18 腾讯科技(深圳)有限公司 Routing method of acceleration network and acceleration network

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114124577A (en) * 2022-01-25 2022-03-01 湖南三湘银行股份有限公司 Safety management and control method based on block chain intelligent contract

Also Published As

Publication number Publication date
CN113301170B (en) 2021-10-19

Similar Documents

Publication Publication Date Title
US8085794B1 (en) Techniques for fault tolerant routing in a destination-routed switch fabric
EP2534794B1 (en) Methods, systems, and computer readable media for providing peer routing at a diameter node
EP2493118A1 (en) Information processing system
US8942098B2 (en) Adaptive hybrid wireless and wired process control system with hierarchical process automation field network sets
US7633873B1 (en) Method and system for communication of data via an optimum data path in a network
CN113301170B (en) Data processing method based on communication node
KR20160019361A (en) Probabilistic Lazy-Forwarding Technique Without Validation In A Content Centric Network
JP3329254B2 (en) Communication network design circuit, design method therefor, and recording medium recording control program therefor
CN109818863B (en) Link priority setting method and device
US9252915B1 (en) Systematic adaptation of data delivery
CN113193996B (en) Power optical transmission network optimization method, device, equipment and storage medium
US20050254429A1 (en) Management node deice, node device, network configuration management system, network configuration management method, node device control method, management node device control method
CN114745791B (en) Power service slice arrangement and resource allocation method and device
US11329880B2 (en) Automatic route reflector configuration system
CN110808911B (en) Networking communication routing method based on ant colony pheromone
CN110858956B (en) Processing method, device, equipment and medium for IP short message gateway load unbalance
CN113923216B (en) Distributed cluster current limiting system and method and distributed cluster node
JP2019220739A (en) Communication system, base station, server, control method, and program
EP3247077B1 (en) Path selection method, device and system
US20040218925A1 (en) Method for reorganizing wavelength division multiplexing network using dynamic watermarks
US11418449B2 (en) Multipath coding apparatus and related techniques
CN107453997B (en) Double-cost-based routing optimization method
CN114095439A (en) Flow optimization method and device, electronic equipment and computer-readable storage medium
US8181044B2 (en) Apparatus and method for determining operation mode of node in ad hoc network
EP3493349A1 (en) Electrical energy optimal routing method between a source node and a destination node of a peer-to-peer energy network and system

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