WO1999009698A1 - A multi-channel automatic retransmission query (arq) method - Google Patents

A multi-channel automatic retransmission query (arq) method Download PDF

Info

Publication number
WO1999009698A1
WO1999009698A1 PCT/SE1998/001415 SE9801415W WO9909698A1 WO 1999009698 A1 WO1999009698 A1 WO 1999009698A1 SE 9801415 W SE9801415 W SE 9801415W WO 9909698 A1 WO9909698 A1 WO 9909698A1
Authority
WO
WIPO (PCT)
Prior art keywords
data packets
multiplexing
channels
over
source
Prior art date
Application number
PCT/SE1998/001415
Other languages
French (fr)
Inventor
Jacobus Cornelis Haartsen
Original Assignee
Telefonaktiebolaget Lm Ericsson (Publ)
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Telefonaktiebolaget Lm Ericsson (Publ) filed Critical Telefonaktiebolaget Lm Ericsson (Publ)
Priority to KR1020007001639A priority Critical patent/KR20010023029A/en
Priority to EEP200000108A priority patent/EE200000108A/en
Priority to EP98935453A priority patent/EP1005732B1/en
Priority to AU84699/98A priority patent/AU747369B2/en
Priority to BR9811240-6A priority patent/BR9811240A/en
Priority to JP2000510243A priority patent/JP4146079B2/en
Publication of WO1999009698A1 publication Critical patent/WO1999009698A1/en
Priority to HK01102584A priority patent/HK1031962A1/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867—Arrangements specially adapted for the transmitter end
    • H04L1/1887—Scheduling and prioritising arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1822—Automatic repetition systems, e.g. Van Duuren systems involving configuration of automatic repeat request [ARQ] with parallel processes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/14—Channel dividing arrangements, i.e. in which a single bit stream is divided between several baseband channels and reassembled at the receiver
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1803—Stop-and-wait protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L2001/0092—Error control systems characterised by the topology of the transmission link
    • H04L2001/0096—Channel splitting in point-to-point links

Definitions

  • This invention relates to the field of data communications, more particularly, to improving data throughput in a data communication network.
  • Some communication networks use packet-switched communication links in which the user information is packetized, and the packets are individually sent as data burst from a source to a destination.
  • packet-switched networks the data throughput is expressed in terms of the number of data packets per unit of time. Since the links are not perfect, especially when wireless links are used, the error rate requirement is not easily met unless some type of error correction mechanism is introduced, for correcting errors while data is being communicated over the network.
  • Error correction schemes can be divided into two classes: a forward-error-correction (FEC) method, and a retransmission method.
  • FEC forward-error-correction
  • retransmission method extra check bits are added to the data packets at the source so that the destination can check the data packets for errors. If the destination detects an error, it will automatically request for a retransmission of the data packet.
  • ARQ Automatic Retransmit Query
  • the data traffic over a switched packet network is carried out in data bursts. Communication errors often arrive in bursts as well. Therefore, it is more efficient to apply a ARQ method, which requires occasional retransmissions, than to apply FEC coding, which adds a constant overhead irrespective of whether there are communication errors or not. A slight amount of FEC coding is always advantageous to avoid retransmissions of data packets that have very few errors. Accordingly, the use of an ARQ method, preferably, with little FEC, is necessary in order to produce a low residual error rate in a high data throughput network .
  • ARQ methods A number of ARQ methods is known.
  • the ARQ methods may be divided into a numbered ARQ method and an unnumbered ARQ method.
  • each data packet is assigned a packet number that allows the destination to specify which data packets have arrived successfully and which have arrived erroneously. In this way, the data packets do not have to arrive at the destination in the order of transmission from the source.
  • the packet-switched networks transfer consecutive packets along different paths having different delays. Therefore, the data packets may arrive out of sequence. By using the packet numbers of the numbered ARQ method, the data packets can be reordered at the destination in proper sequence .
  • a well-known unnumbered ARQ method is a stop-and-wait ARQ method in which the source stops and waits until a transmitted data packet is acknowledged. For each data packet, a positive acknowledgement (ACK) must be received from the destination, before a subsequent data packet can be transmitted from the source. If a negative acknowledgement (NAK) is received from the destination, however, the source retransmits the same data packet again.
  • ACK positive acknowledgement
  • NAK negative acknowledgement
  • the source will automatically retransmit the same data packet after a timeout period.
  • the delay between the data packet transmission and the arrival of the acknowledgement information is known as a round-trip delay.
  • the round-trip delay determines the data throughput of the network. The longer the round-trip delay, the longer the source has to wait before it can transmit a new data packet or retransmit a NAKed data packet.
  • the data throughput on the communication link is inversely proportional to the round-trip delay between the source and destination. Because during the wait periods, the source is idle and no transmission takes place, in order to maintain a high data throughput, the stop-and- wait ARQ methods are generally used in networks with short round-trip delays.
  • FIG. 1 shows an exemplary timing diagram of a data packet transfer that uses a conventional stop-and-wait ARQ method.
  • a sequence of five (5) data packets are transmitted from a source 12 to a destination 14.
  • the data packet are shown by numbers 1 to 5 for illustration purpose only. In practice, however, no number is assigned to the data packets.
  • the round trip delay between a packet and its response is shown by T d .
  • the destination 14 transmits a NAK to the source. For example, an erroneously transmitted 3rd data packet, shown by number 3 in FIG. 1, is retransmitted from the source 12 during the next transmission based on a NAK received from the destination 14.
  • the stop-and-wait ARQ method makes efficient use of the communication resource by allowing for sharing of communication resources among users during idle times. Moreover, the data packets arrive at the destination 14 in the order of transmission from the source 12. Thus, under the stop-and-wait ARQ method, there is no need for numbering and reordering of the data packets, which significantly reduces communication overhead.
  • the stop-and-wait ARQ method provides a high overall data throughput. Because of acknowledgment requirement, however, the data throughput per user may be low under the stop-and-wait ARQ method. Although attractive because of its simplicity and resource efficiency, the stop-and-wait ARQ method is less attractive in high-speed networks, especially when the round-trip delay increases .
  • a well-known numbered ARQ method is go-back-N ARQ method in which each data packet is numbered.
  • the source uses a rotating N-element buffer containing N data packets, for example, packets k to k+N. The ⁇ packets of the buffer are subsequently transmitted. When the source is back at frame k, the source determines whether the corresponding data packet has been acknowledged. If so, the source transmits frame k+N+1 .
  • the source transmits the entire buffer contents, including frames k to k+N again.
  • the buffer length (or the repetition period of the retransmissions) spans over a longer time period than the longest round-trip delay.
  • the go-back- ⁇ ARQ method provides a higher throughput per user since the source does not have to wait for an acknowledgement before it can transmit the next data packet .
  • the go-back- ⁇ ARQ scheme is less efficient from a shared resource point of view, since a single data packet failure results in the retransmission of all data packets in the buffer.
  • the destination stores all successfully received data packets, and acknowledges the highest packet number of the data packets received in sequence. This allows the destination to jump over a number of data packets in a rotating buffer if they correspond to data packets with a lower number than the highest packet number the destination indicates.
  • data packets that have been successfully received once but failed during a retransmission do not have to be retransmitted again.
  • the cumulative method does not prevent the retransmission of successfully received data packets.
  • the buffer lengths in both of these methods depend on the round-trip delay. As in the stop-and-wait ARQ method, the data throughput decreases, when the round-trip delay increases, but only in an error prone environment. Under error free conditions, optimal throughput is obtained.
  • the most efficient ARQ scheme both with respect to throughput per user and shared resource efficiency is a selective repeat ARQ method.
  • the destination specifies in the acknowledgement exactly which data packet has to be retransmitted. In this way, only failed packets are retransmitted, and no packet transmission is delayed due to a retransmission.
  • the packet numbers are used both for retransmission requests and for the ordering of out-of-sequence data packets.
  • the data throughput is independent of the round-trip delay, and can reach the theoretical limit of what can be achieved with a retransmission method, that is a data throughput of 1-FER, where FER is Frame Error Rate or Packet Error Rate.
  • the selective repeat ARQ method requires extensive storage capability and packet handling at both the source and the destination.
  • Some communication networks transfer data packets in parallel . These networks subdivide the communication link into a number of subchannels for parallel transmission of data packets. In order to guarantee proper ordering of data packets arriving from various subchannels, most conventional networks employ the numbered ARQ method.
  • One conventional network uses the unnumbered ARQ method for transfer of data packets in parallel. This network, which is used by ARPANET and is described by D. Bertsekas and R. Gallager, "Data Networks , " 2nd Edition, Prentice Hall International, Inc., London, 1992, applies independent stop-and-wait ARQ methods on eight (virtual) channels in parallel.
  • the data packets are multiplexed over the channels according to availability to transmit a new data packet on the channels.
  • Each data packet contains a virtual channel number identifying the channel on which the data packet is transmitted.
  • the data packets can be transmitted out of order, because the stop- and-wait ARQ method on the separate channels are independent of each other. In other words, retransmissions on one channel will not affect the other channels, but will result in data packets arriving at the destination out of order.
  • packet numbers at higher protocol layers as required to provide enabling instructions to the destination to properly, reorder the data packets. This method, therefore, requires complicated data-packet reordering overhead, which must be implemented in higher protocol layers . Therefore, there exists a need for a data communication network with high data throughput which is simple to implement and does not retransmit successfully received data packets unnecessarily. Summary
  • the present invention is exemplified in a communication network that uses a multi-channel automatic retransmission query (ARQ) for communicating data packets from a source to a destination over a communication link that is subdivided into a number of channels.
  • ARQ automatic retransmission query
  • the network sequentially multiplexes the data packets at the source over corresponding channels during multiplexing rounds.
  • the invention then applies a stop-and wait ARQ method on each one of the channels and determines whether the destination has positively acknowledged a previously transmitted data packet. If not, the network retransmits only the data packets that are not positively acknowledged, after being transmitted during a previous multiplexing round.
  • the network of the invention multiplexes the data packets during successive multiplexing rounds, when the data packets are sequentially transmitted on all of the channels.
  • the network halts the multiplexing of new data packets at the source during a subsequent multiplexing round until the destination positively acknowledges successful reception of a data packet that was transmitted over a corresponding channel during the previous multiplexing round.
  • the network only retransmits previously transmitted data packets that are not positively acknowledged.
  • the source may retransmit the data packets if no acknowledgement is received from the destination after a predefined time-out period.
  • the network sequentially de-multiplexes the data packets over the channels and halts the de-multiplexing of new data packets over all other channels, if a new data packet is not received over a channel.
  • the network buffers the data packets before transmissions over corresponding channels.
  • the network includes source FIFO buffers with predefined lengths for buffering the data packets over the channels in a FIFO manner.
  • the source halts the transmission of the data packets, when the source FIFO buffer is full.
  • the destination includes a destination FIFO buffer for sequentially buffering received data packets over the channels in a FIFO manner. Similar to the source FIFO buffer, the destination FIFO buffer has a predefined length. Under this arrangement, the demultiplexing of the data packets is halted when the destination FIFO buffer is empty.
  • the source includes a multiplexer for multiplexing the data packets on the channels in a rotating manner and the destination includes a de-multiplexer for similarly de-multiplexing the data packets.
  • the multiplexer halts the multiplexing of the data packets, when the transmissions of the data packets are halted and, the demultiplexer halts the de-multiplexing of the data packets, when the reception of the data packets are halted.
  • data packets are pseudo-randomly transmitted over a predetermined number of physical channels, such as radio frequency channels.
  • the destination determines whether a received data packet is a new data packet or not . In response, the destination transmits a positive acknowledgment to the source if a data packet is successfully received over a communication channel, and it transmits a negative acknowledgment to the source if a data packet is not received successfully.
  • FIG. 1 is a timing diagram of a data packet transfer according to a conventional stop-and-wait ARQ method.
  • FIG. 2 is a timing diagram of a data packet transfer according to the present invention.
  • FIG. 3 is a block diagram implementing a multi-channel ARQ method according to one embodiment of the present invention.
  • FIG. 4 is a block diagram implementing a multi-channel ARQ method according to another embodiment of the present invention.
  • FIG. 5 (a) and 5(b) are diagrams showing two exemplary operation of the multi-channel ARQ method of the embodiment of FIG. 4.
  • FIG. 6 is a block diagram implementing multi-channel ARQ method according to yet another embodiment of the present invention.
  • a multi-channel ARQ method subdivides each round trip delay into a number of time slots. As shown, the roundtrip delay T d is divided into six time slots designated as ARQ Channels A-F. In a Time Division Multiplex (TDM) manner, each time slot is used as a virtual channel on a communication link assigned to a user. These channels are used for parallel transfer of data packets between a source 16 and a destination 18. At the source 16, the data packets are sequentially multiplexed over the ARQ Channels A-F and transmitted to the destination 18.
  • the multi-channel ARQ method of the invention applies a stop-and-wait ARQ method on each one of the ARQ Channels A-F.
  • the source 16 sequentially transmits data packets in multiplexing rounds, starting with the first ARQ Channel A and ending with the last ARQ Channel F. Therefore, at the end of each multiplexing round the data packets are sequentially multiplexed over all of the ARQ Channels A-F.
  • the source waits to receive an acknowledgement from the destination 18 before transmitting a new data packet over the same ARQ Channel.
  • the subsequent round if a data packet transmitted on a ARQ Channel during a previous round is negatively acknowledged, i.e.
  • the source 16 halts multiplexing of the data packets and retransmits the NAKed data packet on its corresponding ARQ Channel, before transmitting any subsequent data packet on that ARQ Channel again.
  • the source 16 continues to retransmit only NAKed data packets, if any, on other ARQ Channels until corresponding data packet (s) is (are) positively acknowledged.
  • the received data packets are sequentially de-multiplexed.
  • the destination 18 halts the de-multiplexing of the received data packets, if it does not receive a new data packet on a particular ARQ Channel. As shown in FIG. 2, a first data packet is transmitted on the ARQ Channel A.
  • a second, third, and subsequent data packets are transmitted on ARQ Channels B-F, respectively.
  • These data packets are shown by numbers 1-6, for illustration purpose only.
  • the cumulative duration of the ARQ Channels i.e., the minimum repetition period of a round, is selected so that sufficient time is allowed for reception of positive acknowledgments (ACKs) or negative acknowledgments (NAKs) from the destination, before another data packet is transmitted during a second round.
  • FIG. 2 shows that a fourth data packet (shown by number 4) transmitted on ARQ Channel D to be NAKed.
  • the source 16 Before transmitting a new data packet on ARQ Channel D during the second round, the source 16, which had continued on to transmit data packets on ARQ Channels E, F, etc., during the first round, retransmits the fourth data packet again on channel D during the second round. If the data packets transmitted on Channels E, F, A, B, C during the first round are all ACKed, as is the case in this example, the source 16 only retransmits the NAKed fourth data packet and stops transmission of new data packets on subsequent ARQ Channels during the second round, until an ACK is received for the fourth data packet. Accordingly, contrary to conventional methods, the previously ACKed data packets are not retransmitted unnecessarily.
  • the source 16 remains idle until it reaches ARQ Channel D during a subsequent third round. If during the third round, an ACK is received in response to the retransmission of the fourth packet, then a new data packet, i.e., a 10th data packet, is transmitted on ARQ Channel D. Provided that previously transmitted data packets on the ARQ Channels have all been ACKed, new data packets are transmitted on subsequent ARQ Channels E through F.
  • the destination 18 At the destination 18 the first through third data packets are received and demultiplexed successfully during the first round. However, because of the NAKed fourth data packet, the destination 18 halts the de-multiplexing operation to maintain order in the sequence of the received data packets. Once the fourth data packet is positively acknowledged, the destination 18 resumes the de-multiplexing of the 4th through 9th data packets, which were all received correctly. When it reaches the 10th NAKed data packet, it halts the de-multiplexing operation again until it can positively acknowledge this data packet. Once acknowledged, the destination resumes its de-multiplexing operation. The same process continues for the NAKed 12th data packet until all the received data are positively acknowledged.
  • the multiplexer at the source and the de- multiplexer at the destination operate independently and are not synchronized.
  • acknowledgement errors arise during data packet transfers An acknowledgement error arises when a data packet has been successfully received at the destination 18, however, the associated ACK is not received successfully at the source 16.
  • the source 16 retransmits the same packet again. In this situation, the destination 18 must be able to distinguish between the retransmission of an old data packet and a new data packet .
  • the present invention assigns a sequence number to each data packet.
  • the sequence number may be a single bit which is toggled from one binary state to another for each new data packet .
  • the destination 18 determines whether a new or an old data packet is received from the source 16. New data packets always have alternating sequence numbers. Otherwise, if the same sequence number is encountered for adjacent data packets, the destination 18 acknowledges the reception of the last data packet but ignores its content.
  • FIG. 3 a simplified block diagram of the implementation of a multi-channel ARQ method according to FIG. 2 is shown.
  • a data packetizer 20 packetizes input data according to a predefined protocol.
  • a multiplexer 22 routes the data packets sequentially over the ARQ Channels A-F in a rotating manner.
  • single-element buffers 24 store data packets provided by the multiplexer 22 for transmission on a corresponding ARQ Channel .
  • the multiplexer 22 After placing a data packet in a buffer 24 of the last ARQ Channel of each round, i.e., ARQ Channel F, the multiplexer 22 places a subsequent data packet in the buffer of the first ARQ Channel, i.e., ARQ Channel A, during a subsequent round, provided that a previously transmitted data packet on the first ARQ Channel is positively acknowledged.
  • the corresponding buffer 24 For each ARQ Channel, the corresponding buffer 24 indicates an empty condition each time an ACK is received based on a successful reception of a data packet at the destination 18. Otherwise, the corresponding buffer 24 indicates a full condition.
  • each ARQ Channel For as long as a buffer 24 of a particular ARQ Channel indicates an empty condition, the multiplexer 22 continues to load a new data packet in that buffer and moves onto the next ARQ- channel . If a buffer 24 is not empty when the multiplexer 22 arrives at the buffer's corresponding ARQ Channel, it stops its multiplexing operation during that round. During the round, the source 16 only retransmits NAKed data packets on subsequent ARQ Channels. At that time, no new data packets are loaded into the buffers 24 until the non-empty buffer that stopped the multiplexing operation indicates an empty condition, which is resulted when a previously transmitted data packet is positively acknowledged.
  • a de-multiplexer 26 operating in a rotating fashion sequentially reads the received data packets over the ARQ Channels A-F. Similar to the multiplexer 22 at the source 16, if the de-multiplexer 26 arrives at an ARQ Channel with no new received data packet, it stops its de-multiplexing operation until a successful data packet is received. Only after the arrival of a new data packet, the de-multiplexer 26 advances to demultiplex on the subsequent ARQ Channels.
  • the operation of the multiplexer 22 and de-multiplexer 26 according to the invention which halt their respective multiplexing and demultiplexing operation when ARQ Channel cannot accept or provide new data packets, assures proper ordering of the received data packets at the destination 18.
  • the repetition period of the multiplexer 22 is selected to be longer than the round-trip delay, to avoid idle times at the source 16.
  • the buffers 24 at the ARQ Channels A-F of the multi-channel ARQ method of the invention can be considered as the elements of a circular buffer that is used in a conventional cumulative go-back-N ARQ implementation, the present invention provides similar data per user throughput as that provided by the cumulative method, without the numbering or overhead thereof, while avoiding unnecessary retransmissions of successfully received data packets.
  • another embodiment of the present invention improves the performance of the multichannel ARQ method by using multi-element buffers 28 and 29 at the source 16 and the destination 18.
  • multielement source and destination buffers 28 and 29 are positioned at the transmission and reception path of the ARQ Channels A-F, respectively.
  • the source and destination buffers 28 and 29 are first-in-first-out (FIFO) buffers.
  • a data packet may be retransmitted from the source 16 on an ARQ Channel, while the multiplexer 22 loads data packets into other source FIFO buffers 28, provided that a corresponding FIFO buffer 28 is not full.
  • Consecutive packets are distributed among the FIFO, i.e., packet k is placed in the first FIFO, packet k+1 in the second FIFO, etc. After the last FIFO, the multiplexer returns to the first FIFO.
  • the multiplexer 22 stops multiplexing until a transmitted data packet at the end of the full source FIFO buffer is ACKed. Once ACKed, the multiplexer 22 inputs a subsequent data packet into the source FIFO buffer 28.
  • the destination FIFO buffers 29 operate to allow for orderly reception of the data packets transmitted from the source FIFO buffers 28. Only new data packets are buffered in the destination FIFO buffers 29. This is true even when a data packet is successfully received, however, is retransmitted due to an a acknowledgement error. In this case, the reception is acknowledged, but the data packet is not stored in the destination FIFO.
  • the de-multiplexer 26 advances its demultiplexing operation for as long as a destination FIFO buffer 29 is not empty. When an empty FIFO buffer 20 is encountered, the de-multiplexer 26 stops its de-multiplexing operation on a corresponding ARQ Channel until the arrival of a new data packet over that ARQ Channel.
  • FIGs. 5(a) and 5(b) show exemplary operations of the method of the invention under the embodiment of FIG. 4.
  • a system with 6 parallel ARQ channels and with 3 -element source and destination buffers is shown. It is assumed that the source can load the source FIFOs at a much higher rate than the packets can be transferred over the channels A to F.
  • FIG. 5(a) shows the begin conditions.
  • the multiplexer 22 has distributed packets 1 to 18 over the source FIFOs in a manner as shown in FIG. 5(a) . Next, the packets are transmitted independently over the six physical channels.
  • packet 22 cannot be placed in the proper source buffer (the buffer corresponding to channel D) since this source buffer is full . This is because packet 4 has not been received successfully on channel D and therefore it has not been acknowledged yet. Both the multiplexer 22 and the de- multiplexer 26 have halted at channel D since the source FIFO buffer 28 is full and the destination buffer 29 is empty. Only when the fourth packet is received correctly can the de-multiplexer move forward, whereas only when the acknowledgement of this success has been received by the source can the multiplexer 22 move forward. The transmissions and retransmissions on other channels, however, can continue for as long as their corresponding source FIFO buffers 28 are not empty.
  • a data throughput comparable to that of go-back-N algorithms may be obtained without applying numbering and extra packet overhead, except for handling acknowledgment errors based on the sequence numbers.
  • sufficiently large FIFO buffers 28 and 29 can increase the data throughput to the theoretical limit, making the methods as efficient as the selective repeat ARQ method.
  • each ARQ Channel in the multi-channel ARQ method of the invention should, on average, have an equal error behavior. If retransmissions occur much more frequently on one ARQ Channel than on another, the former ARQ Channel could limit the overall data throughput of the network. Under this situation, it is more advantageous to distribute the data packets over different physical channels, that is, an ARQ channel does not constantly use the same physical channel. If a single physical channel is bad, a single retransmission on a different channel may result in successful reception of a data packet. In contrast, when each data packet is bit- interleaved over multiple physical channels, each packet would be affected by the bad channel, and only a FEC method would help to overcome the transmission errors.
  • the average data throughput performance should be the same in order to achieve an optimal overall data throughput performance.
  • the communication link consists of discrete physical channels, for example, radio frequency (RF) links consisting of a predefined number of parallel Frequency-Division multiplex (FDM) channels.
  • RF radio frequency
  • FDM Frequency-Division multiplex
  • the RF link may be deteriorated at one or more portions of the frequency spectrum, due to such factors as multi-path fading, or narrowband interference. Accordingly, not all the physical channels may have the same average quality.
  • the ARQ Channels of the invention should be distributed over the physical FDM channels, for example, by applying well known spreading and despreading operations, such as frequency hopping.
  • FIG. 6 one such network is shown where the ARQ channels are spread by a spreader 32 at the source 16 and de-spread by a de-spreader 34 at the destination 18.
  • a synchronization block 36 synchronizes the spreading and de-spreading operations, to achieve an equal error performance on all physical channels.
  • MUX/FIFO and DE-MUX/FIFO blocks 38 and 40 correspond to a multiplexer/demultiplexer 22 and 26 and FIFO buffers 28 and 29 shown in FIG. 4.
  • the available physical channels consist of six FDM channels.
  • the network can use four ARQ Channels A-D in parallel.
  • the source 16 and destination 18 pseudo-randomly assign one of the six physical channels to support one of the four ARQ Channels A- D.
  • the six physical channels are different from each other; that is, they are orthogonal and no collisions between packets on different ARQ Channels would occur.
  • the return channels carrying positive and negative acknowledgement are not shown.
  • the present invention is equally applicable to a full-duplex link.
  • the present invention may be extended to cover a full-duplex communication link.
  • positive or negative acknowledgements are usually piggybacked in the data packets in both directions. Therefore, explicit ACK/NAK transmissions may not be required. From the forgoing description it would be appreciated that the present invention provides a high data throughput ARQ method that is unnumbered, thus, simple to implement and does not retransmit successfully received data packets unnecessarily.
  • the unnumbered ARQ method of the invention transmits the data packets in parallel, without requiring substantial packet ordering overhead.
  • the present invention can provide a data throughput approaching the theoretical limit, regardless of the round-trip delays.

Abstract

A multi-channel Automatic Retransmission Query (ARQ) method transmits data packets from a source to a destination over a communication link that is subdivided into a number of channels. A network using the multi-channel ARQ method sequentially multiplexes the data packets at the source and transmits them over corresponding channels. The network applies a stop-and-wait ARQ method on each one of the channels and determines whether the destination has positively acknowledged a previously transmitted data packet. If not, the network retransmits only the data packets that are not positively acknowledged.

Description

A MULTI-CHANNEL AUTOMATIC RETRANSMISSION QUERY (ARQ) METHOD
Field of Invention
This invention relates to the field of data communications, more particularly, to improving data throughput in a data communication network.
Background
Today's information age has experienced a tre- mendous growth in the volume of data communicated over various networks. For example, enormous amounts of data are transferred every day between computers connected by data networks like intra-nets, internet, local area nets, wide area nets, etc. The speed by which these data are communicated, i.e., data throughput, is an important consideration in a data network. Of course, the network's data throughput is proportional to the amount of communication resources allocated for communicating data, with more allocated resources resulting in a higher data throughput. Since the communication resources are scarce, many networks share these resources among many users .
Another important consideration is a network's overall communication error rate, with some networks requiring residual error rates of less than 10"16. Some communication networks use packet-switched communication links in which the user information is packetized, and the packets are individually sent as data burst from a source to a destination. In packet-switched networks, the data throughput is expressed in terms of the number of data packets per unit of time. Since the links are not perfect, especially when wireless links are used, the error rate requirement is not easily met unless some type of error correction mechanism is introduced, for correcting errors while data is being communicated over the network.
Error correction schemes can be divided into two classes: a forward-error-correction (FEC) method, and a retransmission method. In the FEC method, extra coding bits are added at the source to increase the redundancy in the information. This extra redundancy will enable the destination to correct errors. In the retransmission method, extra check bits are added to the data packets at the source so that the destination can check the data packets for errors. If the destination detects an error, it will automatically request for a retransmission of the data packet. This type of retransmission method is known as Automatic Retransmit Query (ARQ) method.
The data traffic over a switched packet network is carried out in data bursts. Communication errors often arrive in bursts as well. Therefore, it is more efficient to apply a ARQ method, which requires occasional retransmissions, than to apply FEC coding, which adds a constant overhead irrespective of whether there are communication errors or not. A slight amount of FEC coding is always advantageous to avoid retransmissions of data packets that have very few errors. Accordingly, the use of an ARQ method, preferably, with little FEC, is necessary in order to produce a low residual error rate in a high data throughput network .
A number of ARQ methods is known. In general, the ARQ methods may be divided into a numbered ARQ method and an unnumbered ARQ method. In the numbered ARQ method, each data packet is assigned a packet number that allows the destination to specify which data packets have arrived successfully and which have arrived erroneously. In this way, the data packets do not have to arrive at the destination in the order of transmission from the source. As is well known, the packet-switched networks transfer consecutive packets along different paths having different delays. Therefore, the data packets may arrive out of sequence. By using the packet numbers of the numbered ARQ method, the data packets can be reordered at the destination in proper sequence .
In the unnumbered ARQ method, packets do not carry a packet number. Therefore, the unnumbered ARQ method requires less overhead and, thus, is less complex to implement. In order to avoid out-of-order arrival of data packets, however, the data packets must be communicated in an orderly manner. A well-known unnumbered ARQ method is a stop-and-wait ARQ method in which the source stops and waits until a transmitted data packet is acknowledged. For each data packet, a positive acknowledgement (ACK) must be received from the destination, before a subsequent data packet can be transmitted from the source. If a negative acknowledgement (NAK) is received from the destination, however, the source retransmits the same data packet again. If no acknowledgement is received, the source will automatically retransmit the same data packet after a timeout period. The delay between the data packet transmission and the arrival of the acknowledgement information is known as a round-trip delay. The round-trip delay determines the data throughput of the network. The longer the round-trip delay, the longer the source has to wait before it can transmit a new data packet or retransmit a NAKed data packet.
Accordingly, the data throughput on the communication link is inversely proportional to the round-trip delay between the source and destination. Because during the wait periods, the source is idle and no transmission takes place, in order to maintain a high data throughput, the stop-and- wait ARQ methods are generally used in networks with short round-trip delays.
FIG. 1 shows an exemplary timing diagram of a data packet transfer that uses a conventional stop-and-wait ARQ method. As shown, a sequence of five (5) data packets are transmitted from a source 12 to a destination 14. The data packet are shown by numbers 1 to 5 for illustration purpose only. In practice, however, no number is assigned to the data packets. The round trip delay between a packet and its response is shown by Td. If a data packet is not received successfully, the destination 14 transmits a NAK to the source. For example, an erroneously transmitted 3rd data packet, shown by number 3 in FIG. 1, is retransmitted from the source 12 during the next transmission based on a NAK received from the destination 14. Assuming that there are no errors in the returned acknowledgement information, only data packets that have failed during a transmission are retransmitted. Accordingly, the stop-and-wait ARQ method makes efficient use of the communication resource by allowing for sharing of communication resources among users during idle times. Moreover, the data packets arrive at the destination 14 in the order of transmission from the source 12. Thus, under the stop-and-wait ARQ method, there is no need for numbering and reordering of the data packets, which significantly reduces communication overhead.
As described above, if the available communication resource are efficiently allocated, the stop-and-wait ARQ method provides a high overall data throughput. Because of acknowledgment requirement, however, the data throughput per user may be low under the stop-and-wait ARQ method. Although attractive because of its simplicity and resource efficiency, the stop-and-wait ARQ method is less attractive in high-speed networks, especially when the round-trip delay increases .
In order to provide high per user data throughput , most modern data links use the numbered ARQ method. Under this method, a higher data throughput is resulted because of the ability to communicate new data packets before preceding data packets are acknowledged. A well-known numbered ARQ method is go-back-N ARQ method in which each data packet is numbered. In the conventional go-back-N ARQ method, the source uses a rotating N-element buffer containing N data packets, for example, packets k to k+N. The Ν packets of the buffer are subsequently transmitted. When the source is back at frame k, the source determines whether the corresponding data packet has been acknowledged. If so, the source transmits frame k+N+1 . If not, the source transmits the entire buffer contents, including frames k to k+N again. For optimal performance, the buffer length (or the repetition period of the retransmissions) spans over a longer time period than the longest round-trip delay. The go-back-Ν ARQ method provides a higher throughput per user since the source does not have to wait for an acknowledgement before it can transmit the next data packet . However, the go-back-Ν ARQ scheme is less efficient from a shared resource point of view, since a single data packet failure results in the retransmission of all data packets in the buffer.
Better performance is obtained with a cumulative go-back-Ν ARQ method, which is a modified version of the ordinary go-back-Ν method. In the cumulative method, the destination stores all successfully received data packets, and acknowledges the highest packet number of the data packets received in sequence. This allows the destination to jump over a number of data packets in a rotating buffer if they correspond to data packets with a lower number than the highest packet number the destination indicates. In addition, data packets that have been successfully received once but failed during a retransmission, do not have to be retransmitted again. Although less so than ordinary go- back-N ARQ method, the cumulative method does not prevent the retransmission of successfully received data packets. The buffer lengths in both of these methods depend on the round-trip delay. As in the stop-and-wait ARQ method, the data throughput decreases, when the round-trip delay increases, but only in an error prone environment. Under error free conditions, optimal throughput is obtained.
The most efficient ARQ scheme, both with respect to throughput per user and shared resource efficiency is a selective repeat ARQ method. According to this method, the destination specifies in the acknowledgement exactly which data packet has to be retransmitted. In this way, only failed packets are retransmitted, and no packet transmission is delayed due to a retransmission. The packet numbers are used both for retransmission requests and for the ordering of out-of-sequence data packets. The data throughput is independent of the round-trip delay, and can reach the theoretical limit of what can be achieved with a retransmission method, that is a data throughput of 1-FER, where FER is Frame Error Rate or Packet Error Rate. However, the selective repeat ARQ method requires extensive storage capability and packet handling at both the source and the destination. Some communication networks transfer data packets in parallel . These networks subdivide the communication link into a number of subchannels for parallel transmission of data packets. In order to guarantee proper ordering of data packets arriving from various subchannels, most conventional networks employ the numbered ARQ method. One conventional network, however, uses the unnumbered ARQ method for transfer of data packets in parallel. This network, which is used by ARPANET and is described by D. Bertsekas and R. Gallager, "Data Networks , " 2nd Edition, Prentice Hall International, Inc., London, 1992, applies independent stop-and-wait ARQ methods on eight (virtual) channels in parallel. The data packets are multiplexed over the channels according to availability to transmit a new data packet on the channels. Each data packet contains a virtual channel number identifying the channel on which the data packet is transmitted. As a consequence, the data packets can be transmitted out of order, because the stop- and-wait ARQ method on the separate channels are independent of each other. In other words, retransmissions on one channel will not affect the other channels, but will result in data packets arriving at the destination out of order. As a result, packet numbers at higher protocol layers as required to provide enabling instructions to the destination to properly, reorder the data packets. This method, therefore, requires complicated data-packet reordering overhead, which must be implemented in higher protocol layers . Therefore, there exists a need for a data communication network with high data throughput which is simple to implement and does not retransmit successfully received data packets unnecessarily. Summary
Briefly, the present invention is exemplified in a communication network that uses a multi-channel automatic retransmission query (ARQ) for communicating data packets from a source to a destination over a communication link that is subdivided into a number of channels. The network sequentially multiplexes the data packets at the source over corresponding channels during multiplexing rounds. The invention then applies a stop-and wait ARQ method on each one of the channels and determines whether the destination has positively acknowledged a previously transmitted data packet. If not, the network retransmits only the data packets that are not positively acknowledged, after being transmitted during a previous multiplexing round. At the source, the network of the invention multiplexes the data packets during successive multiplexing rounds, when the data packets are sequentially transmitted on all of the channels. The network halts the multiplexing of new data packets at the source during a subsequent multiplexing round until the destination positively acknowledges successful reception of a data packet that was transmitted over a corresponding channel during the previous multiplexing round. The network only retransmits previously transmitted data packets that are not positively acknowledged. Also, the source may retransmit the data packets if no acknowledgement is received from the destination after a predefined time-out period. At the destination, the network sequentially de-multiplexes the data packets over the channels and halts the de-multiplexing of new data packets over all other channels, if a new data packet is not received over a channel.
According to some of the more detailed features of the invention the network buffers the data packets before transmissions over corresponding channels. Preferably, the network includes source FIFO buffers with predefined lengths for buffering the data packets over the channels in a FIFO manner. In this way, the source halts the transmission of the data packets, when the source FIFO buffer is full. Similarly, the destination includes a destination FIFO buffer for sequentially buffering received data packets over the channels in a FIFO manner. Similar to the source FIFO buffer, the destination FIFO buffer has a predefined length. Under this arrangement, the demultiplexing of the data packets is halted when the destination FIFO buffer is empty. The destination starts its de-multiplexing operation of the buffered data packets, after the new data packet is received. According to another detailed feature of the invention, the source includes a multiplexer for multiplexing the data packets on the channels in a rotating manner and the destination includes a de-multiplexer for similarly de-multiplexing the data packets. The multiplexer halts the multiplexing of the data packets, when the transmissions of the data packets are halted and, the demultiplexer halts the de-multiplexing of the data packets, when the reception of the data packets are halted. According to other more detailed features of the invention, data packets are pseudo-randomly transmitted over a predetermined number of physical channels, such as radio frequency channels. The destination determines whether a received data packet is a new data packet or not . In response, the destination transmits a positive acknowledgment to the source if a data packet is successfully received over a communication channel, and it transmits a negative acknowledgment to the source if a data packet is not received successfully.
Other features and advantages of the present invention will become apparent from the following description of the preferred embodiment, taken in conjunction with the accompanying drawings, which illustrate, by way of example, the principles of the invention.
Brief Description of the Drawings
FIG. 1 is a timing diagram of a data packet transfer according to a conventional stop-and-wait ARQ method.
FIG. 2 is a timing diagram of a data packet transfer according to the present invention.
FIG. 3 is a block diagram implementing a multi-channel ARQ method according to one embodiment of the present invention. FIG. 4 is a block diagram implementing a multi-channel ARQ method according to another embodiment of the present invention.
FIG. 5 (a) and 5(b) are diagrams showing two exemplary operation of the multi-channel ARQ method of the embodiment of FIG. 4.
FIG. 6 is a block diagram implementing multi-channel ARQ method according to yet another embodiment of the present invention.
Detailed Description
Referring to FIG. 2, a multi-channel ARQ method according to the present invention subdivides each round trip delay into a number of time slots. As shown, the roundtrip delay Td is divided into six time slots designated as ARQ Channels A-F. In a Time Division Multiplex (TDM) manner, each time slot is used as a virtual channel on a communication link assigned to a user. These channels are used for parallel transfer of data packets between a source 16 and a destination 18. At the source 16, the data packets are sequentially multiplexed over the ARQ Channels A-F and transmitted to the destination 18. The multi-channel ARQ method of the invention applies a stop-and-wait ARQ method on each one of the ARQ Channels A-F. Under this arrangement, the source 16 sequentially transmits data packets in multiplexing rounds, starting with the first ARQ Channel A and ending with the last ARQ Channel F. Therefore, at the end of each multiplexing round the data packets are sequentially multiplexed over all of the ARQ Channels A-F. At the start of a subsequent multiplexing round, the source waits to receive an acknowledgement from the destination 18 before transmitting a new data packet over the same ARQ Channel. During the subsequent round, if a data packet transmitted on a ARQ Channel during a previous round is negatively acknowledged, i.e. NAKed, the source 16 halts multiplexing of the data packets and retransmits the NAKed data packet on its corresponding ARQ Channel, before transmitting any subsequent data packet on that ARQ Channel again. The source 16, however, continues to retransmit only NAKed data packets, if any, on other ARQ Channels until corresponding data packet (s) is (are) positively acknowledged. At the destination 18, the received data packets are sequentially de-multiplexed. In order to maintain data packet ordering, the destination 18 halts the de-multiplexing of the received data packets, if it does not receive a new data packet on a particular ARQ Channel. As shown in FIG. 2, a first data packet is transmitted on the ARQ Channel A. Subsequently, a second, third, and subsequent data packets (through 6th) are transmitted on ARQ Channels B-F, respectively. These data packets are shown by numbers 1-6, for illustration purpose only. Thus, during a first multiplexing round, the multiplexing continues and all of the six data packets are transmitted on ARQ Channels A-F, respectively. The cumulative duration of the ARQ Channels, i.e., the minimum repetition period of a round, is selected so that sufficient time is allowed for reception of positive acknowledgments (ACKs) or negative acknowledgments (NAKs) from the destination, before another data packet is transmitted during a second round. During the second round, if an ACK is received in response to the transmitted data packet on ARQ Channel A, i.e., the first data packet, which was transmitted during the first round, a subsequent data packet, i.e., the 7th data packet (shown by number 7) is transmitted. This process continues on to the ARQ Channels B, C, and so on. However, if a NAK is received in response to transmission of any data packet during the first round, the source halts to multiplex the data packets and only retransmits the NAKed data packets during the second round. For example, FIG. 2 shows that a fourth data packet (shown by number 4) transmitted on ARQ Channel D to be NAKed. Before transmitting a new data packet on ARQ Channel D during the second round, the source 16, which had continued on to transmit data packets on ARQ Channels E, F, etc., during the first round, retransmits the fourth data packet again on channel D during the second round. If the data packets transmitted on Channels E, F, A, B, C during the first round are all ACKed, as is the case in this example, the source 16 only retransmits the NAKed fourth data packet and stops transmission of new data packets on subsequent ARQ Channels during the second round, until an ACK is received for the fourth data packet. Accordingly, contrary to conventional methods, the previously ACKed data packets are not retransmitted unnecessarily. Instead, the source 16 remains idle until it reaches ARQ Channel D during a subsequent third round. If during the third round, an ACK is received in response to the retransmission of the fourth packet, then a new data packet, i.e., a 10th data packet, is transmitted on ARQ Channel D. Provided that previously transmitted data packets on the ARQ Channels have all been ACKed, new data packets are transmitted on subsequent ARQ Channels E through F.
If, however, one or more previously transmitted data packets are NAKed, only the retransmissions of the NAKed data packets take place on the ARQ channels during a subsequent round. This situation is illustrated by an exemplary data packet transfer starting from the third round. Let's assume that a 10th and a 12th data packets (shown by numbers 10 and 12) , which where transmitted on ARQ Channels D and F of the third round, were NAKed. As shown, during a subsequent fourth round, only the 10th and 12th data packets are retransmitted. Once ACKs are received for the 10th and 12th data packets during a subsequent fifth round, then new data packets are transmitted.
At the destination 18 the first through third data packets are received and demultiplexed successfully during the first round. However, because of the NAKed fourth data packet, the destination 18 halts the de-multiplexing operation to maintain order in the sequence of the received data packets. Once the fourth data packet is positively acknowledged, the destination 18 resumes the de-multiplexing of the 4th through 9th data packets, which were all received correctly. When it reaches the 10th NAKed data packet, it halts the de-multiplexing operation again until it can positively acknowledge this data packet. Once acknowledged, the destination resumes its de-multiplexing operation. The same process continues for the NAKed 12th data packet until all the received data are positively acknowledged. It is noted that the multiplexer at the source and the de- multiplexer at the destination operate independently and are not synchronized. The multiplexer steps forward in response to ACKed packets, whereas the de-multiplexer steps forward in response to new arrived packets. Therefore, the duration of the multiplexing rounds may be different from each other. As is well known, sometimes acknowledgement errors arise during data packet transfers. An acknowledgement error arises when a data packet has been successfully received at the destination 18, however, the associated ACK is not received successfully at the source 16. As a result, after a predefined time out period, the source 16 retransmits the same packet again. In this situation, the destination 18 must be able to distinguish between the retransmission of an old data packet and a new data packet . In order to handle the acknowledgment errors, the present invention assigns a sequence number to each data packet. In its simplest form, the sequence number may be a single bit which is toggled from one binary state to another for each new data packet . By checking the sequence numbers of consecutive data packets on a single ARQ channel, the destination 18 determines whether a new or an old data packet is received from the source 16. New data packets always have alternating sequence numbers. Otherwise, if the same sequence number is encountered for adjacent data packets, the destination 18 acknowledges the reception of the last data packet but ignores its content.
Referring to FIG. 3, a simplified block diagram of the implementation of a multi-channel ARQ method according to FIG. 2 is shown. At the source 16, a data packetizer 20 packetizes input data according to a predefined protocol. A multiplexer 22 routes the data packets sequentially over the ARQ Channels A-F in a rotating manner. At the input of each one of the ARQ Channels, single-element buffers 24 store data packets provided by the multiplexer 22 for transmission on a corresponding ARQ Channel . After placing a data packet in a buffer 24 of the last ARQ Channel of each round, i.e., ARQ Channel F, the multiplexer 22 places a subsequent data packet in the buffer of the first ARQ Channel, i.e., ARQ Channel A, during a subsequent round, provided that a previously transmitted data packet on the first ARQ Channel is positively acknowledged. For each ARQ Channel, the corresponding buffer 24 indicates an empty condition each time an ACK is received based on a successful reception of a data packet at the destination 18. Otherwise, the corresponding buffer 24 indicates a full condition.
Under the present invention, separate stop-and- wait ARQ schemes are applied to each ARQ Channel. For as long as a buffer 24 of a particular ARQ Channel indicates an empty condition, the multiplexer 22 continues to load a new data packet in that buffer and moves onto the next ARQ- channel . If a buffer 24 is not empty when the multiplexer 22 arrives at the buffer's corresponding ARQ Channel, it stops its multiplexing operation during that round. During the round, the source 16 only retransmits NAKed data packets on subsequent ARQ Channels. At that time, no new data packets are loaded into the buffers 24 until the non-empty buffer that stopped the multiplexing operation indicates an empty condition, which is resulted when a previously transmitted data packet is positively acknowledged.
At the destination 18, a de-multiplexer 26 operating in a rotating fashion sequentially reads the received data packets over the ARQ Channels A-F. Similar to the multiplexer 22 at the source 16, if the de-multiplexer 26 arrives at an ARQ Channel with no new received data packet, it stops its de-multiplexing operation until a successful data packet is received. Only after the arrival of a new data packet, the de-multiplexer 26 advances to demultiplex on the subsequent ARQ Channels. The operation of the multiplexer 22 and de-multiplexer 26 according to the invention, which halt their respective multiplexing and demultiplexing operation when ARQ Channel cannot accept or provide new data packets, assures proper ordering of the received data packets at the destination 18.
Preferably, the repetition period of the multiplexer 22 is selected to be longer than the round-trip delay, to avoid idle times at the source 16. Because the buffers 24 at the ARQ Channels A-F of the multi-channel ARQ method of the invention can be considered as the elements of a circular buffer that is used in a conventional cumulative go-back-N ARQ implementation, the present invention provides similar data per user throughput as that provided by the cumulative method, without the numbering or overhead thereof, while avoiding unnecessary retransmissions of successfully received data packets. Referring to FIG. 4, another embodiment of the present invention improves the performance of the multichannel ARQ method by using multi-element buffers 28 and 29 at the source 16 and the destination 18. As shown, multielement source and destination buffers 28 and 29 are positioned at the transmission and reception path of the ARQ Channels A-F, respectively. Preferably, the source and destination buffers 28 and 29 are first-in-first-out (FIFO) buffers. Under this embodiment of the invention, a data packet may be retransmitted from the source 16 on an ARQ Channel, while the multiplexer 22 loads data packets into other source FIFO buffers 28, provided that a corresponding FIFO buffer 28 is not full. Consecutive packets are distributed among the FIFO, i.e., packet k is placed in the first FIFO, packet k+1 in the second FIFO, etc. After the last FIFO, the multiplexer returns to the first FIFO. If a source FIFO buffer 28 is full, the multiplexer 22 stops multiplexing until a transmitted data packet at the end of the full source FIFO buffer is ACKed. Once ACKed, the multiplexer 22 inputs a subsequent data packet into the source FIFO buffer 28.
At the destination 18, the destination FIFO buffers 29 operate to allow for orderly reception of the data packets transmitted from the source FIFO buffers 28. Only new data packets are buffered in the destination FIFO buffers 29. This is true even when a data packet is successfully received, however, is retransmitted due to an a acknowledgement error. In this case, the reception is acknowledged, but the data packet is not stored in the destination FIFO. The de-multiplexer 26 advances its demultiplexing operation for as long as a destination FIFO buffer 29 is not empty. When an empty FIFO buffer 20 is encountered, the de-multiplexer 26 stops its de-multiplexing operation on a corresponding ARQ Channel until the arrival of a new data packet over that ARQ Channel. The destination then continues its de-multiplexing of the buffered data packets at the destination FIFO buffers 29, after a new data packet is received. FIGs. 5(a) and 5(b) show exemplary operations of the method of the invention under the embodiment of FIG. 4. In this example, a system with 6 parallel ARQ channels and with 3 -element source and destination buffers is shown. It is assumed that the source can load the source FIFOs at a much higher rate than the packets can be transferred over the channels A to F. FIG. 5(a) shows the begin conditions. The multiplexer 22 has distributed packets 1 to 18 over the source FIFOs in a manner as shown in FIG. 5(a) . Next, the packets are transmitted independently over the six physical channels. This can occur sequentially when the channels form slots in a TDMA system, or simultaneously when the channels form carrier frequencies in a FDMA system or codes in a CDMA system. As packets are transmitted and successfully received, the FIFOs 28 shift their packets to the end, and new packets may be loaded by the multiplexer 22. In FIG. 5(b), the situation is shown when packets 1 to 3, and packets 5-9 and 11-13 have been received successfully. However, since packet 4 has not been received correctly yet, only packets 1 to 3 have been de-multiplexed and carried on to the final destination. New packets 19 to 21 have been multiplexed and loaded into the source buffers 28 corresponding to channels A to C. However, packet 22 cannot be placed in the proper source buffer (the buffer corresponding to channel D) since this source buffer is full . This is because packet 4 has not been received successfully on channel D and therefore it has not been acknowledged yet. Both the multiplexer 22 and the de- multiplexer 26 have halted at channel D since the source FIFO buffer 28 is full and the destination buffer 29 is empty. Only when the fourth packet is received correctly can the de-multiplexer move forward, whereas only when the acknowledgement of this success has been received by the source can the multiplexer 22 move forward. The transmissions and retransmissions on other channels, however, can continue for as long as their corresponding source FIFO buffers 28 are not empty. It would be appreciated that even with the implementation of this embodiment, there is a probability that the FIFO buffers 28 could become full due to congestion on a particular ARQ Channel. As a result, while other buffers become empty, their corresponding ARQ Channels would have to wait until the congested ARQ Channel with full FIFO buffer resolves its congestion. The channel congestion probability is decreased by increasing the length of the FIFO buffers 28 and 29. By sufficiently increasing the length of the FIFO buffers 28 and 29, the data throughput of the multi-channel ARQ method of this embodiment of the invention would approach the theoretical limit of (1-FER) . As described in connection with the embodiment of FIGs. 2-3, even for a small number of FIFO elements, i.e. one element, a data throughput comparable to that of go-back-N algorithms may be obtained without applying numbering and extra packet overhead, except for handling acknowledgment errors based on the sequence numbers. However, under the embodiment of FIG. 4, sufficiently large FIFO buffers 28 and 29 can increase the data throughput to the theoretical limit, making the methods as efficient as the selective repeat ARQ method.
For optimal performance, each ARQ Channel in the multi-channel ARQ method of the invention should, on average, have an equal error behavior. If retransmissions occur much more frequently on one ARQ Channel than on another, the former ARQ Channel could limit the overall data throughput of the network. Under this situation, it is more advantageous to distribute the data packets over different physical channels, that is, an ARQ channel does not constantly use the same physical channel. If a single physical channel is bad, a single retransmission on a different channel may result in successful reception of a data packet. In contrast, when each data packet is bit- interleaved over multiple physical channels, each packet would be affected by the bad channel, and only a FEC method would help to overcome the transmission errors.
As mentioned above, for each ARQ Channel of the present invention, the average data throughput performance should be the same in order to achieve an optimal overall data throughput performance. However, this will not necessarily be the case in applications where the communication link consists of discrete physical channels, for example, radio frequency (RF) links consisting of a predefined number of parallel Frequency-Division multiplex (FDM) channels. Under this arrangement, the RF link may be deteriorated at one or more portions of the frequency spectrum, due to such factors as multi-path fading, or narrowband interference. Accordingly, not all the physical channels may have the same average quality. To assure equal performance on average, the ARQ Channels of the invention should be distributed over the physical FDM channels, for example, by applying well known spreading and despreading operations, such as frequency hopping.
Referring to FIG. 6, one such network is shown where the ARQ channels are spread by a spreader 32 at the source 16 and de-spread by a de-spreader 34 at the destination 18. A synchronization block 36 synchronizes the spreading and de-spreading operations, to achieve an equal error performance on all physical channels. MUX/FIFO and DE-MUX/FIFO blocks 38 and 40 correspond to a multiplexer/demultiplexer 22 and 26 and FIFO buffers 28 and 29 shown in FIG. 4. In an exemplary embodiment, the available physical channels consist of six FDM channels. The network can use four ARQ Channels A-D in parallel. That is, for each new data packet transfer, the source 16 and destination 18 pseudo-randomly assign one of the six physical channels to support one of the four ARQ Channels A- D. In each case, the six physical channels are different from each other; that is, they are orthogonal and no collisions between packets on different ARQ Channels would occur. In FIG. 6, the return channels carrying positive and negative acknowledgement are not shown.
Although only a unidirectional link (half-duplex) has been described above, one of ordinary skill in the art would appreciate that the present invention is equally applicable to a full-duplex link. By applying a similar half-duplex link in opposite direction, the present invention may be extended to cover a full-duplex communication link. Under a full-duplex arrangement, positive or negative acknowledgements, are usually piggybacked in the data packets in both directions. Therefore, explicit ACK/NAK transmissions may not be required. From the forgoing description it would be appreciated that the present invention provides a high data throughput ARQ method that is unnumbered, thus, simple to implement and does not retransmit successfully received data packets unnecessarily. Due to multiplexing and demultiplexing at the source and destination, respectively, the unnumbered ARQ method of the invention transmits the data packets in parallel, without requiring substantial packet ordering overhead. As described above, by increasing the size of FIFO buffers at the source and destination, the present invention can provide a data throughput approaching the theoretical limit, regardless of the round-trip delays.
Although the invention has been described in detail with reference only to a preferred embodiment, those skilled in the art will appreciate that various modifications can be made without departing from the invention. Accordingly, the invention is defined only by the following claims which are intended to embrace all equivalents thereof.

Claims

What is Claimed is:
1. A method for transmitting data packets from a source to a destination over a data communication link that is divided into a number of channels comprising the steps of: sequentially multiplexing the data packets at the source over the channels during successive multiplexing rounds ; transmitting the data packets; halting the multiplexing of new data packets during a subsequent multiplexing round until the reception of a data packet that was transmitted over a corresponding channel during a previous multiplexing round is positively acknowledged; and retransmitting only the data packets that are not positively acknowledged.
2. The method of claim 1 further including the step of buffering at least one data packet at the source, before transmitting it over a corresponding channel .
3. The method of claim 1 further including the step of buffering a number of data packets at the source in a FIFO manner, before transmitting them over at least one channel .
4. The method of claim 3, wherein the data packets are buffered in a FIFO buffer having a predefined length, and wherein the multiplexing of the data packets is halted over the at least one channel, when the FIFO buffer is full.
5. The method of claim 1, wherein the step of multiplexing the data packets at the source is in a rotating manner .
6. The method of claim 3, wherein the step of halting the multiplexing of new data packets includes the step of halting the buffering of the data packets into the FIFO buffer.
7. The method of claim 1 further including the step of retransmitting the data packets if a negative acknowledgement is received or if a positive acknowledgment is not received after a predefined time period.
8. The method of claim 1 , wherein the data packets are pseudo-randomly transmitted over a predetermined number of physical channels.
9. The method of claim 1, wherein the physical channels include radio frequency channels.
10. A method for receiving data packets transmitted from a source at a destination over a data communication link that is divided into a number of channels comprising the steps of: sequentially de-multiplexing the data packets over the channels; if a new data packet is not received over a channel, halting the de-multiplexing of new data packets over all other channels; at the destination, sequentially buffering received data packets from the channels in a FIFO manner; and de-multiplexing the buffered data packets, after the new data packet is received.
11. The method of claim 10 further including the step of transmitting a positive acknowledgment to the source if a data packet is successfully received over a channel.
12. The method of claim 10 further including the step of transmitting a negative acknowledgment to the source if a data packet is not successfully received over a channel .
13. The method of claim 10 further including the step of determining whether a received data packet is a new data packet or not .
14. The method of claim 10, wherein the data packets are buffered at the destination in a FIFO buffer having a predefined length, wherein the de-multiplexing of the data packets is halted, when the FIFO buffer is empty.
15. The method of claim 10, wherein the step of de-multiplexing of the data packets at the destination includes the step of de-multiplexing the data packets on the channels in a rotating manner.
16. The method of claim 14, wherein the step of multiplexing and de-multiplexing operate independently.
17. A method for communicating data packets between a source and a destination, comprising the steps of: dividing a data communication link into a number of channels; sequentially multiplexing the data packets at the source over the channels during successive multiplexing rounds ; transmitting the data packets; halting the multiplexing of new data packets during a subsequent multiplexing round until the reception of a data packet that was transmitted over a corresponding channel during a previous multiplexing round is positively acknowledged; retransmitting only the data packets that are not positively acknowledged, after being transmitted during the previous multiplexing round; sequentially de-multiplexing the data packets over the channels; and halting the de-multiplexing of new data packets over all other channels, if a new data packet is not received over a channel .
18. The method of claim 17 further including the step of buffering at least one data packet at the source before transmitting it over a corresponding channel.
19. The method of claim 17 further including the step of buffering a number of data packets at the source in a FIFO manner, before transmitting them over at least one channel .
20. The method of claim 19, wherein the data packets are buffered in a FIFO buffer having a predefined length, wherein the multiplexing of the data packets is halted over the at least one channel, when the FIFO buffer is full.
21. The method of claim 17, wherein the step of multiplexing the data packets from the source during the multiplexing rounds includes the step of multiplexing the data packets on the channels in a rotating manner.
22. The method of claim 19, wherein the step of halting the multiplexing of new data packets includes the step of halting the buffering of the data packets.
23. The method of claim 17 further including the step of retransmitting the data packets if a negative acknowledgement is received or if a positive acknowledgment is not received after a predefined time period.
24. The method of claim 17, wherein the data packets are pseudo-randomly transmitted over a predetermined number of physical channels.
25. The method of claim 17, wherein the physical channels include radio frequency channels.
26. The method of claim 17 further including the step of buffering received data packets at each channel at the destination in a FIFO manner; and de-multiplexing the buffered data packets, after the new data packet is received.
27. The method of claim 17 further including the step of transmitting a positive acknowledgment to the source if a data packet is successfully received over a channel.
28. The method of claim 17 further including the step of transmitting a negative acknowledgment to the source if a data packet is not successfully received over a channel .
29. The method of claim 17 further including the step of determining whether a received data packet is a new data packet or not .
30. The method of claim 26, wherein the data packets are buffered at the destination in a FIFO buffer having a predefined length, wherein the de-multiplexing of the data packets is halted when the FIFO buffer is empty.
31. The method of claim 17, wherein the step of de-multiplexing of the data packets at the destination includes the step of de-multiplexing the data packets on the channels in a rotating manner.
32. The method of claim 30, wherein the steps of multiplexing and de-multiplexing are independent of each other.
33. A multi-channel automatic retransmission query (ARQ) method comprising the steps of: dividing a data communication link into a number of channels; sequentially multiplexing the data packets at the source over the channels and transmitting them to a destination over corresponding channels; applying a stop-and wait ARQ method on each one of the channels; determining whether the destination positively acknowledges a previously transmitted data packet; and retransmitting only the data packets that are not positively acknowledged.
34. The method of claim 33 further including the step of buffering at least one data packet at the source, before transmitting it over a corresponding channel.
35. The method of claim 33 further including the step of buffering a number of data packets at the source in a FIFO manner, before transmitting them over at least one channel .
36. The method of claim 35, wherein the data packets are buffered in a FIFO buffer having a predefined length.
37. The method of claim 33, wherein the step of multiplexing the data packets at the source during the multiplexing rounds includes the step of multiplexing the data packets on the channels in a rotating manner.
38. The method of claim 36, wherein the step of halting the multiplexing of new data packets includes the step of halting the buffering of the data packets.
39. The method of claim 33 further including the step of retransmitting the data packets if a negative acknowledgement is received or if a positive acknowledgment is not received after a predefined time period.
40. The method of claim 33, wherein the data packets are pseudo-randomly transmitted over a predetermined number of physical channels.
41. The method of claim 40, wherein the physical channels include radio frequency channels.
42. The method of claim 33 further including the step of sequentially buffering received data packets over the channels at the destination in a FIFO manner; and demultiplexing the buffered data packets, after the new data packet is received.
43. The method of claim 33 further including the step of transmitting a positive acknowledgment to the source if a data packet is successfully received over a channel.
44. The method of claim 33 further including the step of transmitting a negative acknowledgment to the source if a data packet is not successfully received over a channel .
45. The method of claim 33 further including the step of determining whether a received data packet is a new data packet or not .
46. The method of claim 42, wherein the data packets are buffered at the destination in a FIFO buffer having a predefined length, wherein the de-multiplexing of the data packets is halted, when the FIFO buffer is empty.
47. The method of claim 33, wherein the step of de-multiplexing the data packets at the destination includes the step of de-multiplexing the data packets on the channels in a rotating manner.
48. The method of claim 46, wherein the step of halting the de-multiplexing of the data packets includes the step of halting the buffering of the data packets.
49. A network for communicating data packets between a source and a destination over a data communication link that is subdivided into a number of channels, comprising: means for multiplexing the data packets from the source during successive multiplexing rounds means for transmitting the data packets; means for halting multiplexing of new data packets until the destination positively acknowledges successful reception of a data packet, wherein the means for transmitting the data packets only retransmits the data packets that are not positively acknowledged.
50. The network of claim 49 further including means for sequentially de-multiplexing the data packets over the channels at the destination; and means for halting the de-multiplexing of new data packets over all other channels, if a new data packet is not received over a channel.
51. The network of claim 49 further including a buffer for buffering at least one data packet at the source, before transmitting it over a corresponding channel .
52. The network of claim 49 further including at least one source FIFO buffer for buffering a number of data packets at the source in a FIFO manner before transmitting them over at least one channel .
53. The network of claim 49, wherein the at least one source FIFO buffer has a predefined length, and wherein the multiplexing of the data packets is halted, when the source FIFO buffer is full.
54. The network of claim 49, wherein the means for multiplexing multiplexes the data packets on the channels in a rotating manner.
55. The network of claim 54, wherein the means for multiplexing halts the buffering of the data packets, when the multiplexing of the data packets are halted.
56. The network of claim 54, wherein the means for transmitting retransmits the data packets if a negative acknowledgement is received or if a positive acknowledgment is not received after a predefined time period.
57. The network of claim 49, wherein the data packets are pseudo-randomly transmitted over a predetermined number of physical channels.
58. The network of claim 57, wherein the physical channels include radio frequency channels.
59. The network of claim 49 further including destination FIFO buffers for buffering received data packets over the channels at the destination in a FIFO manner; wherein the buffered data packets are sequentially demultiplexed, after the new data packet is received.
60. The network of claim 49 further including means for transmitting a positive acknowledgment to the source, if a data packet is successfully received over a channel .
61. The network of claim 49 further including means for transmitting a negative acknowledgment to the source, if a data packet is not successfully received over a channel .
62. The network of claim 49 further including means for determining whether a received data packet is a new data packet or not .
63. The network of claim 59, wherein the destination FIFO buffer has a predefined length, wherein the de-multiplexing of the data packets is halted when the destination FIFO buffer is empty.
64. The network of claim 59 further including a de-multiplexer for de-multiplexing the data packets on the channels in a rotating manner.
PCT/SE1998/001415 1997-08-19 1998-07-24 A multi-channel automatic retransmission query (arq) method WO1999009698A1 (en)

Priority Applications (7)

Application Number Priority Date Filing Date Title
KR1020007001639A KR20010023029A (en) 1997-08-19 1998-07-24 A multi-channel automatic retransmission query (arq) method
EEP200000108A EE200000108A (en) 1997-08-19 1998-07-24 Multichannel automatic retransmission request (ARQ) method
EP98935453A EP1005732B1 (en) 1997-08-19 1998-07-24 A multi-channel automatic retransmission query (arq) method
AU84699/98A AU747369B2 (en) 1997-08-19 1998-07-24 A multi-channel automatic retransmission query (ARQ) method
BR9811240-6A BR9811240A (en) 1997-08-19 1998-07-24 Processes for transmitting data packets from a source to a destination and for receiving data packets transmitted by a source at a destination over a data communication link that is divided into a number of channels, for communicating data packets between a source and a destination, and automatic retransmission query (file) on multiple channels, and, network to communicate data packets between a source and a destination through a data communication link that is subdivided into a number of channels
JP2000510243A JP4146079B2 (en) 1997-08-19 1998-07-24 Multi-channel automatic retransmission inquiry (ARQ) method
HK01102584A HK1031962A1 (en) 1997-08-19 2001-04-11 A multi-channel automatic retransmission query (arq) method

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US08/912,834 US6021124A (en) 1997-08-19 1997-08-19 Multi-channel automatic retransmission query (ARQ) method
US08/912,834 1997-08-19

Publications (1)

Publication Number Publication Date
WO1999009698A1 true WO1999009698A1 (en) 1999-02-25

Family

ID=25432531

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SE1998/001415 WO1999009698A1 (en) 1997-08-19 1998-07-24 A multi-channel automatic retransmission query (arq) method

Country Status (13)

Country Link
US (1) US6021124A (en)
EP (1) EP1005732B1 (en)
JP (1) JP4146079B2 (en)
KR (1) KR20010023029A (en)
CN (1) CN1132365C (en)
AR (1) AR016825A1 (en)
AU (1) AU747369B2 (en)
BR (1) BR9811240A (en)
CO (1) CO4790192A1 (en)
EE (1) EE200000108A (en)
HK (1) HK1031962A1 (en)
MY (1) MY116270A (en)
WO (1) WO1999009698A1 (en)

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1204245A2 (en) * 2000-10-11 2002-05-08 Philips Corporate Intellectual Property GmbH Wireless network with exchange of data according to the ARQ method
EP1231736A2 (en) * 2001-02-09 2002-08-14 Samsung Electronics Co., Ltd. Wireless data communication
EP1247367A1 (en) * 1999-12-29 2002-10-09 Motorola, Inc. Multi channel stop and wait arq communication method and apparatus
WO2002082828A2 (en) * 2001-04-09 2002-10-17 Siemens Aktiengesellschaft Packet-oriented data transmission between radio stations in a communication system by means of an n-channel stop and wait (saw) automatic repeat request (arq) method
US7096027B2 (en) * 2001-10-04 2006-08-22 Mitsubishi Denki Kabushiki Kaisha Communication method, communication system and communication apparatus
US7167475B2 (en) 2000-02-14 2007-01-23 Nokia Corporation Data packet numbering in packet-switched data transmission
EP2045946A2 (en) * 2007-10-02 2009-04-08 Infineon Technologies AG Retransmission in data communication systems
US7519018B2 (en) 2001-08-24 2009-04-14 Interdigital Technology Corporation Method for physical layer automatic repeat request for a subscriber unit
US8351400B2 (en) 2004-05-05 2013-01-08 Qualcomm Incorporated Method and apparatus for overhead reduction in an enhanced uplink in a wireless communication system
US8474058B2 (en) 1995-02-01 2013-06-25 Rovi Solutions Corporation Method and system for managing a data object so as to comply with predetermined conditions for usage
US8503452B2 (en) 2005-03-21 2013-08-06 Qualcomm Incorporated Method and apparatus for improving data transmission reliability in a wireless communications system
US9319201B2 (en) 2005-03-29 2016-04-19 Qualcomm Incorporated Reverse link pilot with selective gating in wireless communication
WO2020226680A1 (en) * 2019-05-03 2020-11-12 Huawei Technologies Co. Ltd. Adaptive reordering in multiband communication systems

Families Citing this family (129)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI103540B1 (en) * 1997-04-28 1999-07-15 Nokia Mobile Phones Ltd Method of transmitting packet-shaped data in a mobile telephone system
US6212165B1 (en) * 1998-03-24 2001-04-03 3Com Corporation Apparatus for and method of allocating a shared resource among multiple ports
EP0964544A1 (en) * 1998-06-09 1999-12-15 Mitsubishi Electric Information Technology Centre Europe B.V. Method of controlling errors in a packets transmission link
US6553003B1 (en) * 1998-06-13 2003-04-22 Samsung Electronics, Co., Ltd. Device and method processing a radio link protocol in a mobile communication system
FI106330B (en) * 1998-08-12 2001-01-15 Nokia Networks Oy Take into account transit delay on a data connection
US6590895B1 (en) * 1998-10-15 2003-07-08 Sun Microsystems, Inc. Adaptive retransmission for error control in computer networks
US6967963B1 (en) * 1998-12-01 2005-11-22 3Com Corporation Telecommunication method for ensuring on-time delivery of packets containing time-sensitive data
DE19902436A1 (en) * 1999-01-22 2000-07-27 Nokia Networks Oy Methods for writing data in registers of at least one device using management interface by setting register values of devices accordingly information intended for it from ATM cell
JP4015773B2 (en) * 1999-03-10 2007-11-28 松下電器産業株式会社 Transceiver
US6335933B1 (en) * 1999-05-21 2002-01-01 Broadcom Homenetworking, Inc. Limited automatic repeat request protocol for frame-based communication channels
KR100424654B1 (en) * 1999-08-02 2004-03-24 삼성전자주식회사 Apparatus and method for retransmitting data according to radio link protocol in mobile communication system
US6463070B1 (en) * 1999-08-27 2002-10-08 Tachyon, Inc. System and method for clock correlated data flow in a multi-processor communication system
FR2798810B1 (en) * 1999-09-16 2002-05-31 Cit Alcatel PACKET-BASED TELECOMMUNICATION METHOD AND SYSTEM IN WHICH MULTIPLE COMMUNICATIONS ARE TRANSFERABLE FROM ONE WAY TO ANOTHER
WO2001022747A1 (en) * 1999-09-22 2001-03-29 Motorola Inc. Selecting channels for retransmission of data packets
US6629284B1 (en) * 1999-10-28 2003-09-30 Koninklijke Philips Electronics N.V. System and method for supervised downloading of broadcast data
JP2001142845A (en) * 1999-11-17 2001-05-25 Toshiba Corp Computer system and data transfer control method
US7068623B1 (en) * 2000-01-10 2006-06-27 Nortel Networks Limited Communicating traffic over a wireless channel in a mobile communications system
US6748445B1 (en) * 2000-02-01 2004-06-08 Microsoft Corporation System and method for exchanging data
US6996100B1 (en) * 2000-02-03 2006-02-07 Telefonaktiebolaget Lm Ericsson (Publ) Method and system for medium access on a radio channel
US6760781B1 (en) * 2000-02-16 2004-07-06 3Com Corporation Intelligent packet transmission engine
US6801512B1 (en) * 2000-03-23 2004-10-05 Motorola, Inc. Method and apparatus for providing a distributed architecture digital wireless communication system
US7586949B1 (en) 2000-04-03 2009-09-08 Nortel Networks Limited Interleaving data over frames communicated in a wireless channel
KR100703107B1 (en) * 2000-04-10 2007-04-05 유티스타콤코리아 유한회사 Method for repeating automatically data in wireless communication system
DE20023933U1 (en) * 2000-05-17 2007-09-27 Matsushita Electric Industrial Co. Ltd. Hybrid ARQ transceiver
KR20020003526A (en) * 2000-07-05 2002-01-12 윤종용 Hybrid automatic repeat request method and apparatus for improving mobile communication systems
US7453878B1 (en) * 2000-07-21 2008-11-18 Silicon Graphics, Inc. System and method for ordering of data transferred over multiple channels
US6937592B1 (en) * 2000-09-01 2005-08-30 Intel Corporation Wireless communications system that supports multiple modes of operation
KR100695830B1 (en) * 2000-09-05 2007-03-19 유티스타콤코리아 유한회사 Method for repeatting data in wireless telecommunication system
FI20001975A (en) * 2000-09-07 2002-03-08 Nokia Corp Control data signaling method
US6567387B1 (en) 2000-11-07 2003-05-20 Intel Corporation System and method for data transmission from multiple wireless base transceiver stations to a subscriber unit
US6999430B2 (en) * 2000-11-30 2006-02-14 Qualcomm Incorporated Method and apparatus for transmitting data traffic on a wireless communication channel
US6751480B2 (en) * 2000-12-01 2004-06-15 Lucent Technologies Inc. Method for simultaneously conveying information to multiple mobiles with multiple antennas
JP2002186014A (en) * 2000-12-12 2002-06-28 Matsushita Electric Ind Co Ltd Wireless base station device and communication terminal
FR2819661B1 (en) * 2001-01-15 2003-03-28 Nortel Networks METHOD AND DEVICES FOR DATA TRANSMISSION WITH ACKNOWLEDGMENT MECHANISM
US7184401B2 (en) * 2001-02-05 2007-02-27 Interdigital Technology Corporation Link-aware transmission control protocol
US7120134B2 (en) * 2001-02-15 2006-10-10 Qualcomm, Incorporated Reverse link channel architecture for a wireless communication system
GB0104830D0 (en) * 2001-02-27 2001-04-18 Koninkl Philips Electronics Nv Radio communication system
US7058085B2 (en) * 2001-03-14 2006-06-06 Nortel Networks Limited Method and apparatus for transmitting data over a network within a specified time limit
US20020136287A1 (en) * 2001-03-20 2002-09-26 Heath Robert W. Method, system and apparatus for displaying the quality of data transmissions in a wireless communication system
US9100457B2 (en) * 2001-03-28 2015-08-04 Qualcomm Incorporated Method and apparatus for transmission framing in a wireless communication system
US7792074B2 (en) * 2001-03-28 2010-09-07 Qualcomm Incorporated Method and apparatus for channel management for point-to-multipoint services in a communication system
US8077679B2 (en) * 2001-03-28 2011-12-13 Qualcomm Incorporated Method and apparatus for providing protocol options in a wireless communication system
US8121296B2 (en) * 2001-03-28 2012-02-21 Qualcomm Incorporated Method and apparatus for security in a data processing system
US6625172B2 (en) 2001-04-26 2003-09-23 Joseph P. Odenwalder Rescheduling scheduled transmissions
US7230941B2 (en) * 2001-04-26 2007-06-12 Qualcomm Incorporated Preamble channel decoding
DE10141008A1 (en) * 2001-05-21 2002-11-28 Siemens Ag Multi-channel stop and wait communications method involves storing data packets in receiver unit until all packets preceding packet yet to be received have been received successfully
US6920598B2 (en) * 2001-05-21 2005-07-19 Lucent Technologies Inc. System and method for error recovery using NAKs
CN1134918C (en) * 2001-08-06 2004-01-14 华为技术有限公司 Packet data dispatching method based on mobile station capability
US7185362B2 (en) * 2001-08-20 2007-02-27 Qualcomm, Incorporated Method and apparatus for security in a data processing system
US20040120527A1 (en) * 2001-08-20 2004-06-24 Hawkes Philip Michael Method and apparatus for security in a data processing system
AU2002324584B2 (en) * 2001-08-24 2006-08-10 Interdigital Technology Corporation Base station implementing a physical layer automatic repeat request
TWI261984B (en) * 2001-08-24 2006-09-11 Interdigital Tech Corp Implementing a physical layer automatic repeat request for a subscriber unit
US7149254B2 (en) * 2001-09-06 2006-12-12 Intel Corporation Transmit signal preprocessing based on transmit antennae correlations for multiple antennae systems
US7697523B2 (en) * 2001-10-03 2010-04-13 Qualcomm Incorporated Method and apparatus for data packet transport in a wireless communication system using an internet protocol
US7352868B2 (en) * 2001-10-09 2008-04-01 Philip Hawkes Method and apparatus for security in a data processing system
US20030067890A1 (en) * 2001-10-10 2003-04-10 Sandesh Goel System and method for providing automatic re-transmission of wirelessly transmitted information
US7649829B2 (en) * 2001-10-12 2010-01-19 Qualcomm Incorporated Method and system for reduction of decoding complexity in a communication system
US7379434B2 (en) * 2001-10-19 2008-05-27 Koninklijke Philips Electronics N.V. Radio communication system
US7336719B2 (en) * 2001-11-28 2008-02-26 Intel Corporation System and method for transmit diversity base upon transmission channel delay spread
TW589815B (en) * 2002-01-16 2004-06-01 Winbond Electronics Corp Control method for multi-channel data transmission
US7287206B2 (en) * 2002-02-13 2007-10-23 Interdigital Technology Corporation Transport block set transmission using hybrid automatic repeat request
US7012978B2 (en) * 2002-03-26 2006-03-14 Intel Corporation Robust multiple chain receiver
AU2002252926A1 (en) * 2002-03-27 2003-10-08 Linkair Communications, Inc. An automatic repeat request arq error control method for different channels and the device thereof
CN1555631A (en) * 2002-03-29 2004-12-15 连宇通信有限公司 Automatic repeat request ARQ error control method and device for different channels
WO2003088553A1 (en) * 2002-04-16 2003-10-23 Linkair Communications,Inc. A n-channel arq error control method and apparatus suitable for high-speed wireless packet data service
KR100876765B1 (en) * 2002-05-10 2009-01-07 삼성전자주식회사 Apparatus for retransmitting data in mobile communication system and method thereof
US20030235252A1 (en) * 2002-06-19 2003-12-25 Jose Tellado Method and system of biasing a timing phase estimate of data segments of a received signal
US6876727B2 (en) * 2002-07-24 2005-04-05 Sbc Properties, Lp Voice over IP method for developing interactive voice response system
DE60217098T2 (en) * 2002-08-13 2007-05-03 Matsushita Electric Industrial Co., Ltd., Kadoma Hybrid automatic repeat request protocol
DE60209067T2 (en) * 2002-09-13 2006-11-02 Winbond Electronics Corp. Method for the parallel transmission of data frames by means of independent stop & wait protocols for each channel, which allows the reception-side reordering of the data frames
US7042857B2 (en) * 2002-10-29 2006-05-09 Qualcom, Incorporated Uplink pilot and signaling transmission in wireless communication systems
US7505486B2 (en) * 2002-11-19 2009-03-17 Hewlett-Packard Development Company, L.P. Degradable network data path transmission scheme
US7599655B2 (en) * 2003-01-02 2009-10-06 Qualcomm Incorporated Method and apparatus for broadcast services in a communication system
US7586874B2 (en) * 2003-01-06 2009-09-08 Interdigital Technology Corporation Wireless communication method and apparatus for providing multimedia broadcast services
US7181666B2 (en) * 2003-04-29 2007-02-20 Qualcomm, Incorporated Method, apparatus, and system for user-multiplexing in multiple access systems with retransmission
US7177297B2 (en) * 2003-05-12 2007-02-13 Qualcomm Incorporated Fast frequency hopping with a code division multiplexed pilot in an OFDMA system
EP1489773A1 (en) * 2003-06-16 2004-12-22 Mitsubishi Electric Information Technology Centre Europe B.V. Time scheduling with stop-and-wait ARQ process
KR100688851B1 (en) * 2003-06-18 2007-03-02 니폰덴신뎅와 가부시키가이샤 Radio packet communication method and radio packet communication apparatus
CA2701502C (en) 2003-06-18 2014-08-05 Nippon Telegraph And Telephone Corporation Wireless packet communication method
US7623836B1 (en) 2003-06-19 2009-11-24 Intel Corporation Antenna selection for multicarrier communications
US8098818B2 (en) * 2003-07-07 2012-01-17 Qualcomm Incorporated Secure registration for a multicast-broadcast-multimedia system (MBMS)
US8718279B2 (en) * 2003-07-08 2014-05-06 Qualcomm Incorporated Apparatus and method for a secure broadcast system
US20050224596A1 (en) * 2003-07-08 2005-10-13 Panopoulos Peter J Machine that is an automatic pesticide, insecticide, repellant, poison, air freshener, disinfectant or other type of spray delivery system
US20050047366A1 (en) * 2003-08-25 2005-03-03 Motorola, Inc. Random access communication opportunity method
US8724803B2 (en) * 2003-09-02 2014-05-13 Qualcomm Incorporated Method and apparatus for providing authenticated challenges for broadcast-multicast communications in a communication system
JP3723980B2 (en) * 2003-12-22 2005-12-07 横河電機株式会社 Communication control system
US8611283B2 (en) * 2004-01-28 2013-12-17 Qualcomm Incorporated Method and apparatus of using a single channel to provide acknowledgement and assignment messages
KR101042813B1 (en) * 2004-02-17 2011-06-20 삼성전자주식회사 Method for transmission of the ACK/NACK for Uplink Enhancement in Time Division duplexing mobile communication system
DE602004002086T2 (en) * 2004-02-27 2007-04-12 Mitsubishi Denki K.K. Method and apparatus for the shared dynamic management of window lengths of multiple ARQ data connections
KR100989314B1 (en) * 2004-04-09 2010-10-25 삼성전자주식회사 display apparatus
US8891349B2 (en) 2004-07-23 2014-11-18 Qualcomm Incorporated Method of optimizing portions of a frame
US7643503B2 (en) * 2004-07-30 2010-01-05 Sony Corporation System and method for dynamically determining retransmit buffer time
GB2417400B (en) * 2004-08-18 2008-12-03 Wecomm Ltd Network data transmission
EP1628429A3 (en) * 2004-08-19 2011-06-01 Infineon Technologies AG Method for transmitting information with an acknowledgement scheme and respective communication system
US20060039282A1 (en) * 2004-08-23 2006-02-23 Lucent Technologies, Inc. Outer loop power control for high speed data transmissions
US7498443B2 (en) * 2004-09-17 2009-03-03 Albany Molecular Research, Inc. Process for production of carebastine
US7801125B2 (en) * 2004-10-22 2010-09-21 Cisco Technology, Inc. Forwarding table reduction and multipath network forwarding
US7602720B2 (en) * 2004-10-22 2009-10-13 Cisco Technology, Inc. Active queue management methods and devices
US7969971B2 (en) 2004-10-22 2011-06-28 Cisco Technology, Inc. Ethernet extension for the data center
US8238347B2 (en) 2004-10-22 2012-08-07 Cisco Technology, Inc. Fibre channel over ethernet
US7564869B2 (en) * 2004-10-22 2009-07-21 Cisco Technology, Inc. Fibre channel over ethernet
US7830793B2 (en) * 2004-10-22 2010-11-09 Cisco Technology, Inc. Network device architecture for consolidating input/output and reducing latency
US7839940B2 (en) * 2004-11-22 2010-11-23 Nokia Corporation Ordered retransmissions for ARQ in multicarrier systems
US8831115B2 (en) * 2004-12-22 2014-09-09 Qualcomm Incorporated MC-CDMA multiplexing in an orthogonal uplink
US8238923B2 (en) * 2004-12-22 2012-08-07 Qualcomm Incorporated Method of using shared resources in a communication system
US8661322B2 (en) * 2004-12-22 2014-02-25 Qualcomm Incorporated Apparatus and method for selective response to incremental redundancy transmissions
US7453849B2 (en) * 2004-12-22 2008-11-18 Qualcomm Incorporated Method of implicit deassignment of resources
US7864715B2 (en) * 2005-03-28 2011-01-04 Kyocera Corporation Data communication method, communication server system, and communication terminal
CN101208894B (en) * 2005-05-23 2011-09-07 艾利森电话股份有限公司 Automatic repeat request (ARQ) protocol having multiple complementary feedback mechanisms
US7961621B2 (en) 2005-10-11 2011-06-14 Cisco Technology, Inc. Methods and devices for backward congestion notification
US8995466B2 (en) * 2005-12-22 2015-03-31 Qualcomm Incorporated Communications methods and apparatus for using a single logical link with multiple physical layer connections
TWI427958B (en) * 2005-12-29 2014-02-21 Interdigital Tech Corp Method and apparatus for selecting multiple transport formats and transmitting multiple transport blocks simultaneously with multiple h-arq processes
US8432794B2 (en) 2005-12-29 2013-04-30 Interdigital Technology Corporation Method and apparatus for selecting multiple transport formats and transmitting multiple transport blocks simultaneously with multiple H-ARQ processes
EP2518928B1 (en) 2006-02-03 2021-06-09 InterDigital Technology Corporation Method and system for supporting multiple hybrid automatic repeat request processes per transmission time interval
EP1936853B1 (en) * 2006-12-20 2018-11-21 Panasonic Intellectual Property Corporation of America Avoidance of feedback collision in mobile communications
US8259720B2 (en) 2007-02-02 2012-09-04 Cisco Technology, Inc. Triple-tier anycast addressing
US8149710B2 (en) 2007-07-05 2012-04-03 Cisco Technology, Inc. Flexible and hierarchical dynamic buffer allocation
JP2009044581A (en) 2007-08-10 2009-02-26 Fujitsu Ltd Communication device, transmission method, and reception method
US8121038B2 (en) 2007-08-21 2012-02-21 Cisco Technology, Inc. Backward congestion notification
JP4587053B2 (en) * 2007-08-28 2010-11-24 日本電気株式会社 Communication apparatus, communication system, packet loss detection method, and packet loss detection program
US8116271B2 (en) * 2008-02-07 2012-02-14 Samsung Electronics Co., Ltd. Methods and apparatus to allocate acknowledgement channels
KR101515042B1 (en) * 2008-08-04 2015-04-24 삼성전자주식회사 Apparatus and method for processing a message to assign uplink resource
WO2010016669A2 (en) * 2008-08-04 2010-02-11 Samsung Electronics Co., Ltd. Signal transmission method and apparatus for user equipment in mobile communication system
US8942208B2 (en) * 2009-06-22 2015-01-27 Qualcomm Incorporated Wireless communication having reduced feedback delay
US8645785B2 (en) * 2011-03-14 2014-02-04 Freescale Semiconductor, Inc. Method of re-ordering received data blocks in hybrid automatic repeat request telecommunication system
DE102011015966B4 (en) 2011-04-04 2017-07-06 Wago Verwaltungsgesellschaft Mbh automation system
WO2013027247A1 (en) * 2011-08-25 2013-02-28 富士通株式会社 Information processing device and method for controlling information processing device
US9823864B2 (en) 2014-06-02 2017-11-21 Micron Technology, Inc. Systems and methods for throttling packet transmission in a scalable memory system protocol
US10554761B2 (en) * 2015-12-12 2020-02-04 At&T Intellectual Property I, Lp Methods and apparatus to improve transmission of a field data set to a network access point via parallel communication sessions

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0219049B1 (en) * 1985-10-07 1992-09-02 Nec Corporation High-speed packet-switched communications system with end-to-end flow control and retransmission
US4970714A (en) * 1989-01-05 1990-11-13 International Business Machines Corp. Adaptive data link protocol
US5453981A (en) * 1990-10-16 1995-09-26 Kabushiki Kaisha Toshiba Method of controlling communication network incorporating virtual channels exchange nodes and virtual paths exchange nodes
JP2576780B2 (en) * 1993-12-17 1997-01-29 日本電気株式会社 Protocol termination method

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
D. BERTSEKAS; R. GALLAGER: "Data Networks", 1992, PRENTICE HALL INTERNATIONAL, INC.
JIN-FU CHANG ET AL: "MULTICHANNEL ARQ PROTOCOLS", IEEE TRANSACTIONS ON COMMUNICATIONS, vol. 41, no. 4, 1 April 1993 (1993-04-01), pages 592 - 598, XP000372700 *
NACHUM SHACHAM ET AL: "A SELECTIVE-REPEAT ARQ PROTOCOL FOR PARALLEL CHANNELS AND ITS RESEQUENCING ANALYSIS", IEEE TRANSACTIONS ON COMMUNICATIONS, vol. 40, no. 4, 1 April 1992 (1992-04-01), pages 773 - 782, XP000297814 *
NACHUN SHACHAM ET AL: "A SELECTIVE-REPEAT ARQ PROTOCOL FOR PARALLEL CHANNELS AND ITS RESEQUENCING ANALYSIS", COMPUTER COMMUNICATION TECHNOLOGIES FOR THE 90'S, TEL AVIV, 30 October 1988 (1988-10-30) - 3 November 1988 (1988-11-03), pages 259 - 264, XP000077386 *
WAN-CHEN WU ET AL: "PERFORMANCE ANALYSIS OF MULTI-CHANNEL ARQ PROTOCOLS", PROCEEDINGS OF THE MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, DETROIT, vol. 2, no. 36, 16 August 1993 (1993-08-16) - 18 August 1993 (1993-08-18), INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, pages 1328 - 1331, XP000499819 *

Cited By (31)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8479305B1 (en) 1995-02-01 2013-07-02 Rovi Solutions Corporation Method and system for managing a data object so as to comply with predetermined conditions for usage
US8474058B2 (en) 1995-02-01 2013-06-25 Rovi Solutions Corporation Method and system for managing a data object so as to comply with predetermined conditions for usage
US8479306B1 (en) 1995-02-01 2013-07-02 Rovi Solutions Corporation Method and system for managing a data object so as to comply with predetermined condition for usage
US7065068B2 (en) 1999-12-29 2006-06-20 Motorola, Inc. Multi channel stop and wait ARQ communication method and apparatus
EP1247367A1 (en) * 1999-12-29 2002-10-09 Motorola, Inc. Multi channel stop and wait arq communication method and apparatus
EP1247367A4 (en) * 1999-12-29 2003-03-05 Motorola Inc Multi channel stop and wait arq communication method and apparatus
US7167475B2 (en) 2000-02-14 2007-01-23 Nokia Corporation Data packet numbering in packet-switched data transmission
EP1204245A2 (en) * 2000-10-11 2002-05-08 Philips Corporate Intellectual Property GmbH Wireless network with exchange of data according to the ARQ method
EP1204245A3 (en) * 2000-10-11 2003-10-08 Philips Intellectual Property & Standards GmbH Wireless network with exchange of data according to the ARQ method
EP1231736A3 (en) * 2001-02-09 2003-05-28 Samsung Electronics Co., Ltd. Wireless data communication
EP1643673A1 (en) * 2001-02-09 2006-04-05 Samsung Electronics Co, Ltd Wireless data communication
US7203483B2 (en) 2001-02-09 2007-04-10 Samsung Electronics Co., Ltd. Wireless communication apparatus, method thereof and wireless communication system employing the same
EP1231736A2 (en) * 2001-02-09 2002-08-14 Samsung Electronics Co., Ltd. Wireless data communication
WO2002082828A3 (en) * 2001-04-09 2003-01-30 Siemens Ag Packet-oriented data transmission between radio stations in a communication system by means of an n-channel stop and wait (saw) automatic repeat request (arq) method
WO2002082828A2 (en) * 2001-04-09 2002-10-17 Siemens Aktiengesellschaft Packet-oriented data transmission between radio stations in a communication system by means of an n-channel stop and wait (saw) automatic repeat request (arq) method
US7519018B2 (en) 2001-08-24 2009-04-14 Interdigital Technology Corporation Method for physical layer automatic repeat request for a subscriber unit
US7672265B2 (en) 2001-08-24 2010-03-02 Interdigital Technology Corporation Method for physical layer automatic repeat request for a base station
US7096027B2 (en) * 2001-10-04 2006-08-22 Mitsubishi Denki Kabushiki Kaisha Communication method, communication system and communication apparatus
US8351400B2 (en) 2004-05-05 2013-01-08 Qualcomm Incorporated Method and apparatus for overhead reduction in an enhanced uplink in a wireless communication system
US8503452B2 (en) 2005-03-21 2013-08-06 Qualcomm Incorporated Method and apparatus for improving data transmission reliability in a wireless communications system
US9014192B2 (en) 2005-03-21 2015-04-21 Qualcomm Incorporated Method and apparatus for improving data transmission reliability in a wireless communications system
US9407418B2 (en) 2005-03-29 2016-08-02 Qualcomm Incorporated Channelizing packet acknowledgments for multiple data channels in wireless communication
US9319201B2 (en) 2005-03-29 2016-04-19 Qualcomm Incorporated Reverse link pilot with selective gating in wireless communication
US9350514B2 (en) 2005-03-29 2016-05-24 Qualcomm Incorporated Sending full channel quality indication reports on TDM channel in wireless communication
US9973293B2 (en) 2005-03-29 2018-05-15 Qualcomm Incorporated Sending full channel quality indication reports on TDM channel in wireless communication
US10313086B2 (en) 2005-03-29 2019-06-04 Qualcomm Incorporated Sending full channel quality indication reports on TDM channel in wireless communication
US10944533B2 (en) 2005-03-29 2021-03-09 Qualcomm Incorporated Method and apparatus for high rate data transmission in wireless communication
US11251926B2 (en) 2005-03-29 2022-02-15 Qualcomm Incorporated Sending full channel quality indication reports on TDM channel in wireless communication
EP2045946A2 (en) * 2007-10-02 2009-04-08 Infineon Technologies AG Retransmission in data communication systems
EP2045946A3 (en) * 2007-10-02 2013-03-06 Infineon Technologies AG Retransmission in data communication systems
WO2020226680A1 (en) * 2019-05-03 2020-11-12 Huawei Technologies Co. Ltd. Adaptive reordering in multiband communication systems

Also Published As

Publication number Publication date
CO4790192A1 (en) 1999-05-31
JP2001516177A (en) 2001-09-25
AR016825A1 (en) 2001-08-01
CN1132365C (en) 2003-12-24
JP4146079B2 (en) 2008-09-03
CN1275279A (en) 2000-11-29
MY116270A (en) 2003-12-31
EE200000108A (en) 2000-12-15
AU747369B2 (en) 2002-05-16
EP1005732A1 (en) 2000-06-07
HK1031962A1 (en) 2001-06-29
BR9811240A (en) 2000-08-15
EP1005732B1 (en) 2011-08-31
AU8469998A (en) 1999-03-08
KR20010023029A (en) 2001-03-26
US6021124A (en) 2000-02-01

Similar Documents

Publication Publication Date Title
US6021124A (en) Multi-channel automatic retransmission query (ARQ) method
US5477550A (en) Method for communicating data using a modified SR-ARQ protocol
KR101265637B1 (en) method of transmitting data using a plurality of HARQ process channel sequentially
US7181666B2 (en) Method, apparatus, and system for user-multiplexing in multiple access systems with retransmission
US8023420B2 (en) Automatic retransmission and error recovery for packet oriented point-to-multipoint communication
US7054316B2 (en) Method and system for interlayer control between re-sequencing and retransmission entities
US7444443B2 (en) Method of repeating data transmission between network devices by timing a first predetermined period after previous first data transmission
US7065068B2 (en) Multi channel stop and wait ARQ communication method and apparatus
US20050237965A1 (en) Method and devices for multicasting information over a network that applied a distributed media access control scheme
US20090323564A1 (en) Method for operation of synchronous harq in a wireless communication system
KR101087112B1 (en) Method for Resource Allocation in HARQ
CN101212286A (en) Data transmission method and device using controlled transmission profile
KR20010035467A (en) Apparatus and method for retransmitting data in accordance with radio link protocol in a mobile communication system
Tachikawa et al. ARQ protocols for bi-directional data transmission
KR20070087725A (en) Method for effectively transmitting or receiving data via wireless network, and wireless device thereof
WO2002058345A2 (en) Method for allocating receive buffers to accommodate retransmission scheme in wireless computer networks
KR20070101889A (en) Apparatus and method for efficient node b scheduling in mobile telecommunication system
KR100708190B1 (en) Method for effectively transmitting or receiving data via wireless network, and wireless device thereof
EP1576837B1 (en) Apparatus and method for use in effecting automatic repeat requests in wireless multiple access communications systems
KR20070091970A (en) Method and apparatus for harq reordering using retransmission limit in a mobile communication system
CiilIRe Analysis of throughput efficiency and delay in ARQ systems
CN1555631A (en) Automatic repeat request ARQ error control method and device for different channels
KR20020043794A (en) Transmission of packet data using SR ARQ Method
WO2009098610A2 (en) A method for acknowledging reception of data

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 98810099.1

Country of ref document: CN

AK Designated states

Kind code of ref document: A1

Designated state(s): AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE ES FI GB GE GH GM HU ID IL IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT UA UG UZ VN YU ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW SD SZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 1998935453

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 84699/98

Country of ref document: AU

WWE Wipo information: entry into national phase

Ref document number: 1020007001639

Country of ref document: KR

WWP Wipo information: published in national office

Ref document number: 1998935453

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

NENP Non-entry into the national phase

Ref country code: CA

WWP Wipo information: published in national office

Ref document number: 1020007001639

Country of ref document: KR

WWG Wipo information: grant in national office

Ref document number: 84699/98

Country of ref document: AU

WWR Wipo information: refused in national office

Ref document number: 1020007001639

Country of ref document: KR