EP0991244A2 - Appareil et procédé de gestion de largeur de bande pour un connexion à base de paquets - Google Patents

Appareil et procédé de gestion de largeur de bande pour un connexion à base de paquets Download PDF

Info

Publication number
EP0991244A2
EP0991244A2 EP99307651A EP99307651A EP0991244A2 EP 0991244 A2 EP0991244 A2 EP 0991244A2 EP 99307651 A EP99307651 A EP 99307651A EP 99307651 A EP99307651 A EP 99307651A EP 0991244 A2 EP0991244 A2 EP 0991244A2
Authority
EP
European Patent Office
Prior art keywords
connection
wnd
packets
data
tcp
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.)
Granted
Application number
EP99307651A
Other languages
German (de)
English (en)
Other versions
EP0991244B1 (fr
EP0991244A3 (fr
Inventor
Alan Stanley John Chapman
Hsiang-Tsung Kung
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.)
Nortel Networks Ltd
Original Assignee
Nortel Networks Ltd
Nortel Networks Corp
Nortel Networks Corp USA
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 Nortel Networks Ltd, Nortel Networks Corp, Nortel Networks Corp USA filed Critical Nortel Networks Ltd
Publication of EP0991244A2 publication Critical patent/EP0991244A2/fr
Publication of EP0991244A3 publication Critical patent/EP0991244A3/fr
Application granted granted Critical
Publication of EP0991244B1 publication Critical patent/EP0991244B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • 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
    • 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/19—Flow control; Congestion control at layers above the network layer
    • H04L47/193—Flow control; Congestion control at layers above the network layer at the transport layer, e.g. TCP related
    • 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
    • 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/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
    • H04L69/163—In-band adaptation of TCP data exchange; In-band control procedures
    • 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/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
    • 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]

Definitions

  • the invention resides generally in the field of digital data transmission through a network.
  • it relates to an apparatus for and method of transmitting digital data in streams of packets while observing guaranteed minimum and/or maximum bandwidth allocations.
  • a packet based transport system In contrast to circuit based transport systems, a packet based transport system allows the access bandwidth to be dynamically allocated. Remote nodes can be represented as logical ports but there is no commitment of bandwidth when this is not needed. The physical access link is fully available for traffic to any destination. In a packet transport system, virtual pipes are provided between any two transport access points. These pipes may be guaranteed some minimum rate of transmission but certainly it is required that an access point can make opportunistic use of spare bandwidth up to some maximum amount. Frame relay as a packet based transport allows more efficient use of bandwidth by permitting statistical multiplexing of data streams, thus allowing it to exploit unused bandwidth. However, there is no mechanism (protocol) to ensure reliable delivery of the frames and under congestion conditions frames are discarded and the higher layer protocols must compensate for the loss.
  • ATM with an effective flow control can provide a lossless but dynamic transport. However, it relies on some reasonable level of complexity at the transport switching points to achieve the flow control, the effectiveness of which has not yet been proven in the field.
  • ATM without flow control requires that cells be discarded under congestion conditions and this discard should be aware of packet boundaries and the impact on the higher layer protocol such as TCP protocol.
  • transport layer a layer under the networking layer and provides pipes between networking layer nodes.
  • OSI open systems interconnect
  • IP layer resides under TCP layer.
  • the IP layer is the network layer in which IP (Internet protocol) runs. An internetwork differs from a single network, because different parts may have wildly different topologies, bandwidth, delays, packet sizes, and other parameters.
  • the TCP layer is the transfer layer in which the TCP (transmission control protocol) runs. The TCP has been used for ensuring reliable transfer of byte stream data between two end points over an internetwork, which may be less reliable.
  • TCP allows a shared and adaptive use of available bandwidth of a transmission link between two end points. It does this by having the sender gradually increase the rate of sending until a packet is lost whereupon it reduces its rate significantly and repeats the gradual increase. Thus, TCP tends to give connections their proportional share of the available bandwidth on a link although different connection characteristics can cause large variations in the sharing.
  • TCP trunking In Internet terminology, aggregating traffic streams by encapsulating them into a single IP stream is often called tunneling.
  • Applicant's copending patent application Serial No. 09/066,888 filed on Apr. 28, 1998 describes an invention, which re-uses TCP in a packet based transport to provide TCP tunneling which can conveniently be called "TCP trunking".
  • TCP provides for reliable delivery of data between two transport access points while permitting that transport to offer elasticity and bandwidth sharing.
  • Aggregating traffic streams into TCP tunnels reduces the size of buffers and tables in the transport switches.
  • TCP is well suited to the use of first-in-first-out queues and allows simple implementations at the switching nodes.
  • TCP is also inherently provides for resequencing of out-of-order packets which can occur when switching nodes spread load over multiple links.
  • TCP functionality would be in transport access points rather than host computers, the variability of paths will be low and parameters such as connection round trip time will be very stable. These features make it much easier to envisage modifications to the TCP protocol for these networks. However, the use of this invention can be more generally applied to other TCP hosts and other sliding window protocols.
  • the invention is directed to a method of sending data in packets via a connection by way of sliding window algorithm in which a flow of data into the connection is controlled in response to acknowledged packets and the connection observing either or both of a guaranteed minimum bandwidth and a maximum permitted bandwidth.
  • the method comprises steps of (1) calculating a congestion window hereinafter called C-WND of the connection, (2) calculating either or both of a guaranteed minimum bandwidth window hereinafter called MIN-WND and a maximum permitted bandwidth window hereinafter called MAX-WND.
  • the method further includes steps of (3) determining if the MIN-WND or MAX-WND is invoked on the connection, based on their relationship with C-WND and (4) allowing the transmission of one or more packets of data into the connection if either MIN-WND or MAX-WND permits said transmission.
  • the invention is directed to an apparatus for sending data in packets via a connection by way of sliding window algorithm in which a flow of data into the connection is controlled in response to acknowledged packets and the connection observing either or both of a guaranteed minimum bandwidth and a maximum permitted bandwidth.
  • the apparatus comprises a flow control module for controlling a flow of packets into the connection in response to acknowledged packets, a congestion window arithmetic module for calculating a congestion window hereinafter called C-WND of the connection and a bandwidth monitoring window arithmetic module for calculating either or both of a guaranteed minimum bandwidth window hereinafter called MIN-WND and a maximum permitted bandwidth window hereinafter called MAX-WND.
  • the apparatus further includes control logic module for determining if the MIN-WND or MAX-WND is invoked on the connection, a transmitter for transmitting a series of packets of data into the connection and a controller for allowing the transmission of one or more packets of data into the connection if either MIN-WND or MAX-WND permits said transmission.
  • a packet transport network When providing services with bandwidth guarantees, a packet transport network should be able to emulate the circuit-based mesh in that a defined minimum bandwidth can be allocated between any pair of nodes. However, unused bandwidth should be made available to other flows in a dynamically shared fashion so that a flow can opportunistically exceed its minimum. In some cases it is also useful to implement a maximum limit on how much extra bandwidth a pair of nodes can use.
  • the conventional IP network implements bandwidth sharing among host machines using the transport control protocol (TCP).
  • TCP transport control protocol
  • the sender sender host machine
  • TCP uses the loss of a packet determined by sequence numbers of TCP packets as an indication to decrease its rate. Any lost packets are sent again so that there is a reliable flow of traffic.
  • the loss of too many packets can cause the TCP connection to enter the timed out state. Consecutive timeouts are increased in an exponential way until eventually the connection is closed.
  • TCP The general characteristic of TCP is that it is self-clocking. That is to say, the sender will wait for an acknowledgment from the receiver for the packets already sent before sending more packets. If the sender waited for each individual packet to be acknowledged then the maximum rate that the connection could achieve would be one packet per round trip time of the connection. To increase the sending rate while keeping the self clocking nature of the protocol, the sender is allowed to send some number of packets while waiting for an earlier packet to be acknowledged. This number of packets is called the window. The receiver itself may constrain the size of the window in order to limit its buffer requirement.
  • Each packet contains a sequence number, which increases according to the number of bytes transmitted.
  • the receiver acknowledges packets using this numbering scheme and always acknowledges the latest packet received in correct sequence. It may acknowledge each packet individually or wait in order to reduce overhead (this is called Delayed ACK). It should definitely send an acknowledgment at least every second packet. If a packet is received which is not in correct sequence the receiver will immediately send an acknowledgment but the sequence number it acknowledges will be that of the last packet which was received in the correct sequence. It should be noted that the sequence number in a packet corresponds to the last byte in the packet and the acknowledgment contains the next expected in-sequence byte number and thus acknowledges all bytes up to that number. In general terminology a packet is acknowledged when the receiver reports that the next expected byte number is later than any bytes contained in that packet.
  • the maximum rate of sending on a TCP connection is equal to the window size divided by the round trip time of the connection. TCP will constantly try to increase its rate by increasing the window size. When a packet is lost the window size is reduced and the gradual increase is begun again.
  • the current size of the window is called the congestion window (C-WND) and can vary between one packet and the maximum that the receiver is prepared to accept (R-WND: receiver window).
  • Figure 1 shows the nature of the sliding window.
  • the window reflects the data sent but not yet acknowledged as well as the amount of data that can still be sent without waiting for an acknowledgement.
  • the window advances so that the left-hand side is equal to the earliest unacknowledged byte number.
  • the right hand side of the window is equal to the highest byte sequence number that can be sent before the transmitter must wait for further acknowledgements. It should be noted that the receiver will only acknowledge bytes received which are in a complete sequence. Later bytes that have been received will not be acknowledged until all previous bytes have been received.
  • Packet loss is detected in one of two ways. If the sender does not get an acknowledgment within a certain time (TCP retransmission time-out) it will assume that a packet has been lost and will reduce its C-WND size to one packet as well as resending the lost packet. If the sender sees multiple acknowledgments (called duplicate ACK) of the same packet it can decide that packet has been lost even before the retransmission time-out occurs. Many TCP implementations include this fast retransmission and recovery capability. The window size is cut in half and the lost packet is retransmitted. Avoiding time-out gives a great boost to perceived performance but it is only effective when the window is large enough to allow enough duplicate acknowledgments to be generated (usually three).
  • the transport system is required to provide some minimum level of bandwidth for the total traffic between any pair of access points.
  • TCP will reduce its sending rate very aggressively when a packet is lost. It is envisaged however that TCP can be modified to cause it to reduce sending rate to some configured number rather than just reducing it by a fixed amount such as one half. The configured number will assure that the connection can always run at a minimum rate. It is also envisaged in some instances that TCP can be constrained to a maximum rate, less than it would achieve normally so that a connection would not occupy all the available bandwidth.
  • the TCP sender node needs only reduce its window to that which corresponds to a sending rate equal to that configured number. In this way the protocol will still probe for extra, opportunistic bandwidth but will be able to maintain the minimum rate. Similarly sending will be inhibited when the TCP window reaches a size corresponding to the maximum bandwidth.
  • This invention introduces the concept of overlay windows. This concept makes it easy to understand the design intent and permits the modification to be added without having to make substantial changes to the main body of standard TCP operating code.
  • TCP is modified to cause it to constrain its sending rate to be between some configured minimum and/or maximum numbers rather than between one packet and the receiver window size (R-WND).
  • This modification is only needed at the TCP transmitter.
  • the configured minimum number will assure that the connection can always run at a minimum rate and the configured maximum number prevents all the available bandwidth of the connection from being taken by a node pair.
  • the modification to the TCP transmitter will also improve TCP's resilience in the sense that the connection will not experience exponentially increasing time out under packet loss. This improved resilience against packet loss is achieved without loading the network more than the desired guaranteed minimum bandwidth for the TCP connection, or one packet per the round trip time of the connection.
  • this modification can also be enabled selectively to prevent time-out at the times when the window size of the connection is too small to allow fast retransmission and recovery.
  • the sender is allowed to send some number of packets while waiting for an acknowledgment of an earlier packet and this number is referred to as the window.
  • the maximum rate that a connection can achieve is equal to the window size divided by the round trip time of the connection (RTT) in seconds.
  • RTT round trip time of the connection
  • GMB minimum bandwidth
  • the TCP transmitter uses following variables:
  • the guaranteed minimum bandwidth for a TCP connection is achieved as follows.
  • the transmitter can send one packet into the network if it is allowed by the sliding window advertised by the receiver and if any one of the following conditions are met:
  • Figure 5 shows the nature of MIN-WND, which is very similar to C-WIND except that the size does not change according to congestion but is tied to the value of GMB and RTT.
  • the window when a duplicate acknowledgement is received the window is inflated by one packet.
  • the reception of an acknowledgment shows that the receiver has received a packet even if it was not is sequence.
  • the inflation of the window ensures that the connection can continue sending new packets even when an acknowledgement is missing. A new packet will be sent for each duplicate acknowledgement received. This prevents the connection stalling but does not increase the number of packets in the network. However, as soon as a non-duplicate acknowledgement is received the window is reset to the normal size.
  • Figure 8 shows the format of MAX-WND which is identical to MIN-WND except that the size is based on the maximum permitted bandwidth.
  • Figures 9 and 10 therefore show that the window is also inflated when duplicate acknowledgements are received and reset when a non-duplicate acknowledgement is seen.
  • Figures 11 to 14 show unmodified TCP algorithm and the overlay methods of modifying the TCP algorithm, according to embodiments of the invention.
  • the chosen window is defined as being the maximum acceptable window after taking into account the requirements of the overlay rules. Therefore, Figure 11 shows unmodified TCP where the chosen window is the normal congestion window and can have a value between 1 and R-WND.
  • Figure 12 shows how, when the highest sequence number within C-WND falls below that of MIN-WND, the GMB overlay takes effect and the chosen window is equal to MIN-WND.
  • Figure 13 when the highest sequence number of C-WND becomes greater than that of MAX-WND, the MPB overlay takes effect and chosen window becomes equal to MAX-WND.
  • Figure 14 shows how MIN-WND and MAX-WND are overlaid on the normal TCP algorithm to provide the complete bandwidth control.
  • the normal TCP algorithm controls the rate. If the rate tends to fall below the minimum then MIN-WND comes into play. If the rate reaches the maximum then MAX-WND takes effect.
  • the normal TCP mechanism is still in control of reliability and of elasticity within the configured limits.
  • An overriding timer RsT ensures that even when no acknowledgements are being received, a minimum rate of packets are still sent to stimulate acknowledgements and eventually retransmission without being stalled by TCP timeout.
  • FIG. 15 illustrates schematically in block diagram a TCP node according to one embodiment of the invention.
  • the node is connected to a network and includes a transmitter and receiver of an IP module 20.
  • the customer data 22 is processed by a TCP module 24 which forms the data into TCP packets before the transmitter send them into the network.
  • the module extracts the customer data and transfers it to the customer's terminal for outputting.
  • the clock 26 generates clock signals which times a variety of operations of the node.
  • the arithmetic module 28 is shown in a separate box which performs computations described thus far under control of the control logic 30.
  • Conroller 32 supervises the over-all operation of TCP module.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Communication Control (AREA)
EP99307651A 1998-09-30 1999-09-28 Appareil et procédé de gestion de largeur de bande pour un connexion à base de paquets Expired - Lifetime EP0991244B1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CA002249152A CA2249152C (fr) 1998-09-30 1998-09-30 Appareil et methode de gestion de largeur de bande pour connexion par paquets
CA2249152 1998-09-30

Publications (3)

Publication Number Publication Date
EP0991244A2 true EP0991244A2 (fr) 2000-04-05
EP0991244A3 EP0991244A3 (fr) 2000-05-10
EP0991244B1 EP0991244B1 (fr) 2003-10-01

Family

ID=4162872

Family Applications (1)

Application Number Title Priority Date Filing Date
EP99307651A Expired - Lifetime EP0991244B1 (fr) 1998-09-30 1999-09-28 Appareil et procédé de gestion de largeur de bande pour un connexion à base de paquets

Country Status (5)

Country Link
US (1) US6493316B1 (fr)
EP (1) EP0991244B1 (fr)
JP (1) JP2000115232A (fr)
CA (1) CA2249152C (fr)
DE (1) DE69911711T2 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003026251A1 (fr) * 2001-07-24 2003-03-27 Embrace Networks, Inc. Architecture reseau
WO2003088622A1 (fr) * 2002-04-12 2003-10-23 Nokia Corporation Systeme, dispositif et procede pour ameliorer le debit dans un reseau de communication, de preference un reseau mobile de type ipv6
US6775707B1 (en) 1999-10-15 2004-08-10 Fisher-Rosemount Systems, Inc. Deferred acknowledgment communications and alarm management
WO2005011229A3 (fr) * 2003-07-21 2005-05-19 France Telecom Procédé pour évaluer la bande passante disponible d'un canal de transmission lors d'une transmission de données et dispositif d'émission pour la mise en couvre du procédé
WO2008049462A1 (fr) * 2006-10-26 2008-05-02 Telefonaktiebolaget Lm Ericsson (Publ) Procédé et récepteur pour contrôler la conformité d'un flux de données dans un système de communication à une définition de trafic
EP1499986A4 (fr) * 2002-04-30 2010-06-16 Nokia Corp Procede et systeme augmentant le rendement et l'efficacite d'un protocole a base de paquets dans un reseau sans fil
WO2019169273A1 (fr) * 2018-03-02 2019-09-06 Futurewei Technologies, Inc. Procédé de commande de trafic et de congestion pour un réseau avec qualité de service

Families Citing this family (58)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7085227B1 (en) * 2001-05-11 2006-08-01 Cisco Technology, Inc. Method for testing congestion avoidance on high speed networks
SE516871C2 (sv) * 1999-06-23 2002-03-12 Teracom Ab Metod för flödesstyrning i ett datakommunikationsnät
US7313627B1 (en) 1999-09-30 2007-12-25 Data Expedition, Inc. Flow control method and apparatus
US7404003B1 (en) * 1999-09-30 2008-07-22 Data Expedition, Inc. Method and apparatus for client side state management
US7158479B1 (en) * 1999-09-30 2007-01-02 Data Expedition, Inc. Method and apparatus for non contiguous sliding window
US8199646B1 (en) 1999-12-07 2012-06-12 Nortel Networks Limited System, device, and method for distributing link state information in a communication network
JP2001237882A (ja) * 2000-02-23 2001-08-31 Nec Corp パケットデータ転送におけるパケットサイズ制御装置及びその制御方法
US6925502B1 (en) * 2000-06-20 2005-08-02 At&T Corp. Methods and systems for improving data transmission rates having adaptive protocols
US6958997B1 (en) * 2000-07-05 2005-10-25 Cisco Technology, Inc. TCP fast recovery extended method and apparatus
AU2001288589A1 (en) * 2000-08-31 2002-03-13 The Regents Of The University Of California Method for improving tcp performance over wireless links
US7130268B2 (en) * 2000-10-17 2006-10-31 Saverio Mascolo End-to-end bandwidth estimation for congestion control in packet switching networks
US6862564B1 (en) * 2000-10-26 2005-03-01 Sycamore Networks, Inc. Network emulator
JP2002152259A (ja) * 2000-11-13 2002-05-24 Yozan Inc 通信端末装置および課金処理装置
EP1209861A1 (fr) 2000-11-22 2002-05-29 Telefonaktiebolaget L M Ericsson (Publ) Surveillance du trafic dans des réseaux de paquet
US6967921B1 (en) * 2000-11-27 2005-11-22 At&T Corp. Method and device for efficient bandwidth management
US7327694B2 (en) * 2001-07-31 2008-02-05 Sasken Communication Technologies Ltd. Adaptive radio link protocol (RLP) to improve performance of TCP in wireless environment for CDMAone and CDMA2000 systems
US7856660B2 (en) * 2001-08-21 2010-12-21 Telecommunication Systems, Inc. System for efficiently handling cryptographic messages containing nonce values
US6744730B2 (en) * 2001-11-30 2004-06-01 Nokia Corporation Throughput enhancement after interruption
US20030126196A1 (en) * 2001-12-27 2003-07-03 Todd Lagimonier System for optimizing the invocation of computer-based services deployed in a distributed computing environment
EP1383281A1 (fr) * 2002-07-19 2004-01-21 TELEFONAKTIEBOLAGET LM ERICSSON (publ) Méthode pour le calcul de la taille d'une fenêtre de transmission
US7069326B1 (en) * 2002-09-27 2006-06-27 Danger, Inc. System and method for efficiently managing data transports
US7428595B2 (en) * 2002-09-30 2008-09-23 Sharp Laboratories Of America, Inc. System and method for streaming TCP messages in an enterprise network
US7796602B2 (en) * 2002-11-25 2010-09-14 Intel Corporation In sequence packet delivery without retransmission
EP1434380B1 (fr) * 2002-12-27 2006-07-26 NTT DoCoMo, Inc. Méthode et dispositif pour le contrôle de la transmission de données
US7263067B2 (en) * 2003-07-15 2007-08-28 Nokia Siemans Networks Oy Method and apparatus for accelerating throughput in a wireless or other telecommunication system
JP2005167353A (ja) * 2003-11-28 2005-06-23 Ntt Docomo Inc 送信装置およびプログラム
US7382733B2 (en) * 2004-02-12 2008-06-03 International Business Machines Corporation Method for handling reordered data packets
KR100604597B1 (ko) * 2004-02-20 2006-07-24 주식회사 팬택앤큐리텔 이동 통신 단말기
EP1757036B1 (fr) * 2004-04-26 2008-12-31 Telecom Italia S.p.A. Procede et systeme pour la programmation de paquets de donnees synchrones et asynchrones sur le meme reseau
JP5020076B2 (ja) * 2004-07-29 2012-09-05 デル・プロダクツ・エル・ピー 低頻度ａｃｋのシステムに適した高性能ｔｃｐ
US7656800B2 (en) * 2004-07-30 2010-02-02 Cisco Technology, Inc. Transmission control protocol (TCP)
US7760633B2 (en) * 2005-11-30 2010-07-20 Cisco Technology, Inc. Transmission control protocol (TCP) congestion control using transmission delay components
US7664067B2 (en) * 2005-12-15 2010-02-16 Microsoft Corporation Preserving socket connections over a wireless network
GB0611249D0 (en) * 2006-06-07 2006-07-19 Nokia Corp Communication system
US7821937B1 (en) 2007-06-29 2010-10-26 Symantec Corporation Network protocol with damage loss resilient congestion control algorithm
US8670573B2 (en) * 2008-07-07 2014-03-11 Robert Bosch Gmbh Low latency ultra wideband communications headset and operating method therefor
US8619775B2 (en) * 2008-07-21 2013-12-31 Ltn Global Communications, Inc. Scalable flow transport and delivery network and associated methods and systems
GB2478687B (en) * 2008-12-22 2014-05-21 Ltn Global Communications Inc A system and method for recovery of packets in overlay networks
US9106569B2 (en) 2009-03-29 2015-08-11 Ltn Global Communications, Inc. System and method that routes flows via multicast flow transport for groups
US8599851B2 (en) 2009-04-03 2013-12-03 Ltn Global Communications, Inc. System and method that routes flows via multicast flow transport for groups
JP5375313B2 (ja) * 2009-05-01 2013-12-25 日本電気株式会社 通信装置、擬似応答装置、送信レート制御方法およびプログラム
US8274886B2 (en) * 2009-10-28 2012-09-25 At&T Intellectual Property I, L.P. Inferring TCP initial congestion window
JP5538257B2 (ja) * 2011-02-02 2014-07-02 アラクサラネットワークス株式会社 帯域監視装置、及びパケット中継装置
US10009445B2 (en) 2012-06-14 2018-06-26 Qualcomm Incorporated Avoiding unwanted TCP retransmissions using optimistic window adjustments
US10122645B2 (en) 2012-12-07 2018-11-06 Cisco Technology, Inc. Output queue latency behavior for input queue based device
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
US10291472B2 (en) 2015-07-29 2019-05-14 AppFormix, Inc. Assessment of operational states of a computing environment
US10355997B2 (en) 2013-09-26 2019-07-16 Appformix Inc. System and method for improving TCP performance in virtualized environments
US9385959B2 (en) 2013-09-26 2016-07-05 Acelio, Inc. System and method for improving TCP performance in virtualized environments
US10581687B2 (en) 2013-09-26 2020-03-03 Appformix Inc. Real-time cloud-infrastructure policy implementation and management
US9906454B2 (en) 2014-09-17 2018-02-27 AppFormix, Inc. System and method for providing quality of service to data center applications by controlling the rate at which data packets are transmitted
US11068314B2 (en) 2017-03-29 2021-07-20 Juniper Networks, Inc. Micro-level monitoring, visibility and control of shared resources internal to a processor of a host machine for a virtual environment
US10868742B2 (en) 2017-03-29 2020-12-15 Juniper Networks, Inc. Multi-cluster dashboard for distributed virtualization infrastructure element monitoring and policy control
US11323327B1 (en) 2017-04-19 2022-05-03 Juniper Networks, Inc. Virtualization infrastructure element monitoring and policy control in a cloud environment using profiles
KR102707063B1 (ko) 2022-03-07 2024-09-12 현대오토에버 주식회사 차량용 이더넷 제어기 및 그것의 데이터 전송 방법
US12107767B2 (en) * 2022-04-07 2024-10-01 Mellanox Technologies Ltd. System and method for network rate limiting
CN119892659B (zh) * 2023-10-16 2026-04-28 荣耀终端股份有限公司 一种带宽预测方法及路由转发设备

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5163046A (en) * 1989-11-30 1992-11-10 At&T Bell Laboratories Dynamic window sizing in a data network
US5063562A (en) * 1990-05-23 1991-11-05 International Business Machines Corporation Flow control for high speed networks
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
US6076114A (en) * 1997-04-18 2000-06-13 International Business Machines Corporation Methods, systems and computer program products for reliable data transmission over communications networks
US6105064A (en) * 1997-05-30 2000-08-15 Novell, Inc. System for placing packets on network for transmission from sending endnode to receiving endnode at times which are determined by window size and metering interval
US6023453A (en) * 1997-09-11 2000-02-08 Nokia Telecommunications, Oy System and method employing last occurrence and sliding window technique for determining minimum and maximum values
US6205120B1 (en) * 1998-03-13 2001-03-20 Packeteer, Inc. Method for transparently determining and setting an optimal minimum required TCP window size
US6219713B1 (en) * 1998-07-07 2001-04-17 Nokia Telecommunications, Oy Method and apparatus for adjustment of TCP sliding window with information about network conditions
US6215769B1 (en) * 1998-10-07 2001-04-10 Nokia Telecommunications, Inc. Enhanced acknowledgment pacing device and method for TCP connections

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6775707B1 (en) 1999-10-15 2004-08-10 Fisher-Rosemount Systems, Inc. Deferred acknowledgment communications and alarm management
GB2359225B (en) * 1999-10-15 2004-09-22 Fisher Rosemount Systems Inc Deferred acknowledgement communications and alarm management
US7111070B2 (en) 1999-10-15 2006-09-19 Fisher-Rosemount Systems, Inc. Deferred acknowledgment communications and alarm management
US7574531B2 (en) 1999-10-15 2009-08-11 Fisher-Rosemount Systems, Inc. Deferred acknowledgment communications and alarm management
US8650321B2 (en) 2001-07-24 2014-02-11 Digi International Inc. Network architecture
WO2003026251A1 (fr) * 2001-07-24 2003-03-27 Embrace Networks, Inc. Architecture reseau
WO2003088622A1 (fr) * 2002-04-12 2003-10-23 Nokia Corporation Systeme, dispositif et procede pour ameliorer le debit dans un reseau de communication, de preference un reseau mobile de type ipv6
EP1499986A4 (fr) * 2002-04-30 2010-06-16 Nokia Corp Procede et systeme augmentant le rendement et l'efficacite d'un protocole a base de paquets dans un reseau sans fil
WO2005011229A3 (fr) * 2003-07-21 2005-05-19 France Telecom Procédé pour évaluer la bande passante disponible d'un canal de transmission lors d'une transmission de données et dispositif d'émission pour la mise en couvre du procédé
WO2008049462A1 (fr) * 2006-10-26 2008-05-02 Telefonaktiebolaget Lm Ericsson (Publ) Procédé et récepteur pour contrôler la conformité d'un flux de données dans un système de communication à une définition de trafic
US8477608B2 (en) 2006-10-26 2013-07-02 Unwired Planet, Llc Method and receiver for controlling the conformance of a data flow in a communication system to a traffic definition
WO2019169273A1 (fr) * 2018-03-02 2019-09-06 Futurewei Technologies, Inc. Procédé de commande de trafic et de congestion pour un réseau avec qualité de service
US11533656B2 (en) 2018-03-02 2022-12-20 Huawei Technologies Co., Ltd. Method of traffic and congestion control for a network with quality of service

Also Published As

Publication number Publication date
DE69911711T2 (de) 2004-09-23
DE69911711D1 (de) 2003-11-06
CA2249152C (fr) 2003-07-08
US6493316B1 (en) 2002-12-10
CA2249152A1 (fr) 2000-03-30
EP0991244B1 (fr) 2003-10-01
JP2000115232A (ja) 2000-04-21
EP0991244A3 (fr) 2000-05-10

Similar Documents

Publication Publication Date Title
EP0991244B1 (fr) Appareil et procédé de gestion de largeur de bande pour un connexion à base de paquets
US8064461B2 (en) Method and apparatus for TCIP/IP data transfer over a wireless network
US8462624B2 (en) Congestion management over lossy network connections
US6788704B1 (en) Network adapter with TCP windowing support
KR100785293B1 (ko) 다중 ｔｃｐ확인응답을 이용한 ｔｃｐ 혼잡 제어 시스템및 그 방법
EP1295428B1 (fr) Amelioration de la performance du protocole de controle de transmission (tcp) pour des applications de reseau sans fil
US6880017B1 (en) System and method for providing an adaptive streaming flow control mechanism between the TCP and IP layers of the TCP/IP suite of protocols
US7460472B2 (en) System and method for transmitting information in a communication network
US9385835B2 (en) System and method for adaptive frame size management in a wireless multihop network
WO2001045331A1 (fr) Procede de regulation de congestion dans un reseau commute par paquets
EP1568191A2 (fr) Appareil et procede permettant d'obtenir un protocole de transport par paquets fiable et leger
AU2104300A (en) Communication device and method
Wang et al. Use of TCP decoupling in improving TCP performance over wireless networks
JP2000156706A (ja) データ送受信方法並びにデータ送信プログラムを記憶した媒体及びデータ受信プログラムを記憶した媒体
EP1798913B1 (fr) Procédé de commande du transport dans un système de communication sans fil
JP2001156795A (ja) パケットのフロー制御装置および方法
AU4034299A (en) Overload control method for a packet-switched network
EP1505759B1 (fr) Procédé et dispositif de transmission/réception de données utilisant la couche de transport avec accusé de réception
Auge et al. Window prediction mechanism for improving TCP in wireless asymmetric links
KR100913897B1 (ko) 재전송 타임아웃 수를 줄이기 위한 전송 제어 프로토콜혼잡제어방법
Cerdà et al. Study of the TCP Unfairness in a Wireless Environment
Hung et al. Simple slow-start and a fair congestion avoidance for TCP communications
Akhtar et al. Modified Tahoe TCP for wireless networks using OPNET simulator
Corral et al. Simulation-based study of TCP flow control mechanisms using OPNET Modeler
CHI A N ENHANCED VERSION OF SACKTCP

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

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): DE FR GB

AX Request for extension of the european patent

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

AK Designated contracting states

Kind code of ref document: A3

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

AX Request for extension of the european patent

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

17P Request for examination filed

Effective date: 20000614

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NORTEL NETWORKS LIMITED

AKX Designation fees paid

Free format text: DE FR GB

17Q First examination report despatched

Effective date: 20010809

GRAH Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOS IGRA

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

RAP2 Party data changed (patent owner data changed or rights of a patent transferred)

Owner name: NORTEL NETWORKS LIMITED

REF Corresponds to:

Ref document number: 69911711

Country of ref document: DE

Date of ref document: 20031106

Kind code of ref document: P

ET Fr: translation filed
PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

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

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20040820

Year of fee payment: 6

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20040901

Year of fee payment: 6

26N No opposition filed

Effective date: 20040702

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20040930

Year of fee payment: 6

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20050928

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20060401

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20050928

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20060531

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20060531