CN1921364A - Method for package transmitting and self-adaptive window zooming of reliable transmission layer based on message - Google Patents
Method for package transmitting and self-adaptive window zooming of reliable transmission layer based on message Download PDFInfo
- Publication number
- CN1921364A CN1921364A CNA2005100368230A CN200510036823A CN1921364A CN 1921364 A CN1921364 A CN 1921364A CN A2005100368230 A CNA2005100368230 A CN A2005100368230A CN 200510036823 A CN200510036823 A CN 200510036823A CN 1921364 A CN1921364 A CN 1921364A
- Authority
- CN
- China
- Prior art keywords
- message
- window
- application
- transport layer
- recipient
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Communication Control (AREA)
Abstract
The invention relates to a parallel transmission and self-adaptive window zoom method of reliable transmission layer, based on message. Wherein, it comprises: parallel transmission of sender; pack receiving of receiver; self-adaptive window zoom at receiver; said parallel transmission process comprises that when sender can send data pack that the sending widow is higher than 0 and the sending message queue is not blank, copying several application messages of sending queue into requested buffer area, until the buffer area can not contain one whole application message or the sending queue is blank; sending the content of buffer area as large transmission-layer message via bottom service; and when sending out one transmission-layer message, decreasing one from present sending window. The invention uses parallel sending technique at the sender, to reduce the small pack transmission at bottom network, to improve the communication ability of reliable transmission layer based on message.
Description
Technical field
The present invention proposes a kind of method that is applicable to the raising communication performance of message based reliable transmission layer, in particular a kind of method that on message based reliable transmission layer, has adopted and wrapped transmission and self-adapting window convergent-divergent.
Background technology
Though the TCP communication of prior art provides reliable connection mechanism, the maintenance costs of link is bigger, and system resource takies more, uses TCP can be subjected to the restriction of more specific implementation, and relevant between the parameters, configuration is complicated.Message based reliable transmission layer as RDP, RUDP etc., by stack one deck reliability key-course on insecure service (IP or UDP), has guaranteed the reliability of communication, can compare with TCP under the situation of less expense, finishes inner reliable communication.
Use message based reliable transmission layer to carry out communication, use what receive all is a complete message at every turn, and what need not TCP flows to the resolving of message from byte.In addition, message based reliable transmission has born immunity for the Silly Window Syndrome (Silly WindowSyndrome) that the window traffic control of byte-oriented stream causes.Because expense is low, efficient is high and message based characteristics, message based reliable transmission is applicable to numerous transmission applications, as application such as debugging, download and transmission telephony signaling message.
Simultaneously owing to be based on the transmission of message, so the window size of transport layer represents is the message number that can receive and dispatch, and the tcp window size expression of byte-oriented stream is the byte number that can receive and dispatch.Article one, each end of connection all comprises transmit leg and recipient, and the transmit leg of local terminal constitutes half bar with the recipient of opposite end and is connected, and the transmit leg of opposite end constitutes other half bar with the recipient of local terminal and is connected, and forms a connection complete, full duplex altogether.As shown in Figure 1, shown that half bar of a message based reliable transmission layer connects, the available window among the figure in the send window structure is represented with send window in this manual.
In the realization of message based reliable transmission layer, each bar message all is made up of the message header of this transport layer regulation and the message body of application, connects every a piece of news of transmit leg of an end, and the size of its send window subtracts one.The sending method that transmit leg adopts is described below:
1, when send window greater than 0 and when sending the message queue non-NULL, take out a piece of news from transmit queue, call the IP of bottom or transmission interface that the UDP service provides and send this message, send window subtracts one then.
2, repeating step 1, equals 0 or send message queue for empty until send window.
From top sending method as can be seen, when using message based reliable transmission layer to carry out communication, use and whenever call transmission interface transmission message one time, bottom be will trigger and IP bag of transmission or UDP message bag connected, therefore, when application need transmits a large amount of little message, certainly will cause bottom-layer network to transmit the same number of little message.The processing of research and a large amount of little message of test shows can reduce the bottom-layer network bandwidth utilization and cause the bottom IP stack and the too much CPU of network-driven consumption, thereby has reduced ability to communicate, has influenced the overall performance of system.
The transmit leg of TCP generally can adopt nagle algorithm, and nagle algorithm is the poly-packet transmission method of a kind of time-delay in essence, and nagle algorithm has increased the probability that sends big bag, has improved the ability to communicate of TCP.But adopt nagle algorithm can introduce bigger time delay, so, must close the nagle algorithm of TCP for the comparatively responsive application of some time delays.
Summary of the invention
The object of the present invention is to provide a kind of also bag of message based reliable transmission layer to send and self-adaptive window zooming method, it is that a big transport layer message sends and adopts the method for self adaptive pantographic window the recipient, the problem that communication performance reduces when using message based reliable transmission layer to carry out little transmission of messages in order to solve that employing merges a plurality of little application messages at transmit leg.
Further, the inventive method has adopted the self adaptive pantographic window technique the recipient, and its objective is increases chance transmit leg and that bag sends and further improve ability to communicate; Less relatively and when mainly being little application message when the data volume that sends, suitably reduces the packet sending speed of transmit leg by dwindling receive window, thereby increase transmit leg and bag transmission probability, raising bottom-layer network bandwidth utilization; The ratio of the big transport layer message that sends along with transmit leg rises, by enlarging the packet sending speed that receive window improves transmit leg, can further promote transmitted traffic, and it is very little to compare the time delay that the self-adapting window zoom technology of nagle algorithm the inventive method of TCP itself introduced.
Technical scheme of the present invention comprises:
A kind of also bag of message based reliable transmission layer sends and self-adaptive window zooming method, comprises following treatment step:
A, transmit leg and wrap process of transmitting;
B, recipient's packet receiving processing procedure;
C, recipient's self-adapting window convergent-divergent processing procedure.
Described method, wherein, described steps A also comprises:
A1, when transmit leg can send packet, be send window greater than 0 and send the message queue non-NULL, then copy the buffering area of the extremely new application of many application messages in the transmit queue, can't hold a complete application message or transmit queue sky again until buffer area;
A2, the content of this buffering area is used as a big transport layer message sends by the service that bottom provides, transport layer message of every transmission, no matter this message is only to be made up of an application message or to be formed by many little application messages merging, current send window all subtracts one.
Described method wherein, is used for and the described buffer size of wrapping must satisfy: the maximum message segment length that can not require greater than the recipient; When the service that this transport layer is called bottom to be provided sent the message of a described buffer size, this message must be carried by a Frame of link layer, promptly can not exceed the size of link layer MTU.
Described method, wherein, only at the message header of a transport layer of described buffering area original position copy, every application message of back only copies message-length and message content to described transmit leg, do not copy message header, and the border between the application message in the buffering area is defined by message-length.
Described method, wherein, described step B also comprises:
B1, described recipient are placed on the relevant position that receives buffer memory in following transport layer message that receives of the control of receive window, and reduce current receive window;
B2, when application program receives application message, transmit every transport layer message to upper layer application according to the order of sequence, and increase current receive window;
B3, for every transport layer message, transport layer unpacks according to the length border between the application message, use and whenever call receiving interface one time, the application message that described transport layer then unpacks to the application order transmission, only behind all application messages in having transmitted this transport layer message, current receiver window eloquence adds one.
Described method, wherein, described step C also comprises:
C1, increase the window size field in the message header of message based reliable transmission layer, it is provided with by the recipient, is used for announcing the receive window size that the transmit leg current receiver can be used, and transmit leg upgrades the size of send window in view of the above;
C2, described recipient increase by two counters and add up packet sum and the big number of data packets of receiving respectively, whenever the packet of receiving some is then added up once big number of data packets and is accounted for total number-of-packet purpose ratio, and two counters of zero clearing for next time statistics prepare;
C3, adjust receive window according to the ratio that calculates, ratio hour is dwindled receive window, amplifies receive window during large percentage.
Described method, wherein, the step of described amplification receive window comprises: under the situation that recipient's reception buffer memory allows, current receive window adds one immediately; Otherwise the size of current receive window remains unchanged.
Described method, wherein, described step of dwindling receive window comprises:
C32, for the contraction of the send window that prevents the opposite end, current receive window does not subtract one, described recipient only is provided with and dwindles the window sign;
C33, use toward the upper strata when having transmitted a transport layer message, be set up then as if dwindling the window sign that receive window no longer adds one, only remove this sign described recipient.
The also bag of a kind of message based reliable transmission layer provided by the present invention sends and self-adaptive window zooming method, owing to adopted and wrapped transmission technology at transmit leg, significantly reduce the parcel transmission of bottom-layer network, thereby improved the ability to communicate of message based reliable transmission layer.
And, the inventive method since the recipient adopted the self-adapting window zoom technology with increase transmit leg and wrap probability, improved ability to communicate, the nagle algorithm of TCP compared to existing technology, the time delay that the self-adapting window zoom technology of the inventive method itself is introduced is very little, so this technology is equally applicable to those application comparatively responsive to time delay.
Description of drawings
Fig. 1 is the connection diagram of the message based reliable transmission layer of prior art;
Fig. 2 is the transport layer message structure figure that comprises an application message of the inventive method;
Fig. 3 is the transport layer message structure figure that comprises many application messages in the inventive method;
Fig. 4 has shown that the inventive method solves the procedure chart of application message from the transport layer message that comprises many application messages;
Fig. 5 is process chart the inventive method and that wrap process of transmitting;
Fig. 6 is the recipient's of the inventive method the process chart of self-adapting window convergent-divergent.
Embodiment
Below in conjunction with accompanying drawing, will carry out comparatively detailed explanation to each preferred embodiment of the present invention.
Describe for convenient, in the description of the inventive method, claim using the application datagrams that sends by transmission interface is application message, and transport layer is called the packet that the service of bottom sends and is called transport layer message, described transport layer message is made up of message header and application message, as shown in Figure 2.
The also bag of described message based reliable transmission layer of the present invention sends and self-adaptive window zooming method, and it comprises following basic handling step:
1, transmit leg and wrap process of transmitting.
2, recipient's packet receiving processing procedure.
3, recipient's self-adapting window convergent-divergent processing procedure.
In the described step 1, when transmit leg can send packet, be send window greater than 0 and when sending the message queue non-NULL, copy the buffering area of the extremely new application of many application messages in the transmit queue at first as far as possible, till buffer area can't hold a complete application message or transmit queue sky again, then the content of this buffering area is used as service that a big transport layer message provides by bottom such as IP or UDP service and sends.Transport layer message of every transmission, no matter this message is only to be made up of an application message or to be formed by many little application messages merging, current send window all subtracts one.
The maximum buffer size (wMaxBufSize) that is used for and wraps must satisfy 2 points: at first, wMaxBufSize can not be greater than the maximum message segment length of recipient's requirement; Secondly, when the service that this transport layer is called bottom to be provided sent the message of a wMaxBufSize byte-sized, this message must be carried by a Frame of link layer, promptly can not exceed the size of link layer MTU MTU.
The transmit leg of the inventive method only need be at the message header of a transport layer of buffering area original position copy, every application message of back only need copy message-length and message content, need not to copy once more message header, the border between the application message in the buffering area is defined by message-length.Therefore adopt of the present invention and packet technology after, a transport layer message is made up of message header and one or more application message, is isolated by message length field between two adjacent application messages, as shown in Figures 2 and 3.
In the described step 2, described recipient is placed on the relevant position that receives buffer memory in following transport layer message that receives of the control of receive window, and reduces current receive window.When application program receives application message, transmit every transport layer message to upper layer application according to the order of sequence then, and increase current receive window.
For every transport layer message, transport layer unpacks according to the length border between the application message.Use and whenever call receiving interface, the application message that transport layer then unpacks to the application order transmission one time.Only behind all application messages in having transmitted this transport layer message, current receiver window eloquence adds one.
In the described step 3, in the message header of message based reliable transmission layer, increased window size, described window size field is provided with by the recipient, is used for announcing the receive window size that the transmit leg current receiver can be used, and transmit leg upgrades the size of send window in view of the above.
The recipient increases by two counters and adds up packet sum and the big number of data packets of receiving respectively.Whenever the packet of receiving some is then added up once big number of data packets and is accounted for total number-of-packet purpose ratio, then two counters of zero clearing for next time statistics prepare.Adjust receive window according to the ratio that calculates, ratio hour can be dwindled receive window, scalable receive window during large percentage.
The processing of described amplification receive window is: under the situation that recipient's reception buffer memory allows, current receive window adds one immediately.That is to say adding one to handle the message sequence number can not cause transmit leg to send excessive and cause that recipient's reception buffer memory overflows of current receive window, otherwise the size of current receive window remains unchanged.
The processing of dwindling receive window is: for the contraction of the send window that prevents the opposite end, current receive window can not subtract one, and the recipient can only be provided with and dwindle the window sign.Use toward the upper strata when having transmitted a transport layer message the recipient subsequently, be set up then as if dwindling the window sign that receive window no longer adds one, only remove this sign.
General, in the method for the invention, comprise in the message header of message based reliable transmission sending the bag sequence number, replying field such as sequence number, in order to realize the inventive method, need in message header, increase the field of window size.
Only comprise implementation step related to the present invention in the following description,,, do not repeat them here owing to haveing nothing to do with the inventive method and being well known to those skilled in the art for other step that realizes message based reliable transmission.
The first step, transmit leg and to wrap the implementation step of process of transmitting as follows:
At first, below be necessary variable:
WMaxTranUnit: the maximum transmitted layer message that Frame carried of expression link layer.WMaxTranUnit=link layer MTU (MTU)-bottom expense (wOverhead), for RDP, wOverhead=20 byte (IP head), for RUDP, wOverhead=28 byte (IP head+UDP head).
WSndQSize: the length of a transport layer message that constitutes by all application messages in the transmit queue.WSndQSize=message header+2+ application message 1+2+ application message 2+...+2+ application message n.
WMaxSegment: the maximum message segment length that the recipient requires.
WMaxMuxBuf: be used to merge the buffer memory that the maximum of many application messages allows.
wMaxMuxBuf＝min(wMaxTranUnit，wMaxSegment)。
Having message to be sent in the transmit queue of transmit leg is one of prerequisite that enters process of transmitting, the application message that the informed source in the transmit queue transmits in the application call transmission interface.In transmission interface, earlier application datagrams to be sent is configured to a transport layer message.This transport layer message only comprises an application message, and as shown in Figure 2, message-length is with two byte representations.Then this transport layer message is input in the transmit queue.
In conjunction with Fig. 5, describe below the inventive method and wrap process of transmitting.
1, step 5.1:, then changeed for the 2nd step if transmit queue has Messages-Waiting transmission and send window greater than 0; Otherwise finish this process of transmitting.
2, step 5.2: if the message number in the transmit queue changes step 5.3 over to so greater than 1; Otherwise, from formation, take out message, (seeing step 5.6) changes step 5.5 and sends.
3, step 5.3: if the length of article one message (message header+2+ application message) is changeed step 5.4 so and entered and wrap flow process less than wMaxMuxBuf in the transmit queue; Otherwise, from formation, take out message (seeing step 5.6), change step 5.5 and send.
4, step 5.4: apply for an internal memory that is used for and wraps: if wMaxMuxBuf＞=wSndQSize then applies for the internal memory of wSndQSize size; Otherwise, the internal memory of application wMaxMuxBuf size.
From transmit queue, take out article one message complete (message header+message-length+application message) earlier and copy buffer memory into application; Take out message from transmit queue continuously then, copy message-length and application message can't hold a complete application message or transmit queue sky to the buffer memory of application again until buffer memory.Article one, the transport layer message constructing that comprises many application messages is finished, and as shown in Figure 3, changes the message that step 5.5 sends this structure.
5, step 5.5: bag sequence number and local terminal receive window size are set in message header, and the service that calling bottom then provides sends this message, and the send window size subtracts one simultaneously, changes step 5.1 and continues to send.
In second step, the concrete implementation step of recipient's packet receiving processing procedure is as follows:
Represent the maximum bag sequence number of receiving according to the order of sequence with wMaxPckNoInOrder, wMaxValidPckNo represents the bag sequence number of maximum legal.In receive window shown in Figure 1, wMaxPckNoInOrder=4, wMaxValidPckNo=9.
1, the recipient receives a transport layer message at every turn, takes out the receive window size (wWnd) of bag sequence number (wPckNo) and peer end of the connection from message header, upgrades the send window size wSndWnd=wWnd-retransmission queue size of local terminal transmit leg with wWnd.Retransmission queue refers to message and sends, but is not identified.
If this message receives that according to the order of sequence then the current receive window wCurRcvWnd of local terminal subtracts one automatically;
If the current message bag sequence number of receiving drops on reception interval, i.e. wMaxPckNoInOrder＜wPckNo＜=wMaxValidPckNo, and this message receives for the first time, then the transport layer message of receiving is placed into the relevant position of reception interval.
2, when upper layer application was called receiving interface reception application message, the recipient transmitted transport layer message sequence interval according to the order of sequence in recipient's window to using.For every transport layer message, as shown in Figures 2 and 3, transport layer unpacks according to the total length (wTotalPckSize) of this message and the length border between the application message.Show the understanding packet procedures as Fig. 4, pointer (pData) at first points to the length field of article one message.
Variable wRestSize=wTotalPckSize-message header is set.Use and whenever call receiving interface one time, transport layer is taken out message-length from the pData pointer, the pData pointer moves two bytes backward, begin to copy this data package length then from the pData position to the reception buffer memory of using, upgrade wRestSize=wRestSize-2-application message length simultaneously, the pData pointer moves to the length field of next bar application message.Application program is returned from receiving interface, solves an application message.
When wRestSize equals 0 all application messages of representing to have transmitted in this transport layer message, be not provided with if dwindle the window sign, current receive window (wCurRcvWnd) adds one; Dwindle the window sign otherwise remove, current receive window remains unchanged.Dwindle the step 8 (step 6.10 of Fig. 6) of the setting of window sign referring to the 3rd step.
In the 3rd step, recipient's self-adapting window convergent-divergent processing procedure implementation step is as follows:
The notion of window convergent-divergent is once at first described.When not adopting the method for window convergent-divergent, the recipient can reduce receive window when receiving a transport layer message, receive window adds one after a transport layer message is received in application, therefore can in certain scope, change at receive window under the promotion of message: 0 to wMaxWnd, wMaxWnd is called the window size that maximum can reach.When adopting the method for window convergent-divergent, changed the excursion of receive window in fact: reduce wMaxWnd when dwindling receive window, make the excursion of receive window diminish; Increase wMaxWnd when amplifying receive window, make the excursion of receive window become big.
In addition, the number (wRcvBufSize) of recipient's reception buffer memory has limited the window size (wMaxWnd) that recipient's maximum can reach.Whenever, must guarantee wMaxWnd＜=wRcvBufSize, cause that receiving buffer memory overflows otherwise the message sequence number that can cause transmit leg to send is excessive.The reception buffer memory here is an array of pointers, is used in reference to the transport layer message that receives.
For convenience of description, defined following constant:
BIG_PACK_SIZE: grow up in the packet of this value for bag, be called big packet.
STAT_THRESHOLD: expression is calculated the shared ratio of once receiving of big packet, and is adjusted the receive window size in view of the above when receiving the packet that equals this number.
ADD_THRESHOLD: STAT_THRESHOLD bar message is whenever received in expression, if the number of big packet is worth more than or equal to this, then needs to amplify receive window.
MINUS_THRESHOLD: STAT_THRESHOLD bar message is whenever received in expression, if the number of big packet is worth less than this, then needs to dwindle receive window.
MIN_WND_THRESHOLD: be somebody's turn to do-measure the minimum change scope that has limited receive window.
When setting up a connection, the initial receive window of local terminal (wInitialWnd) is notified at the two ends of connection mutually, and initial receive window is made as half that local terminal receives buffer memory number (wRcvBufSize), i.e. wInitialWnd*2=wRcvBufSize.So for a newly-established connection, the window size wMaxWnd=wInitialWnd that recipient's maximum can reach.
The recipient receives a transport layer message at every turn, all can enter self-adapting window convergent-divergent processing procedure.In conjunction with Fig. 6, the recipient's of the inventive method the concrete processing procedure of self-adapting window convergent-divergent is described below.
1, step 6.1: the counter wTotalPckNum that is used to add up the packet total number of receiving in this connection adds one.
2, step 6.2: if message-length more than or equal to BIG_PACK_SIZE, then changes step 6.3 over to; Otherwise, change step 6.4 over to.
3, step 6.3: be used to add up the big number-of-packet purpose counter wBigPckNum that receives in this connection and add.
4, step 6.4: if wTotalPckNum more than or equal to STAT_THRESHOLD, then changes step 6.5 over to; Otherwise, jump out self-adapting window convergent-divergent processing procedure.
5, step 6.5: carry out receive window processing and amplifying process if wBigPckNum, then changes step 6.7 over to more than or equal to ADD_THRESHOLD.
6, step 6.6: carry out receive window and dwindle processing procedure if wBigPckNum, then changes step 6.8 over to less than MINUS_THRESHOLD; Otherwise zero clearing wTotalPckNum and wBigPckNum (seeing the step 6.11 of Fig. 6) jump out self-adapting window convergent-divergent processing procedure.
7, step 6.7: if wMaxWnd+1 smaller or equal to wRcvBufSize, receive window wCurRcvWnd adds one so, wMaxWnd adds one (seeing the step 6.8 of Fig. 6); Otherwise current receive window remains unchanged.Zero clearing wTotalPckNum and wBigPckNum (seeing the step 6.11 of Fig. 6) jump out the self-adapting window convergent-divergent and handle.
8, step 6.9: dwindle the window sign if wMaxWnd-1 more than or equal to MIN_WND_THRESHOLD, is provided with so, wMaxWnd subtracts one (seeing the step 6.10 of Fig. 6) automatically, and the removing of this sign is referring to the step 2 in second step; Otherwise current receive window remains unchanged.Zero clearing wTotalPckNum and wBigPckNum (seeing the step 6.11 of Fig. 6) jump out the self-adapting window convergent-divergent and handle.
Under the same conditions, the inventive method is carried out the communication performance limit test of too small message (about 100 bytes), test result shows: the ability to communicate that adopts the system behind the present invention is not adopt 3 times of system communication ability of the present invention approximately.Other test also shows: under identical communication traffic, the system CPU occupation rate behind employing the present invention will be far below not adopting system CPU occupation rate of the present invention.
The inventive method has adopted and has wrapped transmission technology at transmit leg, has significantly reduced the parcel transmission of bottom-layer network, thereby has improved the ability to communicate of message based reliable transmission layer.The recipient adopted the self-adapting window zoom technology with increase transmit leg and wrap probability, improved ability to communicate.Compare nagle algorithm, the time delay that self-adapting window zoom technology of the present invention itself is introduced is very little, so this technology is equally applicable to those application comparatively responsive to time delay.
But should be understood that above-mentioned description at specific embodiment of the present invention is comparatively concrete, can not therefore be interpreted as the restriction to scope of patent protection of the present invention, scope of patent protection of the present invention should be as the criterion with claims.
Claims (8)
1, a kind of also bag of message based reliable transmission layer sends and self-adaptive window zooming method, comprises following treatment step:
A, transmit leg and wrap process of transmitting;
B, recipient's packet receiving processing procedure;
C, recipient's self-adapting window convergent-divergent processing procedure.
2, method according to claim 1 is characterized in that, described steps A also comprises:
A1, when transmit leg can send packet, be send window greater than 0 and send the message queue non-NULL, then copy the buffering area of the extremely new application of many application messages in the transmit queue, can't hold a complete application message or transmit queue sky again until buffer area;
A2, the content of this buffering area is used as a big transport layer message sends by the service that bottom provides, transport layer message of every transmission, no matter this message is only to be made up of an application message or to be formed by many little application messages merging, current send window all subtracts one.
3, method according to claim 2 is characterized in that, is used for and the described buffer size of wrapping must satisfy: the maximum message segment length that can not require greater than the recipient; When the service that this transport layer is called bottom to be provided sent the message of a described buffer size, this message must be carried by a Frame of link layer, promptly can not exceed the size of link layer MTU.
4, according to claim 2 or 3 described methods, it is characterized in that, described transmit leg only copies the message header of a transport layer in described buffering area original position, every application message of back only copies message-length and message content, do not copy message header, and the border between the application message in the buffering area is defined by message-length.
5, method according to claim 1 is characterized in that, described step B also comprises:
B1, described recipient are placed on the relevant position that receives buffer memory in following transport layer message that receives of the control of receive window, and reduce current receive window;
B2, when application program receives application message, transmit every transport layer message to upper layer application according to the order of sequence, and increase current receive window;
B3, for every transport layer message, transport layer unpacks according to the length border between the application message, use and whenever call receiving interface one time, the application message that described transport layer then unpacks to the application order transmission, only behind all application messages in having transmitted this transport layer message, current receiver window eloquence adds one.
6, method according to claim 1 is characterized in that, described step C also comprises:
C1, increase the window size field in the message header of message based reliable transmission layer, it is provided with by the recipient, is used for announcing the receive window size that the transmit leg current receiver can be used, and transmit leg upgrades the size of send window in view of the above;
C2, described recipient increase by two counters and add up packet sum and the big number of data packets of receiving respectively, whenever the packet of receiving some is then added up once big number of data packets and is accounted for total number-of-packet purpose ratio, and two counters of zero clearing for next time statistics prepare;
C3, adjust receive window according to the ratio that calculates, ratio hour is dwindled receive window, amplifies receive window during large percentage.
7, method according to claim 6 is characterized in that, the step of described amplification receive window comprises: under the situation that recipient's reception buffer memory allows, current receive window adds one immediately; Otherwise the size of current receive window remains unchanged.
8, method according to claim 7 is characterized in that, described step of dwindling receive window comprises:
C32, for the contraction of the send window that prevents the opposite end, current receive window does not subtract one, described recipient only is provided with and dwindles the window sign;
C33, use toward the upper strata when having transmitted a transport layer message, be set up then as if dwindling the window sign that receive window no longer adds one, only remove this sign described recipient.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100368230A CN100518037C (en) | 2005-08-25 | 2005-08-25 | Method for package transmitting and self-adaptive window zooming of reliable transmission layer based on message |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100368230A CN100518037C (en) | 2005-08-25 | 2005-08-25 | Method for package transmitting and self-adaptive window zooming of reliable transmission layer based on message |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1921364A true CN1921364A (en) | 2007-02-28 |
| CN100518037C CN100518037C (en) | 2009-07-22 |
Family
ID=37778955
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100368230A Expired - Fee Related CN100518037C (en) | 2005-08-25 | 2005-08-25 | Method for package transmitting and self-adaptive window zooming of reliable transmission layer based on message |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100518037C (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101815034A (en) * | 2010-03-26 | 2010-08-25 | 迈普通信技术股份有限公司 | Intertask message sending method and communication apparatus |
| CN101951370A (en) * | 2010-09-17 | 2011-01-19 | 北京神州泰岳软件股份有限公司 | Reliable file transmission method based on UDP |
| CN101364855B (en) * | 2008-09-22 | 2012-04-18 | 杭州华三通信技术有限公司 | Method and device for controlling sending of data packets in code stream |
| CN105376173A (en) * | 2014-09-02 | 2016-03-02 | 中兴通讯股份有限公司 | Sending window flow control method and terminal |
| CN105554822A (en) * | 2015-12-10 | 2016-05-04 | 京信通信技术(广州)有限公司 | Control method and device for balancing rates of multiple user terminals of base station |
| WO2017028727A1 (en) * | 2015-08-14 | 2017-02-23 | 中兴通讯股份有限公司 | Signalling receiving method and device for base station |
-
2005
- 2005-08-25 CN CNB2005100368230A patent/CN100518037C/en not_active Expired - Fee Related
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101364855B (en) * | 2008-09-22 | 2012-04-18 | 杭州华三通信技术有限公司 | Method and device for controlling sending of data packets in code stream |
| CN101815034A (en) * | 2010-03-26 | 2010-08-25 | 迈普通信技术股份有限公司 | Intertask message sending method and communication apparatus |
| CN101815034B (en) * | 2010-03-26 | 2012-07-25 | 迈普通信技术股份有限公司 | Intertask message sending method and communication apparatus |
| CN101951370A (en) * | 2010-09-17 | 2011-01-19 | 北京神州泰岳软件股份有限公司 | Reliable file transmission method based on UDP |
| CN101951370B (en) * | 2010-09-17 | 2013-11-06 | 北京神州泰岳软件股份有限公司 | Reliable file transmission method based on UDP |
| WO2016033948A1 (en) * | 2014-09-02 | 2016-03-10 | 中兴通讯股份有限公司 | Transmission window traffic control method and terminal |
| CN105376173A (en) * | 2014-09-02 | 2016-03-02 | 中兴通讯股份有限公司 | Sending window flow control method and terminal |
| CN105376173B (en) * | 2014-09-02 | 2020-04-28 | 中兴通讯股份有限公司 | Sending window flow control method and terminal |
| WO2017028727A1 (en) * | 2015-08-14 | 2017-02-23 | 中兴通讯股份有限公司 | Signalling receiving method and device for base station |
| CN106470448A (en) * | 2015-08-14 | 2017-03-01 | 中兴通讯股份有限公司 | A kind of signaling method of reseptance of base station and device |
| CN106470448B (en) * | 2015-08-14 | 2020-10-30 | 中兴通讯股份有限公司 | Method and device for receiving signaling of base station |
| CN105554822A (en) * | 2015-12-10 | 2016-05-04 | 京信通信技术(广州)有限公司 | Control method and device for balancing rates of multiple user terminals of base station |
| CN105554822B (en) * | 2015-12-10 | 2019-02-22 | 京信通信系统（中国）有限公司 | The control method and device of balanced base stations and multiuser terminal speed |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100518037C (en) | 2009-07-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1324862C (en) | Method for regulating congest window in communication network | |
| CN1293871A (en) | Decoder buffer for streaming video receiver | |
| US9794311B2 (en) | Transport accelerator implementing extended transmission control functionality | |
| US7080173B2 (en) | Reducing information reception delays | |
| CN1305276C (en) | Method and system for immediately processing real time media stream data packets | |
| CN1921364A (en) | Method for package transmitting and self-adaptive window zooming of reliable transmission layer based on message | |
| US8306062B1 (en) | Method and apparatus of adaptive large receive offload | |
| CN1819553A (en) | Transmission control protocol (TCP) congestion control using multiple tcp acknowledgements (ACKS) | |
| CN1878049A (en) | Method of controlling transmission rate by using error correction packets and communication apparatus using the same | |
| EP1786136A1 (en) | Packet retransmission apparatus, communication system and program | |
| CN1886966A (en) | System, method and computer program product for increasing throughput in bi-directional communications | |
| CN1829345A (en) | Method and system for realizing data share between mobile terminals | |
| CN1832483A (en) | Method and system for control data transmit in communication system | |
| CN1497933A (en) | Network telephone set and voice decoder | |
| CN101056245A (en) | Media stream relay device and method | |
| CN1812575A (en) | Parallel transmission dispatching method for stream media data | |
| CN1633796A (en) | Modifications to TCP/IP for broadcast or wireless networks | |
| CN1248465C (en) | Management method of data fransmission/receiving butter region in network communication | |
| CN1992582A (en) | Implementation method for adaptive variable slide receiving window of broadband signaling link | |
| CN1866905A (en) | Method and apparatus for shaping transmission service stream in network | |
| CN1571418A (en) | A method and system for implementing data transmission in flow control transmission protocol | |
| CN1705308A (en) | User plane data processing method | |
| CN1391374A (en) | Selective grouping retransmission with time control on transmitter terminal | |
| CN1842080A (en) | Method for adjusting transmission control protocol receive window | |
| CN1855793A (en) | Control of video encoding speed |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090722 Termination date: 20170825 |