EP1191764A1 - A method of controlling the time-out in a wireless data TCP transmission - Google Patents

A method of controlling the time-out in a wireless data TCP transmission Download PDF

Info

Publication number
EP1191764A1
EP1191764A1 EP01303140A EP01303140A EP1191764A1 EP 1191764 A1 EP1191764 A1 EP 1191764A1 EP 01303140 A EP01303140 A EP 01303140A EP 01303140 A EP01303140 A EP 01303140A EP 1191764 A1 EP1191764 A1 EP 1191764A1
Authority
EP
European Patent Office
Prior art keywords
channel
time
delay
data
time out
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
EP01303140A
Other languages
German (de)
French (fr)
Inventor
Joseph E. Cloutier
Tejaskumar R. Patel
James C Stekas
Tomas S. Yang
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nokia of America Corp
Original Assignee
Lucent Technologies Inc
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 Lucent Technologies Inc filed Critical Lucent Technologies Inc
Publication of EP1191764A1 publication Critical patent/EP1191764A1/en
Ceased legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/28Flow control; Congestion control in relation to timing considerations
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/19Flow control; Congestion control at layers above the network layer
    • H04L47/193Flow control; Congestion control at layers above the network layer at the transport layer, e.g. TCP related
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/16Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/16Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
    • H04L69/163In-band adaptation of TCP data exchange; In-band control procedures

Definitions

  • the present invention relates to communications; more specifically, wireless communications.
  • TCP Transmission Control Protocol/Internet Protocol
  • IP Transmission Control Protocol/Internet Protocol
  • ACKs acknowledgment messages
  • the ACK scheme In addition to insuring that all transmitted data is correctly received, the ACK scheme also serves to meter the flow of data.
  • the initial transmitted data rate is low and ramps up as ACKs are received through a process called "Slow Start".
  • the Slow Start process begins with the transmitter sending one packet of data and waiting for an acknowledge message from the receiver. After receiving the first ACK, the transmitter then sends two packets of data. Each time an ACK is received in response to a transmission, the number of packets transmitted in the next transmission is increased resulting in an exponential increase in data rate illustrated as Ramp 10 in FIG. 1. Eventually a point is reached when , the maximum data rate of the transmission path is attained (point 12 in FIG. 1) and the transmitter sends data at a rate equal to the rate the receiver acknowledges it.
  • each step up in the ramp involves transmitting one or more packets of data and waiting for one or more acknowledgments from a receiver.
  • the round trip delays may be as little as 1 or 2 milliseconds and as a result, the ramp up period is relatively quick.
  • the round trip delay may be on the order of 100 or 200 milliseconds.
  • the ramp up period in wireless communication systems is relatively long as illustrated by dashed ramp up curve 16.
  • the slower ramp up time results in a waste of channel capacity illustrated by area 18.
  • TCP Normally, errors are indicated by repeated acknowledgements with the same sequence number, indicating that the receiver is receiving data but a packet has been lost.
  • TCP also includes a time out period. If an acknowledgment is not received within the time out period the transmitter will assume all unacknowledged packets are lost and begin retransmission and Slow Start.
  • Such timeouts rarely occur in a wired system because the transmission path is reliable and multiple packet losses are very rare.
  • varying conditions of noise, fading, and channel allocation among multiple users can cause delays in data transmission sufficient to cause TCP timeouts even when no packets are lost. Therefore wireless data are far more vulnerable to time outs than wired systems and their associated slower ramp up of data transmission rates results in a greater reduction of channel capacity per time out.
  • the present invention decreases the probability of a time out and the resulting waste of channel capacity in a communication system by operating in a manner that elevates the length of the time out period so as to minimize the number of time outs that occur.
  • TCP time-over-live
  • the length of the time out is based on the sum of the average channel round trip delay and four times the deviation from the average in the channel round trip delay.
  • a delay is introduced into the communication channel so as to increase the deviation from the average in the channel delay. This results in an increase in the length of time required for a time out.
  • the number of time outs is drastically decreased which in turn decreases the number of wasteful ramp up times that results in a more efficient use of channel capacity.
  • FIG. 2 illustrates the bandwidth of a wireless transmission channel over time. It can be seen that dropouts 30 occur from time to time. These dropouts may be a result of fading, noise or sharing the wireless communication channel among several users. For example, each dropout period 30 may be the time during which another user is granted access to the wireless communication channel. In order to minimize the number of bandwidth wasteful ramp up periods, it is desirable to insert sufficient delays into the wireless communication channel so that that the TCP time out period is greater than most of the dropout periods 30.
  • FIG. 3 illustrates a functional block diagram of a wireless communication channel.
  • Base station 40 receives data from a data source 50 hosting an application using TCP.
  • Base station 40 communicates the data over an air interface to mobile station 60 which passes the received data to a data receiver 70 hosting an application using TCP.
  • the delay can be inserted into the communication channel at either base station 40 or mobile station 60.
  • data is transmitted and received via RF section 80.
  • Channel delay can be inserted into data being transmitted by base station 40 or into acknowledges received by base station 40. Delays may be inserted data transmitted by base station 40 using buffer 82.
  • Buffer 82 may be a shift register or cyclically addressed memory.
  • Processor 84 controls the delay by controlling the number of stages the data must pass through when passing through buffer 84.
  • Processor 84 monitors the channel delay by monitoring acknowledge messages received from RF section 80. As a result, processor 84 can modify the depth or amount of delay added by buffer 82 until the desirable delay is measured as seen by the delay in acknowledges
  • buffer 86 may be a variable length or stage buffer such as a shift register or cyclically addressed memory.
  • processor 84 increases the channel delay as seen by application 50.
  • mobile station 60 may also add delay to the transmission channel.
  • Data is transmitted from and received through RF section 90 of mobile station 60.
  • Processor 92 may control channel delay by controlling the depth of outgoing data buffer 94 or it may control the depth of acknowledge buffer 96. In either case, application 70 sees a greater channel delay which results in a longer TCP time out period. It should be noted that periods of other communication protocols may be controlled in a similar manner, and the approach outlined applies regardless of whether 50 transmits and 70 receives or 70 transmits and 50 receives.
  • FIG. 5 illustrates channel delays as a function of time where delay is added to the channel in order to control and thereby increase the length of the TCP time out.
  • approximately 50 percent of the channel transmissions are not delayed which results in a cluster of channel delays along line 100, which is the average channel delay when no additional delays are added to the channel.
  • Approximately, 50 percent of the transmissions are delayed to produce a second cluster of channel delays along line 102. This produces a larger deviation and results in an average channel delay illustrated by line 104.
  • a bimodal or substantially bimodal delay distribution is achieved. A bimodal distribution is desirable because is maximizes the deviation for a given increase in average delay time.
  • Equation 1 it can be seen that the new time out associated with the delay pattern of FIG. 5, results in a time out (T 2 / 0) that is many times larger than the prior time out of T 1 / 0.
  • T 2 / 0 time out
  • T 0 time out length
  • delay may be added at either the base station or mobile station and it may be added using one or both of the data transmission paths or the acknowledge receive path. It is also possible to control delay by scheduling multiple users to use the same communication channel. This can be accomplished by initially providing each user with a short amount of time using the communication channel. The initial short amount of time should be short enough that a time out does not occur while at the same time increasing the delay in the communication channel per user so that the time out used by the TCP protocol is increased.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Small-Scale Networks (AREA)
  • Communication Control (AREA)

Abstract

The probability of a time out and the resulting waste of channel capacity in a communication system is decreased by controlling the length of the time out period so as to minimize the number of time outs that occur. The length of the time out is based on the sum of the average channel delay and four times the deviation in the channel delay. A delay is introduced into the communication channel so as to increase the deviation in the channel delay. This results in an increase in the length of time required for a time out. As a result, the number of time outs is drastically decreased which in turn decreases the number of wasteful ramp up times that results in a more efficient use of channel capacity.

Description

    Background of the Invention 1. Field of the Invention
  • The present invention relates to communications; more specifically, wireless communications.
  • 2. Description of the Related Art
  • Most wired and wireless data transfers use a common protocol known as TCP/IP (Transmission Control Protocol/Internet Protocol). TCP involves a transmitter sending IP packets of data to a receiver that replies with acknowledgment messages (ACKs) when data is correctly received. Data packets that are lost or corrupted are not acknowledged and are retransmitted until they are received successfully.
  • In addition to insuring that all transmitted data is correctly received, the ACK scheme also serves to meter the flow of data. When TCP transmissions begin, the initial transmitted data rate is low and ramps up as ACKs are received through a process called "Slow Start". The Slow Start process begins with the transmitter sending one packet of data and waiting for an acknowledge message from the receiver. After receiving the first ACK, the transmitter then sends two packets of data. Each time an ACK is received in response to a transmission, the number of packets transmitted in the next transmission is increased resulting in an exponential increase in data rate illustrated as Ramp 10 in FIG. 1. Eventually a point is reached when , the maximum data rate of the transmission path is attained (point 12 in FIG. 1) and the transmitter sends data at a rate equal to the rate the receiver acknowledges it.
  • Transmission at the maximum data rate will be persist until an error occurs indicated by failure of the transmitter to receive an acknowledgement of data sent to the receiver. Should this occur the transmitter assumes the data is lost due to network congestion and invokes the Slow Start procedure. This is illustrated in portion 14. It should be noted that the rate at which the data transmissions are ramped up to the maximum transmission rate, is dependent on how quickly acknowledgments arrive at the transmitter and hence on the the round trip delay in the communication channel. For example, each step up in the ramp involves transmitting one or more packets of data and waiting for one or more acknowledgments from a receiver. In a system such as a wired communication system, the round trip delays may be as little as 1 or 2 milliseconds and as a result, the ramp up period is relatively quick. Unfortunately, in wireless communication systems the round trip delay may be on the order of 100 or 200 milliseconds. As a result, the ramp up period in wireless communication systems is relatively long as illustrated by dashed ramp up curve 16. As a result, in wireless communication systems, the slower ramp up time results in a waste of channel capacity illustrated by area 18.
  • Normally, errors are indicated by repeated acknowledgements with the same sequence number, indicating that the receiver is receiving data but a packet has been lost. To handle cases where many packets are lost, and no acknowledgments are made, TCP also includes a time out period. If an acknowledgment is not received within the time out period the transmitter will assume all unacknowledged packets are lost and begin retransmission and Slow Start. Such timeouts rarely occur in a wired system because the transmission path is reliable and multiple packet losses are very rare. In a wireless system, varying conditions of noise, fading, and channel allocation among multiple users can cause delays in data transmission sufficient to cause TCP timeouts even when no packets are lost. Therefore wireless data are far more vulnerable to time outs than wired systems and their associated slower ramp up of data transmission rates results in a greater reduction of channel capacity per time out.
  • Summary of the Invention
  • The present invention decreases the probability of a time out and the resulting waste of channel capacity in a communication system by operating in a manner that elevates the length of the time out period so as to minimize the number of time outs that occur. In the current version of TCP (dubbed RENO and used by almost all computers on the Internet) the length of the time out is based on the sum of the average channel round trip delay and four times the deviation from the average in the channel round trip delay. A delay is introduced into the communication channel so as to increase the deviation from the average in the channel delay. This results in an increase in the length of time required for a time out. As a result, the number of time outs is drastically decreased which in turn decreases the number of wasteful ramp up times that results in a more efficient use of channel capacity.
  • Brief Description of the Drawings
  • FIG. 1 illustrates data transfer rate vs. time for TCP data transmission;
  • FIG. 2 illustrates an example of a wireless channel's bandwidth as a function of time;
  • FIG. 3 illustrates a functional block diagram of a wireless communication channel;
  • FIG. 4 illustrates variations in channel delays as a function of time; and
  • FIG. 5 illustrates a bimodal distribution of channel delay as a function of time.
  • Detailed Description of the Invention
  • FIG. 2 illustrates the bandwidth of a wireless transmission channel over time. It can be seen that dropouts 30 occur from time to time. These dropouts may be a result of fading, noise or sharing the wireless communication channel among several users. For example, each dropout period 30 may be the time during which another user is granted access to the wireless communication channel. In order to minimize the number of bandwidth wasteful ramp up periods, it is desirable to insert sufficient delays into the wireless communication channel so that that the TCP time out period is greater than most of the dropout periods 30.
  • FIG. 3 illustrates a functional block diagram of a wireless communication channel. Base station 40 receives data from a data source 50 hosting an application using TCP. Base station 40 communicates the data over an air interface to mobile station 60 which passes the received data to a data receiver 70 hosting an application using TCP. The delay can be inserted into the communication channel at either base station 40 or mobile station 60. In base station 40, data is transmitted and received via RF section 80. Channel delay can be inserted into data being transmitted by base station 40 or into acknowledges received by base station 40. Delays may be inserted data transmitted by base station 40 using buffer 82. Buffer 82 may be a shift register or cyclically addressed memory. Processor 84 controls the delay by controlling the number of stages the data must pass through when passing through buffer 84. Processor 84 monitors the channel delay by monitoring acknowledge messages received from RF section 80. As a result, processor 84 can modify the depth or amount of delay added by buffer 82 until the desirable delay is measured as seen by the delay in acknowledges received in response to data transmissions.
  • It is also possible to add delay by using buffer 86 to delay the acknowledge messages passed from base station 40 to application 50. Once again, buffer 86 may be a variable length or stage buffer such as a shift register or cyclically addressed memory. By adjusting the delay provided by buffer 86, processor 84 increases the channel delay as seen by application 50.
  • Whether the delay is provided using buffer 82 or buffer 86, application 50 is made to see longer delays which result in longer TCP time out periods.
  • In a similar fashion, mobile station 60 may also add delay to the transmission channel. Data is transmitted from and received through RF section 90 of mobile station 60. Processor 92 may control channel delay by controlling the depth of outgoing data buffer 94 or it may control the depth of acknowledge buffer 96. In either case, application 70 sees a greater channel delay which results in a longer TCP time out period. It should be noted that periods of other communication protocols may be controlled in a similar manner, and the approach outlined applies regardless of whether 50 transmits and 70 receives or 70 transmits and 50 receives.
  • FIG. 4 illustrates channel delay as a function of time. It can be seen that the channel delay is clustered around an average delay. Additionally, it should be noted that the deviation or the absolute value of the averaged distance between the different data transmission rates and the average transmission rates is rather small. Equation 1 illustrates that the time out (T0) as defined by TCP is the sum of the average channel delay plus four times the deviation of the channel delays. tave + 4 tdev = T0
  • FIG. 5 illustrates channel delays as a function of time where delay is added to the channel in order to control and thereby increase the length of the TCP time out. Assuming the same channel as the channel of FIG. 4, approximately 50 percent of the channel transmissions are not delayed which results in a cluster of channel delays along line 100, which is the average channel delay when no additional delays are added to the channel. Approximately, 50 percent of the transmissions are delayed to produce a second cluster of channel delays along line 102. This produces a larger deviation and results in an average channel delay illustrated by line 104. It should be noted that by delaying approximately 50 percent of the transmissions, a bimodal or substantially bimodal delay distribution is achieved. A bimodal distribution is desirable because is maximizes the deviation for a given increase in average delay time. Using Equation 1 it can be seen that the new time out associated with the delay pattern of FIG. 5, results in a time out (T 2 / 0) that is many times larger than the prior time out of T 1 / 0. As a result, by providing a relatively small increase in the average channel delay, the time out used by TCP is increased dramatically. It is desirable to add delays so that a time out length (T0) is created that is larger than the typical dropout in the wireless communication channel bandwidth.
  • It should be noted that delay may be added at either the base station or mobile station and it may be added using one or both of the data transmission paths or the acknowledge receive path. It is also possible to control delay by scheduling multiple users to use the same communication channel. This can be accomplished by initially providing each user with a short amount of time using the communication channel. The initial short amount of time should be short enough that a time out does not occur while at the same time increasing the delay in the communication channel per user so that the time out used by the TCP protocol is increased.

Claims (6)

  1. A method for controlling communication protocol's timeout, characterized by the step of:
       delaying a portion of a plurality of messages carried on a communications channel.
  2. The method of claim 1, characterized in that the plurality of messages are messages to be transmitted.
  3. The method of claim 1, characterized in that the plurality of messages are received messages.
  4. The method of claim 3, characterized in that the plurality of messages are acknowledge messages.
  5. The method of claim 1, characterized in that the portion of messages are delayed to create a substantially bimodal delay distribution.
  6. The method of claim 1, characterized in that the communication protocol is TCP.
EP01303140A 2000-09-20 2001-04-02 A method of controlling the time-out in a wireless data TCP transmission Ceased EP1191764A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US09/665,724 US7154850B1 (en) 2000-09-20 2000-09-20 Wireless data transmission using time out control
US665724 2000-09-20

Publications (1)

Publication Number Publication Date
EP1191764A1 true EP1191764A1 (en) 2002-03-27

Family

ID=24671321

Family Applications (1)

Application Number Title Priority Date Filing Date
EP01303140A Ceased EP1191764A1 (en) 2000-09-20 2001-04-02 A method of controlling the time-out in a wireless data TCP transmission

Country Status (3)

Country Link
US (1) US7154850B1 (en)
EP (1) EP1191764A1 (en)
JP (1) JP2002135277A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015041686A1 (en) * 2013-09-20 2015-03-26 Hewlett-Packard Development Company, L.P. Snapshot message
US10320689B2 (en) 2016-05-24 2019-06-11 International Business Machines Corporation Managing data traffic according to data stream analysis

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1563634B1 (en) * 2002-11-18 2009-04-08 Telefonaktiebolaget LM Ericsson (publ) Data unit sender and method of controlling the same
JP4214793B2 (en) 2003-02-19 2009-01-28 日本電気株式会社 Wireless communication system, server, base station, mobile terminal, and retransmission timeout time determination method used for them
US7533285B2 (en) * 2004-04-22 2009-05-12 Hewlett-Packard Development Company, L.P. Synchronizing link delay measurement over serial links

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5774479A (en) * 1995-03-30 1998-06-30 Motorola, Inc. Method and system for remote procedure call via an unreliable communication channel using multiple retransmission timers

Family Cites Families (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4769815A (en) * 1987-04-10 1988-09-06 American Telephone And Telegraph Company, At&T Bell Laboratories Packet flow control method
CA2104133A1 (en) * 1992-08-17 1994-02-18 Tsutomu Tanaka Data transmission system with packets having occupied, idle, released, and reset states
US5371734A (en) * 1993-01-29 1994-12-06 Digital Ocean, Inc. Medium access control protocol for wireless network
US5550868A (en) * 1994-03-03 1996-08-27 Lucent Technologies Inc. π/4-DQPSK delay spread detection and compensation apparatus and method
US5570346A (en) * 1994-12-08 1996-10-29 Lucent Technologies Inc. Packet network transit delay measurement system
US6038216A (en) * 1996-11-01 2000-03-14 Packeteer, Inc. Method for explicit data rate control in a packet communication environment without data rate supervision
US6185428B1 (en) * 1998-10-07 2001-02-06 Ericsson Inc System and method for adaptively modifying base station transceiver resources for time of arrival measurements
US6330451B1 (en) * 1998-10-13 2001-12-11 Nortel Networks Limited Selectively delaying data communications in a wireless communication system to provide voice communications capacity
US6240463B1 (en) * 1998-11-24 2001-05-29 Lucent Technologies Inc. Router placement methods and apparatus for designing IP networks with performance guarantees
US6567482B1 (en) * 1999-03-05 2003-05-20 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for efficient synchronization in spread spectrum communications
US6269080B1 (en) * 1999-04-13 2001-07-31 Glenayre Electronics, Inc. Method of multicast file distribution and synchronization
US6697331B1 (en) * 1999-11-17 2004-02-24 Telefonaktiebolaget Lm Ericsson (Publ) Link layer acknowledgement and retransmission for cellular telecommunications
US6477150B1 (en) * 2000-03-03 2002-11-05 Qualcomm, Inc. System and method for providing group communication services in an existing communication system
US6757245B1 (en) * 2000-06-01 2004-06-29 Nokia Corporation Apparatus, and associated method, for communicating packet data in a network including a radio-link
US6791945B1 (en) * 2000-09-15 2004-09-14 Motorola, Inc. Time out threshold shaping for wireless TCP communications

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5774479A (en) * 1995-03-30 1998-06-30 Motorola, Inc. Method and system for remote procedure call via an unreliable communication channel using multiple retransmission timers

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
GOFF ET AL: "Freeze-TCP: a true end-to-end TCP enhancement mechanism for mobile environments", INFOCOM 2000. NINETEENTH ANNUAL JOINT CONFERENCE OF THE IEEE COMPUTER AND COMMUNICATIONS SOCIETIES. PROCEEDINGS. IEEE TEL AVIV, ISRAEL 26-30 MARCH 2000, PISCATAWAY, NJ, USA,IEEE, US, 26 March 2000 (2000-03-26), pages 1537 - 1545, XP010376091, ISBN: 0-7803-5880-5 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015041686A1 (en) * 2013-09-20 2015-03-26 Hewlett-Packard Development Company, L.P. Snapshot message
US9929899B2 (en) 2013-09-20 2018-03-27 Hewlett Packard Enterprises Development LP Snapshot message
US10320689B2 (en) 2016-05-24 2019-06-11 International Business Machines Corporation Managing data traffic according to data stream analysis
US11575613B2 (en) 2016-05-24 2023-02-07 Kyndryl, Inc. Managing data traffic according to data stream analysis

Also Published As

Publication number Publication date
US7154850B1 (en) 2006-12-26
JP2002135277A (en) 2002-05-10

Similar Documents

Publication Publication Date Title
CN112165355B (en) Satellite network-oriented UDP-based reliable data transmission method
EP2068510B1 (en) Communication system, communication device, and communication method
US6934251B2 (en) Packet size control technique
EP1161036B1 (en) Prevent transmission of packets to terminal when the terminal switches to the suspend state in the packet switched service to use a circuit switched service
US20070064631A1 (en) Method and apparatus for transmitting signaling data messages in a wireless communications system
US20030012222A1 (en) method and apparatus for adjusting a communication timer in a communication network
KR100370077B1 (en) Method for Flow Control of data with Window Timer in a Communication System
US6289224B1 (en) Method and apparatus for starting an acknowledgment timer
KR20070015405A (en) Session initiation protocol retransmission method
WO2007036046A1 (en) Methods and apparatus for dynamically adjusting a data packet window size for data packet transmission in a wireless communication network
US6553032B1 (en) Packeting timeout spoofing in a wireless data communications network
CN111193577B (en) Network system communication method and communication device using transmission timeout
EP1798913A2 (en) Transport control method in wireless communication system
Wang et al. Use of TCP decoupling in improving TCP performance over wireless networks
JP4485684B2 (en) Method and apparatus for transmitting data packet in communication system
US7154850B1 (en) Wireless data transmission using time out control
JP2000253096A (en) Method for tcp control
US6530056B1 (en) Method for setting a timer based on previous channel request statistics
EP1505759B1 (en) Method and device for transmitting/receiving data using acknowledged transport layer protocols
EP1323268A2 (en) Dynamic tcp configuration for low latency voice/data traffic
KR100529931B1 (en) Server system communicating through the wireless network
KR100913897B1 (en) Method for controlling congestion of TCP for reducing the number of retransmission timeout
CN115766747A (en) Reliable and efficient transmission method suitable for wireless channel
Jayananthan TCP performance enhancement over wireless networks
Sánchez-Aarnoutse et al. Analysis and performance evaluation of a multicast flow control mechanism for wired-wireless networks.

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20010411

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

AX Request for extension of the european patent

Free format text: AL;LT;LV;MK;RO;SI

AKX Designation fees paid

Free format text: DE FR GB IT

APAB Appeal dossier modified

Free format text: ORIGINAL CODE: EPIDOS NOAPE

APAB Appeal dossier modified

Free format text: ORIGINAL CODE: EPIDOS NOAPE

APAF Appeal reference modified

Free format text: ORIGINAL CODE: EPIDOSCREFNE

APBT Appeal procedure closed

Free format text: ORIGINAL CODE: EPIDOSNNOA9E

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN REFUSED

18R Application refused

Effective date: 20060314