CN103491014B - Jamming control method and system based on allocated bandwidth under a kind of space communication environment - Google Patents
Jamming control method and system based on allocated bandwidth under a kind of space communication environment Download PDFInfo
- Publication number
- CN103491014B CN103491014B CN201310398137.2A CN201310398137A CN103491014B CN 103491014 B CN103491014 B CN 103491014B CN 201310398137 A CN201310398137 A CN 201310398137A CN 103491014 B CN103491014 B CN 103491014B
- Authority
- CN
- China
- Prior art keywords
- bandwidth
- bandwidth value
- value
- connection
- path
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Abstract
The invention discloses jamming control method and system based on allocated bandwidth under a kind of space communication environment, in the time having new connection to add or to have the deletion of connection, each routing node on new connection or path, connection to be deleted place is redistributed bandwidth, and the distribution bandwidth value after redistributing is noticed to corresponding the making a start of each connection; Make a start and get in the distribution bandwidth value that routing node on path notices minimum of a value as sending bandwidth value, and the transmission bandwidth value after upgrading is noticed to all routing nodes of making a start on path, place; Routing node in connection adjusts allocated bandwidth according to sending bandwidth value again. The present invention is by carrying out allocated bandwidth control at routing node, in network, have and connect when adding or deleting, can adjust allocated bandwidth according to the network condition after changing in real time, can within a short period of time congestion window be adjusted, realize making full use of bandwidth.
Description
Technical field
The present invention relates to space communications technique field, relate in particular to base under a kind of space communication environmentIn jamming control method and the system of allocated bandwidth.
Background technology
In conventional TCP/IP network, the error code occurring in transfer of data and packet loss are all thoughtTo have occurred network congestion, then by reduction enter Congestion Avoidance threshold value, reenter slowStartup stage, is reduced the congestion control window of transfer of data. This jamming control method timeProlong that value is very little, can obtain good performance in error code and the lower TCP/IP network of packet loss,And required network overhead is very little. Compared with conventional TCP/IP network, space communication network toolThere is the feature of high time delay, high bit error and high packet loss. If use same congestion avoidance algorithm,The efficiency of transfer of data can be very low, can not reach very high network throughput.
For the feature of space communication environment, to congestion avoidance algorithm in conventional TCP/IP networkThe Vegas algorithm being improved of modifying. Improved Vegas algorithm is unlike conventional TCP/IPNetwork is such, error code and packet loss is all thought to network has occurred congested, but by making a start notDisconnected measurement goodput, and compare with the ideal throughput of thinking of making a start, judgeWhether network is now congested. If there is congested, can not look like conventional TCP/IP network yet, willCongestion window reduces by half immediately or is down to 1 and enters slow start stage, but according to the feedback letter of receiving endNumber ACK (Acknowledgement, acknowledge character) successively reduces congestion window, has ensuredThe efficiency of transmission and the handling capacity of network entirety. Although improved Vegas algorithm is for adapting to spaceThe channel characteristic of communication has been made amendment to traditional congestion avoidance algorithm, but still existsProblem and shortcoming:
1, slow start stage efficiency of transmission is lower: improved Vegas algorithm is also that a kind of end arrivesThe congestion control of end, the incipient stage need to be passed through slow start-up course. After transfer of data starts, headFirst transmit 1 or several packet, through a RTT, (RoundTripTime comes and goesTime delay) after obtain ACK feedback message, judge whether congested, if do not have congested increase congestedControl window. Slow start stage congestion control window increases by 1 times every 1 RTT, needsCould arrive congestion avoidance phase through multiple RTT, approach the maximum throughput of network. ?In the very little network of RTT, the slow process starting can be very short, and this lower efficiency of transmission is passableBe left in the basket. RTT value is larger, the impact of this lower efficiency of transmission on network entire throughputJust larger. In space communication, it is even several little that some RTT values can reach several seconds, a few minutesTime, now slow start stage is just particularly evident on the impact of efficiency of transmission.
2, the frequency problem that ACK sends: because improved Vegas algorithm is to return according to receiving endThe timestamp carrying in the ACK message of feedback obtains real-time goodput, so want to allowThe goodput of measuring is more accurate more in time, just need to strengthen receiving end feedback ACK messageFrequency. Therefore, the order of accuarcy of making a start to the judgement of network congestion situation, depends on that receiving end expendsHow many network overheads carry out feedback ACK message.
3, fairness problem: in improved Vegas algorithm, ideal throughput depends onThe minimum RTT value that receiving end records, so when certain chain occurring in multiple connection community networksLu Shi, distribution bandwidth fair between connection is difficult to be guaranteed.
In sum, in prior art for the space communication under the condition of high time delay bandwidth product,Not providing a kind of jamming control method can solve slow start stage congestion window can not realizeThe problem of adjusting rapidly, causes efficiency of transmission lower.
Summary of the invention
(1) technical problem that will solve
For above-mentioned defect, the technical problem to be solved in the present invention is for having high time delay bandwidthHow long-pending space communication network can be adjusted congestion window fast, with in the short periodInside reach higher network throughput.
(2) technical scheme
For addressing the above problem, the invention provides under a kind of space communication environment and divide based on bandwidthThe jamming control method of joining, specifically comprises the following steps:
S1, when have new connection to add or have connect delete time, described new connection or company to be deletedEach routing node on the path connecing is redistributed bandwidth, and after redistributingDistribution bandwidth value send to and distribute that bandwidth is vicissitudinous connects corresponding making a start;
S2, described in make a start according to the described distribution bandwidth of all routing nodes notice on path, placeValue is upgraded sending bandwidth value, and makes a start described in the transmission bandwidth value after upgrading is sent toAll routing nodes on path, place.
Further, step S1 specifically comprises:
S11, connect while deleting described new connection and/or wait to delete when having new connection to add or havingSend notice except connecting making a start of place to all routing nodes that connect path, place;
Each routing node basis on the path of S12, described new connection or connection to be deletedData are sent the linking number of common link bandwidth on port and the transmission bandwidth value of each connectionSituation of change bandwidth is redistributed, for this routing node of each process is sent portConnection distribute the corresponding bandwidth value that distributes;
S13, described distribution bandwidth value is sent to and distributes that bandwidth is vicissitudinous connects corresponding sending outEnd.
Further, step S2 specifically comprises:
S21, receive described distribution bandwidth value make a start according to described in make a start on path, placeThe distribution bandwidth value that routing node sends upgrades described transmission bandwidth value, upgrades and connects simultaneouslyThe congestion window connecting;
S22, by make a start described in sending to all on path, place of the transmission bandwidth value after upgradingRouting node.
Further, described congestion window is while sending round that bandwidth value and actual measurement obtainProlong after multiplying each other and round downwards again,, wherein CWND is congestedWindow, Bw_send is for sending bandwidth value, and RTT is round trip delay time.
Further, in step S21, described transmission bandwidth value is upgraded specifically and is comprised:
The distribution bandwidth value sending according to described routing node of making a start on path, place is selectedLittle value is upgraded as sending bandwidth value.
Further, after step S22, also comprise:
S23, on described path routing node send port, if described transmission bandwidth valueUnequal with described distribution bandwidth value, enter step S24;
S24, the size of described transmission bandwidth value and described distribution bandwidth value is judged, asThe described transmission bandwidth value of fruit is less than described distribution bandwidth value, unnecessary bandwidth is averagely allocated to itIt can append the connection that distributes bandwidth, upgrades the distribution bandwidth value of described connection as described transmissionBandwidth value, and described in upgrading, can append the distribution bandwidth value of the connection that distributes bandwidth, otherwise enterStep S25, wherein said unnecessary bandwidth is that described distribution bandwidth value deducts described transmission bandwidth valueThe difference obtaining;
S25, the size of described transmission bandwidth value and average bandwidth value is judged, if instituteState transmission bandwidth value and be less than described average bandwidth value, using described transmission bandwidth value as this connectionDistribution bandwidth value after renewal, and described transmission bandwidth value is deducted to described distribution bandwidth value obtainThe bandwidth that differs deduct from the connection that distributes bandwidth value to be greater than described average bandwidth value in proportion,Upgrade described distribution bandwidth value and be greater than the distribution bandwidth value that average bandwidth value connects, otherwise enter stepRapid S26, described average bandwidth value Bw_ave=Bw_total/N, wherein Bw_total is currentSend the total bandwidth of port link, N is the current linking number total on port of sending;
S26, the total bandwidth of described path on described link deduct described distribution bandwidth value and are less thanThe distribution bandwidth value that described average bandwidth value connects is as described remaining bandwidth, and will describedly remainRemaining bandwidth is distributed equally all the other connections, and described distribution bandwidth value is upgraded.
For solving the problems of the technologies described above, the present invention also provide under a kind of space communication environment based onThe congestion control system of allocated bandwidth, comprising: allocated bandwidth unit and bandwidth updating block;
Described allocated bandwidth unit, in the time having new connection to add or to have the deletion of connection, newly connectsConnect or the path of connection to be deleted on each routing node bandwidth is redistributed, andDistribution bandwidth value after redistributing is sent to and distributes corresponding the sending out of the vicissitudinous connection of bandwidthEnd;
The all routing nodes notices on path, place of making a start described in described bandwidth updating block is used forDistribution bandwidth value to send bandwidth value upgrade, and by upgrade after transmission bandwidth value sendAll routing nodes of making a start described in giving on path, place;
Wherein said making a start for realize the transmission of data on connecting, described routing node is used forRealize the forwarding to data.
Further, described allocated bandwidth unit comprises: connect updating block, allocation units andThe first transmitting element;
Described connection updating block is used in the time having new connection to add or to have the deletion of connection, described inMaking a start to all routing nodes that connect path, place of new connection and/or connection to be deleted placeSend notice;
Described allocation units are for each on the path of described new connection or connection to be deletedRouting node is sent linking number and each connection of common link bandwidth on port according to dataThe situation of change of transmission bandwidth value bandwidth is redistributed, be this route of each processThe connection of node distributes the corresponding bandwidth value that distributes;
Described the first transmitting element distributes bandwidth to have change for described distribution bandwidth value is sent toMaking a start of the connection correspondence of changing.
Further, described bandwidth updating block comprises: upgrade operating unit and second and send singleUnit;
Described renewal operating unit for receive described distribution bandwidth value make a start according to described inThe distribution bandwidth value that the routing node of making a start on path, place sends enters described transmission bandwidth valueRow upgrades, and upgrades the congestion window on connecting simultaneously;
Described the second transmitting element is made a start described in the transmission bandwidth value after upgrading is sent toAll routing nodes on path, place.
Further, described renewal operating unit upgrades concrete bag to described transmission bandwidth valueDraw together:
The distribution bandwidth value sending according to described routing node of making a start on path, place is selectedLittle value is upgraded as sending bandwidth value.
(3) beneficial effect
The invention provides the congestion control side based on allocated bandwidth under a kind of space communication environmentMethod and system, send by routing node basis the number and the actual transmission of each connection that on port, connectEffective distribution of bandwidth is carried out in the variation of bandwidth value to each connection. When there being new connection add or haveConnect while deletion, newly each routing node on the path of connection or connection to be deleted is to bandwidthRedistribute, and the distribution bandwidth value after redistributing will be sent to and distributes bandwidth to occurMaking a start of the connection correspondence changing. Point wearing of all routing nodes notices on path, place of making a startWide value is upgraded sending bandwidth value, and the transmission bandwidth value after upgrading is sent to the institute that makes a startAll routing nodes on path. In the process that bandwidth is redistributed, add according to connectionEnter or delete after the impact on allocated bandwidth in communication network, and according to redistributing rear bandThe impact that wide variation changes congestion window, distributes effectively to bandwidth. New when havingConnect while foundation, routing node upgrades the number of current connection, and total bandwidth is distributed;When causing allocated bandwidth to change owing to there being again new connection to add in built network, andTime according to current transmission bandwidth and adjust after distribution bandwidth determine new distribution bandwidth; When havingConnect and delete, will carry out equally redistributing of bandwidth, to adapt to the variation of network availability bandwidth,Thereby ensure the network throughput of every connection. The present invention divides by carrying out bandwidth at routing nodeJoin control, adjust in real time allocated bandwidth, with in prior art by transmitting-receiving two-end to network conditionPredict that the method for carrying out congestion control compares, can save to the transmitting-receiving two-end connecting and sendWhen packet judges according to ACK feedback message the time delay expending in the whether congested process of network againBetween, in prior art, slow start stage needs multiple RTT can reach the abundant profit of bandwidthWith, and the present invention only need to just can reach making full use of of bandwidth at a RTT, shortens networkingThe time that congestion window is adjusted.
Brief description of the drawings
Fig. 1 is based on allocated bandwidth under a kind of space communication environment in the embodiment of the present invention oneThe flow chart of steps of jamming control method;
Fig. 2 is the specific embodiment flow chart of routing node in the embodiment of the present invention one;
Fig. 3 is the specific embodiment flow chart of making a start in the embodiment of the present invention one;
Fig. 4 is the simulating scenes topological diagram of the preferred embodiment of the present invention;
Fig. 5 be preferred embodiment of the present invention simulating scenes the S1 that makes a start transmission bandwidth value in timeChange curve;
Fig. 6 be preferred embodiment of the present invention simulating scenes the S1 that makes a start round-trip delay in timeChange curve;
Fig. 7 be preferred embodiment of the present invention simulating scenes the S1 that makes a start congestion window in timeChange curve;
Fig. 8 be preferred embodiment of the present invention simulating scenes the S2 that makes a start transmission bandwidth value in timeChange curve;
Fig. 9 is that the round-trip delay of the S2 that makes a start of preferred embodiment of the present invention simulating scenes is with in timeChange curve;
Figure 10 be preferred embodiment of the present invention simulating scenes the S2 that makes a start congestion window in timeChange curve;
Figure 11 is based on allocated bandwidth under a kind of space communication environment in the embodiment of the present invention twoThe composition schematic diagram of congestion control system.
Detailed description of the invention
Below in conjunction with drawings and Examples, the specific embodiment of the present invention is done further in detailDescribe. Following examples are used for illustrating the present invention, but are not used for limiting the scope of the invention.
Embodiment mono-
In the embodiment of the present invention one, provide under a kind of space communication environment based on allocated bandwidthJamming control method, steps flow chart as shown in Figure 1, specifically comprises the following steps:
Step S1, when have new connection to add or have connect delete time, newly connect or to be deletedEach routing node on the path connecting is redistributed bandwidth, and will redistributeAfter distribution bandwidth value send to and distribute that bandwidth is vicissitudinous connects corresponding making a start;
Step S2, make a start according to the distribution bandwidth value of all routing nodes notice on path, placeUpgrade sending bandwidth value, and the transmission bandwidth value after upgrading is sent to the place road of making a startAll routing nodes on footpath.
The present invention by routing node according to sending actual of the number that connects on port and each connectionSend the variation of bandwidth value each connection to be carried out to effective distribution of bandwidth. Set up when there being new connectionTime, routing node upgrades the number of current connection, and total bandwidth is distributed; When there being connectionTransmission bandwidth value while changing, in time according to the current transmission bandwidth of this connection with point wearThe bandwidth allocation bandwidth value of the each connection of wide adjustment; Delete when having to connect, will carry out equally bandwidthRedistribute, to adapt to the variation of network availability bandwidth, thereby ensure that the network of every connection gulps downThe amount of telling. The present invention, by carrying out allocated bandwidth control at routing node, adjusts allocated bandwidth in real time,Compared with the method for by transmitting-receiving two-end, network condition being predicted in prior art, Ke YijieEconomize to the transmitting-receiving two-end transmission packet connecting and whether judge network according to ACK feedback message againThe delay time expending in congested process, in prior art, slow start stage needs multiple RTTCan reach making full use of of bandwidth, and the present invention only need to just can reach at a RTTMaking full use of of bandwidth, the time of shortening network congestion window adjusting.
Wherein step S1 specifically comprises the following steps:
Step S11, when have new connection to add or have connect delete time, newly connect and/or wait and deleteSend notice except connecting making a start of place to all routing nodes that connect path, place. Work as networkIn have to connect and add or delete, can cause current linking number to change, be to connection placeAll routing nodes send notice, inform that new connection adds or has the connection will be from netIn network, delete.
Each routing node basis on the path of step S12, newly connection or connection to be deletedData are sent the linking number of common link bandwidth on port and the transmission bandwidth value of each connectionSituation of change bandwidth is redistributed, for the connection of each this routing node of process dividesJoin corresponding distribution bandwidth value.
In the time having new connection to set up, what the routing node connecting according to the place of making a start sent dividesJoining bandwidth value selects minimum of a value to upgrade as sending bandwidth value. Make a start in selected routeAll routing nodes send to connect sets up notice (i.e. the first message), and request is carried out this connectionAllocated bandwidth. Routing node is received request, and the link circuit condition of sending port according to this connection carries outRedistributing of bandwidth, and inform the new distribution bandwidth value of connection that distributes bandwidth value to change(i.e. the second message). Data are made a start according to the distribution bandwidth value of all routes on the path of receiving,Choose minimum of a value as sending bandwidth value Bw_send, and be multiplied by the round trip delay time recording in real timeThe value of RTT, round numbers downwards obtains the congestion window CWND of this connection, and to institute on pathThere is routing node to notice selected Bw_send value (i.e. the 3rd message).
After transfer of data completes, all routing nodes of making a start in route send to connect and stopNotice (the 4th message), redistributes bandwidth after this connection of transistroute knot removal,And inform and distribute the new distribution bandwidth value (the second message) of connection that need to change of bandwidth value. RespectivelyThe second message is received in making a start of connecting, and upgrades the distribution bandwidth value of corresponding routing node, selected newBw_send, change CWND, and notice selected to all routing nodes on pathBw_send value (the 3rd message).
Step S13, by distributing bandwidth value to send to distribute, bandwidth is vicissitudinous connects corresponding sending outHold, inform the size of the bandwidth value of distribution.
Wherein step S2 specifically comprises the following steps:
Step S21, receive distribute bandwidth value make a start according to place make a start place connect onThe distribution bandwidth value that routing node sends upgrades sending bandwidth value, upgrades simultaneously and connectsCongestion window. Congestion window is wherein while sending round that bandwidth value and actual measurement obtainProlong after multiplying each other and round downwards again,CWND is congestion window,Bw_send is for sending bandwidth value, and RTT is round trip delay time.
Step S22, the transmission bandwidth value after upgrading is sent to all on path, place of making a startRouting node. The control transfer rate of wherein making a start, routing node is realized distribution and the data of bandwidthForward.
Step S23, on path routing node send port, if send bandwidth value with pointJoin bandwidth value unequal, enter step S24.
Step S24, judge with distributing the size of bandwidth value sending bandwidth value, if sent outSend bandwidth value to be less than distribution bandwidth value, unnecessary bandwidth is averagely allocated to other and can appends distributionThe connection of bandwidth, upgrades the distribution bandwidth value connecting as sending bandwidth value, and upgrades and can appendDistribute the distribution bandwidth value of the connection of bandwidth, otherwise enter step S25, wherein unnecessary bandwidth isDistribute bandwidth value to deduct and send the difference that bandwidth value obtains.
Step S25, the size that sends bandwidth value and average bandwidth value is judged, ifSend bandwidth value to be less than average bandwidth value, will send the distribution bandwidth of bandwidth value after upgradingValue, and transmission bandwidth value is deducted and distributes the bandwidth that differs that bandwidth value obtains to wear from dividing in proportionWide value is greater than in the connection of average bandwidth value to be deducted, and upgrades and distributes bandwidth value to be greater than average bandwidth valueThe distribution bandwidth value connecting, otherwise progressive rapid S26, average bandwidth valueBw_ave=Bw_total/N, wherein Bw_total is the current total bandwidth of sending port link, NSend linking number total on port for current.
In the total bandwidth on link of step S26, path, deduct as distributing bandwidth value to be less than on averageThe distribution bandwidth value that bandwidth value connects, as remaining bandwidth, and connects remaining bandwidth to all the otherBe distributed equally, to distributing bandwidth value to upgrade.
Routing node is received the 3rd message and allocated bandwidth is adjusted, when selected in this messageTransmission bandwidth value Bw_send value be not equal to that this routing node distributes this connectionWhen Bw_allocation value, allocated bandwidth is adjusted, with ensure the efficient of allocated bandwidth andJustice, and inform and distribute the new distribution bandwidth value of connection that need to change of bandwidth value (second disappearsBreath). Each making a start of connecting received the second message, upgrades the distribution bandwidth value of corresponding routing node,Selected new Bw_send, change CWND, and notice selected to all routing nodes on pathBw_send value (the 3rd message).
Therefore step S23～S26 realizes and according to different band wide-scenes, bandwidth being distributed, noNeed to predict network condition by transmission ACK message just can be in real time according to current networkThe situation that takies bandwidth is distributed, ensure the efficient utilization of bandwidth.
In specific implementation, on each routing node, there is unique mark for each connectionKnow array, described mark array comprises: connect numbering, connect the network address of making a start, flatAll bandwidth value, distribute bandwidth value, append allocation identification and amount of bandwidth mark. At routing nodeUpper each array by 6 elements is carried out unique identification, and this mark array is{ ID, SA, Bw_ave, Bw_ave, Bw_allocation, Pt_ad, Pt_ex}, each element in arrayImplication is as follows:
ID is the connection numbering of this connection;
SA is the network address of making a start in this connection;
Bw_ave is the average bandwidth value under current linking number, Bw_ave=Bw_total/N,Wherein Bw_total is the total bandwidth of link under current connection, and N is on the link of current connection placeTotal linking number;
Bw_allocation is the actual allocated bandwidth value of routing node to this connection;
Pt_ad, for appending allocation identification, is used to indicate in the time having unnecessary bandwidth, and whether this connectionDistribution be can append, this connection unsaturation, energy when allocation identification Pt_ad is 1, represented when appendingAppend and distribute unnecessary bandwidth; Represent described connection when appending when allocation identification Pt_ad is 0Saturated, can not append and distribute unnecessary bandwidth; It is in order to occur that this parameter of Pt_ad is setWhen unnecessary bandwidth, can carry out efficiently allocated bandwidth, the effective utilization guaranteeing network bandwidth.
Pt_ex is amount of bandwidth mark, is used to indicate the actual allocated bandwidth value when this connectionWhether Bw_allocation is greater than average bandwidth value Bw_ave. Amount of bandwidth mark Pt_ex is 1Represent to distribute bandwidth value Bw_allocation to be greater than average bandwidth value Bw_ave, when other is lower than flatAll the connection request of bandwidth value Bw_ave appends while distributing bandwidth, in the connection of Pt_ex=1, subtractsRemove suitable bandwidth value, the request of distributing to connects; Amount of bandwidth mark Pt_ex is that 0 expression dividesJoin bandwidth value Bw_allocation and be not more than average bandwidth value Bw_ave, need to chase after to other connectionBonus point is worn when wide, and the connection bandwidth of Pt_ex=0 is not subdued. This parameter of Pt_ex is set isFor in ensureing bandwidth-efficient utilization and handling capacity, ensure lower than the water distribution of bandwidth average markWhen network condition changes, can again get and should have bandwidth appears in flat being connected to, and guarantees justiceProperty.
Wherein for the specific embodiment flow process of routing node as shown in Figure 2, first routing nodeThe message receiving is judged:
(1) just show to have new connection to add if receive the first message, to thisLinking number N total on link upgrades, and obtains new linking number at original N+1,To upgrade the average bandwidth value in the connection of all these routing nodes of process,Bw_ave=Bw_total/N, wherein N is new linking number. Upgrade each connection Pt_ad simultaneouslyValue with Pt_ex.
Total bandwidth deducts the bandwidth sum of the connection actual allocated of all Pt_ex=0:
BwPt_ex＝1＝Bw_total-ΣPt_ex＝0Bw_allocation；
By BwPt_ex＝1Be averagely allocated to connection and this new connection of all Pt_ex=1, and upgradeThe Bw_allocation that Pt_ex=1 connectsnewValue:
Bw_allocationnew=BwPt_ex＝1/ (ex_num+1), the company that wherein ex_num is Pt_ex=1Connect number;
Add this new link information to routing node;
Send the second message to the connection of Pt_ex=0, inform the average bandwidth value that can distributeBw_ave；
Send the second message to the connection of Pt_ex=1, inform that the bandwidth value of actual allocated isBw_allocationnew。
(2) if receive the 3rd message, (the transmission bandwidth value of current connection i reality isBw_sendi)
Be greater than distribution bandwidth value, i.e. Bw_send if 1. send bandwidth valuei>Bw_allocationiNeed further judgement to distribute the size of bandwidth value and average bandwidth value:
If a) distribute bandwidth value to be not less than average bandwidth value, i.e. Bw_allocationi≥Bw_ave, sends the second message to this connection, informs that distributing bandwidth value is Bw_allocationi，And Pt_ad is set to 1.
If b) distribute bandwidth value to be less than average bandwidth value, i.e. Bw_allocationi<Bw_ave，Continue to judge Bw_sendiWith the size of Bw_ave, Bw_sendiWhen < Bw_ave to distributeBandwidth value upgrades, and sends the second message to this connection, informs the distribution bandwidth after renewalValue is Bw_allocationi=Bw_sendi, calculate the band of the connection actual allocated of all Pt_ex=1The wide summation that exceeds average bandwidth value, total_ex=∑Pt_ex＝1(Bw_allocationj-Bw_ave)
The value of Bw_allocation in the connection of renewal Pt_ex=1, and send the second message, pointWearing wide is Bw_allocationnew：
The value of Pt_ad, Pt_ex in the connection of renewal Pt_ex=1.
If when Bw_send >=Bw_ave, upgrade this connection Pt_ad=1, Pt_ex=1; Total bandThe bandwidth sum of the connection actual allocated of all Pt_ex=0 is gone in reductions:
BwPt_ex＝1=Bw_total-∑Pt_ex＝0Bw_allocation；
By BwPt_ex＝1Be averagely allocated to the connection of all Pt_ex=1, upgrade Pt_ex=1 and connectBw_allocation value, and send the second message, distribution bandwidth is Bw_allocationnew
Bw_allocationnew=BwPt_ex＝1／ex_num
The linking number that wherein ex_num is Pt_ex=1.
Be less than distribution bandwidth value, i.e. Bw_send if 2. send bandwidth valuei<Bw_allocationi，Upgrade this connection Pt_ad=0;
If Bw_sendi≤ Bw_ave, and Bw_ave < Bw_allocationiMake a start to this connectionSend the second message, inform that mean allocation bandwidth is Bw_ave, by unnecessary bandwidth(Bw_allocationi-Bw_sendi) distribute to the connection of Pt_ad=1, upgrade Pt_ad=1Connection Bw_allocation value:
Bw_allocationnew=Bw_allocation+(Bw_allocationi-Bw_sendi)／ad_numAnd send the second message to the connection of Pt_ad=1, inform that distributing bandwidth is Bw_allocation,The linking number that wherein ad_num is Pt_ad=1, upgrades this connectionBw_allocationi=Bw_sendi。
(3) if receive the 4th message (connecting i stops), on routing node, will connectMeet i and delete, linking number N total on this link subtracts 1, upgrades the Bw_ave of every connection,Bw_ave=Bw_total／N；
Connection for Pt_ad=1: will delete the distribution bandwidth B w_allocation connectingiOn averageDistribute to these and connect, upgrade Bw_allocation:
Bw_allocationnew=Bw_allocation+Bw_allocationi／ad_numAnd send the second message, inform that distributing bandwidth is Bw_allocationnew；
Connection for Pt_ad=0: if Bw_allocation≤Bw_ave, Pt_ex=0, accusesKnow that the mean allocation bandwidth of making a start after upgrading is Bw_ave.
For the specific embodiment flow process of making a start on connecting as shown in Figure 3, be respectively:
(1) connect and set up: all routing nodes on selected path send the first message,Notice new connection, request bandwidth allocation.
(2), while receiving the second message, upgrade the distribution bandwidth value of this routing node, and chooseMinimum of a value Bw_allocation_min in all routing node Bw_allocation is as this connectionThe transmission bandwidth value Bw_send selecting, multiplies each other and rounds downwards with the RTT recording in real time, obtainsCongestion control window CWND,And all on pathRouting node sends the 3rd message, informs the transmission bandwidth value Bw_send of actual selection.
(3) connect and stop: all routing nodes on selected path send the 4th message,Notice to connect and stop.
The present embodiment provides following preferred embodiment for said method, simulating scenes topological diagram asShown in Fig. 4, Fig. 4 repeater satellite R1, R2, R3, R4 forms simple communication network. WithR1 directly connected S1 makes a start as data, passes through link L2, and L3 is connected with R4 togetherR1 connects and transmits data (be designated and connect C1); The S2 conduct being directly connected with R3Data are made a start, and through link L1, L2 connects and transmits data (mark with the r2 being connected with R2Know for connecting C2); S3, S4 all passes through link L3 respectively with the r3 being connected with R4, r4The transmission data that connect (be designated respectively and connect C3, C4). Connect C1 and C2 transmissionWhen data, all pass toward R2 through R1, need shared link L2, therefore need R1 at L2 linkWay out C1, C2 are carried out to allocated bandwidth, the Way out of its link refers at thisOn link along the transmission direction of data; Connect C1, C3, C4 equal warp again in the time of transmission dataCross R2 and pass toward R4, need shared link L3, therefore need the Way out of R2 at L3 linkC1, C3, C4 are carried out to allocated bandwidth.
Suppose that the RTT that connects C1, C2 in Fig. 4 model of place is all about 8s, every linkBandwidth value be all made as 225pkts/s. The initial time of first default four connections: connect C1Connect at about 14s, 89s stops connecting; Connect C2 and connect at about 24s, 159sStop connecting; C3 connects at about 40s, and 60s stops connecting; C4 sets up at about 45sConnect, 70s stops connecting. Wherein the first message informs that for making a start routing node has new connection to addThe message entering, the second message is the routing node distribution bandwidth value size of informing this connection of making a startMessage, the 3rd message is the message of the transmission bandwidth value of informing routing node reality of making a start, the 4thMessage is to make a start to inform the message that this connection of routing node stops.
First,, in the time having new connection to set up, new each routing node connecting carries out bandwidthDistribute, and by distribute after distribution bandwidth value by the connection correspondence that sends to bandwidth value to changeMake a start. For example, after connecting C1 and setting up, the S1 that makes a start in this connection is to the institute on pathThere is routing node (being repeater satellite R1, R2 and R4) to send the first message, inform connectionSet up. Now in network, only have this 1 connection, connect all routing nodes in C1 pathThe outbound bandwidth of C1 join dependency is given connect C1 completely, and to connecting sending out of C1End S1 sends the second message, informs distribution bandwidth value. The S1 that makes a start chooses all routing nodes and dividesJoin minimum of a value in bandwidth value as sending bandwidth value Bw_send, congestion control windowCWND=Bw_send*RTT, and send message 3 to all routing nodes in path, informThe actual transmission bandwidth value of selecting is Bw_send. The now size of the transmission bandwidth value of S1Bw_send is 225pkts/s (bandwidth represents with the number of data packets of transmission per second).
Connecting after C1 foundation, just need to adjust bandwidth if there is again new connection to set upWhole, if connecting C2, another sets up, (be relaying to all routing nodes in path equallySatellite R3, R1 and R2) send the first message, now connect C1, C2 exists shared linkL2. Routing node R1 receives after the first message of C2 transmission, need utilize bandwidth according to connectionSituation, connects the bandwidth of L2 link to distribute to C1, C2, and connects and send out to twoEnd S1, S2 send the second message, inform new distribution bandwidth value. Make a start S1, S2 receivesAfter the second message that R1 sends, upgrade the distribution bandwidth value of R1, reselect all route jointsMinimum of a value in some distribution bandwidth value, as actual transmission bandwidth value Bw_send, is upgraded simultaneouslyCongestion window CWND, and again send the 3rd message to routing node in path, inform realityThe transmission bandwidth value of selecting. Now the Bw_send of S1, S2 is 112pkts/s.
Now existing two connect C1 and C2, and have public link L2, if continuedHaving new connection C3, C4 to set up, (is repeater satellite R2 to all routing nodes in pathAnd R4) transmission the first message, now C1, C3, C4 shared link L3. Routing nodeR2 connects the bandwidth of L3 to distribute to C1, C3, C4, and to the S1 that makes a start, S3,S4 sends the second message, informs new distribution bandwidth value. The S1 that makes a start receives rear renewal R2'sDistribute bandwidth value, again reselect and send bandwidth value Bw_send, upgrade congestion window simultaneouslyCWND, and send the 3rd message to routing node in path, inform the transmission band of actual selectionWide value. Now, the Bw_send of S1 is the bandwidth value 75pkts/s that R2 distributes.
Routing node R1 receives after the 3rd message of S1 transmission, by unnecessary bandwidth (Bw_allocation1-Bw_send1) distribute to connection C2, the distribution bandwidth value that upgrades C1 isBw_send1, the apportioning cost bandwidth of upgrading C2 isBw_allocation2=Bw_allocation2+(Bw_allocation1-Bw_send1), and send out to S2Send the second message, inform the distribution bandwidth value Bw_allocation after renewal2. S2 receives that R1 sends outAfter the second breath sending disappears, upgrade the distribution bandwidth value of R2, reselect transmission bandwidth valueBw_send, upgrades congestion window CWND, and sends the 3rd message to routing node in path,Inform the transmission bandwidth value of actual selection. Now, the Bw_send of S1 is 75pkts/s, S2'sBw_send is 187pkts/s.
In the time having the termination of connection, for example, after the transfer of data on 60s connection C3 completes,Connect C3 and stop, send the 4th message to the routing node in path, now only surplus connect C1,C4 shared link L3. R2 by the distribution allocated bandwidth of C3 to C1, C4. Dividing of C1 wornThe wide Bw_allocation that is updated to1=Bw_allocation1+Bw_allocation3/ 2, R2 sends to S1The second message, informs the distribution bandwidth value after renewal. S1 receive R2 send the second message after,Upgrade the distribution bandwidth value of R2, reselect and send bandwidth value Bw_send, upgrade congestion windowMouthful CWND, and send the 3rd message to routing node in path, inform the transmission of actual selectionBandwidth value. Now, the Bw_send of S1 is 112pkts/s.
Receive the routing node of making a start and making a start in the connection of place according to place that distributes bandwidth valueThe distribution bandwidth value sending upgrades sending bandwidth value, and routing node R1 receives S1 afterwardsAfter the 3rd message sending, the transmission bandwidth value that upgrades C1 is average bandwidth value, calculates residueIn connection, exceed the total bandwidth value of mean allocation value:
total_ex=∑Pt_ex＝1(Bw_allocationj-Bw_ave), and account for and exceed total band by exceeding partlyThe ratio of wide value is subdued the bandwidth value of distribution, redistributes to connecting C1. Upgrading C2 divides and wearsWide value:
R1 sends the second message to S2, informs the distribution bandwidth value after renewal. S2 receives that R1 sendsThe second message after, upgrade the distribution bandwidth value of R1, again according to the distribution bandwidth after upgradingValue selects to send bandwidth value Bw_send, upgrades congestion window CWND, and to route in pathNode sends the 3rd message, informs the transmission bandwidth value of actual selection. Now, S1, S2Bw_send is 112pkts/s.
Connect C1 at 89s and also stop, the S1 that makes a start that connects C1 connects C1 in pathOn routing node send the 4th message. Now link L2 monopolizes for connecting C2. R1 is by itBefore distribute to C1 bandwidth value distribute to C2, upgrade the distribution bandwidth value of C2:Bw_allocation2=Bw_allocation2+Bw_allocation1。
R1 sends the second message to S2, informs the distribution bandwidth value after renewal. S2 receives R1After the second message sending, upgrade the distribution bandwidth value of R2, again according to the distribution after upgradingBandwidth value selects to send bandwidth value Bw_send, upgrades congestion window CWND, and in pathRouting node sends the 3rd message, informs the transmission bandwidth value of actual selection. Now, S2Bw_send is 225pkts/s.
The transmission bandwidth value Bw_send of S1 of making a start in above-mentioned preferred enforcement is bent over timeLine as shown in Figure 5, the round-trip delay RRT of the S1 that makes a start over time curve as Fig. 6 instituteShow, the congestion window CWND temporal evolution curve of the S1 that makes a start as shown in Figure 7. S2 makes a startTransmission bandwidth value Bw_send over time curve as shown in Figure 8, the S2's that makes a start is pastReturn time delay RRT over time curve as shown in Figure 9, the congestion window CWND of the S2 that makes a startTemporal evolution curve as shown in figure 10.
The whole flow process of above preferred embodiment comprises:
Step S11, make a start after connecting and setting up, all routing nodes in selected route are sent outSend the first message, new connection of notice sets up, and request is carried out allocated bandwidth to this connection.
Step S12, routing node are received request, add new link information, upgrade each connectionAverage bandwidth value and Pt_ad, Pt_ex indicated value, total bandwidth deducts the connection reality of Pt_ex=0The bandwidth sum Bw that border is distributedPt_ex＝1=Bw_total-∑Pt_ex＝0Bw_allocation, by BwPt_ex＝1Be averagely allocated to the connection of Pt_ex=1, as actual distribution bandwidth value.
Step S13, routing node send the second message to the connection that distributes bandwidth value to change,Inform new distribution bandwidth value.
The distribution bandwidth value of all route assignment on step S21, the basis of the making a start path of receiving,Choose minimum of a value as sending bandwidth value Bw_send, and it is downward to be multiplied by the RTT value recording in real timeRound, obtain the congestion window CWND of this connection.
Step S22, making a start sends the 3rd message to all routing nodes on path, notices selectedBw_send value.
Or after transfer of data completes, above-mentioned steps S11～S22 is the owning in route of making a startRouting node sends the 4th message, informs to connect to stop, and this connection of transistroute knot removal,Upgrade each connection mean allocation bandwidth value and Pt_ad, Pt_ex value. By the distribution of this connectionBandwidth value on average appends the connection of distributing to Pt_ad=1, upgrades the distribution bandwidth of corresponding connectionValue, and inform the distribution bandwidth value after renewal to transmission second message of making a start of corresponding connection. RespectivelyThe second message is received in making a start of connecting, and upgrades the distribution bandwidth value of corresponding routing node, selected newBw_send, change CWND, and send the 3rd message to all routing nodes on path,Notice selected Bw_send value.
Step S23, bandwidth is redistributed again i.e. road in the time that linking number changesCarry out bandwidth adjustment by node.
Step S24, routing node receive that certain connects the 3rd message sending, when in this messageSelected Bw_send value is not equal to the distribution bandwidth value of this routing node to this connectionWhen Bw_allocation, allocated bandwidth is adjusted, to ensure the efficient and public of allocated bandwidthFlat, re-allocation process:
First to Bw_sendiAnd Bw_allocationiSize judge, whenBw_sendi＜Bw_allocationiTime, by unnecessary bandwidth (Bw_allocationi-Bw_sendi) averageAppend the connection of distributing to Pt_ad=1 in other links, upgrade the distribution bandwidth of corresponding connectionValue; Work as Bw_sendi＞Bw_allocationiTime, enter step S25.
Step S25, more further to Bw_sendiJudge with the size of Bw_ave, whenBw_allocationi＜Bw_sendiWhen < Bw_ave, the distribution bandwidth value of this connection is updated toBw_sendi. The connection of calculating Pt_ex=1 distributes bandwidth value to exceed the summation of average bandwidth value:total_ex=∑Pt_ex＝1(Bw_allocationj-Bw_ave), upgrade dividing of Pt_ex=1 connection and wearWide value:
Work as Bw_allocationi＜Bw_ave＜Bw_sendiTime, enter step S26.
Step S26, calculate total bandwidth deduct all Pt_ex=0 connect actual allocated bandwidth itWith: BwPt_ex＝1=Bw_total-∑Pt_ex＝0Bw_allocation. By BwPt_ex＝1Be averagely allocated to thisConnect and the connection of other Pt_ex=1, upgrade the distribution bandwidth value of corresponding connection.
After redistributing, send the second message to the connection that distributes bandwidth value to change, inform newDistribution bandwidth value. Each making a start of connecting received the second message, upgrades dividing of corresponding routing nodeJoin bandwidth value, selected new Bw_send, change CWND, and to all routes joints on pathPoint sends the 3rd message, notices selected Bw_send value.
In sum, the method that the embodiment of the present invention provides, after having new connection to set up, sends outEnd chains all routing nodes and sends the first message to this, is used to newly-established connect PleaseAsk distribution bandwidth, routing node defines the connection newly increasing after receiving the first message, according to roadLink behaviour in service by node output port is redistributed link bandwidth, the mistake of distributionIn journey, will newly connect and also consider within the scope of allocated bandwidth. The method is no longer according to transmitting-receiving twoEnd is predicted with regard to realizing the congested of network is controlled network condition, sends out thereby reduceSend the frequency of ACK message, also help the raising of slow start stage efficiency of transmission.
After bandwidth is redistributed, cause bandwidth value that the connection of adjusting occurs to redistributingCorresponding making a start sends the second message, comprising the distribution bandwidth value after redistributing. Send outEnd all routing nodes from this connection receive the second message, therefrom select to distribute bandwidth value minimumConduct send bandwidth value, and send to all routing nodes by the 3rd message. Routing nodeAfter receiving the 3rd message, wear according to distributing bandwidth value to redistribute bandwidth, upgrade to divideWide value is also notified making a start that bandwidth need to redistribute, to ensure the efficient and fair of allocated bandwidthProperty. After the transfer of data in this connection completes, all routing nodes of making a start in this connectionSend and connect the 4th message that stops notice, routing node is deleted this connection, again to bandwidthRedistribute, upgrade and distribute bandwidth value and notify making a start that bandwidth need to redistribute. LogicalCross at routing node and carry out allocated bandwidth control, adjust in real time allocated bandwidth, in prior artThe method of network condition being predicted by transmitting-receiving two-end is compared, and can save to the receipts that connectSending out two ends transmission packet judges in the whether congested process of network and consumes according to ACK feedback message againThe delay time taking, in prior art, slow start stage needs multiple RTT can reach bandwidthMake full use of, and the method that the embodiment of the present invention provides only need to just can reach at a RTTMaking full use of of bandwidth, the time of shortening network congestion window adjusting.
Embodiment bis-
The embodiment of the present invention two also provides under a kind of space communication environment based on allocated bandwidthCongestion control system, composition schematic diagram as shown in figure 11, specifically comprises: allocated bandwidth unit111 and bandwidth updating block 112.
Allocated bandwidth unit 111, in the time having new connection to add or to have the deletion of connection, newly connectsConnect or the path of connection to be deleted on each routing node bandwidth is redistributed, andDistribution bandwidth value after redistributing is sent to and distributes bandwidth to have the connection correspondence changingMake a start.
Bandwidth updating block 112 is for making a start according to all routing node notices on path, placeDistribution bandwidth value to send bandwidth value upgrade, and by upgrade after transmission bandwidth value sendGive all routing nodes of making a start on path, place. Wherein make a start for realize data on connectingTransmission, routing node is for realizing forwarding to data.
Congestion control system based on allocated bandwidth provided by the invention, with the side in embodiment mono-In the process that method can be redistributed bandwidth, add according to connection or delete after communicationImpact on allocated bandwidth in network, and according to the variation of redistributing rear bandwidth to congestion windowThe impact that mouth changes, distributes effectively to bandwidth. Divide by carrying out bandwidth at routing nodeJoin control, adjust in real time allocated bandwidth, with in prior art by transmitting-receiving two-end to network conditionThe method of predicting is compared, and can save to the transmitting-receiving two-end connecting and send packet basis againACK feedback message judges the delay time expending in the whether congested process of network, prior artMiddle slow start stage needs multiple RTT can reach making full use of of bandwidth, and the present inventionOnly need to just can reach making full use of of bandwidth at a RTT, shorten network congestion window and adjustThe whole time.
Wherein allocated bandwidth unit 111 comprises: connect updating block 1111, allocation units 1112With the first transmitting element 1113.
Connect updating block 1111 in the time having new connection to add or to have the deletion of connection, newMaking a start of connection and/or connection to be deleted place sent out to all routing nodes that connect path, placeSend notice.
Allocation units 1112 are for each route on the path of new connection or connection to be deletedNode is sent the linking number of common link bandwidth on port and sending out of each connection according to dataSending the situation of change of bandwidth value to redistribute bandwidth, is this routing node of each processConnection distribute the corresponding bandwidth value that distributes.
The first transmitting element 1113 distributes bandwidth vicissitudinous for distribution bandwidth value is sent toConnect corresponding making a start.
Allocated bandwidth unit 111 upgrades specifically and comprises transmission bandwidth value:
The distribution bandwidth value sending according to the routing node of making a start on path, place is selected minimum of a valueUpgrade as sending bandwidth value.
Bandwidth updating block 112 comprises: upgrade operating unit 1121 and the second transmitting element 1122.
Upgrading operating unit 1121 distributes making a start of bandwidth value to make a start according to place for receivingThe distribution bandwidth value that routing node on path, place sends upgrades sending bandwidth value, withCongestion window in Shi Gengxin connection.
The second transmitting element 1122 is for sending to by the transmission bandwidth value after upgrading the place of making a startAll routing nodes on path.
Make a start and send notice message to all routing nodes that connect, when there being new connection to set upAfter, all routing nodes on connecting send the first message, and wherein the first message is used to newlyThe connection request of setting up distributes bandwidth; After bandwidth is adjusted, send from all routing nodes secondIn message, select to distribute the minimum of a value of bandwidth value as sending bandwidth value, and to all routing nodesSend the 3rd message, the 3rd message comprises the distribution bandwidth value after redistributing; On connectingTransfer of data complete after, all routing nodes on connecting send the 4th message, the three or fourIn message, comprise to connect and stop notice;
Routing node is noticed receipt message, and judges that notice message is the first message, the 3rd messageOr the 4th message, the first message defines the connection newly increasing if, saves according to routeThe link behaviour in service of some output port is redistributed link bandwidth, and sends out to bandwidth valueMaking a start that the raw connection of adjusting is corresponding sends the second message, and the second message comprises to be redistributedAfter distribution bandwidth value; The 3rd message judges whether send bandwidth value equals average band ifWide value, if the default transmission bandwidth value of the 3rd message is not equal to average under current linking numberBandwidth value is redistributed bandwidth, upgrades and distributes bandwidth value, adjusts to bandwidth valueConnection corresponding make a start send the second message; The 4th message is from routing node ifAfter connection is deleted, again bandwidth is redistributed, upgraded and distribute bandwidth value, to bandwidth valueCorresponding the making a start of connection that occurs to adjust sends the second message;
Make a start and also comprise that the second message sending from all routing nodes, selection distributes bandwidth valueMinimum of a value as sending bandwidth value, and send the 3rd message to all routing nodes.
The system that above-described embodiment provides have with a kind of space communication environment under divide based on bandwidthThe identical beneficial effect of jamming control method of joining, does not repeat them here.
Above embodiment is only for the present invention is described, and limitation of the present invention is not relevantThe those of ordinary skill of technical field, without departing from the spirit and scope of the present invention,Can also make a variety of changes and modification, therefore all technical schemes that are equal to also belong to the present inventionCategory, scope of patent protection of the present invention should be defined by the claims.
Claims (8)
1. the jamming control method based on allocated bandwidth under space communication environment, its featureBe, described method specifically comprises:
S1, when have new connection to add or have connect delete time, described new connection or company to be deletedEach routing node on the path connecing is redistributed bandwidth, and after redistributingDistribution bandwidth value send to and distribute that bandwidth is vicissitudinous connects corresponding making a start;
S2, described in make a start according to the described distribution bandwidth of all routing nodes notice on path, placeValue is upgraded sending bandwidth value, and makes a start described in the transmission bandwidth value after upgrading is sent toAll routing nodes on path, place;
Step S1 specifically comprises:
S11, connect while deleting described new connection and/or wait to delete when having new connection to add or havingSend notice except connecting making a start of place to all routing nodes that connect path, place;
Each routing node basis on the path of S12, described new connection or connection to be deletedData are sent the linking number of common link bandwidth on port and the transmission bandwidth value of each connectionSituation of change bandwidth is redistributed, for this routing node of each process is sent portConnection distribute the corresponding bandwidth value that distributes;
S13, described distribution bandwidth value is sent to and distributes that bandwidth is vicissitudinous connects corresponding sending outEnd.
2. the method for claim 1, is characterized in that, step S2 specifically comprises:
S21, receive described distribution bandwidth value make a start according to described in make a start on path, placeThe distribution bandwidth value that routing node sends upgrades described transmission bandwidth value, upgrades and connects simultaneouslyThe congestion window connecting;
S22, by make a start described in sending to all on path, place of the transmission bandwidth value after upgradingRouting node.
3. method as claimed in claim 2, is characterized in that, described congestion window is for sending outAfter multiplying each other, the round-trip delay that send bandwidth value and actual measurement to obtain rounds downwards again,Wherein CWND is congestion window, and Bw_send is for sending bandWide value, RTT is round trip delay time.
4. method as claimed in claim 2, is characterized in that, in step S21 to describedTransmission bandwidth value upgrades specifically and comprises:
The distribution bandwidth value sending according to described routing node of making a start on path, place is selectedLittle value is upgraded as sending bandwidth value.
5. method as claimed in claim 2, is characterized in that, after step S22, also wrapsDraw together:
S23, on described path routing node send port, if described transmission bandwidth valueUnequal with described distribution bandwidth value, enter step S24;
S24, the size of described transmission bandwidth value and described distribution bandwidth value is judged, asThe described transmission bandwidth value of fruit is less than described distribution bandwidth value, unnecessary bandwidth is averagely allocated to itIt can append the connection that distributes bandwidth, upgrades the distribution bandwidth value of described connection as described transmissionBandwidth value, and described in upgrading, can append the distribution bandwidth value of the connection that distributes bandwidth, otherwise enterStep S25, wherein said unnecessary bandwidth is that described distribution bandwidth value deducts described transmission bandwidth valueThe difference obtaining;
S25, the size of described transmission bandwidth value and average bandwidth value is judged, if instituteState transmission bandwidth value and be less than described average bandwidth value, using described transmission bandwidth value as this connectionDistribution bandwidth value after renewal, and described transmission bandwidth value is deducted to described distribution bandwidth value obtainThe bandwidth that differs deduct from the connection that distributes bandwidth value to be greater than described average bandwidth value in proportion,Upgrade described distribution bandwidth value and be greater than the distribution bandwidth value that average bandwidth value connects, otherwise enter stepRapid S26, described average bandwidth value Bw_ave=Bw_total/N, wherein Bw_total is currentSend the total bandwidth of port link, N is the current linking number total on port of sending;
S26, the total bandwidth of described path on described link deduct described distribution bandwidth value and are less thanThe distribution bandwidth value that described average bandwidth value connects is as remaining bandwidth, and by described residue bandWide all the other connections are distributed equally, described distribution bandwidth value is upgraded.
6. the congestion control system based on allocated bandwidth under space communication environment, its featureBe, described system comprises: allocated bandwidth unit and bandwidth updating block;
Described allocated bandwidth unit, in the time having new connection to add or to have the deletion of connection, newly connectsConnect or the path of connection to be deleted on each routing node bandwidth is redistributed, andDistribution bandwidth value after redistributing is sent to and distributes corresponding the sending out of the vicissitudinous connection of bandwidthEnd;
The all routing nodes notices on path, place of making a start described in described bandwidth updating block is used forDistribution bandwidth value to send bandwidth value upgrade, and by upgrade after transmission bandwidth value sendAll routing nodes of making a start described in giving on path, place;
Wherein said making a start for realize the transmission of data on connecting, described routing node is used forRealize the forwarding to data;
Described allocated bandwidth unit comprises: connect updating block, allocation units and the first transmission singleUnit;
Described connection updating block is used in the time having new connection to add or to have the deletion of connection, described inMaking a start to all routing nodes that connect path, place of new connection and/or connection to be deleted placeSend notice;
Described allocation units are for each on the path of described new connection or connection to be deletedRouting node is sent linking number and each connection of common link bandwidth on port according to dataThe situation of change of transmission bandwidth value bandwidth is redistributed, be this route of each processThe connection of node distributes the corresponding bandwidth value that distributes;
Described the first transmitting element distributes bandwidth to have change for described distribution bandwidth value is sent toMaking a start of the connection correspondence of changing.
7. system as claimed in claim 6, is characterized in that, described bandwidth updating block bagDraw together: upgrade operating unit and the second transmitting element;
Described renewal operating unit for receive described distribution bandwidth value make a start according to described inThe distribution bandwidth value that the routing node of making a start on path, place sends enters described transmission bandwidth valueRow upgrades, and upgrades the congestion window on connecting simultaneously;
Described the second transmitting element is made a start described in the transmission bandwidth value after upgrading is sent toAll routing nodes on path, place.
8. system as claimed in claim 7, is characterized in that, described renewal operating unitDescribed transmission bandwidth value is upgraded specifically and is comprised:
The distribution bandwidth value sending according to described routing node of making a start on path, place is selectedLittle value is upgraded as sending bandwidth value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310398137.2A CN103491014B (en) | 2013-08-15 | 2013-09-04 | Jamming control method and system based on allocated bandwidth under a kind of space communication environment |
Applications Claiming Priority (4)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310356955 | 2013-08-15 | ||
| CN2013103569556 | 2013-08-15 | ||
| CN201310356955.6 | 2013-08-15 | ||
| CN201310398137.2A CN103491014B (en) | 2013-08-15 | 2013-09-04 | Jamming control method and system based on allocated bandwidth under a kind of space communication environment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103491014A CN103491014A (en) | 2014-01-01 |
| CN103491014B true CN103491014B (en) | 2016-05-11 |
Family
ID=49830984
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310398137.2A Active CN103491014B (en) | 2013-08-15 | 2013-09-04 | Jamming control method and system based on allocated bandwidth under a kind of space communication environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103491014B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105099938B (en) * | 2014-05-13 | 2018-10-12 | 华为技术有限公司 | The determination method and apparatus of congestion window in network |
| CN105897506A (en) * | 2016-03-31 | 2016-08-24 | 乐视控股（北京）有限公司 | Bandwidth estimation method and device |
| US10567069B2 (en) * | 2016-04-28 | 2020-02-18 | Netgear, Inc. | Repeater bandwidth, radio configuration, and ADC clock speed adjustment |
| CN106850040B (en) * | 2017-01-05 | 2019-11-05 | 清华大学 | The configuration method and device of bandwidth resources in Information Network |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101075960A (en) * | 2007-06-22 | 2007-11-21 | 清华大学 | Method for controlling fluid based on router virtual display load feedback in high-speed network |
-
2013
- 2013-09-04 CN CN201310398137.2A patent/CN103491014B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101075960A (en) * | 2007-06-22 | 2007-11-21 | 清华大学 | Method for controlling fluid based on router virtual display load feedback in high-speed network |
Non-Patent Citations (1)
| Title |
|---|
| SaclTCP: 基于跨层设计的卫星网络传输协议;陈静等;《宇航学报》;20110331;第32卷(第3期);正文第2.1节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103491014A (en) | 2014-01-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1918861B (en) | Traffic flow determination in communications networks | |
| CN103491014B (en) | Jamming control method and system based on allocated bandwidth under a kind of space communication environment | |
| US7688740B1 (en) | System and method for identifying cost metrics for a network | |
| US6310881B1 (en) | Method and apparatus for network control | |
| CN104954279B (en) | A kind of transfer control method, apparatus and system | |
| CN105897575A (en) | Path computing method based on multi-constrained path computing strategy under SDN | |
| KR20000035664A (en) | Router placement methods and apparatus for designing ip networks with performance guarantees | |
| CN105024940A (en) | Link adaptation-based heterogeneous network TCP congestion control method | |
| KR20050045523A (en) | Method for bandwidth allocation using resilient packet ring fairness mechanism | |
| US7197573B1 (en) | System and method for identifying addresses to modify and the effects thereof | |
| CN106533956A (en) | Scheduling control method and system for plurality of relay links among communication nodes | |
| CN108206781A (en) | The method and apparatus for selecting forward-path | |
| CN111835634A (en) | Dynamic multipath routing method based on service distribution | |
| CN103391249B (en) | Neighborhood relationship building method in a kind of IS-IS network and equipment | |
| CN104202262B (en) | Frequency spectrum distributing method and device in the flexible optical-fiber network of frequency spectrum | |
| CA2309527A1 (en) | Method and apparatus for managing communications between nodes in a bi-directional ring network | |
| Chiang et al. | Jointly optimal congestion control and power control in wireless multihop networks | |
| Simo-Reigadas et al. | Sharing low-cost wireless infrastructures with telecommunications operators for backhauling 3G services in deprived rural areas | |
| Alabbad et al. | Localized credit based qos routing: Performance evaluation using | |
| Mudassar et al. | A new Linux based TCP congestion control mechanism for long distance high bandwidth sustainable smart cities | |
| CN109982376B (en) | Multi-path strong real-time transmission method suitable for wireless system | |
| WO2018179922A1 (en) | Communication device, communication control method, and communication system | |
| CN109996292B (en) | Path optimization method of mobile backhaul network | |
| Mohammad et al. | Localized quality based QoS routing | |
| CN110572324B (en) | Link recommendation method based on meteor trail communication network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |