CN113365310A - Data transmission method and device, storage medium and electronic device - Google Patents
Data transmission method and device, storage medium and electronic device Download PDFInfo
- Publication number
- CN113365310A CN113365310A CN202110605224.5A CN202110605224A CN113365310A CN 113365310 A CN113365310 A CN 113365310A CN 202110605224 A CN202110605224 A CN 202110605224A CN 113365310 A CN113365310 A CN 113365310A
- Authority
- CN
- China
- Prior art keywords
- link
- links
- transmission channel
- quality
- group
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0289—Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
- H04W28/24—Negotiating SLA [Service Level Agreement]; Negotiating QoS [Quality of Service]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Abstract
The embodiment of the invention provides a data transmission method, a data transmission device, a storage medium and an electronic device, wherein the method comprises the following steps: selecting M links from a group of links to establish a bottom link transmission channel; adjusting the transmission channel of the bottom layer link according to the link quality of each link in the M links to obtain a target transmission channel of the bottom layer link; and transmitting data through the target bottom link transmission channel. By the method and the device, the problem of poor data transmission quality is solved, and the effect of improving the data transmission quality is achieved.
Description
Technical Field
The embodiment of the invention relates to the field of communication, in particular to a data transmission method, a data transmission device, a storage medium and an electronic device.
Background
In a distributed network (mesh network, multi-hop network) composed of D2D communication users, since data transmission is usually performed using a frequency band of a cellular system, under the condition of complex network environment and interference of surrounding environment, the network quality of a network edge node is usually not effectively guaranteed, thereby affecting the data transmission quality.
Disclosure of Invention
The embodiment of the invention provides a data transmission method, a data transmission device, a storage medium and an electronic device, which are used for at least solving the problem of poor data transmission quality in the related technology.
According to an embodiment of the present invention, there is provided a data transmission method including:
selecting M links from a group of links to establish a bottom link transmission channel, wherein the group of links comprises at least two links, and M is a positive integer;
adjusting the transmission channel of the bottom layer link according to the link quality of each link in the M links to obtain a target transmission channel of the bottom layer link, wherein the link quality comprises: congestion status of the link, link window size;
and transmitting data through the target bottom link transmission channel.
In an exemplary embodiment, adjusting the transmission channel of the bottom link according to the link quality of each of the M links includes:
and under the condition that a newly added link exists in the group of links, adjusting the transmission channel of the bottom link according to the link quality of the newly added link and the link quality of each link in the M links.
In an exemplary embodiment, when there is a newly added link in the group of links, the adjusting the transmission channel of the underlying link according to the link quality of the newly added link and the link quality of each link in the M links includes one of:
if the value of M is a maximum threshold value, replacing a congested link in the transmission channel of the bottom link with the newly-added link when a congested link exists in the M links, wherein the link quality includes a congestion state of the link, and the maximum threshold value is a maximum value of the number of links that the transmission channel of the bottom link is allowed to include;
if the M value is the maximum threshold value, replacing the first link in the transmission channel of the bottom link with the newly added link under the condition that the link quality of the newly added link is higher than the link quality of the first link in the M links;
and if the M value is smaller than the maximum threshold value, adding the newly added link to the transmission channel of the bottom link.
In an exemplary embodiment, adjusting the transmission channel of the bottom link according to the link quality of each of the M links includes:
and under the condition that a fault link exists in the M links, adjusting the transmission channel of the bottom link according to the link quality of other links in the group of links, wherein the other links are links in the group of links except for the M links.
In an exemplary embodiment, when there is a failed link in the M links, adjusting the transmission channel of the underlying link according to link qualities of other links in the group of links includes:
and replacing the failed link in the M links with a second link under the condition that the second link with the link quality higher than a preset value exists in the other links.
In an exemplary embodiment, the selecting M links from a group of links to establish an underlying link transmission channel includes:
determining a link quality for each link in the set of links;
selecting M links from the group of links according to the link quality of each link in the group of links, wherein the M links are the links with link quality ranked in the top M in the group of links, and the ranking is in the order of the link quality from high to low;
and establishing the transmission channel of the bottom layer link by using the M links.
In one exemplary embodiment, the transmitting data through the target underlying link transmission channel includes:
acquiring a data packet to be transmitted;
determining idle weight of each link in the target bottom link transmission channel;
and transmitting the data packet through the link with the largest idle weight.
According to another embodiment of the present invention, there is provided a data transmission apparatus including:
the channel establishing module is used for selecting M links from a group of links to establish a bottom link transmission channel, wherein the group of links comprises at least two links, and M is an integer;
a channel adjusting module, configured to adjust the bottom-layer link transmission channel according to the link quality of each link in the M links, to obtain a target bottom-layer link transmission channel, where the link quality includes: congestion status of the link, link window size;
and the data transmission module is used for transmitting data through the target bottom link transmission channel.
According to a further embodiment of the present invention, there is also provided a computer-readable storage medium having a computer program stored thereon, wherein the computer program is arranged to perform the steps of any of the above method embodiments when executed.
According to yet another embodiment of the present invention, there is also provided an electronic device, including a memory in which a computer program is stored and a processor configured to execute the computer program to perform the steps in any of the above method embodiments.
According to the invention, the transmission channel of the bottom link is adjusted according to the link quality, so that the data transmission of the bottom link transmission channel with the optimal link quality is ensured, the problem of poor data transmission quality can be solved, and the effect of improving the data transmission quality is achieved.
Drawings
Fig. 1 is a block diagram of a hardware configuration of a mobile terminal of a data transmission method according to an embodiment of the present invention;
FIG. 2 is a flow chart of a method of data transmission according to an embodiment of the present invention;
fig. 3 is a block diagram of a data transmission apparatus according to an embodiment of the present invention;
FIG. 4 is a schematic block diagram of an embodiment of the present invention;
FIG. 5 is a flow chart one according to an embodiment of the present invention;
FIG. 6 is a second flowchart in accordance with an embodiment of the present invention;
FIG. 7 is a flow chart three according to an embodiment of the present invention;
fig. 8 is a fourth flowchart in accordance with an embodiment of the present invention.
Detailed Description
Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings in conjunction with the embodiments.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order.
The method embodiments provided in the embodiments of the present application may be executed in a mobile terminal, a computer terminal, or a similar computing device. Taking an example of the operation on a mobile terminal, fig. 1 is a hardware structure block diagram of the mobile terminal of a data transmission method according to an embodiment of the present invention. As shown in fig. 1, the mobile terminal may include one or more (only one shown in fig. 1) processors 102 (the processor 102 may include, but is not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA), and a memory 104 for storing data, wherein the mobile terminal may further include a transmission device 106 for communication functions and an input-output device 108. It will be understood by those skilled in the art that the structure shown in fig. 1 is only an illustration, and does not limit the structure of the mobile terminal. For example, the mobile terminal may also include more or fewer components than shown in FIG. 1, or have a different configuration than shown in FIG. 1.
The memory 104 may be used to store a computer program, for example, a software program and a module of application software, such as a computer program corresponding to a data transmission method in the embodiment of the present invention, and the processor 102 executes various functional applications and data processing by running the computer program stored in the memory 104, so as to implement the method described above. The memory 104 may include high speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 104 may further include memory located remotely from the processor 102, which may be connected to the mobile terminal over a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The transmission device 106 is used for receiving or transmitting data via a network. Specific examples of the network described above may include a wireless network provided by a communication provider of the mobile terminal. In one example, the transmission device 106 includes a Network adapter (NIC), which can be connected to other Network devices through a base station so as to communicate with the internet. In one example, the transmission device 106 may be a Radio Frequency (RF) module, which is used for communicating with the internet in a wireless manner.
In this embodiment, a data transmission method is provided, and fig. 2 is a flowchart according to an embodiment of the present invention, as shown in fig. 2, the flowchart includes the following steps:
step S202, M links are selected from a group of links to establish a bottom link transmission channel, wherein one group of links comprises at least two links, and M is a positive integer;
in this embodiment, the establishment of the underlying link transmission channel is to realize normal transmission of data between the transmitting end and the receiving end.
It should be noted that at least two communication nodes are included in one link.
Step S204, according to the link quality of each link in the M links, adjusting the transmission channel of the bottom link to obtain a target transmission channel of the bottom link, wherein the link quality comprises: congestion status of the link, link window size;
in this embodiment, the link quality may further include information such as channel strength of the link; the congestion state of the link can be (but is not limited to) determined by collecting the throughput, the time delay change, the packet loss, the effective transmission efficiency and the like of the link, and can also be obtained by calculating through a model formula; the link window size may be (but is not limited to) determined according to a plurality of levels divided in advance, and may also be determined according to the transmission amount of data and the transmission speed.
Step S206, data is transmitted through the target underlying link transmission channel.
Through the steps, the target bottom layer link transmission channel is adjusted according to the link quality before data transmission, so that the target bottom layer link transmission channel can meet the data transmission requirement, the problem of poor data transmission quality is solved, and the data transmission quality is improved.
The main body of the above steps may be a base station, a terminal, etc., but is not limited thereto.
In an optional embodiment, adjusting the transmission channel of the bottom link according to the link quality of each of the M links includes:
step S2042, under the condition that a newly added link exists in a group of links, adjusting the transmission channel of the bottom link according to the link quality of the newly added link and the link quality of each link in the M links.
In this embodiment, when a newly added link is found, the link quality of the currently performed data transmission link is determined first, and when the link quality of the current link is better, the newly added link is not needed to be used for data transmission, otherwise, the link with poor quality of the current link needs to be replaced by the newly added link, thereby ensuring the data transmission quality.
The number of the newly added links may be one or at least two.
In an optional embodiment, when a newly added link exists in a group of links, adjusting a transmission channel of a bottom link according to a link quality of the newly added link and a link quality of each of M links, where the adjusting includes one of:
if the value M is the maximum threshold value, replacing the congested link in the transmission channel of the bottom link with a newly added link under the condition that the congested link exists in the M links, wherein the link quality comprises the congestion state of the link, and the maximum threshold value is the maximum value of the number of links allowed to be included in the transmission channel of the bottom link;
in this embodiment, when the value M is the maximum threshold value, it indicates that a new link cannot be added to the current transmission channel of the bottom link, and at this time, the congested link in the transmission channel of the bottom link is replaced with the new link, so that the congested link can be prevented from affecting the data transmission quality, and the data transmission quality can be ensured.
If the M value is the maximum threshold value, replacing the first link in the transmission channel of the bottom link with the newly added link under the condition that the link quality of the newly added link is higher than that of the first link in the M links;
in this embodiment, when the value M is the maximum threshold value, it indicates that a new link cannot be added to the current transmission channel of the bottom link, and at this time, the data transmission quality of the current transmission channel of the bottom link can be improved by replacing the first link in the transmission channel of the bottom link with the new link, so as to ensure the data transmission quality.
And if the value of M is less than the maximum threshold value, adding the newly added link to the transmission channel of the bottom link.
In this embodiment, if the value of M is smaller than the maximum threshold, it indicates that a new link may be added to the current transmission channel of the bottom link, and at this time, a data transmission channel may be added by adding the new link to the transmission channel of the bottom link, so as to alleviate the data congestion condition and improve the data transmission quality.
In an optional embodiment, adjusting the transmission channel of the underlying link according to the link quality of each of the M links includes:
step S2044, under the condition that there is a faulty link in the M links, adjusting the transmission channel of the bottom link according to the link quality of other links in the group of links, where the other links are links in the group of links other than the M links.
In this embodiment, when a communication node in one link fails or changes, the entire link is prone to fail, and at this time, the high-quality links in other links are supplemented to the transmission channel of the underlying link, so that normal data transmission in the transmission channel of the underlying link can be ensured.
In an optional embodiment, in the case that there is a failed link in M links, adjusting the transmission channel of the underlying link according to the link quality of other links in a group of links includes:
step S20442, in the case that there is a second link with link quality higher than the preset value in the other links, replacing the failed link in the M links with the second link.
In this embodiment, replacing the failed link with the second link with a link quality higher than the preset value can ensure that the data of the transmission channel of the underlying link is normally transmitted.
The link quality is higher than the preset value, which may be (but is not limited to) the congestion condition is higher than the preset value, the window size is larger than the preset value, or other values are higher than the preset value.
In an optional embodiment, selecting M links from a group of links to establish a bottom link transmission channel includes:
step S2022, determining link quality of each link in a set of links;
step S2024, selecting M links from the group of links according to the link quality of each link in the group of links, wherein the M links are links with link quality ranked in the top M in the group of links, and the ranking is from high to low according to the link quality;
step S2026, establish a bottom link transmission channel using the M links.
In this embodiment, the M links are filtered and selected in a sorting manner, so that the link quality can be ensured to meet the data transmission requirement.
In an alternative embodiment, the transmitting data through the target underlying link transmission channel includes:
step S2062, obtaining a data packet to be transmitted;
step S2064, determining the idle weight of each link in the target bottom link transmission channel;
in step S2066, the data packet is transmitted through the link with the largest idle weight.
In this embodiment, the idle weight may be determined by calculating according to the congestion condition, a preset weight factor or congestion factor, and a window size; for example, the idle weight is congestion state congestion factor + send window, where the congestion factor may be set to 1000, so that there is a large gap between idle weights of different links.
Through the above description of the embodiments, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but the former is a better implementation mode in many cases. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, or a network device) to execute the method according to the embodiments of the present invention.
In this embodiment, a data transmission device is further provided, and the data transmission device is used to implement the foregoing embodiments and preferred embodiments, which have already been described and are not described again. As used below, the term "module" may be a combination of software and/or hardware that implements a predetermined function. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware, or a combination of software and hardware is also possible and contemplated.
Fig. 3 is a block diagram of a data transmission apparatus according to an embodiment of the present invention, as shown in fig. 3, the apparatus including:
a channel establishing module 32, configured to select M links from a group of links to establish a bottom-layer link transmission channel, where the group of links includes at least two links, and M is a positive integer;
a channel adjusting module 34, configured to adjust the bottom-layer link transmission channel according to the link quality of each link in the M links, to obtain a target bottom-layer link transmission channel, where the link quality includes: congestion status of the link, link window size;
and a data transmission module 36, configured to transmit data through the target underlying link transmission channel.
In an alternative embodiment, the channel adjustment module 34 includes:
the new adding adjusting unit 342 adjusts the transmission channel of the bottom link according to the link quality of the new added link and the link quality of each of the M links when the new added link exists in a group of links.
In an alternative embodiment, the new addition adjusting unit 342 includes one of the following:
a first new adding subunit 3422, configured to, when the value M is a maximum threshold value and a congested link exists in M links, replace the congested link in the transmission channel of the bottom link with a new link, where the link quality includes a congestion state of the link, and the maximum threshold value is a maximum value of the number of links that the transmission channel of the bottom link is allowed to include;
a second adding subunit 3424, configured to replace the first link in the transmission channel of the bottom link with the adding link when the value M is the maximum threshold value and the link quality of the adding link is higher than the link quality of the first link in the M links;
a third adding subunit 3422, configured to add the new added link to the underlying link transmission channel if the value of M is smaller than the maximum threshold.
In an alternative embodiment, the channel adjustment module 34 further comprises:
a failure adjusting unit 344, configured to, in a case that there is a failed link in the M links, adjust a transmission channel of the underlying link according to link qualities of other links in the set of links, where the other links are links other than the M links in the set of links.
In an alternative embodiment, the fault adjustment unit 344 comprises:
a failure replacing subunit 3442, configured to replace the failed link in the M links with a second link when there is a second link with link quality higher than a preset value in the other links.
In an alternative embodiment, the channel establishing module 32 includes:
a quality determination unit 322 for determining a link quality of each link in a set of links;
a link determining unit 324, configured to select M links from a group of links according to link quality of each link in the group of links, where the M links are links whose link quality is ranked as M top in the group of links, and the ranking is according to the order of link quality from high to low;
a channel establishing unit 326, configured to establish a bottom link transmission channel using the M links.
In an alternative embodiment, the data transmission module 36 includes:
a data acquisition unit 362, configured to acquire a data packet to be transmitted;
a link weight determination unit 364, configured to determine an idle weight of each link in the target underlying link transmission channel;
a data transmission unit 366, configured to transmit the data packet through the link with the largest idle weight.
It should be noted that, the above modules may be implemented by software or hardware, and for the latter, the following may be implemented, but not limited to: the modules are all positioned in the same processor; alternatively, the modules are respectively located in different processors in any combination.
The present invention will be described with reference to specific examples.
As shown in fig. 4 and 5, the method includes the following steps:
step S401, D2D link discovery. For example, between D1 and D2, D1 obtains neighbor information and link quality thereof by broadcasting, and establishes a link channel;
step S402, multilink aggregation transmission. For example, there are three A/B/C paths between D1 and D2, data are transmitted on the three paths simultaneously, and permutation and combination are performed at the receiving end;
step S403, aggregate link congestion control. In the data transmission process, performing congestion control on the link to send more data when the link is idle, fully utilizing bandwidth resources of the relay node, or reducing sending amount when the link is congested, so as to prevent link data from occupying too much original node service;
step S404, multilink dynamic adaptation. During data transmission, since the network quality changes as nodes are added or removed in a distributed network formed by D2D communication users, the aggregated links can be adapted to the change of network resources by dynamically adapting the network nodes.
Specifically, as shown in fig. 6, step S401 includes:
step S4011, after the service is started, the resident background provides continuous service until the service is finished.
Step S4012, link node information communicated with the target node is obtained in a broadcast form.
In step S4013, the quality of data links between different links is measured (refer to RFC6349, the measurement means is not limited thereto).
Step S4014, according to link communication quality, tabulation and grading are carried out on the multilinks.
Step S4015 sleeps for a period of time, and performs D2D link discovery again to refresh link information.
The link tabulation hierarchy is shown in table 1, for example, and it should be noted that the hierarchical tabulation is not limited to information such as link quality, congestion state, transmission window, and the like.
TABLE 1
As shown in fig. 7, step S402 includes:
building a chain:
step S4021: and D2D, when in communication, the sending end selects N links with higher link quality according to the multilink hierarchical table, and establishes a bottom link transmission channel with the opposite end.
Transmission (sender):
step S4022: when a sending end sends, selecting a link with the largest link idle weight, wherein:
calculation of idle weight congestion factor + send window
Transmission window size ═ window size- (transmission sequence number-response sequence number)
Step S4023: and the transmitting end transmits the data to the opposite end through the link with the maximum idle weight.
Step S4024: and judging the congestion state of the sending end and updating the idle weight information of the local link.
Transmission (receiving end):
step S4025: and after receiving the data, the receiving end carries out response operation for the reference of the sending end.
Step S4026: the receiving end rearranges the received data in the buffer queue according to the data identification information to obtain correct upper-layer application data.
Step S4027: and the receiving end delivers the rearranged application data to the upper layer application.
In step S403, since D2D aggregation link transmission is performed on multiple underlying links, the relay node on each link has the original service to be transmitted, and if the aggregation link occupies too much data, the traffic of the relay node is affected; therefore, by using the link congestion control, when the link is about to be congested, the link idle weight can be reduced, and the amount of data to be transmitted can be reduced. Wherein, the link congestion control can adopt mature congestion control mechanisms, such as TCP, GCC and the like; and when the link is congested or idle, the link quality information table is updated.
Wherein, the congestion factor is X (X >1000), and the window size is Y;
calculating idle weight as congestion state X + sending window;
y- (transmission sequence number-response sequence number);
it should be noted that, when calculating the idle weight, the congestion status takes a larger weight (i.e. by multiplying a larger number of congestion factors to ensure that the low-load link obtains a higher idle weight, and preferentially uses the low-load link to transmit data). The sending window is used for ensuring the sent data and carrying out subsequent sending after timely response is obtained.
As shown in fig. 8, step S404 includes:
in the case of link addition on the left side of fig. 8:
step S4041: an increase in available links is determined.
Step S4042: and measuring the channel quality and the data link quality of the newly added link.
Step S4043: and updating the link quality rating information table.
Step S4044: and judging whether a newly added link needs to be used or not according to the link in the current information table to replace the link with poor effect.
If the number of the links currently exists to reach the maximum N and the channel is not congested, the link is not lifted;
if the number of the existing links reaches the maximum N and the existing channel is continuously congested, replacing the congested channel;
if: and if the current link number does not reach the maximum N, increasing the links.
Step S4045: and if the link needs to be replaced, replacing the link with poor quality by using the newly added link, and carrying out the aggregation transmission.
In the case of link reduction on the right side of fig. 8:
step S4046: a decrease in available links is determined.
Step S4047: and updating the link quality rating information table.
Step S4048: and judging whether redundant links need to be used or not according to the links in the current information table, and replacing the deleted links.
Step S4049: and if the link needs to be replaced, replacing and deleting the link by using an idle link with higher quality, and carrying out the aggregation transmission.
Embodiments of the present invention also provide a computer-readable storage medium having a computer program stored thereon, wherein the computer program is arranged to perform the steps of any of the above-mentioned method embodiments when executed.
In an exemplary embodiment, the computer-readable storage medium may include, but is not limited to: various media capable of storing computer programs, such as a usb disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic disk, or an optical disk.
Embodiments of the present invention also provide an electronic device comprising a memory having a computer program stored therein and a processor arranged to run the computer program to perform the steps of any of the above method embodiments.
In an exemplary embodiment, the electronic apparatus may further include a transmission device and an input/output device, wherein the transmission device is connected to the processor, and the input/output device is connected to the processor.
For specific examples in this embodiment, reference may be made to the examples described in the above embodiments and exemplary embodiments, and details of this embodiment are not repeated herein.
It will be apparent to those skilled in the art that the various modules or steps of the invention described above may be implemented using a general purpose computing device, they may be centralized on a single computing device or distributed across a network of computing devices, and they may be implemented using program code executable by the computing devices, such that they may be stored in a memory device and executed by the computing device, and in some cases, the steps shown or described may be performed in an order different than that described herein, or they may be separately fabricated into various integrated circuit modules, or multiple ones of them may be fabricated into a single integrated circuit module. Thus, the present invention is not limited to any specific combination of hardware and software.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A method of data transmission, comprising:
selecting M links from a group of links to establish a bottom link transmission channel, wherein the group of links comprises at least two links, and M is a positive integer;
adjusting the transmission channel of the bottom layer link according to the link quality of each link in the M links to obtain a target transmission channel of the bottom layer link, wherein the link quality comprises: congestion status of the link, link window size;
and transmitting data through the target bottom link transmission channel.
2. The method of claim 1, wherein adjusting the underlying link transmission channel according to the link quality of each of the M links comprises:
and under the condition that a newly added link exists in the group of links, adjusting the transmission channel of the bottom link according to the link quality of the newly added link and the link quality of each link in the M links.
3. The method of claim 2, wherein in the case that there is a newly added link in the set of links, adjusting the transmission channel of the underlying link according to the link quality of the newly added link and the link quality of each of the M links comprises one of:
if the value of M is a maximum threshold value, replacing a congested link in the transmission channel of the bottom link with the newly-added link when a congested link exists in the M links, wherein the link quality includes a congestion state of the link, and the maximum threshold value is a maximum value of the number of links that the transmission channel of the bottom link is allowed to include;
if the M value is the maximum threshold value, replacing the first link in the transmission channel of the bottom link with the newly added link under the condition that the link quality of the newly added link is higher than the link quality of the first link in the M links;
and if the M value is smaller than the maximum threshold value, adding the newly added link to the transmission channel of the bottom link.
4. The method of claim 1, wherein adjusting the underlying link transmission channel according to the link quality of each of the M links comprises:
and under the condition that a fault link exists in the M links, adjusting the transmission channel of the bottom link according to the link quality of other links in the group of links, wherein the other links are links in the group of links except for the M links.
5. The method of claim 4, wherein adjusting the underlying link transmission channel according to link quality of other links in the set of links in the case of a failed link in the M links comprises:
and replacing the failed link in the M links with a second link under the condition that the second link with the link quality higher than a preset value exists in the other links.
6. The method of claim 1, wherein selecting M links from a set of links to establish a bottom link transmission channel comprises:
determining a link quality for each link in the set of links;
selecting M links from the group of links according to the link quality of each link in the group of links, wherein the M links are the links with link quality ranked in the top M in the group of links, and the ranking is in the order of the link quality from high to low;
and establishing the transmission channel of the bottom layer link by using the M links.
7. The method of claim 1, wherein transmitting data over the target underlying link transmission channel comprises:
acquiring a data packet to be transmitted;
determining idle weight of each link in the target bottom link transmission channel;
and transmitting the data packet through the link with the largest idle weight.
8. A data transmission apparatus, comprising:
the channel establishing module is used for selecting M links from a group of links to establish a bottom link transmission channel, wherein the group of links comprises at least two links, and M is a positive integer;
a channel adjusting module, configured to adjust the bottom-layer link transmission channel according to the link quality of each link in the M links, to obtain a target bottom-layer link transmission channel, where the link quality includes: congestion status of the link, link window size;
and the data transmission module is used for transmitting data through the target bottom link transmission channel.
9. A computer-readable storage medium, in which a computer program is stored, wherein the computer program is arranged to perform the method of any of claims 1 to 7 when executed.
10. An electronic device comprising a memory and a processor, wherein the memory has stored therein a computer program, and wherein the processor is arranged to execute the computer program to perform the method of any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110605224.5A CN113365310B (en) | 2021-05-31 | 2021-05-31 | Data transmission method and device, storage medium and electronic device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110605224.5A CN113365310B (en) | 2021-05-31 | 2021-05-31 | Data transmission method and device, storage medium and electronic device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113365310A true CN113365310A (en) | 2021-09-07 |
| CN113365310B CN113365310B (en) | 2023-03-24 |
Family
ID=77530621
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110605224.5A Active CN113365310B (en) | 2021-05-31 | 2021-05-31 | Data transmission method and device, storage medium and electronic device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113365310B (en) |
Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1781290A (en) * | 2003-03-13 | 2006-05-31 | 索尼株式会社 | Radio ad hoc communication system, terminal, and processing method therein |
| CN103339983A (en) * | 2012-09-29 | 2013-10-02 | 华为技术有限公司 | Data transmission method, apparatus, terminal and base station |
| CN105763366A (en) * | 2016-01-29 | 2016-07-13 | 浪潮(北京)电子信息产业有限公司 | Method and device for realizing data communication based on aggregation link |
| CN107113538A (en) * | 2014-12-04 | 2017-08-29 | Lg 电子株式会社 | The equipment that the method for D2D links is relayed in wireless communication system and this method is performed |
| CN107682258A (en) * | 2017-09-27 | 2018-02-09 | 北京邮电大学 | A kind of multi-path network transmission method and device based on virtualization |
| WO2018194433A1 (en) * | 2017-04-21 | 2018-10-25 | 삼성전자 주식회사 | Method and apparatus for distributing packets on multi-link in mobile communication network |
| CN108833202A (en) * | 2018-05-22 | 2018-11-16 | 华为技术有限公司 | Faulty link detection method, device and computer readable storage medium |
| CN108989139A (en) * | 2017-06-02 | 2018-12-11 | 中兴通讯股份有限公司 | A kind of management method and device of the link aggregation group based on CFM |
| US20190082373A1 (en) * | 2017-09-11 | 2019-03-14 | Qualcomm Incorporated | Techniques for multi-link aggregation signaling |
| CN109618373A (en) * | 2019-01-15 | 2019-04-12 | Oppo广东移动通信有限公司 | Link choosing method and relevant apparatus |
| EP3540994A1 (en) * | 2018-03-15 | 2019-09-18 | InterDigital CE Patent Holdings | Method and device for sending data packets on a first and a second links |
| CN111277502A (en) * | 2020-01-20 | 2020-06-12 | 北京红云融通技术有限公司 | Method for transmitting data by multi-link aggregation and transmitting equipment |
| CN111770551A (en) * | 2020-07-09 | 2020-10-13 | 南方电网科学研究院有限责任公司 | Method, system and equipment for communication between gateways of high-dynamic uncertain link |
| CN111836329A (en) * | 2019-04-19 | 2020-10-27 | Oppo广东移动通信有限公司 | Data transmission method and related device |
| CN112532518A (en) * | 2020-11-26 | 2021-03-19 | 新华三技术有限公司 | Path selection method and device of segment routing strategy |
-
2021
- 2021-05-31 CN CN202110605224.5A patent/CN113365310B/en active Active
Patent Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1781290A (en) * | 2003-03-13 | 2006-05-31 | 索尼株式会社 | Radio ad hoc communication system, terminal, and processing method therein |
| CN103339983A (en) * | 2012-09-29 | 2013-10-02 | 华为技术有限公司 | Data transmission method, apparatus, terminal and base station |
| CN107113538A (en) * | 2014-12-04 | 2017-08-29 | Lg 电子株式会社 | The equipment that the method for D2D links is relayed in wireless communication system and this method is performed |
| CN105763366A (en) * | 2016-01-29 | 2016-07-13 | 浪潮(北京)电子信息产业有限公司 | Method and device for realizing data communication based on aggregation link |
| WO2018194433A1 (en) * | 2017-04-21 | 2018-10-25 | 삼성전자 주식회사 | Method and apparatus for distributing packets on multi-link in mobile communication network |
| CN108989139A (en) * | 2017-06-02 | 2018-12-11 | 中兴通讯股份有限公司 | A kind of management method and device of the link aggregation group based on CFM |
| US20190082373A1 (en) * | 2017-09-11 | 2019-03-14 | Qualcomm Incorporated | Techniques for multi-link aggregation signaling |
| CN107682258A (en) * | 2017-09-27 | 2018-02-09 | 北京邮电大学 | A kind of multi-path network transmission method and device based on virtualization |
| EP3540994A1 (en) * | 2018-03-15 | 2019-09-18 | InterDigital CE Patent Holdings | Method and device for sending data packets on a first and a second links |
| CN108833202A (en) * | 2018-05-22 | 2018-11-16 | 华为技术有限公司 | Faulty link detection method, device and computer readable storage medium |
| CN109618373A (en) * | 2019-01-15 | 2019-04-12 | Oppo广东移动通信有限公司 | Link choosing method and relevant apparatus |
| CN111836329A (en) * | 2019-04-19 | 2020-10-27 | Oppo广东移动通信有限公司 | Data transmission method and related device |
| CN111277502A (en) * | 2020-01-20 | 2020-06-12 | 北京红云融通技术有限公司 | Method for transmitting data by multi-link aggregation and transmitting equipment |
| CN111770551A (en) * | 2020-07-09 | 2020-10-13 | 南方电网科学研究院有限责任公司 | Method, system and equipment for communication between gateways of high-dynamic uncertain link |
| CN112532518A (en) * | 2020-11-26 | 2021-03-19 | 新华三技术有限公司 | Path selection method and device of segment routing strategy |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113365310B (en) | 2023-03-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8301823B2 (en) | Bus controller arranged between a bus master and a networked communication bus in order to control the transmission route of a packet that flows through the communication bus, and simulation program to design such a bus controller | |
| CN109451534B (en) | Dynamic control method and device for QoS flow in session management of 5G system | |
| CN101686497B (en) | Cell load equalization method, and cell load evaluation method and device | |
| CN109526029B (en) | Service optimization method, medium, related device and equipment | |
| CN105474588B (en) | Adaptive traffic engineering configuration | |
| CN110139325B (en) | Network parameter tuning method and device | |
| CN112738820A (en) | Dynamic deployment method and device of service function chain and computer equipment | |
| CN110768837A (en) | Network slice virtual resource allocation method, system and device | |
| CN108174397A (en) | A kind of multiple gateway Synergistic method of task-driven | |
| CN107820321B (en) | Large-scale user intelligent access method in narrow-band Internet of things based on cellular network | |
| CN111181873B (en) | Data transmission method, data transmission device, storage medium and electronic equipment | |
| CN114143270B (en) | Bandwidth adjustment method and device | |
| WO2021163931A1 (en) | Data transmission method, terminal device, and network device | |
| CN102594902A (en) | BitTorrent node selecting method based on node performance | |
| Amer et al. | Delay analysis for wireless D2D caching with inter-cluster cooperation | |
| Kim et al. | Network-Aided Intelligent Traffic Steering in 5G Mobile Networks. | |
| US20220053373A1 (en) | Communication apparatus, communication method, and program | |
| WO2022142277A1 (en) | Method and system for dynamically adjusting communication architecture | |
| CN113365310B (en) | Data transmission method and device, storage medium and electronic device | |
| CN112788698A (en) | Data processing method and device and terminal equipment | |
| CN116806043A (en) | Routing method, device, electronic equipment and mobile edge network | |
| CN116647498A (en) | Dynamic selection method and system for multi-link network path | |
| CN113765703B (en) | Data transmission switching control method and system of intelligent gateway | |
| Huang et al. | An enhanced scheduling framework for elephant flows in SDN-based data center networks | |
| US20230100981A1 (en) | Method for determining a quality of service parameter, computer-readable storage medium, computer program, and communication device |
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 |