CN113141305A - Communication method, communication device, electronic equipment and computer-readable storage medium - Google Patents
Communication method, communication device, electronic equipment and computer-readable storage medium Download PDFInfo
- Publication number
- CN113141305A CN113141305A CN202110606263.7A CN202110606263A CN113141305A CN 113141305 A CN113141305 A CN 113141305A CN 202110606263 A CN202110606263 A CN 202110606263A CN 113141305 A CN113141305 A CN 113141305A
- Authority
- CN
- China
- Prior art keywords
- communication path
- communication
- historical
- weight
- selection information
- 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
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment of the disclosure discloses a communication method, a communication device, electronic equipment and a computer-readable storage medium. The method comprises the following steps: acquiring historical congestion degree information and historical selection information of each communication path in a predetermined communication path set, wherein the historical selection information is information selected by a single communication path for communication in a historical time period; determining a communication probability metric value for selecting the communication path to carry out the communication at the time based on the historical congestion degree information and the historical selection information of the communication path for each communication path in the communication path set; selecting a target communication path for carrying out the communication from the communication path set based on the communication probability metric of each communication path in the communication path set; and performing communication through the target communication path. The embodiment of the disclosure helps to ensure the balance and low delay of communication path selection.
Description
Technical Field
The present disclosure relates to the field of computer technologies, and in particular, to a communication method, an apparatus, an electronic device, and a computer-readable storage medium.
Background
In the prior art, a communication initiator may generally select one communication path from a plurality of communication paths to perform the communication. For example, the exchange has multiple trading channels available for selection, each trading channel also being available for selection by multiple investors.
However, the selection of different communication paths often depends on the communication speed of the communication initiator, and whether some communication paths provided by the communication channel provider are frequently selected.
It can be seen that how to select a communication path before each communication is a significant technical problem.
Disclosure of Invention
In view of the above, to solve the technical problems or some of the technical problems, embodiments of the present disclosure provide a communication method, apparatus, electronic device and computer-readable storage medium.
In a first aspect, an embodiment of the present disclosure provides a communication method, where the method includes:
acquiring historical congestion degree information and historical selection information of each communication path in a predetermined communication path set, wherein the historical selection information is information selected by a single communication path for communication at historical time;
determining a communication probability metric value for selecting the communication path to perform the current communication based on the historical congestion degree information and the historical selection information of the communication path for each communication path in the communication path set, wherein the communication probability metric value for selecting the communication path to perform the current communication is positively or negatively correlated with the communication probability for selecting the communication path to perform the current communication;
selecting a target communication path for carrying out the communication from the communication path set based on the communication probability metric of each communication path in the communication path set;
and performing communication through the target communication path.
In a second aspect, an embodiment of the present disclosure provides a communication apparatus, where the apparatus includes:
the communication path selection method comprises an acquisition unit, a selection unit and a selection unit, wherein the acquisition unit is configured to acquire historical congestion degree information and historical selection information of each communication path in a predetermined communication path set, and the historical selection information is information selected for communication by a single communication path at historical time;
the first determining unit is configured to determine, for each communication path in the communication path set, a communication probability metric value for selecting the communication path for the current communication based on the historical congestion degree information and the historical selection information of the communication path, wherein the communication probability metric value for selecting the communication path for the current communication is positively or negatively correlated with the communication probability for selecting the communication path for the current communication;
a selecting unit configured to select a target communication path for performing the current communication from the communication path set based on the communication probability metric of each communication path in the communication path set;
and a communication unit configured to communicate through the target communication path.
In a third aspect, an embodiment of the present disclosure provides an electronic device, including:
a memory for storing a computer program;
a processor for executing the computer program stored in the memory, and when the computer program is executed, implementing the method of any embodiment of the communication method of the first aspect of the present disclosure.
In a fourth aspect, the disclosed embodiments provide a computer readable medium, which when executed by a processor, implements the method as in any of the embodiments of the communication method of the first aspect described above.
In a fifth aspect, the disclosed embodiments provide a computer program comprising computer readable code which, when run on a device, causes a processor in the device to execute instructions for implementing the steps in the method as described in any of the embodiments of the communication method of the first aspect.
The communication method provided by the above embodiment based on the present disclosure includes obtaining historical congestion degree information and historical selection information of each communication path in a predetermined communication path set, where the historical selection information is information that a single communication path is selected to communicate at a historical time, then, for each communication path in the communication path set, determining a communication probability metric value for selecting the communication path to perform the current communication based on the historical congestion degree information and the historical selection information of the communication path, where the communication probability metric value for selecting the communication path to perform the current communication is positively or negatively correlated with the communication probability for selecting the communication path to perform the current communication, and then, based on the communication probability metric value of each communication path in the communication path set, selecting a target communication path for performing the current communication from the communication path set, and finally, carrying out communication through the target communication path. Therefore, the communication path used for the communication can be selected based on the historical congestion degree information and the historical selection information of the communication path, the historical congestion condition and the historical selection condition of the communication path are considered for selection, and the balance and low delay of communication path selection are favorably ensured.
The technical solution of the present disclosure is further described in detail by the accompanying drawings and examples.
Drawings
Other features, objects and advantages of the disclosure will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is an exemplary system architecture diagram of a communication method provided by an embodiment of the present disclosure;
fig. 2 is a flow chart of a communication method provided by an embodiment of the present disclosure;
FIG. 3 is a schematic diagram of one application scenario for the embodiment of FIG. 2;
fig. 4 is a flow chart of another communication method provided by the embodiments of the present disclosure;
fig. 5 is a schematic structural diagram of a communication device according to an embodiment of the present disclosure;
fig. 6 is a schematic structural diagram of an electronic device provided in an embodiment of the present disclosure.
Detailed Description
Various exemplary embodiments of the present disclosure will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of parts and steps, numerical expressions, and values set forth in these embodiments do not limit the scope of the present disclosure unless specifically stated otherwise.
It will be understood by those within the art that the terms "first," "second," and the like in the embodiments of the present disclosure are used merely to distinguish one object, step, device, or module from another object, and do not denote any particular technical meaning or logical order therebetween.
It is also understood that in embodiments of the present disclosure, "a plurality" may refer to two or more and "at least one" may refer to one, two or more.
It is also to be understood that any reference to any component, data, or structure in the embodiments of the disclosure, may be generally understood as one or more, unless explicitly defined otherwise or stated otherwise.
In addition, the term "and/or" in the present disclosure is only one kind of association relationship describing an associated object, and means that three kinds of relationships may exist, for example, a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" in the present disclosure generally indicates that the former and latter associated objects are in an "or" relationship.
It should also be understood that the description of the various embodiments of the present disclosure emphasizes the differences between the various embodiments, and the same or similar parts may be referred to each other, so that the descriptions thereof are omitted for brevity.
The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the disclosure, its application, or uses.
Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.
It should be noted that, in the present disclosure, the embodiments and features of the embodiments may be combined with each other without conflict. The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Fig. 1 is an exemplary system architecture diagram of a communication method provided by an embodiment of the present disclosure.
As shown in fig. 1, the system architecture 100 may include terminals 101, 102, networks 106, 107, and servers 103, 104, 105. The networks 106, 107 serve to provide a medium for communication links between the terminals 101, 102 and the servers 104, 105. The networks 106, 107 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
The user may use the terminals 101, 102 to interact with the servers 103, 104, 105 via the networks 106, 107 to receive or transmit data (e.g., transaction instructions or market information), etc. The terminals 101, 102 may have installed thereon various communication client applications, such as stock keeping software, digital currency trading systems, futures software, and the like.
The terminals 101, 102 may be hardware or software. When the terminals 101, 102 are hardware, they may be various electronic devices having a display screen and supporting information communication, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like. When the terminals 101 and 102 are software, they can be installed in the electronic devices listed above. It may be implemented as multiple pieces of software or software modules (e.g., software or software modules used to provide distributed services) or as a single piece of software or software module. And is not particularly limited herein.
The servers 103, 104, 105 may be servers providing various services, such as background servers performing corresponding processing on instructions sent by the terminals 101, 102. The background server can analyze and process the received operation instructions such as buy instructions, sell instructions and the like. As an example, the servers 103, 104, 105 may be cloud servers.
As an example, the server 103 may be a counter server, the server 103 may be an execution subject of the communication method provided by the embodiment of the present disclosure, and in addition, each unit, sub-unit, module, and sub-module described in the communication apparatus provided by the embodiment of the present disclosure may be disposed in the server 103. The server 104, 105 may be an exchange server, and the server 104, 105 may be a transaction server (i.e. a communication path, such as a transaction channel) that the server 103 needs to select.
It should be noted that the server may be hardware or software. When the server is hardware, the server can be implemented as a distributed server cluster formed by a plurality of servers, or can be implemented as a single server. When the server is software, it may be implemented as a plurality of software or software modules (for example, software or software modules for providing distributed services), or may be implemented as a single software or software module. And is not particularly limited herein.
It should be further noted that the communication method provided by the embodiment of the present disclosure may be executed by a server, a terminal, or a server and a terminal in cooperation with each other. Accordingly, each part (for example, each unit, sub-unit, module, sub-module) included in the communication apparatus may be entirely provided in the server, may be entirely provided in the terminal, and may be provided in the server and the terminal, respectively.
It should be understood that the number of terminals, networks and servers in fig. 1 is merely illustrative. There may be any number of terminals, networks, and servers, as desired for an implementation.
Fig. 2 shows a flow 200 of a communication method provided by an embodiment of the present disclosure. The communication method comprises the following steps:
In this embodiment, an executing entity of the communication method (for example, a terminal or a server shown in fig. 1) may acquire the historical congestion degree information and the historical selection information of each communication path in the predetermined communication path set by a wired connection manner or a wireless connection manner.
Each communication path may be uniquely identified by combining an IP (Internet Protocol) address and a port number. That is, any two communication paths in the communication path set have different IP addresses and/or port numbers.
The historical selection information may be information that a single communication path is selected to communicate in a historical time period, or may also be information that characterizes whether a single communication path was selected to communicate in the last selection, and so on. By way of example, the historical selection information may include, but is not limited to: the number of times, frequency, probability of being selected for communication within a historical period of time, whether the last or last few times was selected for communication, etc.
The historical congestion degree information can represent the congestion degree of a single communication path for communication in a historical time period, or the congestion degree of the single communication path selected for communication at the last time or last several times. Which may be characterized by adverbs indicating degrees, or alternatively, numerical values, letters, etc.
In some optional implementation manners of the present embodiment, the historical congestion degree information is represented by a numerical value. Each communication path in the communication path set corresponds to a first weight and a second weight. The first weight corresponding to the channel path is positively correlated with the historical congestion degree information. The second weight value sequence corresponding to the communication path set is an arithmetic progression. And the second weight value corresponding to each communication path in the communication path set is polled and updated according to a preset sequence after each selected communication. On the basis, the history selection information can be determined in the following way:
and determining historical selection information of each communication path in the communication path set based on the first weight and the second weight corresponding to the communication path.
The first weight corresponding to the channel path may be a predetermined multiple of the historical congestion degree information, or determined by using the following formula:
Wn＝M×RTTn÷(RTT1+RTT2+……+RTTn)
n is used for identifying communication paths in the communication path set, the value of n can represent the number of the communication paths in the communication path set, and WnThe first weight representing the communication path with the identifier n, and the M representing a predetermined value (e.g., 100, 1000), etc., the specific value of which may be determined according to the actual requirement, RTTnCharacterizing historical congestion level information for the communication path identified as n.
The second weight sequence corresponding to the communication path set may be { the second weight corresponding to communication path 1, the second weight corresponding to communication path 2, … …, and the second weight corresponding to communication path n }. N is used for identifying the communication paths in the communication path set, and the value of n can represent the number of the communication paths in the communication path set. In practice, the identity of each communication path in the set of communication paths may be determined in a variety of ways, and is not limited herein.
The predetermined order may be various predetermined orders.
As an example, if the communication path set includes three communication paths of communication path 1, communication path 2, and communication path 3, and communication path 1, communication path 2, and communication path 3 respectively correspond to the second weight: 100. 200/3, 100/3. Then, after selecting a communication path from the communication path set this time, in a process of selecting a communication path from the communication path set for the second time (for example, when determining historical selection information of the communication path based on the first weight and the second weight), the second weights respectively corresponding to the communication path 1, the communication path 2, and the communication path 3 may be: 200/3, 100/3, 100. In the process of selecting a communication path from the communication path set for the third time, the second weights corresponding to the communication path 1, the communication path 2, and the communication path 3 may be: 100/3, 100, 200/3.
In some application scenarios of the optional implementation manner, the execution main body may determine a sum of a first weight and a second weight corresponding to the communication path as the historical selection information of the communication path.
It can be understood that in the above application scenario, the communication path can be selected for communication by looking at the first weight and the second weight in equal amounts, which is beneficial to considering balance and low delay of communication path selection.
In some application scenarios of the above optional implementation, each communication path in the above communication path set further corresponds to a third weight, and the third weight corresponding to the communication path is determined by the communication initiator and/or the communication receiver. On this basis, the execution body may determine the historical selection information of the communication path based on the first weight, the second weight, and the third weight corresponding to the communication path.
The third weight corresponding to the communication path may be determined based on a preference, a hardware facility of the communication path, and the like via the communication initiator and/or the communication receiver.
In some cases of the application scenario, the execution body may determine the historical selection information of the communication path based on the first weight, the second weight, and the third weight corresponding to the communication path in the following manner:
first, the product of the first weight and the third weight corresponding to the communication path is obtained.
And then, determining the sum of the product corresponding to the signal path and the second weight corresponding to the communication path as the historical selection information of the communication path.
It can be understood that, in the above alternative implementation manner, the balance and low delay of the communication path selection are ensured by calculating the product of the first weight and the third weight corresponding to the communication path and the sum of the product and the second weight corresponding to the communication path.
In other cases of the application scenario, the execution body may further determine the historical selection information of the communication path based on the first weight, the second weight, and the third weight corresponding to the communication path in the following manner: and determining the result of the weighted summation of the first weight, the second weight and the third weight corresponding to the communication path as the historical selection information of the communication path.
Optionally, the executing body may further determine a result of weighted summation of the first weight and the second weight corresponding to the communication path as the history selection information of the communication path.
It is understood that, in the above alternative implementation manner, the first weight and the second weight may be combined to ensure the balance and low latency of the communication path selection.
In this embodiment, the executing entity may determine, for each communication path in the communication path set, a communication probability metric value for selecting the communication path for the current communication based on the historical congestion degree information and the historical selection information of the communication path.
The communication probability metric value for selecting the communication path to perform the communication at the time is positively or negatively correlated with the communication probability for selecting the communication path to perform the communication at the time.
As an example, the executing agent may use the sum of the historical congestion degree information and the historical extraction information of the communication path as the communication probability metric value for the communication path to perform the communication this time.
As another example, the executing entity may input the historical congestion degree information and the historical selection information into a metric determination model trained in advance, so as to obtain a communication probability metric for selecting the communication path for the current communication. The metric value determination model may be a two-dimensional table prepared based on a large number of statistics, or a convolutional neural network trained by a machine learning algorithm.
It should be noted that, in some cases, the historical selection information of each communication path may be determined based on the historical congestion degree information of the communication path, in this case, the step 202 may also be expressed as: and determining a communication probability metric value for selecting the communication path to carry out the communication at the time based on the historical selection information of the communication path for each communication path in the communication path set.
Therefore, the technical solutions of the embodiments of the present disclosure can cover the above situations, in other words, the technical solutions described in the above situations are covered in the protection scope of the technical solutions of the embodiments of the present disclosure, and both belong to the equivalent technical features.
In this embodiment, the executing entity may select a target communication path for performing the current communication from the communication path set based on the communication probability metric of each communication path in the communication path set.
In some optional implementation manners of this embodiment, the executing main body may execute step 203 in the following manner:
and determining the communication path with the maximum or minimum communication probability metric value in the communication path set as a target communication path for performing the current communication.
And step 204, performing communication through the target communication path.
In this embodiment, the execution body may perform communication through the target communication path.
In some optional implementations of this embodiment, the communication path is a transaction channel. The trading channel can be used for transmitting trading instructions such as buying or selling. On this basis, the executing entity may execute the step 204 in the following manner: and carrying out transaction through the target communication path.
It can be understood that, in the above optional implementation manner, the transaction channel used for performing the transaction may be selected based on the historical congestion degree information and the historical selection information of the transaction channel, and the historical congestion condition and the historical selection condition of the transaction channel are considered, which is helpful for ensuring the balance and low delay of the transaction channel selection.
In some optional implementations of this embodiment, the executing body may further determine, for each communication path in the communication path set, historical congestion degree information of the communication path based on at least one of a historical data sending delay time, a historical data transmission delay time, and a historical data receiving delay time of the communication path.
In some application scenarios in the above alternative implementation, the executing entity may determine the sum of the historical data sending delay time, the historical data transmission delay time and the historical data receiving delay time of the communication path as the historical congestion degree information of the communication path.
Optionally, the executing body may further determine, as the historical congestion degree information of the communication path, a result of weighted summation of the historical data sending delay time, the historical data transmission delay time, and the historical data receiving delay time of the communication path.
With continued reference to fig. 3, fig. 3 is a schematic diagram of an application scenario of the communication method according to the present embodiment. In the application scenario of fig. 3, there are 3 communication paths, i.e., communication channel 310, communication channel 320, and communication channel 330, between a communication initiator 301 (e.g., a terminal or a server shown in fig. 1) and a communication recipient 302 (e.g., a server or a terminal shown in fig. 1). Before the communication between the communication initiator 301 and the communication receiver 302, the communication initiator 301 may obtain the historical congestion degree information and the historical selection information of the communication channel 310, the communication channel 320 and the communication channel 330. The historical selection information is information which is selected by a single communication path to communicate in a historical time period. For example, the historical congestion degree information of the communication channel 310, the communication channel 320, and the communication channel 330 is: 1 microsecond, 0.8 microsecond, 1.2 microsecond. The communication channels 310, 320, 330 respectively correspond to the first weight and the second weight, the first weights corresponding to the communication channels 310, 320, 330 are 100/3, 80/3, 40, respectively, and the second weights corresponding to the communication channels 310, 320, 330 are 100, 200/3, 100/3, respectively.
Then, the communication initiator 301 may use both the first weight and the second weight as history selection information.
Subsequently, the communication initiator 301 may use the sum of the first weight and the second weight in the history selection information as a communication probability metric for selecting the communication path for the current communication.
Finally, the communication initiator 301 may select a communication channel with the largest communication probability metric value among the communication channels 310, 320, and 330 as a target communication path for performing the current communication, and perform communication through the target communication path.
Specifically, in the above example, the history selection information corresponding to the communication channel 310, the communication channel 320, and the communication channel 330 may be respectively: 400/3, 280/3, 220/3. Thus, the communication channel 310 may be selected as the target communication path.
The method provided by the above embodiment of the present disclosure includes acquiring historical congestion degree information and historical selection information of each communication path in a predetermined communication path set, where the historical selection information is information that a single communication path is selected to communicate in a historical time period, then, for each communication path in the communication path set, determining a communication probability metric value for selecting the communication path to perform the current communication based on the historical congestion degree information and the historical selection information of the communication path, where the communication probability metric value for selecting the communication path to perform the current communication is positively or negatively correlated with the communication probability for selecting the communication path to perform the current communication, and then, based on the communication probability metric value of each communication path in the communication path set, selecting a target communication path for performing the current communication from the communication path set, and finally, carrying out communication through the target communication path. Therefore, the communication path used for the communication can be selected based on the historical congestion degree information and the historical selection information of the communication path, the congestion condition and the historical selection condition of the communication path are considered, and the balance and low delay of communication path selection are favorably ensured.
With further reference to fig. 4, a flow 400 of yet another embodiment of a communication method is shown. The flow 400 of the communication method includes the following steps:
In this embodiment, an execution subject of the communication method (for example, a terminal or a server shown in fig. 1) may obtain the identifier of the communication initiator in a wired connection manner or a wireless connection manner. Then, according to the identification of the communication initiator, a random number corresponding to the communication initiator is generated.
The identifier of the communication initiator may be an ID (Identity document) of the communication initiator.
As an example, the executing body may randomly generate a random number after obtaining the identifier of the communication initiator, and use the random number as the random number corresponding to the communication initiator.
As another example, the execution body may use a hash value of the identifier of the communication initiator as the random number corresponding to the communication initiator.
In this embodiment, the execution body may determine the number of communication paths included in the communication path set to obtain the number of paths.
In step 403, the remainder of the random number and the number of paths is calculated.
In this embodiment, the execution body may calculate a remainder of the random number and the number of paths.
Step 404 is to determine a communication path having a mapping relation with the remainder among the communication path set as a candidate communication path based on a predetermined mapping relation.
In this embodiment, the executing body may determine, as the candidate communication path, a communication path having a mapping relationship with the remainder among the communication path set, based on a predetermined mapping relationship.
The mapping relationship may represent a correspondence between remainders of different values and communication paths in the communication path set.
As an example, each differently valued remainder may have a correspondence with one of the set of communication paths.
Here, each communication path (including the candidate communication path) in the communication path set corresponds to a first weight and a second weight, the first weight corresponding to the channel path is positively correlated with the historical congestion degree information, and the second weight corresponding to the candidate communication path in the communication path set is greater than the second weight corresponding to other communication paths except the candidate communication path in the communication path set. The historical congestion degree information is represented by a numerical value.
The historical selection information is information which is selected by a single communication path to communicate in a historical time period.
The communication probability metric value for selecting the communication path to perform the communication at the time is positively or negatively correlated with the communication probability for selecting the communication path to perform the communication at the time.
In this embodiment, the specific implementation manners of the steps 405 to 408 may refer to the related descriptions of the embodiment corresponding to fig. 2, and are not repeated herein. In addition, besides the above-mentioned contents, the embodiment of the present disclosure may further include the same or similar features and effects as the embodiment corresponding to fig. 2, and details are not repeated herein.
As can be seen from fig. 4, the flow 400 of the communication method in this embodiment may further improve the balance of selecting the communication path by establishing a mapping relationship.
With further reference to fig. 5, as an implementation of the method shown in the above figures, the present disclosure provides an embodiment of a communication device, which corresponds to the method embodiment shown in fig. 2-4, and which may include the same or corresponding features as the method embodiment shown in fig. 2-4, in addition to the features described below, and which produces the same or corresponding effects as the method embodiment shown in fig. 2-4. The device can be applied to various electronic equipment.
As shown in fig. 5, the communication apparatus 500 of the present embodiment. The above apparatus 500 includes: an acquisition unit 501, a first determination unit 502, a selection unit 503, and a communication unit 504. The acquiring unit 501 is configured to acquire historical congestion degree information and historical selection information of each communication path in a predetermined communication path set, wherein the historical selection information is information that a single communication path is selected for communication in a historical time period; a first determining unit 502, configured to determine, for each communication path in the communication path set, a communication probability metric value for selecting the communication path for the current communication based on the historical congestion degree information and the historical selection information of the communication path, where the communication probability metric value for selecting the communication path for the current communication is positively or negatively correlated with the communication probability for selecting the communication path for the current communication; a selecting unit 503, configured to select a target communication path for performing the current communication from the communication path set based on the communication probability metric of each communication path in the communication path set; a communication unit 504 configured to communicate through the target communication path.
In this embodiment, the obtaining unit 501 of the communication apparatus 500 may obtain the historical congestion degree information and the historical election information of each communication path in a predetermined set of communication paths. The historical selection information is information which is selected by a single communication path to communicate in a historical time period.
In this embodiment, the first determining unit 502 may determine, for each communication path in the communication path set, a communication probability metric value for selecting the communication path for the current communication based on the historical congestion degree information and the historical selection information of the communication path. The communication probability metric value for selecting the communication path to perform the communication at the time is positively or negatively correlated with the communication probability for selecting the communication path to perform the communication at the time.
In this embodiment, the selecting unit 503 may select a target communication path for performing the current communication from the communication path set based on the communication probability metric of each communication path in the communication path set.
In the present embodiment, the communication unit 504 can perform communication through the above-described target communication path.
In some optional implementation manners of this embodiment, the historical congestion degree information is represented by a numerical value, each communication path in the communication path set corresponds to a first weight and a second weight, the first weight corresponding to a channel path is in positive correlation with the historical congestion degree information, a sequence of the second weights corresponding to the communication path set is an arithmetic progression, and the second weights corresponding to each communication path in the communication path set are polled and updated according to a predetermined sequence after being selected for communication each time; and
the history selection information is determined in the following way:
and determining historical selection information of each communication path in the communication path set based on the first weight and the second weight corresponding to the communication path.
In some optional implementation manners of this embodiment, the determining the historical selection information of the communication path based on the first weight and the second weight corresponding to the communication path includes:
and determining the sum of the first weight and the second weight corresponding to the communication path as the historical selection information of the communication path.
In some optional implementations of this embodiment, each communication path in the communication path set further corresponds to a third weight, and the third weight corresponding to the communication path is determined by the communication initiator and/or the communication receiver; and
the determining the historical selection information of the communication path based on the first weight and the second weight corresponding to the communication path includes:
and determining historical selection information of the communication path based on the first weight, the second weight and the third weight corresponding to the communication path.
In some optional implementation manners of this embodiment, the determining the historical selection information of the communication path based on the first weight, the second weight, and the third weight corresponding to the communication path includes:
calculating the product of the first weight and the third weight corresponding to the communication path to obtain the product corresponding to the communication path;
and determining the sum of the product corresponding to the communication path and the second weight corresponding to the communication path as the historical selection information of the communication path.
In some optional implementation manners of this embodiment, the historical congestion degree information is represented by a numerical value, each communication path in the communication path set corresponds to a first weight and a second weight, the first weight corresponding to a channel path is positively correlated with the historical congestion degree information, and the second weight corresponding to a candidate communication path in the communication path set is greater than the second weights corresponding to other communication paths except the candidate communication path in the communication path set; and
the candidate communication path is determined as follows:
generating a random number corresponding to a communication initiator according to the identifier of the communication initiator;
determining the number of communication paths contained in the communication path set to obtain the number of paths;
calculating the remainder of the random number and the path number;
determining a communication path having a mapping relation with the remainder among the communication path set as a candidate communication path based on a predetermined mapping relation; and
the history selection information is determined in the following way:
and determining historical selection information of each communication path in the communication path set based on the first weight and the second weight corresponding to the communication path.
In some optional implementation manners of this embodiment, the selecting unit 503 includes:
and a determining subunit (not shown in the figure) configured to determine, as a target communication path for performing the current communication, a communication path with the largest or smallest communication probability metric value in the communication path set.
In some optional implementations of this embodiment, the communication path is a transaction channel; and
the communication unit 504 includes:
a communication subunit (not shown) configured to conduct transactions via the target communication path.
In some optional implementations of this embodiment, the apparatus 500 further includes:
and a second determination unit (not shown in the figure) configured to determine, for each communication path in the communication path set, historical congestion degree information of the communication path based on at least one of a historical data issuing delay time, a historical data transmission delay time, and a historical data receiving delay time of the communication path.
In some optional implementation manners of this embodiment, the second determining unit includes:
and a determining module (not shown in the figure) configured to determine the sum of the historical data sending delay time, the historical data transmission delay time and the historical data receiving delay time of the communication path as the historical congestion degree information of the communication path.
In the apparatus 500 provided in the above embodiment of the present disclosure, the obtaining unit 501 may obtain historical congestion degree information and historical selection information of each communication path in a predetermined communication path set, where the historical selection information is information that a single communication path is selected to perform communication in a historical time period, then, the first determining unit 502 may determine, for each communication path in the communication path set, a communication probability metric value for selecting the communication path to perform the current communication based on the historical congestion degree information and the historical selection information of the communication path, where the communication probability metric value for selecting the communication path to perform the current communication is positively or negatively correlated with the communication probability for selecting the communication path to perform the current communication, and then, the selecting unit 503 may determine, based on the communication probability metric value of each communication path in the communication path set, a target communication path for performing the current communication is selected from the communication path set, and finally, communication section 504 may perform communication through the target communication path. Therefore, the communication path used for the communication can be selected based on the historical congestion degree information and the historical selection information of the communication path, the congestion condition and the historical selection condition of the communication path are considered, and the balance and low delay of communication path selection are favorably ensured.
Fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure, where the electronic device 600 shown in fig. 6 includes: at least one processor 601, memory 602, and at least one network interface 604 and other user interfaces 603. The various components in the electronic device 600 are coupled together by a bus system 605. It is understood that the bus system 605 is used to enable communications among the components. The bus system 605 includes a power bus, a control bus, and a status signal bus in addition to a data bus. For clarity of illustration, however, the various buses are labeled as bus system 605 in fig. 6.
The user interface 603 may include, among other things, a display, a keyboard, or a pointing device (e.g., a mouse, trackball, touch pad, or touch screen, among others.
It will be appreciated that the memory 602 in embodiments of the disclosure may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The non-volatile Memory may be a Read-Only Memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable PROM (EEPROM), or a flash Memory. Volatile Memory can be Random Access Memory (RAM), which acts as external cache Memory. By way of illustration and not limitation, many forms of RAM are available, such as Static random access memory (Static RAM, SRAM), Dynamic Random Access Memory (DRAM), Synchronous Dynamic random access memory (Synchronous DRAM, SDRAM), Double Data Rate Synchronous Dynamic random access memory (ddr Data Rate SDRAM, ddr SDRAM), Enhanced Synchronous SDRAM (ESDRAM), synchlronous SDRAM (SLDRAM), and Direct Rambus RAM (DRRAM). The memory 602 described herein is intended to comprise, without being limited to, these and any other suitable types of memory.
In some embodiments, memory 602 stores the following elements, executable units or data structures, or a subset thereof, or an expanded set thereof: an operating system 6021 and application programs 6022.
The operating system 6021 includes various system programs, such as a framework layer, a core library layer, a driver layer, and the like, and is used for implementing various basic services and processing hardware-based tasks. The application program 6022 includes various application programs such as a Media Player (Media Player), a Browser (Browser), and the like, and is used to implement various application services. Programs that implement methods of embodiments of the disclosure can be included in the application program 6022.
In the embodiment of the present disclosure, by calling a program or an instruction stored in the memory 602, specifically, a program or an instruction stored in the application program 6022, the processor 601 is configured to execute the method steps provided by the method embodiments, for example, including: acquiring historical congestion degree information and historical selection information of each communication path in a predetermined communication path set, wherein the historical selection information is information selected by a single communication path for communication in a historical time period; determining a communication probability metric value for selecting the communication path to perform the current communication based on the historical congestion degree information and the historical selection information of the communication path for each communication path in the communication path set, wherein the communication probability metric value for selecting the communication path to perform the current communication is positively or negatively correlated with the communication probability for selecting the communication path to perform the current communication; selecting a target communication path for carrying out the communication from the communication path set based on the communication probability metric of each communication path in the communication path set; and performing communication through the target communication path.
The method disclosed by the embodiment of the present disclosure can be applied to the processor 601 or implemented by the processor 601. The processor 601 may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware or instructions in the form of software in the processor 601. The Processor 601 may be a general-purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, or discrete hardware components. The various methods, steps, and logic blocks disclosed in the embodiments of the present disclosure may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present disclosure may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software elements in the decoding processor. The software elements may be located in ram, flash, rom, prom, or eprom, registers, among other storage media that are well known in the art. The storage medium is located in the memory 602, and the processor 601 reads the information in the memory 602 and completes the steps of the method in combination with the hardware thereof.
It is to be understood that the embodiments described herein may be implemented in hardware, software, firmware, middleware, microcode, or any combination thereof. For a hardware implementation, the Processing units may be implemented within one or more Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), Field Programmable Gate Arrays (FPGAs), general purpose processors, controllers, micro-controllers, microprocessors, other electronic units configured to perform the functions described herein, or a combination thereof.
For a software implementation, the techniques described herein may be implemented by means of units performing the functions described herein. The software codes may be stored in a memory and executed by a processor. The memory may be implemented within the processor or external to the processor.
The electronic device provided in this embodiment may be the electronic device shown in fig. 6, and may perform all the steps of the communication method shown in fig. 2 to 4, so as to achieve the technical effects of the communication method shown in fig. 2 to 4, which please refer to the related descriptions of fig. 2 to 4 for brevity, and further will not be described herein again.
The disclosed embodiments also provide a storage medium (computer-readable storage medium). The storage medium herein stores one or more programs. Among others, the storage medium may include volatile memory, such as random access memory; the memory may also include non-volatile memory, such as read-only memory, flash memory, a hard disk, or a solid state disk; the memory may also comprise a combination of memories of the kind described above.
When one or more programs in the storage medium are executable by one or more processors to implement the above-described communication performed on the electronic device side.
The processor is configured to execute the communication program stored in the memory to implement the following steps of communication performed on the electronic device side:
acquiring historical congestion degree information and historical selection information of each communication path in a predetermined communication path set, wherein the historical selection information is information selected by a single communication path for communication in a historical time period; determining a communication probability metric value for selecting the communication path to perform the current communication based on the historical congestion degree information and the historical selection information of the communication path for each communication path in the communication path set, wherein the communication probability metric value for selecting the communication path to perform the current communication is positively or negatively correlated with the communication probability for selecting the communication path to perform the current communication; selecting a target communication path for carrying out the communication from the communication path set based on the communication probability metric of each communication path in the communication path set; and performing communication through the target communication path.
Those of skill would further appreciate that the various illustrative components and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative components and steps have been described above generally in terms of their functionality in order to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied in hardware, a software module executed by a processor, or a combination of the two. A software module may reside in Random Access Memory (RAM), memory, Read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
The above-mentioned embodiments, objects, technical solutions and advantages of the present disclosure are described in further detail, it should be understood that the above-mentioned embodiments are merely illustrative of the present disclosure and are not intended to limit the scope of the present disclosure, and any modifications, equivalent substitutions, improvements and the like made within the spirit and principle of the present disclosure should be included in the scope of the present disclosure.
Claims (10)
1. A method of communication, the method comprising:
acquiring historical congestion degree information and historical selection information of each communication path in a predetermined communication path set, wherein the historical selection information is information selected by a single communication path for communication at historical time;
determining a communication probability metric value for selecting the communication path to perform the current communication based on the historical congestion degree information and the historical selection information of the communication path for each communication path in the communication path set, wherein the communication probability metric value for selecting the communication path to perform the current communication is positively or negatively correlated with the communication probability for selecting the communication path to perform the current communication;
selecting a target communication path for carrying out the communication from the communication path set based on the communication probability metric of each communication path in the communication path set;
and communicating through the target communication path.
2. The method according to claim 1, wherein the historical congestion degree information is represented by numerical values, each communication path in the communication path set corresponds to a first weight and a second weight, the first weight corresponding to a channel path is positively correlated with the historical congestion degree information, the sequence of the second weights corresponding to the communication path set is an arithmetic progression, and the second weights corresponding to each communication path in the communication path set are polled and updated according to a predetermined sequence after being selected for communication each time; and
the history selection information is determined in the following way:
and determining historical selection information of each communication path in the communication path set based on the first weight and the second weight corresponding to the communication path.
3. The method according to claim 2, wherein the determining the historical selection information of the communication path based on the first weight and the second weight corresponding to the communication path comprises:
and determining the sum of the first weight and the second weight corresponding to the communication path as the historical selection information of the communication path.
4. The method of claim 2, wherein each communication path in the set of communication paths further corresponds to a third weight, and wherein the third weight corresponding to a communication path is determined by the communication initiator and/or the communication receiver; and
the determining the historical selection information of the communication path based on the first weight and the second weight corresponding to the communication path includes:
and determining historical selection information of the communication path based on the first weight, the second weight and the third weight corresponding to the communication path.
5. The method according to claim 4, wherein the determining the historical selection information of the communication path based on the first weight, the second weight, and the third weight corresponding to the communication path includes:
calculating the product of the first weight and the third weight corresponding to the communication path to obtain the product corresponding to the communication path;
and determining the sum of the product corresponding to the communication path and the second weight corresponding to the communication path as the historical selection information of the communication path.
6. The method according to claim 1, wherein the historical congestion degree information is represented by a numerical value, each communication path in the communication path set corresponds to a first weight and a second weight, the first weight corresponding to a channel path is positively correlated with the historical congestion degree information, and the second weight corresponding to a candidate communication path in the communication path set is greater than the second weights corresponding to other communication paths except the candidate communication path in the communication path set; and
the candidate communication path is determined as follows:
generating a random number corresponding to a communication initiator according to the identifier of the communication initiator;
determining the number of communication paths contained in the communication path set to obtain the number of paths;
calculating the remainder of the random number and the path number;
determining communication paths with the mapping relation with the remainder in the communication path set as candidate communication paths based on the predetermined mapping relation; and
the history selection information is determined in the following way:
and determining historical selection information of each communication path in the communication path set based on the first weight and the second weight corresponding to the communication path.
7. The method according to one of claims 1 to 6, characterized in that the method further comprises:
for each communication path in the set of communication paths, determining historical congestion level information for the communication path based on at least one of historical data issuance delay time, historical data transmission delay time, and historical data reception delay time for the communication path.
8. A communications apparatus, the apparatus comprising:
the communication path selection method comprises an acquisition unit, a selection unit and a selection unit, wherein the acquisition unit is configured to acquire historical congestion degree information and historical selection information of each communication path in a predetermined communication path set, and the historical selection information is information selected for communication by a single communication path at historical time;
the first determining unit is configured to determine, for each communication path in the communication path set, a communication probability metric value for selecting the communication path for the current communication based on the historical congestion degree information and the historical selection information of the communication path, wherein the communication probability metric value for selecting the communication path for the current communication is positively or negatively correlated with the communication probability for selecting the communication path for the current communication;
the selecting unit is configured to select a target communication path for performing the communication from the communication path set based on the communication probability metric of each communication path in the communication path set;
a communication unit configured to communicate through the target communication path.
9. An electronic device, comprising:
a memory for storing a computer program;
a processor for executing a computer program stored in the memory, and when executed, implementing the method of any of the preceding claims 1-7.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method of any one of the preceding claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110606263.7A CN113141305B (en) | 2021-05-31 | 2021-05-31 | Communication method, communication device, electronic equipment and computer-readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110606263.7A CN113141305B (en) | 2021-05-31 | 2021-05-31 | Communication method, communication device, electronic equipment and computer-readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113141305A true CN113141305A (en) | 2021-07-20 |
| CN113141305B CN113141305B (en) | 2021-11-23 |
Family
ID=76816025
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110606263.7A Active CN113141305B (en) | 2021-05-31 | 2021-05-31 | Communication method, communication device, electronic equipment and computer-readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113141305B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102945615A (en) * | 2012-11-26 | 2013-02-27 | 北京易华录信息技术股份有限公司 | Intelligent customizing method and intelligent customizing system |
| CN104517155A (en) * | 2013-09-26 | 2015-04-15 | Sap欧洲公司 | System used for dynamic path optimization and method thereof |
| CN109547965A (en) * | 2018-12-27 | 2019-03-29 | 国网江苏省电力有限公司南京供电分公司 | A kind of wireless sensor network paths planning method based on service priority |
| US20200021516A1 (en) * | 2017-06-20 | 2020-01-16 | Cisco Technology, Inc. | Network path selection |
| US20200177496A1 (en) * | 2017-10-17 | 2020-06-04 | Cloudminds (Shenzhen) Robotics Systems Co., Ltd. | Network path optimization method and system |
| CN111553685A (en) * | 2020-04-28 | 2020-08-18 | 中国工商银行股份有限公司 | Method, device, electronic equipment and storage medium for determining transaction routing channel |
| CN112003787A (en) * | 2020-08-14 | 2020-11-27 | 北京灵汐科技有限公司 | Routing path determining method, device, control equipment and storage medium |
-
2021
- 2021-05-31 CN CN202110606263.7A patent/CN113141305B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102945615A (en) * | 2012-11-26 | 2013-02-27 | 北京易华录信息技术股份有限公司 | Intelligent customizing method and intelligent customizing system |
| CN104517155A (en) * | 2013-09-26 | 2015-04-15 | Sap欧洲公司 | System used for dynamic path optimization and method thereof |
| US20200021516A1 (en) * | 2017-06-20 | 2020-01-16 | Cisco Technology, Inc. | Network path selection |
| CN110754066A (en) * | 2017-06-20 | 2020-02-04 | 思科技术公司 | Network path selection |
| US20200177496A1 (en) * | 2017-10-17 | 2020-06-04 | Cloudminds (Shenzhen) Robotics Systems Co., Ltd. | Network path optimization method and system |
| CN109547965A (en) * | 2018-12-27 | 2019-03-29 | 国网江苏省电力有限公司南京供电分公司 | A kind of wireless sensor network paths planning method based on service priority |
| CN111553685A (en) * | 2020-04-28 | 2020-08-18 | 中国工商银行股份有限公司 | Method, device, electronic equipment and storage medium for determining transaction routing channel |
| CN112003787A (en) * | 2020-08-14 | 2020-11-27 | 北京灵汐科技有限公司 | Routing path determining method, device, control equipment and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| 广泽晶等: "基于设备状态的通信业务可靠性分析及路由优化技术研究", 《软件》 * |
| 杨娜: "大数据分析下信息异常传输路径实时校正仿真", 《计算机仿真》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113141305B (en) | 2021-11-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110222533B (en) | Distributed data security application method and system and electronic equipment | |
| CN111343048B (en) | Pressure testing method and device, computer device and storage medium | |
| CN104331306B (en) | Content updating method, equipment and system | |
| JP2019503537A (en) | Method and apparatus for processing short link and short link server | |
| US10992594B2 (en) | Optimization of network resources | |
| TWI706362B (en) | Data processing method, device and server based on blockchain | |
| CN110750658B (en) | Recommendation method of media resource, server and computer readable storage medium | |
| US11216877B2 (en) | Automated electronic trade matching systems and methods | |
| CN112533209A (en) | Black product identification method and black product identification device | |
| WO2016146846A1 (en) | Combinatorial matching techniques for electronic data messages | |
| CN111144975B (en) | Order matching method, server and computer readable storage medium | |
| CN113141305B (en) | Communication method, communication device, electronic equipment and computer-readable storage medium | |
| CN110585717B (en) | Information processing method and device | |
| US9483528B1 (en) | Social ranking metric | |
| CN111144977B (en) | Stock order processing method and device | |
| US20130191265A1 (en) | Cloud-based system for performing online trading | |
| CN113312184A (en) | Service data processing method and related equipment | |
| CN108958931B (en) | Calculation migration method and device | |
| CN111985979A (en) | Method and device for processing invalid traffic information in advertisement service | |
| CN105243009A (en) | Method and device for determining use log | |
| CN113111078A (en) | Resource data processing method and device, computer equipment and storage medium | |
| CN114666294A (en) | Information sharing method, device, system, equipment and storage medium | |
| CN111163123A (en) | Service request processing method and device | |
| CN115758300B (en) | Data processing method, device, electronic equipment and storage medium | |
| US11669903B2 (en) | Differential privacy for axe obfuscation |
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 | ||
| CP03 | Change of name, title or address |
Address after: 9th Floor, Block A, Shenzhen National Engineering Laboratory Building, No. 20, Gaoxin South 7th Road, High-tech Zone Community, Yuehai Street, Nanshan District, Shenzhen, Guangdong 518000 Patentee after: Shenzhen Huayun Information System Technology Co.,Ltd. Address before: No. 904, block a, national engineering laboratory building, Gaoxin South 7th road digital technology park, Yuehai street, Nanshan District, Shenzhen, Guangdong 518000 Patentee before: Shenzhen Huayun Information System Co.,Ltd. |
|
| CP03 | Change of name, title or address |