US7869395B2 - Methods and apparatus for dynamically adjusting a data packet window size for data packet transmission in a wireless communication network - Google Patents

Methods and apparatus for dynamically adjusting a data packet window size for data packet transmission in a wireless communication network Download PDF

Info

Publication number
US7869395B2
US7869395B2 US11/536,874 US53687406A US7869395B2 US 7869395 B2 US7869395 B2 US 7869395B2 US 53687406 A US53687406 A US 53687406A US 7869395 B2 US7869395 B2 US 7869395B2
Authority
US
United States
Prior art keywords
window size
data packets
round trip
trip time
router system
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.)
Active, expires
Application number
US11/536,874
Other languages
English (en)
Other versions
US20070076626A1 (en
Inventor
Simon Wise
Marc Plumb
Ian M. Patterson
Allan David Lewis
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.)
Malikie Innovations Ltd
Original Assignee
Research in Motion Ltd
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
Priority to US11/536,874 priority Critical patent/US7869395B2/en
Application filed by Research in Motion Ltd filed Critical Research in Motion Ltd
Assigned to RESEARCH IN MOTION LIMITED reassignment RESEARCH IN MOTION LIMITED ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: LEWIS, ALLAN DAVID, PATTERSON, IAN M., PLUMB, MARC, WISE, SIMON
Publication of US20070076626A1 publication Critical patent/US20070076626A1/en
Priority to US12/939,711 priority patent/US8233438B2/en
Publication of US7869395B2 publication Critical patent/US7869395B2/en
Application granted granted Critical
Priority to US13/542,972 priority patent/US8457053B2/en
Assigned to BLACKBERRY LIMITED reassignment BLACKBERRY LIMITED CHANGE OF NAME (SEE DOCUMENT FOR DETAILS). Assignors: RESEARCH IN MOTION LIMITED
Assigned to BLACKBERRY LIMITED reassignment BLACKBERRY LIMITED CHANGE OF NAME (SEE DOCUMENT FOR DETAILS). Assignors: RESEARCH IN MOTION LIMITED
Assigned to MALIKIE INNOVATIONS LIMITED reassignment MALIKIE INNOVATIONS LIMITED ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: BLACKBERRY LIMITED
Assigned to MALIKIE INNOVATIONS LIMITED reassignment MALIKIE INNOVATIONS LIMITED NUNC PRO TUNC ASSIGNMENT (SEE DOCUMENT FOR DETAILS). Assignors: BLACKBERRY LIMITED
Active legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

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
    • H04L1/1867—Arrangements specially adapted for the transmitter end
    • H04L1/187—Details of sliding window management
    • 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/1825—Adaptation of specific ARQ protocol parameters according to transmission conditions
    • 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/188—Time-out mechanisms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0852—Delays
    • H04L43/0864—Round trip delays
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/25—Flow control; Congestion control with rate being modified by the source upon detecting a change of network conditions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/27—Evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/28—Flow control; Congestion control in relation to timing considerations
    • H04L47/283—Flow control; Congestion control in relation to timing considerations in response to processing delays, e.g. caused by jitter or round trip time [RTT]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/29—Flow control; Congestion control using a combination of thresholds
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/326—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the transport layer [OSI layer 4]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
    • H04W8/04—Registration at HLR or HSS [Home Subscriber Server]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/16—Threshold monitoring
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/18—Negotiating wireless communication parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding

Definitions

  • the present disclosure generally relates to a wireless communication system, and more specifically to a system and a method for adaptively adjusting window sizing for datagram delivery to a wireless mobile device based upon a round trip time of the datagram in the wireless communication system.
  • the rate at which data can be transferred to a wireless mobile communication device (“mobile device”) from a client depends upon various factors such as the quality of the mobile device coverage, the type of network in which the mobile device is currently registered and located, network congestion, and the type of the mobile device.
  • Various types of mobile devices with various capabilities may access a common wireless network, or a common wireless transport for web browsing.
  • GSM Global System for Mobile Communications
  • EDGE Enhanced Data rates for Global Evolution
  • GPRS General Packet Radio Service
  • CDMA Code Division Multiple Access
  • EV-DO EVolution Data Only
  • the date rate used for a given wireless transport may be fixed a maximum rat which meets the requirements for the slowest device.
  • a rate wastes the capabilities of faster mobile devices and may be perceived as slow web browsing by the users of the faster mobile devices.
  • Sending more data to mobile devices at faster rates than they are designed to handle can also create problems for the mobile devices and the network.
  • FIG. 1 is an exemplary wireless communication system in which a wireless router system having the adaptive window feature in accordance with at least one of the preferred embodiments may be practiced;
  • FIG. 2 is an exemplary timing diagram for the adaptive window with an increase in the window size for data packet transmissions set between the wireless router system and the mobile device in accordance with at least one of the preferred embodiments;
  • FIG. 3 is an exemplary timing diagram for the adaptive window with a decrease in the window size for data packet transmissions between the wireless router system and the mobile device in accordance with at least one of the preferred embodiments;
  • FIG. 4 is an exemplary flowchart illustrating the process of the adaptive window for data packet transmissions between the wireless router system and the mobile device in accordance with at least one of the preferred embodiments.
  • FIG. 5 is an exemplary block diagram of a wireless router system configured to dynamically adjust a window size for data packet transmission to a wireless mobile communication device through a wireless communication network.
  • a method in a wireless router system for transmitting data packets to a mobile communication device through the wireless communication network based upon a round trip time (RTT) associated with communication of each data packet is provided.
  • the round trip time is a time period between the transmission of each data packet and reception of a corresponding acknowledgment signal from the mobile communication device.
  • a number of data packets matched for a window size are transmitted to the mobile communication device, and a round trip time associated with communication of each of the transmitted data packets is measured.
  • the window size for data packet transmission is re-sized by increasing the window size if the round trip time associated with the communication of each of the transmitted data packets is within a first time threshold, and decreasing the window size if the round trip time associated with the communication of any of the transmitted data packets is more than the first time threshold but less than a second time threshold.
  • the window size is also decreased if the round trip time of any of the transmitted data packets is more than the second time threshold, where each such data packet is further marked as a lost data packet.
  • a number of data packets matched for the re-sized window is subsequently transmitted, including a retransmission any data packets marked as lost.
  • the steps of the method are repeated from the measuring step until data packets to be transmitted are exhausted.
  • the adaptive window techniques of the present disclosure allow newer mobile devices with higher data-rate capabilities, such as EDGE-capable mobile devices, to browse the web quickly while ensuring that older mobile devices with lower data-rate capabilities are not overwhelmed.
  • the adaptive window techniques are designed to dynamically adjust the rate of data transfer from a wireless router system to a wireless mobile communication device (“mobile device”) based upon an overall network traffic condition, including the quality of the mobile device coverage, the type of network in which the mobile device is currently registered and located, network congestion, and the type of the mobile device.
  • a technique which dynamically adjusts the number of data packets transmitted to the mobile device at one time, or the window size, based upon a round trip time (RTT) associated with the data packets.
  • the mobile device may transmit an acknowledgment signal for every packet received individually. If the mobile device supports optimized acknowledgments, it does not transmit an acknowledgment signal for each packet, but instead transmits an acknowledgment signal upon receiving a set of data packets.
  • the wireless router system measures the round trip time as the time period between the transmission of the data packets and the receipt of the acknowledgment signal. The round trip time is indicative of the overall network traffic condition.
  • the wireless router system initially transmits a default number of data packets, matching a default window size, to the mobile device, and measures the round trip times associated with those data packets.
  • Adjustment of the window size is made based on the round trip time of the communication of the data packets. If the round trip time is less than a first time threshold for those data packets, then the window size is increased, allowing more data packets to be transmitted. If the round trip time is more than the first time threshold but less than a second time threshold, then the window size is decreased, allowing less data packets to be transmitted to avoid losing data packets. If the round trip time is more than the second time threshold time, then the data packets having such round trip time are considered lost. The window size is decreased, and the lost packets are re-transmitted within the decreased window size.
  • the transmission of data packets matching the window size and the re-sizing of the window size based upon the round trip time are repeated until all data packets have been transmitted.
  • the window size is increased until a predetermined maximum window size is reached. If a new set of data becomes available for transmission to the same mobile device within a predetermined interval after all previous data packets have been transmitted, the last-used window size is retained for the initial data packet transmission. However, if new set of data becomes available after the predetermined interval after all previous data packets have been transmitted, the default window size is used for the initial data packet transmission.
  • an “in-flight” window (rather than a sliding window which may be utilized in some TCP communications) suitable for the present wireless environment and data applications.
  • a sliding window approach of the prior art may be useful where a stream of data is being communicated, and a first byte needs to be received before a second byte is useful (e.g. a streaming video).
  • the sliding window approach may also be useful where a very large file is being communicated and the receiver does not have sufficient memory available to buffer all of the data (e.g. downloading a new program).
  • the permitted window size is three (3), the sender is allowed to send packets 1 , 2 , 3 . If packet 1 is acknowledged, the sender is permitted to send packet 4 . However, if packet 2 is acknowledged before packet 1 , the sender is not permitted to send any other following packet until packet 1 is acknowledged.
  • the sender is permitted to send another packet to the match the number of packets “in-flight”.
  • several different small independent messages e.g. small incremental changes in data for data-synchronized communication with network applications, e-mail messages/data, calendar appointment message/data
  • the mobile device is able receive (and display, for example) a second message before it receives a first message.
  • an advantage conferred by using a fixed value for the round trip time is that is helps identify the optimal sending rate more quickly, since a large amount of traffic does not have to be sent first in order to calculate a good estimate of the minimum round trip time.
  • the technique is particularly useful when the mobile device is operative to send, over a long period of time, a plurality of relatively short data bursts/messages (e.g. small incremental changes in data for data-synchronized communication with network applications, e-mail messages/data, calendar appointment message/data) with long periods of idle connections between each sending.
  • Another advantage of using a fixed value for the optimal round trip time is that more consistent sharing of the bandwidth is gained across different connections.
  • the previous window size is retained for a predetermined time period (e.g. several minutes, such as between 1 and 10 minutes) and may be returned to more quickly.
  • a predetermined time period e.g. several minutes, such as between 1 and 10 minutes
  • the limit in bandwidth is the RP over-the-air portion, which has less to do with other traffic (which may change quickly) and more to do with where the mobile device is located (which does not change too quickly).
  • the minimum round trip time would need to be re-learned each time a short message had to be sent.
  • the sender of the prior art techniques drops the window size back to one (1) segment as the technique assumes that another device may now be using the network bandwidth. Therefore, the sender is not permitted to quickly start sending data at a fast data rate.
  • FIG. 1 is an exemplary wireless communication system 100 in which a wireless router system 102 having the adaptive window feature in accordance with at least one of the preferred embodiments may be practiced.
  • the wireless communication system 100 includes a plurality of host services (three shown, 104 , 106 , and 108 ), each of which may have a plurality of services such as, but not limited to, e-mail, calendar, Internet web browser, and other applications, available to subscribers.
  • the host services 104 , 106 , and 108 are connected to a communication network 110 such as Internet, which connects to the wireless router system 102 allowing communication between the host services 104 , 106 , and 108 and the wireless router system 102 .
  • the wireless router system 102 may also be connected to a host service, such as a local service 112 , without the communication network 110 .
  • the wireless router system 102 of FIG. 1 is also connected to a plurality of wireless networks (three shown, 114 , 116 , and 118 ), each of which may support a plurality of mobile devices (one in each wireless network is shown, 120 , 122 , and 124 ).
  • the wireless networks 114 , 116 , and 118 may be a cellular telephone network, a two-way paging network, a short range wireless network such as BluetoothTM and a IEEE 802.11 compliant network, and others alike, and the mobile devices 120 , 122 , and 124 are mobile devices compatible with the corresponding wireless network.
  • FIG. 2 is an exemplary timing diagram 200 which reveals an increase in the window size for date packet transmissions between the wireless router system 102 and the mobile device 120 utilizing techniques of at least one of the preferred embodiments.
  • the initial window size which is also the minimum window size, is set to three data packets
  • the window size increment is set to one data packet
  • the maximum window size is set to five data packets
  • the mobile device 120 transmits an acknowledgment signal for each packet received.
  • the wireless router system 102 begins to transmit the first set of data packets 204 , 206 , and 208 , to the mobile device 120 .
  • the wireless router system 102 receives the first acknowledgment signal 210 , which corresponds to data packet 204 , it transmits next data packet 212 , thereby keeping the number of “packets in flight” equal to three.
  • the wireless router system 102 receives acknowledgment signals 214 and 216 corresponding to data packets 206 and 208 , and transmits data packets 218 and 220 . Because the round trip time for each of the first set of data packets 204 , 206 , and 208 is less than a first time threshold 222 , the window size for the packets in flight is increased to four data packets, and the wireless router system transmits data packet 224 after data packet 220 . The wireless router system 102 then receives corresponding acknowledgment signals 226 , 228 , 230 , and 232 within the first time threshold 222 . Although not shown in FIG.
  • the window size would be increased to five data packets if more data packets were available.
  • the wireless router system 102 would have transmitted four data packets in response to receiving each of the acknowledgment signals 226 , 228 , 230 , and 232 , and in addition, would have transmitted another data packet.
  • FIG. 3 is an exemplary timing diagram 300 which reveals a decrease in the window size for data packet transmissions between the wireless router system 102 and the mobile device 120 when utilizing techniques of at least one of the preferred embodiments. In this example, all the conditions are the same as the example in FIG. 2 .
  • the wireless router system 102 has the window size set to four data packets.
  • the wireless router system 102 begins to transmit the four data packets 304 , 306 , 308 , and 310 , to the mobile device 120 .
  • the mobile device 120 then transmits corresponding acknowledgment signal 312 , 314 , 316 , and 318 .
  • the wireless router system 102 transmits data packet 320 , 322 , and 324 in response to receiving the acknowledgment signal 312 , 314 , and 316 within the first time threshold.
  • the window size is decreased to three data packets.
  • a second time threshold is also shown in FIG. 3 as measured against data packet 310 and the corresponding acknowledgment signal 318 .
  • Data packets having round trip times longer than the second time threshold are considered to be lost, and are re-transmitted. Instead of actually measuring the time period longer than the second time threshold, the wireless router system 102 may consider a data packet to be lost if it fails to receive an acknowledgment signal corresponding to the data packet within the second time threshold.
  • FIG. 4 is an exemplary flowchart 400 illustrating the process of the adaptive window for data packet transmissions between the wireless router system 102 and the mobile device 120 in accordance with at least one of the preferred embodiments.
  • the process begins in block 402 and the number of data packets matched for the default window size, which is also the minimum window size, is transmitted from the wireless router system 102 to the mobile device 120 in block 404 .
  • a around trip time (RTT) of each of the transmitted data packets is measured.
  • the mobile device 120 may transmit an acknowledgment signal for every packet received individually.
  • the mobile device 120 if it supports optimized acknowledgments, then it does not transmit an acknowledgment signal for each packet, but instead, transmits an acknowledgment signal upon receiving a set of data packets or upon expiration of a predetermined time period if incomplete set of data packets are received.
  • the wireless router system 102 measures the round trip time as the time period between the transmission of the data packet and the receipt of the corresponding acknowledgment signal. The round trip time is indicative of the overall network traffic condition.
  • the round trip time is determined to be within the first time threshold for the data packets transmitted within the current window in block 408 , indicating the network traffic condition is good, whether the current window size can be increased is checked in block 410 . If the current window size is less than the maximum window size and data packets filing the current window size are in flight, then the window size is increased by one data packet in block 412 . If the current window size is already at the maximum size, the window size is unchanged. If there are more data to be transmitted in block 414 , then the number of data packets matching the window size is transmitted in block 416 . The process then repeats from block 406 .
  • the round trip time for the data packets is determined to be greater than the first time threshold in block 408 , then whether the round trip time is within the second time threshold is determined in block 418 . If the round trip time is within the second time threshold, but is greater than the first time threshold, then whether the current window size can be decreased is checked in block 420 . If the current window size is greater than the minimum window size, then the window size is decreased by one data packet in block 422 . If the current window size is already at the minimum size, then the window size in unchanged. If there are more data to be transmitted in block 414 , then the number of data packets matching the window size is transmitted in block 416 . The process then repeats from block 406 .
  • the data packets associated with the round trip time greater than the second time threshold are considered to be lost.
  • Whether the current window size can be decreased is checked in block 424 . If the current window size is greater then the minimum window size, then the window size is decreased by one data packet in block 426 . If the current window size is already at the minimum size, then the window size is unchanged.
  • the lost data packets are prepared to be re-transmitted in block 428 , and whether there are more data to be transmitted in addition to the lost packets is checked in block 414 . Then the number of data packets, including lost packets, matching the window size is transmitted in block 416 . The process then repeats from block 406 .
  • the timing of the availability of the new data packets is evaluated in block 430 . If the new data packets have become available within a predetermined interval after the initial data is exhausted in block 414 , then these new data packets are first transmitted using the last-used window size in block 416 . If the new data packets have become available after the predetermined interval, then these new data packets are first transmitted using the default window size in block 404 .
  • the window size may be increased or decreased by a single data packet (incrementing/decrementing) when appropriate.
  • the window size may be increased or decreased with use of a predetermined algorithm different from such incrementing/decrementing (i.e. one where the window size is changed at a faster rate than incrementing/decrementing).
  • the predetermined algorithm may be utilized for all such increases and decreases in the window size, or utilized only during or in response to the identification of predetermined events or conditions related to mobile device traffic.
  • the window size adjustment according to the predetermined algorithm may be based on, for example, a current round trip time of communications or an elapsed time since previous successful communications have occurred.
  • the window size adjustment according to the predetermined algorithm may provide for a doubling of the current window size for each increase in window size.
  • a last-used window size may be used for transmitting if more data packets become available for transmitting to the mobile device within a predetermined interval after previous data packets are exhausted, but a default (minimum) window size for transmitting may be used if more data packets become available for transmitting to the mobile device after the predetermined interval.
  • a default window size for transmitting may be used if more data packets become available for transmitting to the mobile device after the predetermined interval.
  • a second variation of the technique after this first use of the default window size, what may immediately follow is the use of the last-used window size for transmitting if any of the more data packets are successfully delivered.
  • the predetermined algorithm e.g. see specific examples above
  • the window size is changed at a faster rate than incrementing/decrementing if any of the more data packets are successfully delivered.
  • the wireless router system utilizes first and second time thresholds for determining adjustments to the window size.
  • the first and second time thresholds are initialized and set based on traffic conditions of a plurality of mobile communication devices (e.g. all of the mobile communication devices) operating in the wireless communication network through the wireless router system (i.e. not only the single mobile device with which communications are taking place).
  • the first and the second time thresholds may be initialized and set based on a round trip time value derived based on round trip times for traffic associated with all of the mobile communication devices operating in the wireless communication network through the wireless router system.
  • This round trip time value may be based on an average of all of the round trip times for the mobile communication devices over a period of time.
  • the wireless router system operates to regularly or periodically derive the round trip time value based on the round trip times for the traffic and dynamically update the first and the second time thresholds per on-going operation.
  • FIG. 5 is an exemplary block diagram of a wireless router system 102 configured to dynamically adjust a window size for data packet transmission to a wireless mobile communication device 120 through a wireless communication network 114 .
  • the wireless router system 102 has a transmitter 502 configured to transmit a number of data packets matched for a window size, and a receiver 504 configured to receive an acknowledgment signal associated with the number of data packets.
  • the mobile device 120 may transmit an acknowledgment signal for every packet received individually. If the mobile device 120 supports optimized acknowledgments, it does not transmit an acknowledgment signal for each packet, but instead, transmits an acknowledgment signal upon receiving a set of data packets or upon expiration of a predetermined time period if incomplete set of data packets are received.
  • the wireless router system 102 has a timer 506 , which is coupled to the transmitter 502 and the receiver 504 .
  • the timer 506 is configured to measure the round trip time associated with the number of data packets, and measures the round trip time as the time period between the transmission of the data packets and the receipt of the acknowledgment signal.
  • the round trip time is indicative of the overall network traffic condition.
  • the wireless router system also has a window size adapter 508 , which is coupled to the timer 506 and the transmitter 502 , and is configured to adapt the window size based upon the round trip time.
  • the window size adapter 508 is configured to increase the window size if the round trip time is within a first time threshold and to decrease the window size if the round trip time is more than the first time threshold.
  • the window size adapter 508 is configured to change the window size by a predetermined increment, such as one data packet, and to increase the window size up to a predetermined maximum size and to decrease down to a predetermined minimum size.
  • the window size adapter 508 is further configured to use a previous window size if more data packets become available within a predetermined interval after the previous data packets are exhausted. If more data become available after the predetermined interval, the window size adapter 508 uses a default window size.
  • the timer 506 is further configured to equate the round trip time to be more than a second time threshold if the receiver 504 fails to receive the acknowledgment signal within the second time threshold.
  • the data packets having the round trip time of more than the second time threshold are considered to be lost and are re-transmitted by the transmitter 502 .
  • an “in-flight” window (rather than a sliding window which may be utilized in some TCP communications) suitable for the present wireless environment and data applications.
  • a sliding window approach of the prior art is useful where a stream of data is being communicated, and a first byte needs to be received before a second byte is useful (e.g. a streaming video).
  • the sliding window approach is also useful where a very large file is being communicated and the receiver does not have sufficient memory available to buffer all of the data (e.g. downloading a new program).
  • the permitted window size is three (3), the sender is permitted to send packets 1 , 2 , 3 . If packet 1 is acknowledged, the sender is permitted to send packet 4 . However, if packet 2 is acknowledged before packet 1 , the sender is not permitted to send any other following packet until packet 1 is acknowledged.
  • the sender is permitted to send another packet to the match the number of packets “in-flight”.
  • several different small independent messages may be sent at the same time, and the mobile device is able receive (and display, for example) a second message before it receives a first message.
  • An advantage conferred by using a fixed value for the optimal round trip time is that it helps identify the optimal sending rate more quickly, since a large amount of traffic does not have to be sent first in order to calculate a good estimate of the minimum round trip time.
  • the technique is particularly useful when the mobile device is operative to send, over a long period of time, a plurality of relatively short data bursts/messages (e.g. small incremental changes in data for data-synchronized communication with network applications, e-mail messages/data, calendar appointment message/data) with long periods of idle connections between each sending.
  • the minimum round trip time would need to be re-learned each time a short message had to be sent.
  • Another advantage of using a fixed value for the optimal round trip time is that more consistent sharing of the bandwidth is gained across different connections.
  • the sender when a connection is idle, the sender drops the window size back to one (1) segment as the technique assumes that another device may now be using the network bandwidth. Therefore, the sender is not permitted to quickly start sending data at a fast data rate.
  • the previous window size is retained for a predetermined time period (e.g. several minutes, such as between 1 and 10 minutes) and may be returned to more quickly. This technique is driven on the assumption that the limit in bandwidth is the RF over-the-air portion, which has less to do with other traffic (which may change quickly) and more to do with where the mobile device is located (which does not change too quickly).
  • a method in a wireless router system for transmitting data packets to a mobile communication device through the wireless communication network based upon a round trip time associated with communication of each data packet is provided.
  • the round trip time is a time period between the transmission of each data packet and reception of a corresponding acknowledgment signal from the mobile communication device.
  • a number of data packets matched for a window size are transmitted to the mobile communication device, and a round trip time associated with communication of each of the transmitted data packets is measured.
  • the window size for data packet transmission is re-sized by increasing the window size if the round trip time associated with the communication of each of the transmitted data packets is within a first time threshold, and decreasing the window size if the round trip time associated with the communication of any of the transmitted data packets is more than the first time threshold but less than a second time threshold.
  • the window size is also decreased if the round trip time of any of the transmitted data packets is more than the second time threshold, where each such data packet is further marked as a lost data packet.
  • a number of data packets matched for the re-sized window is subsequently transmitted, including a retransmission any data packets marked as lost.
  • the steps of the method are repeated from the measuring step until data packets to be transmitted are exhausted.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Environmental & Geological Engineering (AREA)
  • Databases & Information Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Communication Control (AREA)
US11/536,874 2005-09-30 2006-09-29 Methods and apparatus for dynamically adjusting a data packet window size for data packet transmission in a wireless communication network Active 2029-06-25 US7869395B2 (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
US11/536,874 US7869395B2 (en) 2005-09-30 2006-09-29 Methods and apparatus for dynamically adjusting a data packet window size for data packet transmission in a wireless communication network
US12/939,711 US8233438B2 (en) 2005-09-30 2010-11-04 Methods and apparatus for dynamically adjusting a data packet window size for data packet transmission in a wireless communication network
US13/542,972 US8457053B2 (en) 2005-09-30 2012-07-06 Methods and apparatus for dynamically adjusting a data packet window size for data packet transmission in a wireless communication network

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US72285205P 2005-09-30 2005-09-30
US11/536,874 US7869395B2 (en) 2005-09-30 2006-09-29 Methods and apparatus for dynamically adjusting a data packet window size for data packet transmission in a wireless communication network

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/939,711 Continuation US8233438B2 (en) 2005-09-30 2010-11-04 Methods and apparatus for dynamically adjusting a data packet window size for data packet transmission in a wireless communication network

Publications (2)

Publication Number Publication Date
US20070076626A1 US20070076626A1 (en) 2007-04-05
US7869395B2 true US7869395B2 (en) 2011-01-11

Family

ID=37899328

Family Applications (3)

Application Number Title Priority Date Filing Date
US11/536,874 Active 2029-06-25 US7869395B2 (en) 2005-09-30 2006-09-29 Methods and apparatus for dynamically adjusting a data packet window size for data packet transmission in a wireless communication network
US12/939,711 Active US8233438B2 (en) 2005-09-30 2010-11-04 Methods and apparatus for dynamically adjusting a data packet window size for data packet transmission in a wireless communication network
US13/542,972 Active US8457053B2 (en) 2005-09-30 2012-07-06 Methods and apparatus for dynamically adjusting a data packet window size for data packet transmission in a wireless communication network

Family Applications After (2)

Application Number Title Priority Date Filing Date
US12/939,711 Active US8233438B2 (en) 2005-09-30 2010-11-04 Methods and apparatus for dynamically adjusting a data packet window size for data packet transmission in a wireless communication network
US13/542,972 Active US8457053B2 (en) 2005-09-30 2012-07-06 Methods and apparatus for dynamically adjusting a data packet window size for data packet transmission in a wireless communication network

Country Status (5)

Country Link
US (3) US7869395B2 (de)
EP (1) EP1929687B1 (de)
AT (1) ATE511258T1 (de)
CA (1) CA2624671C (de)
WO (1) WO2007036046A1 (de)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080259803A1 (en) * 2005-10-21 2008-10-23 International Business Machines Corporation Method and Apparatus for Adaptive Bandwidth Control with a Bandwidth Guarantee
US20100223395A1 (en) * 2005-10-21 2010-09-02 International Business Machines Corporation Method and Apparatus for Adaptive Bandwidth Control with Defined Priorities for Different Networks
US20110051637A1 (en) * 2005-09-30 2011-03-03 Research In Motion Limited Methods Apparatus For Dynamically Adjusting A Data Packet Window Size For Data Packet Transmission In A Wireless Communication Network
US20140269294A1 (en) * 2013-03-13 2014-09-18 Cisco Technology, Inc. Intra Switch Transport Protocol
US9860185B2 (en) 2013-03-14 2018-01-02 Cisco Technology, Inc. Intra switch transport protocol
US10122645B2 (en) 2012-12-07 2018-11-06 Cisco Technology, Inc. Output queue latency behavior for input queue based device

Families Citing this family (35)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7474614B2 (en) * 2005-10-21 2009-01-06 International Business Machines Corporation Method and apparatus for adaptive bandwidth control with user settings
US8920343B2 (en) 2006-03-23 2014-12-30 Michael Edward Sabatino Apparatus for acquiring and processing of physiological auditory signals
EP2103052B1 (de) 2006-12-28 2012-08-22 Research In Motion Limited Verfahren und vorrichtungen zur vergrösserung des datendurchsatzes durch gruppierung von datenpaketen zu maximalen übertragbaren einheiten
FR2922391B1 (fr) * 2007-10-15 2009-12-04 Canon Kk Procede et dispositif de transmission de donnees
US7916658B2 (en) * 2007-11-08 2011-03-29 Siemens Enterprise Communications Gmbh & Co. Kg Method for congestion detection in packet transmission networks
CN101207461B (zh) * 2007-12-10 2011-04-20 华为技术有限公司 一种门限值自适应调整的方法和装置
US20110158115A1 (en) * 2009-04-01 2011-06-30 Texas Instruments Inc. Power Efficiency and Packet Delivery Ratio Through Micro Rate Control at Access Point Functionality Enabled Devices
WO2011098134A1 (en) * 2010-02-12 2011-08-18 Telefonaktiebolaget L M Ericsson (Publ) Rate adaptation
US9019854B2 (en) 2010-04-26 2015-04-28 Telefonaktiebolaget L M Ericsson (Publ) Method for setting and adjusting a parameter dependent on a round trip time
WO2012005609A1 (en) * 2010-07-08 2012-01-12 Blade Limited File transfer system
US8477618B2 (en) 2010-07-16 2013-07-02 Research In Motion Limited Methods and apparatus for use in communicating data packets within a data packet window having a size that is set based on quality of service (QoS) parameters
EP2408152B1 (de) * 2010-07-16 2013-11-27 BlackBerry Limited Verfahren und Vorrichtung zur Nutzung bei der Übermittlung von Datenpaketen in einem Datenpakete-Fenster, das eine Größe hat, die basierend auf QOS-Parametern eingestellt ist
EP2465035B1 (de) * 2010-09-24 2016-04-27 Intel Corporation Verfahren und system zur erkennung und reduzierung von zugangspunktüberlastungen
US9237324B2 (en) * 2010-10-22 2016-01-12 Phorus, Inc. Playback synchronization
JP5598306B2 (ja) * 2010-12-20 2014-10-01 富士通株式会社 中継装置および通信方法
US20120209413A1 (en) 2011-02-14 2012-08-16 Microsoft Corporation Background Audio on Mobile Devices
US8717916B2 (en) * 2011-03-28 2014-05-06 Citrix Systems, Inc. Systems and methods for learning MSS of services
US9319330B2 (en) * 2011-09-23 2016-04-19 Oracle International Corporation Apparatus and method for avoiding packet losses in a network connection
US10292066B2 (en) * 2011-11-04 2019-05-14 Cisco Technology, Inc. System and method of modifying congestion control based on mobile system information
US9515942B2 (en) 2012-03-15 2016-12-06 Intel Corporation Method and system for access point congestion detection and reduction
KR102132309B1 (ko) * 2012-09-14 2020-07-09 디티에스, 인코포레이티드 재생 동기화
CN104813303B (zh) * 2012-09-14 2018-11-16 Dts（英属维尔京群岛）有限公司 回放同步
US20140281018A1 (en) * 2013-03-13 2014-09-18 Futurewei Technologies, Inc. Dynamic Optimization of TCP Connections
KR101535721B1 (ko) * 2013-10-30 2015-07-10 삼성에스디에스 주식회사 큐잉 지연 추정 방법 및 장치
KR101821513B1 (ko) 2014-02-24 2018-01-23 인텔 아이피 코포레이션 롱 텀 에볼루션 네트워크에서의 사용자 장비의 이동성을 결정하기 위한 사용자 장비, 컴퓨터 판독가능 매체 및 방법
US10409781B2 (en) 2015-04-29 2019-09-10 Box, Inc. Multi-regime caching in a virtual file system for cloud-based shared content
JP6675943B2 (ja) * 2016-07-06 2020-04-08 アルプスアルパイン株式会社 通信装置
CN111769968A (zh) * 2016-11-04 2020-10-13 华为技术有限公司 一种混合接入网络中处理报文的方法及网络设备
US10417235B2 (en) 2017-02-03 2019-09-17 International Business Machines Corporation Window management in a stream computing environment
US10929210B2 (en) 2017-07-07 2021-02-23 Box, Inc. Collaboration system protocol processing
US11470131B2 (en) 2017-07-07 2022-10-11 Box, Inc. User device processing of information from a network-accessible collaboration system
US10389407B2 (en) * 2017-11-17 2019-08-20 Texas Instruments Incorporated Electrical transformer to transmit data and power
CN111246421B (zh) * 2019-12-31 2023-03-31 航天信息股份有限公司 传输数据的方法、装置、存储介质以及电子设备
US11811877B2 (en) 2021-05-13 2023-11-07 Agora Lab, Inc. Universal transport framework for heterogeneous data streams
US20220368765A1 (en) * 2021-05-13 2022-11-17 Agora Lab, Inc. Universal Transport Framework For Heterogeneous Data Streams

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5727002A (en) 1995-01-19 1998-03-10 Starburst Communications Corporation Methods for transmitting data
WO2001050637A1 (en) 1999-12-29 2001-07-12 Samsung Electronics Co., Ltd. Data transmitting method in a cdma system
US20020146037A1 (en) 2001-03-02 2002-10-10 Shigeru Sugaya Wireless transmission apparatus and wireless transmission method
US20030035420A1 (en) * 2000-08-18 2003-02-20 Zhisheng Niu TCP aware local retransmissioner scheme for unreliable transmission network
WO2003043258A1 (en) 2001-11-09 2003-05-22 Cyneta Networks, Inc. Weighted wireless early detection
US6646987B1 (en) 1998-10-05 2003-11-11 Nortel Networks Limited Method and system for transmission control protocol (TCP) packet loss recovery over a wireless link
WO2004010657A1 (en) 2002-07-19 2004-01-29 Telefonaktiebolaget Lm Ericsson (Publ) Method for calculating a transmission window size
US6707869B1 (en) * 2000-12-28 2004-03-16 Nortel Networks Limited Signal-processing apparatus with a filter of flexible window design
WO2005002148A1 (en) 2003-06-27 2005-01-06 Ipwireless, Inc. Method and arrangement for tcp flow control
US6901081B1 (en) * 1999-08-17 2005-05-31 Telefonaktiebolaget Lm Ericsson (Publ) Method and device for determining a time-parameter
US7154868B1 (en) * 2002-01-08 2006-12-26 Utstarcom, Inc. Smooth handoff via state exchange in wireless networks

Family Cites Families (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5193151A (en) * 1989-08-30 1993-03-09 Digital Equipment Corporation Delay-based congestion avoidance in computer networks
US7200111B2 (en) * 2000-08-31 2007-04-03 The Regents Of The University Of California Method for improving TCP performance over wireless links
US7382749B2 (en) * 2002-11-26 2008-06-03 Sony Corporation Systems, methods, and apparatus with a common wireless communications protocol
US7583594B2 (en) * 2003-01-31 2009-09-01 Texas Instruments Incorporated Adaptive transmit window control mechanism for packet transport in a universal port or multi-channel environment
CN1689277A (zh) 2003-04-04 2005-10-26 富士通株式会社 无线电接入系统中的移动终端和无线电接入点
SE0301053D0 (sv) 2003-04-07 2003-04-07 Ericsson Telefon Ab L M Method and system in a communications network
US7075890B2 (en) * 2003-06-06 2006-07-11 Meshnetworks, Inc. System and method to provide fairness and service differentation in ad-hoc networks
JP4235506B2 (ja) * 2003-08-14 2009-03-11 株式会社エヌ・ティ・ティ・ドコモ 送信装置、中継装置およびプログラム
US7376143B2 (en) * 2003-09-30 2008-05-20 Intel Corporation Systems and methods for contention control in wireless networks
JP4417733B2 (ja) * 2004-01-15 2010-02-17 ソニー・エリクソン・モバイルコミュニケーションズ株式会社 伝送方法及び装置
US8125910B2 (en) * 2004-06-25 2012-02-28 Nec Corporation Communication system
KR100886060B1 (ko) * 2004-11-05 2009-02-26 메시네트웍스, 인코포레이티드 멀티호핑 통신 네트워크에서 노드간의 루트를 선택하기위해 정체-인식 라우팅 메트릭을 제공하기 위한 시스템 및방법
US20060133281A1 (en) * 2004-12-20 2006-06-22 Motorola, Inc. System for managing round trip time of a transmission control protocol and supporting method and apparatus
CN101208982A (zh) 2005-05-03 2008-06-25 诺基亚公司 用信号发送用于多媒体会话的服务质量（qos）参数
ATE511258T1 (de) 2005-09-30 2011-06-15 Research In Motion Ltd Verfahren und vorrichtungen zum dynamischen justieren einer datenpaket-fenstergrösse für die datenpaketübertragung in einem drahtlosen kommunikationsnetz
US8477614B2 (en) * 2006-06-30 2013-07-02 Centurylink Intellectual Property Llc System and method for routing calls if potential call paths are impaired or congested
US7684332B2 (en) * 2006-08-22 2010-03-23 Embarq Holdings Company, Llc System and method for adjusting the window size of a TCP packet through network elements

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5727002A (en) 1995-01-19 1998-03-10 Starburst Communications Corporation Methods for transmitting data
US6646987B1 (en) 1998-10-05 2003-11-11 Nortel Networks Limited Method and system for transmission control protocol (TCP) packet loss recovery over a wireless link
US6901081B1 (en) * 1999-08-17 2005-05-31 Telefonaktiebolaget Lm Ericsson (Publ) Method and device for determining a time-parameter
WO2001050637A1 (en) 1999-12-29 2001-07-12 Samsung Electronics Co., Ltd. Data transmitting method in a cdma system
US20030035420A1 (en) * 2000-08-18 2003-02-20 Zhisheng Niu TCP aware local retransmissioner scheme for unreliable transmission network
US6707869B1 (en) * 2000-12-28 2004-03-16 Nortel Networks Limited Signal-processing apparatus with a filter of flexible window design
US20020146037A1 (en) 2001-03-02 2002-10-10 Shigeru Sugaya Wireless transmission apparatus and wireless transmission method
WO2003043258A1 (en) 2001-11-09 2003-05-22 Cyneta Networks, Inc. Weighted wireless early detection
US7154868B1 (en) * 2002-01-08 2006-12-26 Utstarcom, Inc. Smooth handoff via state exchange in wireless networks
WO2004010657A1 (en) 2002-07-19 2004-01-29 Telefonaktiebolaget Lm Ericsson (Publ) Method for calculating a transmission window size
WO2005002148A1 (en) 2003-06-27 2005-01-06 Ipwireless, Inc. Method and arrangement for tcp flow control

Non-Patent Citations (20)

* Cited by examiner, † Cited by third party
Title
Annika Wennstr Om, Stefan Alfredsson, and Anna Brunstrom, TCP over Wireless Networks, pp. 1-34, the authors.
Chen, Jin-Ru et al., "An End-To-End Flow Control Approach Based On Round Trip Time", Computer Communications, Elsevier Science Publishers, Amsterdam NL, vol. 23, Sep. 30, 2000, pp. 1537-1547.
Congestion Control for High Bandwidth Delay Product Networks, pages, DMinlaTKLaCtaSbi .. MarklCHSaIndley ChaTrelilelaRbsohrs dk@mit.edu mjh@icsi.berkeley.edu crhors@mit.edu.
Congestion Control for High Bandwidth Delay Product Networks, pages, DMinlaTKLaCtaSbi •• MarklCHSaIndley ChaTrelilelaRbsohrs dk@mit.edu mjh@icsi.berkeley.edu crhors@mit.edu.
EPO Search Report for EP Patent Application No. 06790769.1, Mar. 5, 2009.
International Preliminary Report on Patentability for International Patent Application PCT/CA2006/001605, Apr. 1, 2008.
International Search Report for PCT application # PCT/CA2006/001605, Dated Jan. 26, 2007.
John Nagle, "Congestion Control in IP/TCP Inter Networks", pp. 1-10, Jan. 6, 1984, Network Working Group.
Lawrence S. Brakmo and Larry L. Peterson, TCP Vegas: End to End Congestion Avoidance on a Global Internet, 22 pgs., University of Arizona, Tucson, AZ 85721.
Lawrence S. Brakmo, Sean W. O' Malley, Larry L. Peterson, TCP Vegas: New Techniques for Congestion Detection and Avoidance, 12 pgs. University of Arizona, Tucson, AZ 85721.
M. Handley, J. Padhye, S. Floyd, J. PadhyeTCP Congestion Window Validation, pp. 1-11, Jun. 2000, Network Working Group.
Masayoshi Nabeshima, Kouji Yata, Improving the Convergence time of Highspeed TCP, pp. 1-5, NTT Cyber Solutions Laboratories, NTT Corporation, Yokosuka-shi, 239-0847 Japan.
S. Floyd, Congestion Control Principles, pp. 1-17, Sep. 2000, Network Working Group.
Sakia, Dilip KR; Dahal, Manoj, "Packet Loss Free Congestion Control In TCP For Controlled Packet Latency And Optimal Throughput", IEEE TENCON 2003, vol. 1, XP010687089, pp. 313-317, NY, IEEE, USA.
Sally Floyd, HighSpeed TCP for Large Congestion Windows, pp. 1-24, Internet Engineering Task Force Aug. 2002, ICSI.
Sally Ford, Congestion Control for High-Bandwidth-Delay-Product Networks: XCP vs. HighSpeed TCP and QuickStart, pp. 1-20, Sep. 11, 2002, ICIR.
Sally Ford, Limited Slow-Start for TCP with Large Congestion Windows, pp. 1-6, Internet Engineering Task Force Aug. 2002, ICSI.
Sally Ford, Sylvia Ratnasamy, Scott Shenker, Modifying TCP's Congestion Control for High Speeds, pp. 1-5, May 5, 2002.
Srisankar S. Kunniyur, AntiECN Marking: A Marking Scheme for High Bandwidth Delay Connections, pp. 1-12, May 2003.
Venkataramani, Arun et al., TCP Nice: A Mechanism For Background Transfers, Proceedings of the usenix symposium on operating systems design and implementation, XP002412375, pp. 329-343, Dec. 1, 2002.

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8233438B2 (en) * 2005-09-30 2012-07-31 Research In Motion Limited Methods and apparatus for dynamically adjusting a data packet window size for data packet transmission in a wireless communication network
US8457053B2 (en) 2005-09-30 2013-06-04 Research In Motion Limited Methods and apparatus for dynamically adjusting a data packet window size for data packet transmission in a wireless communication network
US20110051637A1 (en) * 2005-09-30 2011-03-03 Research In Motion Limited Methods Apparatus For Dynamically Adjusting A Data Packet Window Size For Data Packet Transmission In A Wireless Communication Network
US8493859B2 (en) 2005-10-21 2013-07-23 International Business Machines Corporation Method and apparatus for adaptive bandwidth control with a bandwidth guarantee
US8284796B2 (en) 2005-10-21 2012-10-09 International Business Machines Corporation Method and apparatus for adaptive bandwidth control with defined priorities for different networks
US20100223395A1 (en) * 2005-10-21 2010-09-02 International Business Machines Corporation Method and Apparatus for Adaptive Bandwidth Control with Defined Priorities for Different Networks
US20080259803A1 (en) * 2005-10-21 2008-10-23 International Business Machines Corporation Method and Apparatus for Adaptive Bandwidth Control with a Bandwidth Guarantee
US8811424B2 (en) 2005-10-21 2014-08-19 International Business Machines Corporation Adaptive bandwidth control with defined priorities for different networks
US9985908B2 (en) 2005-10-21 2018-05-29 International Business Machines Corporation Adaptive bandwidth control with defined priorities for different networks
US10122645B2 (en) 2012-12-07 2018-11-06 Cisco Technology, Inc. Output queue latency behavior for input queue based device
US20140269294A1 (en) * 2013-03-13 2014-09-18 Cisco Technology, Inc. Intra Switch Transport Protocol
US9628406B2 (en) * 2013-03-13 2017-04-18 Cisco Technology, Inc. Intra switch transport protocol
US9860185B2 (en) 2013-03-14 2018-01-02 Cisco Technology, Inc. Intra switch transport protocol

Also Published As

Publication number Publication date
WO2007036046A1 (en) 2007-04-05
US8457053B2 (en) 2013-06-04
CA2624671C (en) 2012-01-03
EP1929687A4 (de) 2009-04-15
CA2624671A1 (en) 2007-04-05
EP1929687A1 (de) 2008-06-11
US20110051637A1 (en) 2011-03-03
US20120275336A1 (en) 2012-11-01
US20070076626A1 (en) 2007-04-05
ATE511258T1 (de) 2011-06-15
US8233438B2 (en) 2012-07-31
EP1929687B1 (de) 2011-05-25

Similar Documents

Publication Publication Date Title
US7869395B2 (en) Methods and apparatus for dynamically adjusting a data packet window size for data packet transmission in a wireless communication network
US8930569B2 (en) Methods and apparatus for optimum file transfers in a time-varying network emvironment
US7898958B2 (en) Communication system
EP2109954B1 (de) Ack-priorisierung in drahtlosen netzen
KR100671002B1 (ko) 전송창 크기 변경 과정을 조정하기 위한 무선 통신 시스템의 수신기 및 송신기 제어 방법
US6747993B2 (en) Method and apparatus for adjusting a communication timer in a communication network
EP2119171B1 (de) Verbessertes datenübertragungsverfahren, system und protokoll
EP1768296A2 (de) Verfahren und Gerät zum Übertragen von Signalisierungsdaten in einem drahtlosen Kommunikationssystem
US20080101290A1 (en) Apparatus for Arq Controlling in Wireless Portable Internet System and Method Thereof
JPWO2008044653A1 (ja) 通信システム、通信装置、通信方法
EP2015500A1 (de) Verfahren und einrichtung zur drahtlosen kommunikation
US20030086403A1 (en) Method for dynamically adjusting the number of retransmissions and NAKs in a communications system implementing TCP/IP
KR100895182B1 (ko) 무선통신 시스템의 전송 제어 방법
US20060116074A1 (en) Communication repeater, communication repeater program, and communication repeater system
US7609639B2 (en) Negative acknowledgment (NAK) suppression
KR100612654B1 (ko) 자동 재송신 요청을 위한 프레임 생성 장치 및 방법
EP1993313A2 (de) Verfahren und Vorrichtung zur Abfrage des Übertragungsstatus in einem drahtlosen Kommunikationssystem
CN101453311B (zh) 一种自动重传请求状态报告的触发方法
US7154850B1 (en) Wireless data transmission using time out control
CN109905206A (zh) 无线通信方法和设备

Legal Events

Date Code Title Description
AS Assignment

Owner name: RESEARCH IN MOTION LIMITED, CANADA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:WISE, SIMON;PLUMB, MARC;PATTERSON, IAN M.;AND OTHERS;REEL/FRAME:018476/0623

Effective date: 20061101

STCF Information on status: patent grant

Free format text: PATENTED CASE

AS Assignment

Owner name: BLACKBERRY LIMITED, ONTARIO

Free format text: CHANGE OF NAME;ASSIGNOR:RESEARCH IN MOTION LIMITED;REEL/FRAME:031249/0583

Effective date: 20130709

AS Assignment

Owner name: BLACKBERRY LIMITED, ONTARIO

Free format text: CHANGE OF NAME;ASSIGNOR:RESEARCH IN MOTION LIMITED;REEL/FRAME:031435/0538

Effective date: 20130709

FPAY Fee payment

Year of fee payment: 4

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1552)

Year of fee payment: 8

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 12

AS Assignment

Owner name: MALIKIE INNOVATIONS LIMITED, IRELAND

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BLACKBERRY LIMITED;REEL/FRAME:064104/0103

Effective date: 20230511

AS Assignment

Owner name: MALIKIE INNOVATIONS LIMITED, IRELAND

Free format text: NUNC PRO TUNC ASSIGNMENT;ASSIGNOR:BLACKBERRY LIMITED;REEL/FRAME:064269/0001

Effective date: 20230511