CN106102093A - A kind of multi-path data bag allocation schedule method in wireless self-organization network - Google Patents
A kind of multi-path data bag allocation schedule method in wireless self-organization network Download PDFInfo
- Publication number
- CN106102093A CN106102093A CN201610388348.1A CN201610388348A CN106102093A CN 106102093 A CN106102093 A CN 106102093A CN 201610388348 A CN201610388348 A CN 201610388348A CN 106102093 A CN106102093 A CN 106102093A
- Authority
- CN
- China
- Prior art keywords
- packet
- path
- source node
- time
- transmission
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
- H04W72/1221—Wireless traffic scheduling based on age of data to be sent
-
- 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/021—Traffic management, e.g. flow control or congestion control in wireless networks with changing topologies, e.g. ad-hoc networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of multi-path data bag allocation schedule method in wireless self-organization network, belong to technical field of wireless self-organizing.The method comprises the following steps: step one: packet, according to the round-trip delay of each paths and available bandwidth situation, is transmitted by source node by the preferred mulitpath selecting data transfer time minimum simultaneously；Step 2: source node dynamically adjusts the data package transmission velocity in each path according to the link delay situation that destination node is fed back；Step 3: after destination node receives the packet that source node sends, the packet received is sequentially placed into buffer area, waits to be read, and periodically the case propagation delays feedback of each bar link is beamed back source node.This method is no longer to take tradition continuous print mode but by the mode of a kind of intertexture, along mulitpath, packet can be respectively transmitted to destination node, so that packet can sequentially arrive destination node and makes buffer size and start time delay reduction.
Description
Technical field
The invention belongs to technical field of wireless self-organizing, relate to multi-path data bag in a kind of wireless self-organization network
Allocation schedule method.
Background technology
Along with the development of the computer network become increasingly popular, obtain the various letters needed for individual the most quickly and easily
Breath seems more important.People obtain information and are not limited by any time any place for convenience, have arisen at the historic moment one
Plant technology--the mobile communication technology needing primary study in computer realm.According to whether needing the support of infrastructure,
Mobile communications network is divided into two aspects, and an aspect is to need not the network that static infrastructure is supported, another side
Face is the network needing static infrastructure to support.
Need now static infrastructure support and to have been widely used network in the world be mobile communication backbone network,
Such as: CDMA (Code Division Multiple Access), GSM (Inter System Mobile
Communication) etc..But these networks are only suitable in the region of backbone network and are not having backbone network or backbone network
Network suffered in the region of significant damage inapplicable, as in desert or marine greatly and battlefield, disaster area, military operation, interim
The places such as meeting.And when run into when some emergency needs quickly transmission information be accomplished by provisionally, build rapidly new
Network.Therefore, wireless self-organization network (Wireless Self-organizing Network) just arises at the historic moment.
Due to the transmission demand of the big data quantities such as HD video, and the low time delay requirement that people are to business service, wireless
The pattern of single network transmission data in self-organizing network, can not meet business transmission demand.Therefore mobile Ad hoc network
In network, multipath parallel transmission technology is widely studied and applied, and improves network throughput, reduces time delay.Due to wireless from group
Asymmetric in terms of each network, the bandwidth of each link and time delay in knitmesh network, causes packet cannot arrive receiving terminal in order, goes out
Existing data packet disorder phenomenon.And the out of order packet of receiving terminal can retain and cannot pass to upper layer application in time in the buffer, meeting
Increase receiving terminal is congested, consume receiving terminal caching, cause unnecessary re-transmission, when ultimately resulting in throughput degradation, application process
Between increase.In existing wireless self-organization network, when carrying out packet multipath parallel transmission, fail fully to solve due to difference
Receiving terminal packet sequence that network, the isomerism of different link cause and transmitting terminal packet sequence inconsistence problems, this is also
It it is the difficult point of the out of order problem of packet multipath parallel transmission in wireless self-organization network.
Therefore, study and realize, how on existing Research foundation, packet being reasonably allocated on multilink parallel
Transmission, and make receiving terminal packet sequence and transmitting terminal packet sequence keep concordance to become the difficult point of research, have
Important realistic meaning.
Summary of the invention
In view of this, it is an object of the invention to provide multi-path data bag allocation schedule in a kind of wireless self-organization network
Method, the path that each packet in the method selects transfer delay minimum is transmitted, and can effectively slow down destination node
The packet received out of order, and reduce the destination sequence number of times to packet, therefore also reduce destination node
Start-up study and the demand to relief area.
For reaching above-mentioned purpose, the present invention provides following technical scheme:
A kind of multi-path data bag allocation schedule method in wireless self-organization network, in the method, source node is according to Ge Tiao road
The round-trip delay in footpath and available bandwidth situation select the path transmitting this packet transmission time minimum to be transmitted, destination node
Obtain chain-circuit time delay according to the situation receiving packet and periodically chain-circuit time delay feedback beamed back source node, source node basis again
The two-way time in each path dynamically adjusts the data package transmission velocity in each path；
Specifically include following steps:
S1: in wireless self-organization network multipath parallel transmission system, the packet marking sequence to be sent to each
Row k, and calculate this packet moment T through each path to destinationi,k；
S2: for the packet calculated in step S1 through the moment T in each path to destinationi,k, compare the moment minimum
Value Tmin=Min{T1, k, T2, k..., TN, k, and this packet is transmitted on the path that this moment minima is corresponding；
S3: repeat above step, until each packet transmission completes.
Further, in step sl, following steps are specifically included:
S11: calculate fl transmission time delay FTiAnd round-trip delay RTTi；Source node receives the delayed response that path i passes back and divides
After group message, so that it may estimate the current FT of this path iiValue.In the method, path round-trip time delay is estimated as forward direction roughly
The twice of propagation delay time, computing formula is RTTi=2FTi, in order to make Lubricity more preferable, then combine value sample and calculate RTTi
Value, computing formula is RTTi←βRTTi+(1-β)RTTi, wherein β represents ratio factor, takes empirical value 0.75 in the method；
S12: estimation bandwidth Bi: before sending packet, use SBPP (Sender-Based Packet Pair) to calculate
Method estimation bandwidth Bi；Westhood algorithm estimation bandwidth B is used in data transmission procedurei, wherein BiRepresent the i-th paths
Available bandwidth.SBPP, refer to based on packet to bandwidth estimation algorithm, only estimation source node is to the link band between destination node
Wide.Continuously transmit the different links between packet to two communication node that two sizes are P in the algorithm, and by two
The time interval Δ T of bar link goes to estimate the bandwidth of path i.Computing formula is Bi=P/ Δ T.Band width estimation method
Westhood, by one two-way time section RTTiData volume P of interior transmission goes to estimate the size of available bandwidth, computing formula
For Bi=P/max (RTTi, 50ms), the advantage of this algorithm is to substantially envisage influencing each other between interference flow.In order to
Make the estimated value of dynamic bandwidth more accurately, Lubricity better, then acquire the numerical value of multiple sample, formula isWherein α represents ratio factor, takes empirical value 0.875 in the method；
S13: according to formula Qi=Lb/BiIt is calculated on the i of path, the transmission time interval Q between this packeti(false
If the size of each packet is identical), wherein, LbRepresent the size of packet, QiRepresent on the i-th paths, send packet
Time interval；
S14: according to formula tI, k=t0+nI, k×Qi+FTiBeing calculated, on the i of path, this packet k passes from source node
It is passed to the time t that destination node is spentI, k, wherein QiFor between the time sending packet on the i-th paths in previous step
Every, t0On the basis of the moment, typically represent source node send first packet moment, nI, kRepresent from sending first data
Unwrap and begin in each process data packet of kth-1, the packet number sent on the i of path, FTiFor fl transmission on path
Time delay；The kth packet sent from source node arrives, through the i-th paths, the time t that destination node is spentI, k, can be by base
T between Zhun Shi0, plus having have sent n on pathI, kTotal time interval of individual packet, adds forward direction on the path
The transmission time tries to achieve；
S15: repeat the above steps, until having calculated the time that this packet transmits on each paths.
Further, in the method, after destination node receives the packet that source node sends, just by data cached bag, and
Periodically the case propagation delays of each bar link is fed back and beam back source node, set transmission delayed response time interval as 60s.
The beneficial effects of the present invention is: multi-path data bag distribution in a kind of wireless self-organization network that the present invention provides
Dispatching method, the path that each packet of the method selects transfer delay minimum is transmitted, and can effectively slow down destination node
The packet received out of order, and reduce the destination sequence number of times to packet, therefore decrease opening of destination node
Dynamic time delay and the demand to relief area.
Accompanying drawing explanation
In order to make the purpose of the present invention, technical scheme and beneficial effect clearer, the present invention provides drawings described below to carry out
Illustrate:
Fig. 1 is that multipath transmitting data in parallel bag selects Path Method figure；
Fig. 2 is that parallel data packet scheduling algorithm is embodied as block diagram；
Fig. 3 is the scheduling packet exemplary plot that each path is corresponding；
Fig. 4 is multipath parallel data packet scheduling exemplary graph；
Fig. 5 is data package transmission velocity update mechanism figure；
Fig. 6 is allocation of packets dispatching method workflow diagram.
Detailed description of the invention
Below in conjunction with accompanying drawing, the preferred embodiments of the present invention are described in detail.
For this data packet dispatching method of detailed description, first define some network parameters needing to use:
FTiFl transmission time delay for path i；RTTiRound-trip delay for path i；t0As benchmark
In the moment, typically represent source node and send the moment of first packet；N meets the number of the multipath of condition；Vi——
Represent the speed sending packet on the i-th paths；LbRepresent the size of packet；QiRepresent on the i-th paths
Send the time interval of packet；nI, kRepresent to unwrap from first data of transmission and begin to each process data packet of kth-1,
The packet number sent on the i of path；TiRepresent the chain-circuit time delay in the i-th paths；BiRepresent i-th
The available bandwidth in path；tI, kWhen representing kth packet transmission from source node to destination node on the i-th paths
Between.
Fig. 1 is that multipath transmitting data in parallel bag selects Path Method figure；
After source node receives the delayed response blocking message that path i passes back, so that it may estimate the current FT of this path iiValue.?
In this method, path round-trip time delay being estimated as the twice of fl transmission time delay roughly, computing formula is:
RTTi=2FTi
In order to make Lubricity more preferable, then combine value sample above and calculate RTTiValue, computing formula is:
RTTi←βRTTi+(1-β)RTTi
Wherein β represents ratio factor, takes empirical value 0.75 in the method.
Use SBPP (Sender-Based Packet Pair) algorithm estimation bandwidth Bi, continuously transmit two in the algorithm
Individual size is the different links between packet to two communication node of P, and goes to estimate by the time interval Δ T of both links
Calculate the bandwidth of path i.Computing formula is:
Bi=P/ Δ T
Westhood algorithm estimation bandwidth B is used in data transmission procedurei, by one two-way time section RTTiIn
Data volume P transmitted goes to estimate the size of available bandwidth.Computing formula is:
Bi=P/max (RTTi, 50ms)
In formula, α represents ratio factor, takes empirical value 0.875 in the method.
According to formula Qi=Lb/BiBeing calculated on the i of path, the transmission time interval between this packet is Qi(assume
The size of each packet is identical).
To sum up, can calculate on the i of path, packet k is transferred to, from source node, the time t that destination node is spentI, k, meter
Calculation formula is:
tI, k=t0+nI, k×Qi+FTi
From the packet k having calculated that, transmission cost time on each path, select path corresponding to minima and pass
Defeated this packet k, until all packets have all been transmitted.
Fig. 2 is that parallel data packet scheduling algorithm is embodied as block diagram；
For becoming apparent from explaining parallel data packet scheduling flow process, the path selection process false code form of packet is represented
Out.In code flow diagram, first initialization data nj=0, the minimum due in Minj of definition jth packet, with
And the transmission path of jth packet.Then circulated by two for, travel through all packets and all paths, its ectomesoderm
Each packet is operated by for circulation, and each paths is operated by internal layer for circulation.Interior loop makes
Use formula tI, k=t0+nI, k×Qi+FTiObtain the time that packet k transmits on the j of path, use if statement to realize each paths
On the size of packet k transmission time used is compared, and select reckling.
Fig. 3 is the scheduling packet exemplary plot that each path is corresponding；Five paths are had between assuming from source node to destination node.
The bandwidth of each paths is followed successively by: 0.4,0.3,0.5,0.7 and 0.1Mbps；412,475 packet transmission delay is followed successively by:,
594,865 and 945ms.Assume that each packet is 512 byte-sized, and select to send the initial time t of packet0As
Reference instant.Can get according to the multi-path data packet scheduling algorithm proposed in method, each packet is respectively as depicted
Transmission trend on bar link, the most front 124 packets sequential delivery from Article 1 path；124th to the 431st packet
Cross transfer from the first and second paths；432nd to the 857th packet is submitted from first, second, and third paths
Fork transmission；858th to the 1305th packet Cross transfer from first, second, third and fourth paths；Remaining data
Bag Cross transfer from five paths respectively.
Assume there are five paths in figure 3, and the bandwidth of each paths is followed successively by: 0.4,0.3,0.5,0.7 and
0.1Mbps；Packet transmission delay is followed successively by: 412, on the basis of 475,594,865 and 945ms, if from numbering the 1310th
As a example by data packet dispatching to the 1370th, describe packet and corresponding transmission pathway figure.Made figure represents each packet warp
After five paths Cross transfer, the transmission link corresponding to each packet.So, it can be seen that packet point
Joining scheduling mechanism transmission in mulitpath is not (except packet is at initial time in traditional mode in units of block
Continuously transmit on inherent Article 1 path), it is not cyclically to transmit between mulitpath in the way of simple poll, and
It is to select optimum path to transmit, so that packet sequence arrives in units of each packet and according to network parameter
Receiving terminal.Fig. 4 is multipath parallel data packet scheduling exemplary graph.
Fig. 5 is data package transmission velocity update mechanism figure, and this mechanism includes the two-way time obtaining each bar link in real time, from
And dynamic adjusting data packet sending speed.In data transmission procedure, first turning on intervalometer, the interval time of intervalometer is arranged
For 60s, obtain the fl transmission time delay in each path worked every the delayed response packet that 60s beams back according to destination node
FTi, and utilize formula RTTi=2FTi、RTTi←βRTTi+(1-β)RTTiAnd Bi=P/max (RTTi, 50ms) calculate and update each
Round-trip delay RTT on pathsiWith available bandwidth Bi, and the dynamic transmission rate adjusting each path accordingly, and recalculate each
The transmission time of link.
Fig. 6 is allocation of packets dispatching method workflow diagram；First source node splits data into equal-sized n number
According to bag, as a example by this sentences video stream data, n video data bag will be divided into by video stream data, then can according to each paths
The round-trip delay of each paths fed back to by bandwidth situation and destination node and, minimum preferred of data transfer time will be selected
Mulitpath packet is transmitted simultaneously, and according to destination node feedback link delay situation dynamically adjust each path
Data package transmission velocity, herein it is not intended that packet send after at the routing condition of respective path transmission；Destination node is received
After the packet that source node sends, on the one hand by data pack buffer, the order of caching is exactly the packet sequence accepted, due to
Packet is by transmission of front and back sorting, and is that the road strength selecting propagation delay time minimum is transmitted, so destination receives
To packet will not produce out of order problem, upper layer application can be submitted directly to；On the other hand periodically by each bar link time
Prolong situation feedback and beam back source node.
Finally illustrate, preferred embodiment above only in order to technical scheme to be described and unrestricted, although logical
Cross above preferred embodiment the present invention to be described in detail, it is to be understood by those skilled in the art that can be
In form and it is made various change, without departing from claims of the present invention limited range in details.
Claims (3)
1. multi-path data bag allocation schedule method in a wireless self-organization network, it is characterised in that: source node in the method
Round-trip delay and available bandwidth situation according to each paths select the path transmitting this packet transmission time minimum to pass
Defeated, destination node obtains chain-circuit time delay according to the situation receiving packet and periodically chain-circuit time delay feedback is beamed back source node,
Source node dynamically adjusts again the data package transmission velocity in each path according to the two-way time in each path；
Specifically include following steps:
S1: in wireless self-organization network multipath parallel transmission system, the packet marking serial number to be sent to each
K, and calculate this packet moment T through each path to destinationi,k；
S2: for the packet calculated in step S1 through the moment T in each path to destinationi,k, compare moment minima
Tmin=Min{T1, k, T2, k..., TN, k, and this packet is transmitted on the path that this moment minima is corresponding；
S3: repeat above step, until each packet transmission completes.
Multi-path data bag allocation schedule method in a kind of wireless self-organization network the most according to claim 1, its feature
It is: in step sl, specifically includes following steps:
S11: calculate fl transmission time delay FTiAnd round-trip delay RTTi: source node receives the delayed response packet that path i passes back and disappears
After breath, so that it may estimate the current FT of this path iiValue, meanwhile, by the twice that path round-trip delay estimation is fl transmission time delay,
Computing formula is RTTi=2FTi；
S12: estimation bandwidth Bi: before sending packet, use the estimation of SBPP (Sender-Based Packet Pair) algorithm
Bandwidth Bi；Westhood algorithm estimation bandwidth B is used in data transmission procedurei, wherein BiRepresent the available band of the i-th paths
Wide；SBPP, refer to based on packet to bandwidth estimation algorithm, only estimation source node is to the link bandwidth between destination node, at this
Algorithm continuously transmits the different links between packet to two communication node that two sizes are P, and passes through both links
Time interval Δ T go estimate path i bandwidth, computing formula is Bi=P/ Δ T；Band width estimation method Westhood passes through
One two-way time section RTTiData volume P of interior transmission goes to estimate the size of available bandwidth, and computing formula is Bi=P/max
(RTTi, 50ms)；
S13: according to formula Qi=Lb/BiIt is calculated on the i of path, the transmission time interval Q between this packeti(assume every
The size of individual packet is identical), wherein, LbRepresent the size of packet, QiRepresent send on the i-th paths packet time
Between be spaced；
S14: according to formula tI, k=t0+nI, k×Qi+FTiBeing calculated, on the i of path, this packet k is transferred to from source node
The time t that destination node is spentI, k, wherein QiFor the time interval sending packet on the i-th paths in previous step, t0
On the basis of the moment, typically represent source node send first packet moment, nI, kRepresent and unwrap the beginning from first data of transmission
In each process data packet of kth-1, the packet number sent on the i of path, FTiFor forward direction propagation delay time on path；
From source node send kth packet through i-th paths arrive destination node spent time tI, k, can be by benchmark
Time t0, plus having have sent n on pathI, kTotal time interval of individual packet, adds forward direction on the path and passes
The defeated time tries to achieve；
S15: repeat the above steps, until having calculated the time that this packet transmits on each paths.
Multi-path data bag allocation schedule method in a kind of wireless self-organization network the most according to claim 2, its feature
It is: in the method, after destination node receives the packet that source node sends, just by data cached bag, and periodically by each bar
The case propagation delays feedback of link beams back source node, sets transmission delayed response time interval as 60s.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610388348.1A CN106102093A (en) | 2016-06-02 | 2016-06-02 | A kind of multi-path data bag allocation schedule method in wireless self-organization network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610388348.1A CN106102093A (en) | 2016-06-02 | 2016-06-02 | A kind of multi-path data bag allocation schedule method in wireless self-organization network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106102093A true CN106102093A (en) | 2016-11-09 |
Family
ID=57447233
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610388348.1A Pending CN106102093A (en) | 2016-06-02 | 2016-06-02 | A kind of multi-path data bag allocation schedule method in wireless self-organization network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106102093A (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106850682A (en) * | 2017-03-22 | 2017-06-13 | 北京交通大学 | Data safe transmission method in space-air-ground integration information network |
| CN107426102A (en) * | 2017-07-26 | 2017-12-01 | 桂林电子科技大学 | Multipath parallel transmission dynamic decision method based on path quality |
| CN108696427A (en) * | 2017-04-11 | 2018-10-23 | 华为技术有限公司 | A kind of data transmission method and device |
| CN109379163A (en) * | 2018-09-05 | 2019-02-22 | 新华三技术有限公司 | A kind of message forwarding rate control method and device |
| CN110662256A (en) * | 2019-09-18 | 2020-01-07 | 北京交通大学 | Multi-path cross-protocol transmission data packet scheduling method and system |
| CN111416770A (en) * | 2020-02-21 | 2020-07-14 | 北京交通大学 | Self-adaptive scheduling system and method for cross-protocol convergence transmission |
| CN111464437A (en) * | 2020-05-11 | 2020-07-28 | 南京邮电大学 | Multipath transmission path optimization method based on forward time delay in vehicle-mounted heterogeneous network |
| WO2020176038A1 (en) * | 2019-02-25 | 2020-09-03 | Skylab Networks Pte. Ltd. | System and method for managing network traffic |
| CN112134895A (en) * | 2020-09-27 | 2020-12-25 | 中国人民解放军战略支援部队信息工程大学 | Endogenous safe network data stream processing method |
| CN112615764A (en) * | 2021-01-04 | 2021-04-06 | 重庆邮电大学 | Air-ground broadband link network bandwidth measuring method based on active and passive combination |
| CN113037624A (en) * | 2019-12-25 | 2021-06-25 | 华为技术有限公司 | Data flow control method and device |
| CN113055291A (en) * | 2021-04-29 | 2021-06-29 | 全球能源互联网研究院有限公司 | Data packet sending method, router and data packet transmission system |
| CN115277589A (en) * | 2022-06-30 | 2022-11-01 | 北京比特大陆科技有限公司 | Control data sending method, device, equipment and storage medium |
| CN117938980A (en) * | 2024-03-21 | 2024-04-26 | 北京火山引擎科技有限公司 | Data transmission method, device, equipment and medium applied to content distribution network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101888664A (en) * | 2010-06-25 | 2010-11-17 | 陶洋 | Video multi-path parallel transfer method in wireless self-organization network |
| CN102185771A (en) * | 2011-05-05 | 2011-09-14 | 清华大学 | Dispatching method and system for data packet of sender in MPTCP (Multipath TCP (Transmission Control Protocol)) |
-
2016
- 2016-06-02 CN CN201610388348.1A patent/CN106102093A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101888664A (en) * | 2010-06-25 | 2010-11-17 | 陶洋 | Video multi-path parallel transfer method in wireless self-organization network |
| CN102185771A (en) * | 2011-05-05 | 2011-09-14 | 清华大学 | Dispatching method and system for data packet of sender in MPTCP (Multipath TCP (Transmission Control Protocol)) |
Non-Patent Citations (3)
| Title |
|---|
| CASETTI C,ET AL: "TCP westwood:bandwidth estimation for enhanced transport over wireless", 《ACM WIRELESS NETWORKS》 * |
| OU C S,ZHANG JING,ET AL: "Near-optimal approaches for shared-path protection in WDM mesh networks", 《PRO OF IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS》 * |
| 陶洋，张传欣等: "并行多路传输中数据调度算法的研究", 《计算机应用研究》 * |
Cited By (24)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106850682B (en) * | 2017-03-22 | 2020-05-05 | 北京交通大学 | Data security transmission method in air-space-ground integrated information network |
| CN106850682A (en) * | 2017-03-22 | 2017-06-13 | 北京交通大学 | Data safe transmission method in space-air-ground integration information network |
| US11252078B2 (en) | 2017-04-11 | 2022-02-15 | Huawei Technologies Co., Ltd. | Data transmission method and apparatus |
| CN108696427A (en) * | 2017-04-11 | 2018-10-23 | 华为技术有限公司 | A kind of data transmission method and device |
| CN108696427B (en) * | 2017-04-11 | 2020-05-08 | 华为技术有限公司 | Data transmission method and device |
| CN107426102A (en) * | 2017-07-26 | 2017-12-01 | 桂林电子科技大学 | Multipath parallel transmission dynamic decision method based on path quality |
| CN109379163B (en) * | 2018-09-05 | 2021-11-23 | 新华三技术有限公司 | Message forwarding rate control method and device |
| CN109379163A (en) * | 2018-09-05 | 2019-02-22 | 新华三技术有限公司 | A kind of message forwarding rate control method and device |
| WO2020176038A1 (en) * | 2019-02-25 | 2020-09-03 | Skylab Networks Pte. Ltd. | System and method for managing network traffic |
| CN110662256A (en) * | 2019-09-18 | 2020-01-07 | 北京交通大学 | Multi-path cross-protocol transmission data packet scheduling method and system |
| CN110662256B (en) * | 2019-09-18 | 2021-03-23 | 北京交通大学 | Multi-path cross-protocol transmission data packet scheduling method and system |
| WO2021129861A1 (en) * | 2019-12-25 | 2021-07-01 | 华为技术有限公司 | Data flow control method and device |
| CN113037624A (en) * | 2019-12-25 | 2021-06-25 | 华为技术有限公司 | Data flow control method and device |
| CN111416770B (en) * | 2020-02-21 | 2021-05-14 | 北京交通大学 | Self-adaptive scheduling system and method for cross-protocol convergence transmission |
| CN111416770A (en) * | 2020-02-21 | 2020-07-14 | 北京交通大学 | Self-adaptive scheduling system and method for cross-protocol convergence transmission |
| CN111464437A (en) * | 2020-05-11 | 2020-07-28 | 南京邮电大学 | Multipath transmission path optimization method based on forward time delay in vehicle-mounted heterogeneous network |
| CN112134895A (en) * | 2020-09-27 | 2020-12-25 | 中国人民解放军战略支援部队信息工程大学 | Endogenous safe network data stream processing method |
| CN112615764A (en) * | 2021-01-04 | 2021-04-06 | 重庆邮电大学 | Air-ground broadband link network bandwidth measuring method based on active and passive combination |
| CN113055291A (en) * | 2021-04-29 | 2021-06-29 | 全球能源互联网研究院有限公司 | Data packet sending method, router and data packet transmission system |
| CN113055291B (en) * | 2021-04-29 | 2022-12-02 | 全球能源互联网研究院有限公司 | Data packet sending method, router and data packet transmission system |
| CN115277589A (en) * | 2022-06-30 | 2022-11-01 | 北京比特大陆科技有限公司 | Control data sending method, device, equipment and storage medium |
| CN115277589B (en) * | 2022-06-30 | 2023-08-29 | 北京比特大陆科技有限公司 | Control data sending method, device, equipment and storage medium |
| CN117938980B (en) * | 2024-03-21 | 2024-06-07 | 北京火山引擎科技有限公司 | Data transmission method, device, equipment and medium applied to content distribution network |
| CN117938980A (en) * | 2024-03-21 | 2024-04-26 | 北京火山引擎科技有限公司 | Data transmission method, device, equipment and medium applied to content distribution network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106102093A (en) | A kind of multi-path data bag allocation schedule method in wireless self-organization network | |
| CN105933232A (en) | Multi-path transmission control terminal and method for supporting multi-service data transmission | |
| CN103607358B (en) | Dynamic ECMP method and system based on link utilization rate average sum | |
| CN102752192B (en) | Bandwidth allocation method of forwarding and control element separation (ForCES) transmission mapping layer based on stream control transmission protocol (SCTP) | |
| CN105490962B (en) | A kind of QoS management methods based on OpenFlow networks | |
| CN102802266B (en) | Implementation method of high dynamic self-organization network high efficiency TDMA (time division multiple address) protocol | |
| CN104954206A (en) | Disorder analyzing method for multipath parallel transmission system | |
| CN110943772B (en) | Time division duplex time slot scheduling method for large-span space-based data chain | |
| CN101854697A (en) | Multi-constraint quality-of-service control routing method and system for wireless mesh network | |
| CN104734991B (en) | A kind of end-to-end time delay towards industrial backhaul network ensures transmission dispatching method | |
| CN104270793A (en) | Resource allocation method based on satellite cooperative transmission | |
| CN103888976A (en) | Link selection method combined with network scheduling and routing | |
| CN104935524B (en) | The soft load-balancing method that a kind of multipath network is controlled based on chain-circuit time delay | |
| Zhang et al. | A highly reliable link scheduling strategy for WirelessHART networks | |
| Wang et al. | Time-Sensitive Scheduling Mechanism based on End-to-End Collaborative Latency Tolerance for Low-Earth-Orbit Satellite Networks | |
| Yu et al. | Research of multi-path routing based on network coding in space information networks | |
| Zhang et al. | Noncooperative dynamic routing with bandwidth constraint in intermittently connected deep space information networks under scheduled contacts | |
| US20060002341A1 (en) | Methods and devices for scheduling the transmission of packets in configurable access wireless networks that provide Quality-of-Service guarantees | |
| CN105072046A (en) | Delay tolerant network congestion prevention method based on data concurrence and forwarding by token control node | |
| CN105119843A (en) | A method for setting a message buffer queue length | |
| Leung et al. | A resequencing model for high-speed packet-switching networks | |
| Guo et al. | Dynamic MAC protocol for tactical data links | |
| Shrivastava et al. | Effect of number of CBR Connections on the performance of a Load Balanced Congestion Adaptive Routing for MANET | |
| Sivanesan et al. | HMM based resource allocation and fuzzy based rate adaptation technique for MANET | |
| CN103533579B (en) | The scheduling processing method and dispatch server of data flow in streaming media service |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination |