CN101371484A - System and method for transmitting and receiving data frames in a NAK-based window protocol - Google Patents
System and method for transmitting and receiving data frames in a NAK-based window protocol Download PDFInfo
- Publication number
- CN101371484A CN101371484A CNA2005800041528A CN200580004152A CN101371484A CN 101371484 A CN101371484 A CN 101371484A CN A2005800041528 A CNA2005800041528 A CN A2005800041528A CN 200580004152 A CN200580004152 A CN 200580004152A CN 101371484 A CN101371484 A CN 101371484A
- Authority
- CN
- China
- Prior art keywords
- frame
- transmitter
- receiver
- copy
- message
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Abstract
In a NAK-based window transmission protocol where the transmitter retains transmitted data frames in a retransmission queue, one or more transmitted data frames are discarded as the number of data frames approaches the available queue capacity. A message, such as a control frame, is transmitted to the receiver indicating which of the retained data frame copies were discarded. The queue stall avoidance mechanism operates at the transmitter, which has direct knowledge of its queue utilization. By avoiding a queue stall, the transmitter may continue to receive incoming data packets for transmission to a receiver. That is, the transmitter can be configured to prioritize sending new data over retaining previously transmitted data for support of data retransmissions.
Description
Technical field
The present invention relates generally to field of wireless communications systems, particularly a kind of system and method that is used to send and receive based on the window protocol Frame of NAK.
Background technology
The Modern Communication System that comprises wireless system is used hierarchy, has to be used at the put rules into practice separated protocol of function of each layer.This layered protocol method allows to carry out the more senior logical operation of transmission and reception, error correction etc., and does not consider more rudimentary physical operations.
The IS-2000CDMA wireless communication standard has defined the agreement that is called " radio link protocol (RLP) ", and this agreement is used to realize the physical layer communication between Radio Access Network and the travelling carriage.RLP discovers less than more high-rise framing; It moves on undistinguishable octet stream, transmits described eight bit byte to receive order.RLP has the program of the shown error rate of abundant reduction cdma service channel.More there is no between high layer packets and the RLP Frame and contact directly; Large-scale grouping can expand into a plurality of Frames, and a perhaps independent RLP Frame can comprise all or part of of several small-sized more high layer packets.
RLP is based on the window protocol of NAK.That is to say that receiver is not replied the Frame that each is received certainly.But receiver receives and process frames of data (according to the serial number relevant with each Frame) according to order, sends negative response (NAK)-do not receive or receive irrecoverable error when Frame " is lost ".During the one or more Frame that connects when the data frame sequence of receiving Yu before received is non-conterminous, receiver can send the NAK that has the obliterated data frame sequence number.This NAK is the request of retransmits lost Frame.Yet this NAK does not need to send immediately; Receiver can continue to receive lost frames Frame before, wishes to receive in uncalled re-transmission the Frame of losing.Receiver also can optionally send " filling up (fill) " frame frequently, and all Frames up to particular sequence number have correctly been received in expression.
In order to observe the NAK agreement, transmitter must keep the copy of each Frame that sends in retransmission queue, receives the possibility of NAK request with reply.In case receive NAK, transmitter just knows that receiver does not correctly receive in the NAK request all Frames before institute's identification data frame.Therefore, only receive NAK or " filling up " frame, transmitter just can abandon the previous copy that sends Frame, discharges the space in its retransmission queue.If for the retransmission queue of any fixed size-especially correctly the received Frame of all transmissions for the compulsory fixedly queue size-receiver of RLP agreement discussed herein, perhaps there are not certain lost frames of NAK decidedly, and frame is filled up in transmission, and transmitter can come the complete filling retransmission queue with the copy of transmission Frame so.In case this situation occurred, transmitter must pause, and can not accept in order to be transferred to the new data frame of receiver.
Summary of the invention
On the one hand, the present invention relates to a kind of method of avoiding transmitter queue pause (stall) in the transmitter.Frame is sent to receiver continuously, and each Frame all identifies with a serial number.The copy of each Frame of send is retained in the formation to be used for possible re-transmission, and up to the message that receives from receiver such as control frame, this message represents correctly to receive Frame, perhaps till having exceeded the maximum number that retransmits.In response to the approaching available capacity of queue of the number of institute's retained data frame copy, abandon the copy of one or more retained data frame, and will send to receiver such as the message of control frame, which institute's retained data frame copy is this message represent to abandon.
On the other hand, the present invention relates to a kind of transmitter.This transmitter comprises the input rank that is used to receive the new data that will send to receiver, and the circuit that is used for sending to receiver Frame.This transmitter also comprises for example retransmission queue of memory, be used to store when receiver receives the not Frame copy that sends of affirmative acknowledgement, and controller, can operate and be used for abandoning one or more copies that send Frame during near the active volume of memory when described copy.This method of operation allows transmitter to send new data, rather than waits for the availability of re-transmit queue.
Again on the one hand, the present invention relates to the frame that a kind of receiver/transmitter sends, and send these frames to the more method of higher protocol layer.From the transmitter receiving data frames, each frame all identifies with a serial number.With what receive, the continuous data frame sends higher protocol layer to.With what receive, the non-continuous data frame is stored in the formation out of order.In case receive for example message of control frame from transmitter, this message comprises the serial number of flush (flush), and expression abandons the copy of the institute's transmit frame that is used for retransmitting of one or more transmitters reservations, just will send higher protocol layer to, and the starting point of described formation out of order will be reset to described flush sequence number up to all receiving data frames of this flush sequence number.
Another aspect the present invention relates to a kind of receiver.This receiver comprises the receiver that is used for from the transmitter receiving data frames, and each Frame all has a serial number.This receiver also comprises the output that is used for transmitting to higher protocol layer more the received data frame, and the memory that is used to be stored in the non-continuous data frame of receiving before transmitting to higher protocol layer more, the reception of mediate continuous data frame co-pending.In addition, this receiver comprises controller, can operate to be used for reaching or responding near capacity limitation detecting the memory that is used to store the non-continuous data frame, transmits described non-continuous data frame to higher protocol layer more.This controller also can be operated and be used for just transmitting described non-continuous data frame to higher protocol layer in case receive from transmitter and to have abandoned the message that transmitter is preserved for the mediate continuous data frame copy that may retransmit.
Description of drawings
Fig. 1 is the functional-block diagram of wireless communication system.
Fig. 2 is U
mThe protocol layer diagram of datum mark.
Fig. 3 is the function diagram of RLP transmitter and receiver buffer.
Embodiment
Fig. 1 illustrates with numeral 10 exemplary wireless communications network that summarize the directions for.In an exemplary embodiment, network 10 is based on the cdma2000 by telecommunications industry association (TIA) promulgation, and the 1xEV-DO/DV standard is although the present invention is not limited to such embodiment.Herein, but network 10 is coupled to public switched telephone network (PSTN) 14 with one or more travelling carriages (MS) 12, integrated data digital network (ISDN) 16, and/or public data network (PDN) 18, for example internet in the mode of liaison.Support this function, network 10 comprises and strides across the wireless access network (RAN) 20 that the A interface is connected to packet-based core networks (PCN) 22 and IS-41 network 24.
RAN 20 generally includes one or more base station controllers (BSC) 26, and each includes one or more controllers 28 or other treatment systems, and relevant memory 30, is used to store essential data and the parameter relevant with ongoing communication activity.Usually, each BSC 26 all is associated with one or more base stations (BS) 32.Each BS 32 includes one or more controllers 34, or other treatment systems, and support and the MS 12 raisonne transceiver resources 36 of carrying out radio communication, modulator/demodulator for example, baseband processor, radio frequency (RF) power amplifier, antenna or the like.
BS 32 can be called basic transceiver system (BTS) or radio base station (RBS).In the running, BS 32 passes through U
mInterface sends control and business datum to MS 12, and receives control and business datum from these MS 12.BSC 26 provides the coordination control to each BS 32.But BSC 26 can also be coupled to PCN 22 with RAN 20 with liaison mode.
PCN 22 comprises packet data serving node (PDSN) 38, and this node comprises one or more controllers 40, or other treatment systems, local agent (HA) 42, and authentication (AAA) server 44.Usually, PCN 22 is coupled to PDN 18 by the IP network 46 of management, and this IP network 46 is moved under the control of network 10.PDSN 38 passes through to set up, keeps and terminates point-to-point protocol (PPP) link as the tie point between RAN 16 and the PDN 18, and external agent (FA) function that provides the web visitor to register and serve.HA 42 and PDSN 38 together move, so that authenticate mobile IP registration, and grouping tunneling (tunneling) and other professional current local informations that is redirected activity are supported in preservation.At last, aaa server 44 provides authentification of user and mandate, and the support of call charge service.
But BSC 26 can also be coupled to IS-41 network 24 with RAN 20 with liaison mode.IS-41 network 24 comprises mobile switching centre (MSC) 48, and its visit Home Location Register (HLR) 50 and Visited Location Registor (VLR) is to obtain customer location and profile information.MSC48 sets up RAN 20 with circuit switching and packet switching communication between PSTN 16 and the ISDN 16.
In Fig. 2, draw the protocol layer architecture that has defined the Um Interface of communication between RAN 20 and the MS 12.On the upper strata, PCN 22 provides Packet data service, and IS-41 network 24 provides aforesaid voice service and circuit switched data.Be also referred to as the 3rd layer of the IS-2000 of Signaling Layer, comprise allowing the terminal use to receive professional base station and travelling carriage interoperability program and relevant signaling.
Link access control (LAC) layer provides the transport service on the logic channel of the 3rd layer of signaling.This logic channel can be special-purpose, also can be public.Dedicated channel is mapped as the physical channel of distributing to the sole user, for example is used to send Speech Communication.Common channel is mapped as the shared physical channel of a plurality of users, and can carry system overhead traffic, beep-page message, or the like.LAC is encapsulated into the 3rd layer of message in the LAC protocol Data Unit (PDU), and this PDU can carry out Segmentation and Reassembly, so that make them be suitable for being transmitted by low layer.
Medium access control (MAC) layer is mapped as physical channel with logic channel, and the use of coordinate resource.MAC also puts teeth in service quality (QoS) grade of negotiation.MAC carries out multiplexing and demultiplexing function, is linked into medium so that allow from the PDUs of LAC reception and the data cell that receives from user application.MAC is by radio link protocol (RLP) and other agreements, guaranteed reliable transfer of data-almost do not have error and according to order.RLP is by the dedicated form of automatic repetitive requests (ARQ) agreement of IS-707 standard definition, selectivity repetition, and the full content of this agreement is herein incorporated for reference.Although do not handle by the MAC layer clearly, RLP function and conceptive be the part of MAC layer.As shown in Figure 2, RLP 60 receives data from PDSN 38, stores data in buffer or formation 66.RLP communicates by the reciprocity RLP 70 in data and control frame and the travelling carriage 12.
As mentioned above, RLP is based on the ARQ agreement of negative response (NAK).RLP operation-transfer of data and re-transmission-basis are carried out when being connected when professional (for example at call setup time) negotiation parameter.The RLP parameter is contained in the data structure that is called RLP bit block (RLP-BLOB).These parameters comprise NAK number, the number of cycles in each circulation, and also comprise the round trip cycle (RTT) of estimation alternatively, or the round trip between base station 32 and the travelling carriage 12 postpones.For forward packet data channel (F-FDCH) operation, RLP-BLOB can also comprise DELAY_DETECTION_WINDOW (DDW) parameter in addition.In the starting point that business connects, RTT is determined by the SYNC program between BS 32 and the MS 12.
In case initialization the RLP parameter, just can carry out data and transmit.RLP sequence of data frames space comprises 12 bit values of 4096 serial numbers.Each Frame identifies by a serial number, and the transmission of Frame and receive is followed the tracks of by the queue pointer that preserves in the RLP transmitter and receiver.As shown in Figure 3, these formations are at the conceptive circular buffer that is configured to.Four pointers have following implication:
L_V (S): 12 bit-order of the next Frame that send number
L_V (R): 12 bit-order of the new data frame of next expection number
L_V (N): 12 bit-order number that need the next Frame that order transmits
L_V (N)
PEER: the estimation of the L_V of reciprocity RLP (N)
It shifts to an earlier date L_V (S) when receiver sends Frame when transmitter.In case receive new data frame, if the Frame of receiving receives L_V (N) in advance so for the previous next alphabetic data frame of receiving data frames in order (in order number).If new data frame drops between L_V (S) and the L_V (S), so this Frame is stored in the receiver queue, and does not upgrade pointer.If new data frame (in order number) beyond the most forward Frame of receive, receiver advances to L_V (R) serial number of the Frame of receiving so.If the serial number of the Frame of receiving is lower than L_V (N) (as giving a definition), receiver has been interpreted as the correctly re-transmission of the alphabetic data frame of reception with it so, and abandons it.
Receiver is preserved pointer L_V (N)
PEER, this pointer is the best estimate of transmitter to the pointer L_V of receiver place (N) value.L_V (N)
PEERAnd the Frame between the L_V (S) comprises this retransmission queue.This queue stores the previous copy that sends Frame, receive NAK request to retransmit the possibility of one or more Frames with reply.
Mathematics on the serial number and logical calculated are with 4096 (promptly 2
12) implement for mould.Especially, defined and be greater than or less than operator.The scope of following serial number thinks to be greater than or less than data frame sequence number N:
N greater than serial number (N-2048) %4096 to (N-1) %4096
N less than serial number (N+1) %4096 to (N+2047) %4096
That is to say that the first half of circular buffer is defined as less than N; And circular buffer back half be defined as greater than N.Because receiver will abandon the received data of any serial number less than L_V (N), and because " less than " definition comprise the first half of this buffer, so transmitter can not be mentioned L_V (N) with the L_V (S) greater than 2048 serial numbers forever
PEERThe front.Suppose L_V (N)
PEERAccurately with the L_V (N) of receiver mapping (mirror), do like this and will transmitter-receiver will think less than L_V (N) and the Frame that abandons meaning transmitter.Because at L_V (N)
PEERAnd the Frame of transmitter storage comprises retransmission queue between the L_V (S), therefore retransmission queue is restricted to effectively half of potential buffer sizes, perhaps 2048 Frames.In fact, the restriction of the actual storage at transmitter place may be restricted to the retransmission queue size certain value less than 2048 Frames.
Under the bad channel status that produces quite a large amount of NAK, perhaps under the quite low data rate that allows frequent relatively padding data frame to send, the retransmission queue of 2048 elements just may be enough.Yet under the high data rate that may occur on the Packet Data Channel (PDCH), especially under good channel conditions, transmitter can stand queue stall condition, wherein sends 2048 Frames and also can not receive a NAK or fill up frame.For example, suppose the average data throughput of 1Mbps, the retransmission queue of 2048 elements will fill up:
≈2048*46*8/1Mbps＝754msec
This number is also littler under the peak value running status of 3Mbps on the FPDCH.In queue stall, transmitter can not send new data frame to receiver, up to receiver NAK, allows transmitter to shift to an earlier date L_V (N), and abandons previous some copy that sends Frame.Queue stall can force transmitter to abandon the Frame that enters, and allows more high-rise this error of protocol processes.This queue stall and new data abandon the best option of the application program that may not be requirement certain QoS proterties.
There are some kinds of methods to solve queue stall problem.For example, when the NAK of each loop parameter number is set to 1, and if round trip cycle (RTT)+delay detection window (DDW)+REXMIT_TIMER for the data rate of 1Mbps less than 754ms, queue stall can not take place.Even lower DDW and REXMIT_TIMER value also can require to support higher data rate.Yet low DDW value has the negative effect of introducing unnecessary NAK under rule ruuning situation, so it is not satisfied option.As another replacement scheme, receiver can use according to special-purpose implementation standard and avoid queue stall based on the scheme of implementation by not waiting for that complete NAK circulates.This solution is maked decision at the receiver place, and this receiver does not have any cognition to the buffering at transmitter place, therefore may cause incorrect decision under many situations.
According to the present invention, when retransmission queue during near active volume, transmitter can be by L_V (N) in advance
PEERPointer is avoided queue stall.In fact this abandoned (according to serial number) the earliest retransmitting data frame copy of storing in retransmission queue.If agreement allows, transmitter is with L_V (N) so
PEERThe new value of pointer offers receiver, thereby receiver can upgrade the value of its corresponding L_V (N) pointer.
In one embodiment, in frame-skipping (Skip Frame) transmitter with the L_V (N) that upgrades
PEERValue (is called L_V (N) herein
NEW) offer receiver.As the definition of carrying out herein, frame-skipping has the form that fills up frame, and its sequence number field comprises the serial number of new proposition L_V (N) pointer.The field of frame-skipping is as giving a definition:
| Field | Length (bit) |
| SEQ CTL SEQ_HI fills | 844 variablees |
SEQ-this field comprises minimum effective 8 bits of the L_V (N) of new proposition.
CTL-this field should be set to " 1111 ".This is identified as this frame and fills up frame type.
SEQ_HI-this field should comprise the highest effective 4 bits of the L_V (N) of new proposition.
Filling-filling bit.Come the remainder of infilled frame as requested.These bits should be set to " 0 ".
The queue stall of transmitter control of the present invention avoids solution requirement to carry out the Coordination Treatment of receiver according to receiving frame-skipping.Especially, according to the new value that proposes L_V (N) in the frame-skipping, receiver should be taked following action.At first, according to following equation, receiver extracts L_V (N) from frame-skipping
NEWValue:
L_V(N)
NEW＝{SEQ+[SEQ_HI*256]}
Then, the following process frames of data of receiver (wherein as mentioned above operator＜=, ,=be mould with-4096):
If L_V (N)
NEW＜=L_V (N) then abandons this frame-skipping.In this case, transmitter only abandons the retransmitting data frame that has been received in order by receiver, and sends it to higher protocol layer.
If L_V (N)
NEWL_V (N), then receiver transmits serial number less than L_V (N) to higher protocol layer
NEWAll Frames of receiving.Receiver also removes all less than L_V (N) from the NAK tabulation
NEWSerial number.Any Frame of losing all will be handled by the Error processing routine in the higher protocol layer (for example TCP) more.At last, receiver is set to L_V (N) with L_V (N)
NEWValue.
If L_V (N)
NEW〉=L_V (N), then receiver is set to L_V (N) with L_V (R)
NEWValue.
By this way, the copy of the previous Frame that sends is compared with keep, and transmitter can be provided with higher priority in the transmission of new data frame, requires the possibility that retransmits with reply.In many high data rate applications, need and require this ability, for example can tolerate some loss of data but the propagation delay of new data frame is required lower audio or video stream.The present invention can avoid controlling to the queue stall of transmitter terminal, is known in this queue resource of this transmitter terminal, and can carry out best optimization.
Although with reference to RLP transmitter and RLP receiver the present invention is had been described in detail herein, the present invention is not limited to this, and can be applied to expediently in any communication system that has fixed size buffers based on NAK.More generally,, it is evident that numerous modification, modification and other embodiment may be within broad range of the present invention herein although invention has been described about its special characteristic, aspect and embodiment.Therefore, all modification, modification and embodiment should be considered as within the scope of the present invention.Therefore all to should be understood in all respects be illustrative and nonrestrictive in the present invention, and all be intended to be contained in wherein in the implication and all changes within the equivalency range of claims.
Claims (24)
1. avoid the method that transmitter queue pauses in the transmitter for one kind, comprising:
Frame is sent to receiver continuously, and each described Frame all identifies with a serial number;
The copy of each Frame that sends is retained in the formation to be used for possible re-transmission, and up to receive a message from receiver, this message represents correctly to receive described Frame; With
In response to the approaching available capacity of queue of the number of the Frame copy that is kept, abandon the Frame copy of one or more described reservations.
2. according to the method for claim 1, comprise also to receiver sending a message this message represents to abandon the Frame copy of which described reservation.
3. according to the method for claim 1, also comprise in case receive the repeat requests that from described formation, abandons the Frame copy from described receiver, just send a message to described receiver, this message comprises the serial number of the Frame copy that keeps the earliest that does not abandon.
4. according to the method for claim 1, comprise also and preserve a pointer that this pointer comprises the serial number of the Frame copy of first reservation in the described formation.
5. according to the method for claim 4, also comprise when abandoning the frame copy of described one or more reservations, described pointer is carried previous serial number, and send the new value of described pointer to described receiver for each described frame that abandons.
6. be woven to described set of queues altogether according to the process of claim 1 wherein that serial number is the circular buffer of N frame, and wherein be that mould shifts to an earlier date described pointer with N.
7. according to the method for claim 5, wherein said available queue capacity is at most N/2.
8. transmitter comprises:
Be used to receive the input of the Frame that will send to receiver;
Be used for sending the transmitter of described Frame to described receiver;
Be used to store when described receiver receives the not memory of the Frame copy that sends of affirmative acknowledgement; With
Can operate and be used for abandoning the controller of the copy of one or more described transmission Frames when described copy during near the active volume of described memory.
9. transmitter according to Claim 8, wherein said controller also can be operated and be used for sending the indication that abandons which described copy to described receiver.
10. according to the transmitter of claim 9, wherein said controller is observed radio link protocol (RLP).
11. transmitter according to claim 10, wherein described memory set is woven to N element circular buffer, and wherein said controller is preserved a pointer, this indicator marker hold the starting point of the repeating transmission window of described transmission Frame copy, and be that mould shifts to an earlier date described pointer with N to each described discarding copy.
12. in a single day according to the transmitter of claim 11, wherein abandon described copy and shift to an earlier date described pointer, described controller just sends the new value of described pointer to described receiver.
13. the frame that a receiver/transmitter sends and send described frame to the more method of higher protocol layer comprises:
From the transmitter receiving data frames, each described frame all identifies with a serial number;
With receive, the continuous data frame sends described higher protocol layer to;
With receive, the non-continuous data frame is stored in the formation out of order; With
In case receive a message from described transmitter, this message comprises the serial number of flush, and expression abandons the institute's transmit frame copy that is used for retransmitting that one or more described transmitters keep, just will send described higher protocol layer to, and the starting point of described formation out of order will be reset to described flush sequence number up to the Frame of all receptions of described flush sequence number.
14., also comprise if the receiver storage buffer is full according to the method for claim 13, then increase progressively last expection serial number, receive new data frame creation space so that be from transmitter.
15. method according to claim 14, wherein in case receive a message from described transmitter, this message comprises the serial number of flush, and expression abandons the copy of the institute's transmit frame that is used for retransmitting of one or more described transmitters reservations, just will send described higher protocol layer to, and the starting point of described formation out of order will be reset to described flush sequence number up to the Frame of all receptions of described flush sequence number.
16. the method according to claim 13 also comprises:
Preserve a pointer, this indicator marker the starting point of described formation out of order; With
In case receive described message, just number replace described pointer value, and will send described higher protocol layer to up to all Frames in the formation described out of order of described flush sequence number with described flush sequence from described transmitter.
17. the method according to claim 16 also comprises:
In case receive the non-continuous data frame, just add the serial number of next at least sequence frames to the NAK tabulation.
18. according to the method for claim 17, wherein said transmitter and receiver is observed radio link protocol (RLP), the described pointer of the described formation starting point out of order of mark is L_V (N), and described flush sequence number is L_V (N)
NEW, and comprise:
Preserve the pointer L_V (R) of the described formation terminal point out of order of mark; With
In case receive from described transmitter and to comprise L_V (N)
NEWDescribed message,
If L_V (N)
NEW＜=L_V (N) then abandons described message,
If L_V (N)
NEWL_V (N), then transmit serial number less than L_V (N) to described higher protocol layer
NEWAll Frames, from described NAK tabulation, remove all less than L_V (N)
NEWSerial number, and L_V (N) is set to L_V (N)
NEWValue; With
If L_V (N)
NEW〉=L_V (N) then is set to L_V (N) with L_V (R)
NEWValue.
19. a receiver comprises:
Be used for from the receiver of transmitter receiving data frames, each described Frame all has a serial number;
Be used for transmitting the output of the Frame that is received to higher protocol layer;
Be used to be stored in the non-continuous data frame of before described higher protocol layer transmits, receiving, the reception of mediate continuous data frame co-pending; With
Controller can be operated and is used for just transmitting described non-continuous data frame to described higher protocol layer in case receive the message of the mediate continuous data frame copy that being used for of having abandoned that described transmitter keeps may retransmit from described receiver.
20., wherein comprise the serial number of the last mediate alphabetic data frame that described transmitter abandons from the described message of described transmitter according to the receiver of claim 19.
21. receiver according to claim 20, wherein described memory set is woven to N element circular buffer, described controller is preserved a pointer, this indicator marker hold the starting point of window out of order of the non-continuous data frame of described reception, and wherein by upgrade the value of described pointer from the described message of described transmitter.
22. a wireless communication system comprises:
Receiver receives the continuous data frame, and the described Frame that do not receive in order of request retransmission;
Transmitter, sequentially send described Frame to described receiver, and has storage memory of the Frame copy that sends of affirmative acknowledgement not when receiver receives, when described copy during near the active volume of described memory, described transmitter abandons one or more described copies that send Frame, and sends the indication that abandons which described copy to described receiver.
23. according to the system of claim 22, wherein said transmitter and receiver is controlled according to the negative response window and is moved.
24. according to the system of claim 23, wherein said transmitter and receiver is radio link protocol (RLP) peer-to-peer.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US54273104P | 2004-02-06 | 2004-02-06 | |
| US60/542731 | 2004-02-06 | ||
| US11/026000 | 2004-12-31 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101371484A true CN101371484A (en) | 2009-02-18 |
Family
ID=40414060
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2005800041528A Pending CN101371484A (en) | 2004-02-06 | 2005-01-28 | System and method for transmitting and receiving data frames in a NAK-based window protocol |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101371484A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102571567A (en) * | 2010-12-17 | 2012-07-11 | 微软公司 | Non-greedy consumption by execution blocks in dataflow networks |
| CN105657472A (en) * | 2014-11-14 | 2016-06-08 | 北京四达时代软件技术股份有限公司 | Audience rating data processing method and device |
-
2005
- 2005-01-28 CN CNA2005800041528A patent/CN101371484A/en active Pending
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102571567A (en) * | 2010-12-17 | 2012-07-11 | 微软公司 | Non-greedy consumption by execution blocks in dataflow networks |
| US8799378B2 (en) | 2010-12-17 | 2014-08-05 | Microsoft Corporation | Non-greedy consumption by execution blocks in dataflow networks |
| CN102571567B (en) * | 2010-12-17 | 2015-09-23 | 微软技术许可有限责任公司 | For the method and system of processing messages in a computing environment |
| CN105657472A (en) * | 2014-11-14 | 2016-06-08 | 北京四达时代软件技术股份有限公司 | Audience rating data processing method and device |
| CN105657472B (en) * | 2014-11-14 | 2018-09-18 | 北京四达时代软件技术股份有限公司 | Audience rating data treating method and apparatus |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10298350B2 (en) | Radio telecommunications system and method of operating the same with polling | |
| KR100397962B1 (en) | Data transmission over a communications link with variable transmission rates | |
| JP4437128B2 (en) | Method and apparatus for processing control PDU upon re-establishment of receiver in wireless communication system | |
| JP5238036B2 (en) | Limiting RLC window size in HSDPA flow control | |
| US20060203760A1 (en) | Base station device and transmission method | |
| EP1808975B1 (en) | Method and apparatus for a selective acknowledgement scheme | |
| JP2007523537A (en) | System and method for data frame transmission / reception by NAK-based window protocol | |
| JP2003283596A (en) | System and method for avoiding stall using timer for high-speed downlink packet access system | |
| WO2005122441A1 (en) | Transmitting and receiving control protocol data unit having processing time information | |
| JP2008005491A (en) | Method and apparatus for handling uplink data upon handover in wireless communications system | |
| US7573883B2 (en) | System, method and operator for increasing the active window size in a NAK-based window protocol | |
| KR100684319B1 (en) | ARQ control method for using wireless source effectively and apparatus thereof | |
| CN101371484A (en) | System and method for transmitting and receiving data frames in a NAK-based window protocol | |
| CN111654360B (en) | Non-active state switching processing method and communication equipment | |
| JP3802363B2 (en) | Method and apparatus for reducing delay time in distributing data | |
| KR100755269B1 (en) | Method and apparatus for driving retransmission timer in mobilecommunication system using radio link protocol | |
| US20240121658A1 (en) | Data transmission method and apparatus, device, and storage medium | |
| EP4340314A1 (en) | Data transmission method and apparatus, device, and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20090218 |