CN101175027B - SSCOP periodic line sliding window updating method - Google Patents
SSCOP periodic line sliding window updating method Download PDFInfo
- Publication number
- CN101175027B CN101175027B CN2006101504538A CN200610150453A CN101175027B CN 101175027 B CN101175027 B CN 101175027B CN 2006101504538 A CN2006101504538 A CN 2006101504538A CN 200610150453 A CN200610150453 A CN 200610150453A CN 101175027 B CN101175027 B CN 101175027B
- Authority
- CN
- China
- Prior art keywords
- window
- window size
- cpcs
- buffer memory
- atm
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention provides a SSCOP link sliding window renewal method, including that a link calls a CPCS/ATM detection function to obtain the present residual number of CPCS/ATM buffers whenever receiving a data packet. According to the present residual number and the last period residual number of receiving buffers obtained in the last period and a predetermined algorithm, the evaluation value of the present link receiving ability is calculated. The size of a receiving window is determined according to the evaluation value, the buffer total number and predetermined rules. Therefore, the renewal of SSCOP link sliding windows among the net element equipments of the core network CN of the third mobile communication system which adopts ATM technique as the ground transmission bearing, a wireless network controller RNC and a base station NodeB is realized.
Description
Technical field
The present invention relates to a kind of SSCOP link sliding window updating method, more specifically, relate to a kind of adopt atm technology as between the network element devices such as core net CN, radio network controller (RNC) and base station node B of the 3-G (Generation Three mobile communication system) of terrestrial transmission carrying to the method for SSCOP link sliding window updating.
Background technology
When 3-G (Generation Three mobile communication system) uses ATM (Asynchronous TransferMode) when technology is carried as terrestrial transmission, Iu interface (interface between RNC and core net) at core net CN (Core Network) and radio network controller (RNC) (radio network controller), all adopt the SSCOP (ServiceSpecific Connection Oriented Protocol) of ATM to carry out the reliable transmission of signaling data on the Iur interface between Iub interface between RNC and base station node B (base station) (interface between RNC and base station) and RNC (logic interfacing between two RNC physically may not be point-to-point connection).In protocol stack, SSCOP is positioned on the CPCS (Common Part ConvergenceSublayer, common part convergence sub-layer).
Wherein, the basic variable in the SSCOP agreement is:
VR (R): the sequence sequence number of the SD PDU that next expectation is received increases 1 after receiving.
VR (H): the maximum SD PDU sequence number that next expectation is received, when receiving new SDPDU or POLL PDU, VR (H) is upgraded.
VR (MR): be not received the initial SD PDU sequence number that end allows reception.
Send the stage (Data transfer) in data, the recipient in real time according to self situation (for example receive buffer memory size, receive the factors such as length of formation in the buffer memory), upgrade variable V R (MR), and VR (MR) is passed to transmit leg, thereby change the send window size of transmit leg by sending STAT PDU or USTAT PDU.
Receiving terminal is that transmitting terminal provides a reliability, the maximum sequence number of the current SD PDU that can send of sign transmitting terminal.The SD PDU that surpasses this maximum sequence number that transmitting terminal is sent will be received end and abandon.Transmitting terminal always distributes according to the order of sequence and sends sequence number, if sequence number surpasses this maximum sequence number, stops to send, and sends out polling message POLL-PDU to the opposite end and applies for upgrading the send window coboundary; Still surpass maximum sequence number if send sequence number after the maximum sequence number of renewal (receiving STAT-PDU etc.), transmitting terminal is put congestion flag and is notified management level to lack reliability.If at this moment still there are upper-layer user's data to arrive, it is full until it that SSCOP can deposit transmit queue as far as possible in order in, the SD that comes after losing afterwards.The SD of every transmission some of making a start can send out polling message POLL to the opposite end, with reach send window coboundary.As previously mentioned, it is congested that transmitting terminal appears in the too small meeting of window, limited the throughput that SSCOP connects; Window is crossed the reception buffer capacity that conference surpasses receiving terminal, causes loss of data.
The recipient is by the speed of sliding window control transmit leg transmission data, to realize the purpose of flow control.
Sliding window control classic methods is to pre-estimate the performance of the maximum of link, provides the initial value of a receive window, just can not change its size afterwards.Such shortcoming is can not in time reduce flow when the link receiving ability is not enough, CPCS/ATM is received overflow after buffer memory is taken, and causes retransmission data packet may repeatedly, makes the burden of link, and link transmission quality descends.In addition, when the other side send out POLL-PDU poll bag interval greater than 100ms the time, just need to strengthen receive window because at this moment the renewal frequency step-down of window (100ms is the recommended value of agreement, but the other side's design is unknown).
In sum, the problem of two aspects in use can appear in the flow-control mechanism of SSCOP link.The frequency that the POLL-PDU poll bag at two ends sent when aspect was butt joint is also inconsistent, and the frequency that causes the two ends sliding window to upgrade is also inconsistent, and the underfrequency when the poll bag of a certain end sends causes overstocking of opposite end packet easily.Another aspect is in use dynamically to adjust the size of sliding window, when link transmission quality difference or receiving ability deficiency, causes CPCS/ATM to receive buffering easily and overflows, and repeatedly retransmission data packet may occurs, increases the weight of link load.
Summary of the invention
Thereby for the problem that the sliding window that solves receive window can not dynamically update, the new flow control algorithm that the invention provides a kind of SSCOP link is realized the automatic renewal of sliding window.
Wherein, flow control algorithm satisfies following requirement: suitably reduce the other side's flow when the receiving ability of (1) link is not enough, avoid CPCS/ATM to receive and cause packet loss to retransmit after buffer memory is taken; (2) make serial ports be controlled at a proper size, neither can be with flow restriction too small, can't give full play to link performance, it is too big and cause link-quality to worsen to be unlikely to flow again; And (3) can handle some special circumstances, when the other side is not when sending out POLL poll bag according to the frequency of 100ms, enlarges or dwindle receive window according to the window update time of length at interval.Blanking time is long more, will strengthen window more; Blanking time is short more, will reduce window more.
One aspect of the present invention provides a kind of SSCOP link sliding window updating method, and it may further comprise the steps: step S102, link call the CPCS/ATM detection function to obtain the current residual number that CPCS/ATM receives buffer memory when whenever receiving a packet; Step S104, the last period residue number of the reception buffer memory that obtained according to current residual number and a last period is calculated the assessed value of current link receiving ability by pre-defined algorithm; And step S106, according to assessed value and CPCS/ATM buffer memory sum, determine the size of receive window by pre-defined rule.
Wherein, a last period refers to the interval period of upgrading between receive window for twice.
Pre-defined algorithm in above-mentioned SSCOP link sliding window updating method is: current residual number and residue number of the last period are averaged as the assessed value of present link receiving ability.
In addition, pre-defined rule refers to: when the ratio of assessed value and CPCS/ATM buffer memory sum during less than first threshold, receive window is reduced into first window size; When the ratio of assessed value and CPCS/ATM buffer memory sum during greater than second threshold value, judge whether new data surpass second window size, if surpassed second window size, then receive window is enlarged into the 3rd window size, if do not surpass second window size, then keep receive window constant; And when the ratio of assessed value and CPCS/ATM buffer memory sum is between the 3rd threshold value and the 4th threshold value, keep receive window constant.
In above-mentioned SSCOP link sliding window updating method, first threshold is 50%, and first window size is 80% of a current window size; Second threshold value is that 80%, the second window size is 60% of a current window size, and the 3rd window size is 120% of a current window size; And the 3rd threshold value be 50%, and the 4th threshold value is 80%.
Another aspect of the present invention provides the sliding window updating device of the SSCOP link in a kind of mobile system, it comprises: detecting unit is used for all calling the CPCS/ATM detection function to obtain the current residual number of CPCS/ATM buffer memory when link is whenever received a packet; Computing unit is used for the last period residue number of the reception buffer memory that obtained according to current residual number and a last period, calculates the assessed value of current link receiving ability by pre-defined algorithm; And the window size determining unit, be used for determining the size of receive window by pre-defined rule according to assessed value and buffer memory sum.
Wherein, a last period refers to the interval period between receive window twice.
Pre-defined algorithm in above-mentioned SSCOP link sliding window updating device is: current residual number and residue number of the last period are averaged as the assessed value of present link receiving ability.
In addition, pre-defined rule refers to: when assessed value during less than first threshold, receive window is reduced into first window size; When assessed value during, judge whether new data surpass second window size, if surpassed second window size, then receive window are enlarged into the 3rd window size, if do not surpass second window size, then do not keep receive window constant greater than second threshold value; And when evaluating value bit is between the 3rd threshold value and the 4th threshold value, keep receive window constant.
In above-mentioned SSCOP link sliding window updating device, first threshold is 50% of the buffering sum, and first window size is 80% of a current window size; Second threshold value is 60% of a current window size for 80%, the second window size of buffering sum, and the 3rd window size is 120% of a current window size; And the 3rd threshold value be 50% of buffering sum, and the 4th threshold value is 80% of buffering sum.
By foregoing description, the present invention can solve the problem that the sliding window of receive window can not dynamically update in the prior art.
Other features and advantages of the present invention will be set forth in the following description, and, partly from specification, become apparent, perhaps understand by implementing the present invention.Purpose of the present invention and other advantages can realize and obtain by specifically noted structure in the specification of being write, claims and accompanying drawing.
Description of drawings
Accompanying drawing is used to provide further understanding of the present invention, and constitutes the part of specification, is used from explanation the present invention with embodiments of the invention one, is not construed as limiting the invention.In the accompanying drawings:
Fig. 1 shows the flow chart according to the SSCOP link sliding window updating method in the mobile communication system of the present invention;
Fig. 2 shows the block diagram according to the SSCOP link sliding window updating device in the mobile communication system of the present invention;
Fig. 3 shows the schematic diagram of the receive window renewal process of SSCOP link update method according to an embodiment of the invention; And
Fig. 4 shows the flow process control schematic diagram of SSCOP link sliding window updating method according to an embodiment of the invention.
Embodiment
Below in conjunction with accompanying drawing the preferred embodiments of the present invention are described, should be appreciated that preferred embodiment described herein only is used for description and interpretation the present invention, and be not used in qualification the present invention.
As shown in Figure 1, comprise step S102 according to the SSCOP link sliding window updating method in the mobile communication system of the present invention, link all calls the CPCS/ATM detection function to obtain the current residual number of CPCS/ATM buffer memory when whenever receiving a packet.
Then, at step S104, the last period residue number of the reception buffer memory that obtained according to described current residual number and a last period is calculated the assessed value of current link receiving ability by pre-defined algorithm.Wherein, a last period refers to the interval period between receive window twice.Pre-defined algorithm was that current residual number and residue number of the last period are averaged as the assessed value of present link receiving ability.Buffer memory average residual number is many, illustrates that the link receiving ability is strong; Buffer memory average residual number is few, a little less than the link receiving ability.
Next, at step S106,, determine the size of receive window by pre-defined rule according to assessed value and buffer memory sum.
Wherein, pre-defined rule is: when assessed value during less than first threshold, receive window is reduced into first window size; When assessed value during, judge whether new data surpass second window size, if surpassed second window size, then receive window are enlarged into the 3rd window size, if do not surpass second window size, then do not keep receive window constant greater than second threshold value; And when evaluating value bit is between the 3rd threshold value and the 4th threshold value, keep receive window constant.
In this embodiment, when CPCS/ATM receives buffer memory average residual number less than BufNum1 (suggestion is 50% of the buffer memory sum), receiving ability a little less than, window is contracted to WinSize1 (be preferably original window size 80%), thereby reduced the other side's flow, and reserved certain buffer memory and receive new data.
In addition, when CPCS/ATM buffer memory average residual number greater than BufNum2 (suggestion for the buffer memory number 80%), receiving ability is stronger, window can be amplified.Judge earlier whether the window of setting last time is filled up by new data, when new data surpass WinSize2 (be preferably window size 60%), therefore receiving ability is stronger, but has limited the other side's flow, window is enlarged into WinSize3 (be preferably original window size 120%); When new data surpass window 60% the time, also allow the other side's augmented flow, thereby keep window constant.
And when driving buffer memory average residual number between BufNum3 (be preferably buffer memory sum 50%) and BufNum4 (be preferably buffer memory sum 80%) time, window size is proper, has both given full play to the performance of link, also is unlikely to make flow excessive.
Preferably, first threshold is 50% of the buffering sum, and first window size is 80% of a current window size.Second threshold value is 60% of a current window size for 80%, the second window size of buffering sum, and the 3rd window size is 1 20% of a current window size.The 3rd threshold value is 50% of the buffering sum, and the 4th threshold value is 80% of buffering sum.
As shown in Figure 2, comprise detecting unit device 202 according to the SSCOP link sliding window updating device 200 in the mobile communication system of the present invention, be used for when link is whenever received a packet, all calling the CPCS/ATM detection function to obtain the current residual number of CPCS/ATM buffer memory.
In addition, also comprise computing unit device 204, be used for the last period residue number of the reception buffer memory that obtained according to current residual number and a last period, calculate the assessed value of current link receiving ability by pre-defined algorithm.
Wherein, a last period is twice interval period between receive window.Pre-defined algorithm is: current residual number and residue number of the last period are averaged as the assessed value of present link receiving ability.
In addition, also comprise window size determining unit device 206, be used for determining the size of receive window by pre-defined rule according to assessed value and buffer memory sum.
Wherein, pre-defined rule is: when assessed value during less than first threshold, receive window is reduced into first window size; When assessed value during, judge whether new data surpass second window size, if surpassed second window size, then receive window are enlarged into the 3rd window size, if do not surpass second window size, then do not keep receive window constant greater than second threshold value; And when evaluating value bit is between the 3rd threshold value and the 4th threshold value, keep receive window constant.
Preferably, first threshold is 50% of the buffering sum, and first window size is 80% of a current window size.Second threshold value is 60% of a current window size for 80%, the second window size of buffering sum, and the 3rd window size is 120% of a current window size.The 3rd threshold value is 50% of the buffering sum, and the 4th threshold value is 80% of buffering sum.
Fig. 3 shows the schematic diagram of the receive window renewal process of SCOPP link update method according to an embodiment of the invention.Wherein, SlidWinLen represents the sliding window size; MaxBd represents the maximum number of CPCS/ATM buffer memory; LeftBd represents the residue number of CPCS/ATM buffer memory; VrR is the window low side, and expression 0～VrR is the sequence number of the packet that received; VrMR is the high-end of window, all is allowed to receive less than the packet of VrMR, between VrR and VrH data-bag lost is arranged.Wherein, the high-end agreement of new window can not be less than VrH.
Fig. 4 shows the flow process control schematic diagram of SSCOP link sliding window updating method according to an embodiment of the invention.
Below with reference to Fig. 3 Fig. 4 process is described.
The ratio that receives the shared window of data when in this embodiment, CPCS/ATM receives the buffer memory anxiety is 50%; CPCS/ATM reception buffer memory receives the shared window of data when abundant ratio is 80%; The ratio that receives the shared window of data when window need dwindle is 80%; The ratio that window need be enlarged into original window size is 120%; And the ratio that window size receives the shared window of data when suitable is 60%.
At first, at step S402, the SSCOP link all calls the residue number that the CPCS/ATM detection function obtains receiving buffer memory when whenever receiving a packet.When upgrading window, it is one average that the residue number of the buffer memory that the last period interval period of renewal window (twice between) is obtained is done, and half of this mean value and total reception buffer memory number compared.
(1) if a little less than buffer memory average residual number less than 50% (step S402 is a "Yes") of sum, thinks that then receiving ability, need dwindle sliding window, proceeds to step S404, sliding window is contracted to original 80%.Then, at step S406, VrMR is updated to VrR and VrMR sum.At this moment, in step S408, judge that whether VrMR is less than VrH then.If the result is a "Yes", then proceed to step S410, the value of VrH is composed to VrMR.Execution in step S412 then, the value of calculating sliding window SlidWinLen this moment is the difference of VrMR and VrR, and is final, window dwindles to upgrade and finishes.If the judged result in step S408 is a "No", then be directly to step S412, then, window dwindles to upgrade and finishes.
(2) if buffer memory average residual number and be not less than the sum 50% (step S402 is a "No"), think that then receiving ability is stronger, need to amplify sliding window, proceed to step S414, judge that whether CPCS/ATM buffer memory average residual number is greater than 80% of buffer memory sum.When if the result is "No" (step S414 is a "No"), promptly when CPCS/ATM buffer memory average residual number between sum 50% and 80% between the time, think that at this moment window size is proper, both given full play to the performance of link, also be unlikely to make flow excessive, then be directly to step S420.If the result is "Yes" (step S414 is a "Yes"), think that then receiving ability is stronger at this moment, window can be amplified, proceed to step S416, judge whether new data surpass 60% of window SlidWinLen, if the result is "No" (step S416 is a "No"), think that then we also allow the other side's augmented flow, thereby, be directly to step S420, the low side that the high-end VrMR of window is set to window and sliding window window size and, window amplifies to upgrade and finishes; If the result is "Yes" (step S416 is a "Yes"), think that receiving ability is stronger at this moment, then proceed to step S418, the ratio by 120% amplifies current window SlidWinLen, then, enters step S420, and window amplifies renewal and finishes.
The above is the preferred embodiments of the present invention only, is not limited to the present invention, and for a person skilled in the art, the present invention can have various changes and variation.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (7)
1. a SSCOP link sliding window updating method is characterized in that, may further comprise the steps: step S102, link call the CPCS/ATM detection function to obtain the current residual number that CPCS/ATM receives buffer memory when whenever receiving a packet;
Step S104, the last period residue number of the described reception buffer memory that obtained according to described current residual number and a last period is calculated the assessed value of current link receiving ability by pre-defined algorithm; And
Step S106 according to described assessed value and CPCS/ATM buffer memory sum, determines the size of receive window by pre-defined rule.
2. SSCOP link sliding window updating method according to claim 1 is characterized in that, a described last period is the interval period between the described receive window of twice renewal.
3. SSCOP link sliding window updating method according to claim 1 is characterized in that described pre-defined algorithm is: described current residual number and described last period residue number are averaged as the assessed value of present link receiving ability.
4. according to each described SSCOP link sliding window updating method in the claim 1 to 3, it is characterized in that described pre-defined rule is:
When the ratio of described assessed value and described CPCS/ATM buffer memory sum during, described receive window is reduced into first window size less than first threshold;
When the ratio of described assessed value and described CPCS/ATM buffer memory sum during greater than second threshold value, judge whether new data surpass second window size, if surpassed described second window size, then described receive window is enlarged into the 3rd window size, if do not surpass described second window size, then keep described receive window constant; And
When the ratio of described assessed value and described CPCS/ATM buffer memory sum is between the 3rd threshold value and the 4th threshold value, keep described receive window constant.
5. SSCOP link sliding window updating method according to claim 4 is characterized in that described first threshold is 50%, and described first window size is 80% of a current window size.
6. SSCOP link sliding window updating method according to claim 4 is characterized in that described second threshold value is 80%, and described second window size is 60% of a current window size, and described the 3rd window size is 120% of a current window size.
7. SSCOP link sliding window updating method according to claim 4 is characterized in that described the 3rd threshold value is 50%, and described the 4th threshold value is 80%.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006101504538A CN101175027B (en) | 2006-10-31 | 2006-10-31 | SSCOP periodic line sliding window updating method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006101504538A CN101175027B (en) | 2006-10-31 | 2006-10-31 | SSCOP periodic line sliding window updating method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101175027A CN101175027A (en) | 2008-05-07 |
| CN101175027B true CN101175027B (en) | 2011-11-30 |
Family
ID=39423295
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2006101504538A Expired - Fee Related CN101175027B (en) | 2006-10-31 | 2006-10-31 | SSCOP periodic line sliding window updating method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101175027B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103227697B (en) * | 2013-03-26 | 2015-11-25 | 北京创毅视讯科技有限公司 | A kind of detection method of protocol Data Unit and device |
| CN103763211B (en) * | 2014-02-13 | 2017-02-22 | 上海交通大学 | Link flow control method |
| CN106470448B (en) * | 2015-08-14 | 2020-10-30 | 中兴通讯股份有限公司 | Method and device for receiving signaling of base station |
| CN107708199B (en) * | 2017-09-26 | 2021-01-26 | 南京哈卢信息科技有限公司 | Method for improving downlink reliability of low-power-consumption wireless cellular network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6438101B1 (en) * | 1997-12-23 | 2002-08-20 | At&T Corp. | Method and apparatus for managing congestion within an internetwork using window adaptation |
| CN1496157A (en) * | 2002-09-07 | 2004-05-12 | Lg������ʽ���� | Data retransmission control method for mobile communication system |
| CN1529437A (en) * | 2003-10-17 | 2004-09-15 | 中兴通讯股份有限公司 | Flow control method for WCDMA system wireless network control tier |
| CN1536798A (en) * | 2003-04-11 | 2004-10-13 | 深圳市中兴通讯有限公司南京分公司 | Adaptive flow rate control method of forward access transmission channel |
| CN1764101A (en) * | 2004-10-22 | 2006-04-26 | 华为技术有限公司 | Method for distributing wireless link window size dynamically |
-
2006
- 2006-10-31 CN CN2006101504538A patent/CN101175027B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6438101B1 (en) * | 1997-12-23 | 2002-08-20 | At&T Corp. | Method and apparatus for managing congestion within an internetwork using window adaptation |
| CN1496157A (en) * | 2002-09-07 | 2004-05-12 | Lg������ʽ���� | Data retransmission control method for mobile communication system |
| CN1536798A (en) * | 2003-04-11 | 2004-10-13 | 深圳市中兴通讯有限公司南京分公司 | Adaptive flow rate control method of forward access transmission channel |
| CN1529437A (en) * | 2003-10-17 | 2004-09-15 | 中兴通讯股份有限公司 | Flow control method for WCDMA system wireless network control tier |
| CN1764101A (en) * | 2004-10-22 | 2006-04-26 | 华为技术有限公司 | Method for distributing wireless link window size dynamically |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101175027A (en) | 2008-05-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101849391B (en) | Efficient flow control in a radio network controller (RNC) | |
| CN1613233B (en) | Method and system of retransmission | |
| CA2416897C (en) | Tcp flow control | |
| JP3540183B2 (en) | Multilink communication device | |
| JP4632874B2 (en) | Communication terminal | |
| JP4497322B2 (en) | Communication method | |
| KR100973376B1 (en) | Data transmission method and device using controlled transmission profile | |
| KR100409162B1 (en) | Radio base station, packet relay device, and radio communication system | |
| US7352700B2 (en) | Methods and devices for maximizing the throughput of TCP/IP data along wireless links | |
| EP1558000B1 (en) | Transmitter device for controlling data transmission | |
| EP1850538A1 (en) | Radio communication device, communication route control device, communication route control method, and communication system | |
| US20070025304A1 (en) | System and method for prioritizing transmission legs for precaching data | |
| JP2008532382A (en) | Method and apparatus for supporting data flow control in a wireless mesh network | |
| CN113826364A (en) | Method and apparatus for cooperative communication of sidelink | |
| CN101668314A (en) | Data transmission method for wireless distribution system and device thereof | |
| CN101175027B (en) | SSCOP periodic line sliding window updating method | |
| US7876679B2 (en) | Connection-oriented data transfer over wireless transmission paths | |
| GB2384950A (en) | Mobile communication system in which a wireless link control is performed by processing an acknowledged mode wireless link control protocol. | |
| WO2002043403A2 (en) | Enhanced data link layer selective reject mechanism in noisy wireless environment | |
| CN1965547A (en) | Frame transmission interval | |
| CN1992582B (en) | Implementation method for adaptive variable slide receiving window of broadband signaling link | |
| CA2371503C (en) | Packet data transmission in third generation mobile system | |
| US20030099205A1 (en) | Method for classifying service classes of packet data in two way communication network | |
| CN101175028A (en) | SSCOP periodic line sliding window updating device | |
| CN100471197C (en) | Method of efficiently transmitting/receiving data using transport layer in a mobile ad hoc network, and network device using the method |
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 |
Granted publication date: 20111130 Termination date: 20151031 |
|
| EXPY | Termination of patent right or utility model |