Title of Invention

A DATA COMMUNICATION NODE AND A METHOD FOR DATA COMMUNICATION

Abstract

The present invention relates to a data communication node capable of operating under, for example, TCP protocol in two or three of the following modes: a normal mode in which it does not affect communications; an early acknowledgement mode in which it transmits early acknowledgement messages for datagrams that have not yet reached the node; and a fast TCP mode in which it delays the communication of acknowledgement messages to the transmitter.

Full Text

FLOW CONTROL This invention relates to controlling the flow of data, especially in networks that are required to operated at high speed. Many networks use the transmission control protocol (TCP) as their transport layer protocol. The transmission control protocol is the primary transport protocol in the commonly used TCP/IP protocol suite. The internet protocol (IP) does not provide a reliable bit stream: errors during the course of transmission are not corrected by the IP. Overlaying TCP on an IP link implements a reliable byte stream over the unreliable datagram service provided by IP. As part of implementing the reliable sen/ice, TCP is also responsible for flow and congestion control: ensuring that the data is transmitted at a rate consistent with the capacities of both the receiver and the intermediate links in the network path. As s result, most throughput problems in a TCP/IP system are rooted in TCP. TCP Is one of the few transport protocols that has congestion control mechanisms (see W. Richard Stevens, TCP/IP Illustrated Volume 1, The protocols", and IETF RFC 793, "Transport Control Protocor. September 1981)- A key element of the TCP congestion mechanism is its slow start' probe algorithm. When a TCP connection starts up, the TCP specification requires the connection to be ■ conservative and assume that the bandwidth available for the receiver is small. TCP is supposed to use an algorithm called slow start, to probe the path to team how much bandwidth is available before the rate of data flow is increased. Slow start is used so that when a new TCP connection is started the TCP flow will continue after some idle period or when an acknowledgement (ACK) has failed to return after a set period (indicating a lost packet). In addition, the size of the transmission window is decreased. Each TCP acknowledgement specifies a con"esponding packet so that the system can identify wtiich packet has been lost A TCP link is established between two units, one of which is the source of a data message to be transmitted and the other of which is to receive the data message. The two units are connected by a data path over which the data is to travel. The source unit generates datagrams (e.g. packets) that together represent the message that is to be sent. The datagrams are transmitted over the data path. The datagrams are finally reassembled by the receiving unit, which also requests retransmission of any datagrams that it cannot decode correctly. Whilst the slow start algorithm is running the TCP source starts with a notional transmission window set to one segment. In this state It will not transmit more than one datagram (e.g. packet) without having received an acknowledgement from the receiving unit. When an acloiowledgement (ACK) is received, the window size is increased by one. In practice, the window size tends to increase exponentially, because one ACK increase the size to two, ACKs from these two segments increase the window to four their ACKs increase size to eight etc. This is illustrated in figure 1. Line 1 in figure 1 illustrates the exponential increase of window size WS up to a maximum wSgvail 3t time tf. There are t^o problems with the slow start algorithm on high-speed networks. First, the probing algorithm is such that it can take a considerable time for the link to reach its maximum speed. The time {ti in figure 1) required to get up the • maximum speed is a direct ratio of round trip time (RTT), delay-bandwidth product (DBW) and reverse ratio of average segment length (L). If the available bandwidth goes up or round-trip time increases, or both, this start-up time can be quite long. If the link is otherwise idle, during that period much of the link bandwidth will be unused and therefore potentially wasted. This is illustrated in figure 1, It can be assumed that from the start of the TCP connection, there is available bandwidth that corresponds to the available v^/indow size WSt^vr^if. However, lower that bandwidth is not fully used until time U. Therefore, the shaded area 2 in figure 1 represents the wasted bandwidth. A potentraiiy more signfficant problem is that in many cases (especially when relatively short messages are to be sent) the entire data transfer will have been completed before the slow start algorithm has finished and the bandwidth-limited maximum window size WSavaii has been reached. In this situation the user will never experience the full link bandwidth. All the transfer time will be spent in slow start- There are some common practical situations when this can occur. For example, this problem is particularly severe for hyper-text transfer protocol (HTTP) connections (as used for transferring worldwide web data) because HTTP is notorious for starting a new TCP connection for every item on a web page. In addition to the waste of bandwidth that is caused by the slow start algorithm, there is a wea] These problems are exacerbated when TCP is run over links that have relatively high en-or rates or variable data capacity. For example, in some cases wireless links (such as those to cellular phones or satellites) have higher en'or rates than conventional cabled terrestrial links. Such higher error rates matter for two reasons. First, they cause en-ors in datagrams, which will have to be retransmitted. Second, TCP typically interprets loss as a sign of congestion and when loss is encountered it reverts to a modified version of the slow start algorithm. Systems do exist that are able to make use of spare bandwidth on a link that is currently left over from over from other connections tfiat are running over the link. One example is the available bit rate (ABR) service of the asynchronous transfer mode (ATM) system. With the ABR service a user is able to use bandwidth that is left over from constant bit rate (CBR) and other higher priority traffic. Another example is the generic packet radio system/GPRS), which utilises bandwidth of a global system for mobile communications (GSM) cellular telephone network that is not used for GSM voice connections. In the GSM system tlnere are a number of GSM frequency slots, each of which Is divided to eight time slots. Each time slot and frequency combination is able to support one GSM voice connection. The basic idea of GPRS is to use timeslots that are not currently in use for voice communications to carry data packets. Naturally, the number of available timeslots for GPRS varies over time, depending on the current demand for GSM voice connections. A problem of dynamic systems of these types is that the bandwidth allocated for the service varies over time. For example, when TCP traffic is transmitted over GPRS, the bandwidth available for the TCP connections may increase or decrease suddenly (when several GSM calls are terminated or begun simultaneously). This means that a TCP connection over such a dynamic system may have to stop and start frequently, and in that environment TCP's slow start algorithm prevents the TCP connection from making full use of the available bandwidth. Thus, network resources are wasted and a user cannot get the full benefit of the dynamic available bandwidth. This problem is especially important with wireless communication systems, because radio interface capacity is limited and expensive. If the TCP system had more information about the characteristics of the path over which the data is being sent then It may be able to accelerate the slow start process, for example by skipping at least some of the slow start process and beginning transmission at a somewhat higher rate than is represented by one datagram, if that were known to be likely to be supported by the link. In order to speed up the slow start process, several schemes have been proposed. One such technique Is known as TCP snooping", (See Z, Liu et al., 'Evaluation of TCP Vegas: Emulation and Experiment", Proa ACM SlGCOivM'95, Aug-1995. pp,185-196; and H. Balakrishnan, et al " Improving TCP/IP Performance over Wireless Networks", Proc. ACM SIGCOMM'95, Aug. 1995), This idea is illustrated* in figure 2. The idea calls for a router or other node 10 to be present between the TCP source 11 and the TCP receiver 1Z The node 10 sends back to the source 11 ACKs for TCP data that the source has sent, to give the source 11 the illusion of a short delay path. The node 10 then suppresses ACKs returning from the receiver 12, and takes responsibility for re-transrnitting to the receiver 12 any segments lost downstream of the router (l.e, over the portion of the path between the node 10 and the receiver 12). Thus, such a TCP snooping node 10 gives the TCP source 11 the impression that the node 10 is the actual TCP receiver. Figure 2 illustrates the flow of packets (PKn) and correspondingly numbered acknowledgements (ACKn), In the arrangement shown in figure 2, when a packet PK64 reaches the node 10 from the source 11 the node generates a con^esponding acknowledgement ACK64 for the packet and returns that to the source. The node 10 stores at memory 13 packets that have been received by it but not yet acknowledged by the receiver 12. The node 10 sends packets in tun-i to the receiver (see packets PK59. PK60). The receiver returns acknowledgements for the packets it has received corectly {ACK5S, ACK59). When the node 10 receives such an acknowledgement (e.g. ACK57 as illustrated in figure 2) it drops the corresponding packet from its store 13. The snooping node 10 must thus do a considerable amount of work after it sends an ACK to the source 11. It must buffer the data segment it has just received because the source 11 is now free to discard its copy as the segment has been acknowledged, and thus if the segment gets lost between the router and the receiver the router must be able to take full responsibility for re-transmitting it. Therefore, the data in the buffer cannot be deleted until the snooping node gets the relevant ACKs from the TCP receiver 12. Unfortunately, this method has the big problem that the buffer in a snooping node can fill quickly ff the available bandwidth (such as cellular network resources) between the node and the TCP receiver (link 14 in figure 2) decreases. The problem has been illustrated in figure 3, which illustrates a packet PK69 overflowing the buffer 13 in the node 10, It should be noted that the need for the node 10 to store segments, and thus the problem of buffer overflow, arises from the fact that the snooping node generates an acknowledgement that corresponds to the same TCP segment as it has just received. Another approach to overcoming some of the problems of the TCP slow start algorithm is known as split TCP. In this approach a TCP connection is divided into muitiple TCP connections, with a special TCP connection. Because each TCP connection is tenninated. split TCP is not vulnerable to asymmetric paths. And in cases where applications actively participate in TCP connection management (such as web caching) it works well. But othenwise split TCP has the same problems as TCP snooping, especially the building up of buffers. There is therefore a need for an improved method of operation in protocols such as TCP in order to at least partially overcome one or more of the problems described above. According to one aspect of the present Invention there is provided a data communication node for operation in a communication path between a transmitter of datagrams and a receiver of datagrams under a protocol wherein the transmission of datagrams by the transmitter is dependant on it receiving an acknowledgement message for a previously transmitted datagram, the node comprising: detection apparatus for detecting communications in the path; an acknowledgement generator capable of generating acknowledgement messages for datagrams and transmitting those messages to the transmitter; and flov;/ interruption apparatus capable of intenupting communications in the path; the node being capable of operating in at least two of the following modes: a first mode in which it does not internjpt communications in the path; a second mode in which it transmits acknowledgement messages for a datagrams succeeding the latest datagram detected at the node; and a third mode in which it delays the communication of acknowledgement messages to the transmitter. In the first mode the node preferably does not affect communications in the path, suitably so that datagrams from the transmitter can flow freely past the node towards the receiver and acknowledgement messages from the receiver can flow ■ freely towards the transmitter. In the second and/or third mode the node preferably interrupts the communication of aGkno>Ai'ledgement messages from the receiver to the transmftter. In the second and/or third mode the node preferably inten"upts the communication of datagrams from the transmitter to transmitter to the receiver, The node may comprise a memory capable of storing datagrams and/or acknowledgement messages. In the second and/or third mode the node preferably stores in the memory datagrams detected in transmission from the transmitter to the receiver. The node may then, in the second and/or third mode, if It detects no acknowledgement message for a datagram from the receiver within a set period retransmit that datagram to the receiver. On receiving an acknowledgement message for a datagram the node may delete that datagram from the memory. The node preferably comprises a mode detennination unit for detennining the mode of operation of the node. The mode determination unit is preferably capable of determining whether there is available capacity in the communication path, for example unused bandwidth in the communication path (preferably in both directions over the path), and/or available capacity in the said memory of the node (if present). If there is such available capacity the mode determination unit is preferably capable of causing the node to operate in the second mode. The mode determination unit is preferably capable of determining whether there is congestion in the communication path. Congestion in the communication path may be indicated by delays in communication over the path (either of datagrams or acknowledgements), excessfve loss of data, excessive demands on the path etc. The congestion may arise due to one or both of an increase in the amount of data directed over the path and a reduction in the data capacity (bandwidth) of the I path. When the unit determines that there is congestion it is preferably capable of causing the node to operate in the third mode. Otherwise (i.e. if there is no available capacHy or congestion in the communication path) the determination unit is suitably capable of causing the node to enter the first mode. The node is preferably capable of operating in any of the first, second and third modes. According to a second aspect of the present invention there Is provided a method for data communication over a communication path between, a transmitter of datagrams and a receiver of datagrams under a protocol wherein the transmission of datagrams by the transmitter Is dependant on it receiving an acknowledgement message for a previously transmitted datagram, there being a node located in the communication path between the transmitter and the receiver; the method comprising: the transmitter transmitting datagrams towards the receiver the node detecting the said datagrams; and. the node repeatedly transmitting to the transmitter an acknowledgement message for a datagram succeeding the latest datagram detected at the node. In both aspects of the invention the protocol is preferably a transmission control protocol (TCP). The protocol preferably provides an operation type in which the transmitter will not transmit a datagram until it has received an acknowledgement . message for a datagram transmitted a stored inter/al previously, and most preferably in which the stored inteival is increased if an acknowledgement message is received. This may be a slow start operation type. The stored inter/al is preferably expressed as a number of data units, for example a number of datagrams or a number of bits. Preferably the interval is expressed as a number of datagrams. Then the protocol preferably provides an operation type in which a datagram will not be transmitted until an acknowledgement has been received for the datagram that was transmitted n datagrams perviously, where n is the number of datagrams expressed by the stored interval. In both aspects of the invention at least part of the communication path is . preferably provided by a radio link, most preferably a cellular radio link. The present invention will now be described byway of example, with reference to the accompanying drawings, In which; figure 1 illustrates the TCP slow start algorithm; figures 2 and 3 illustrate aspects of the TCP snooping procedure; figure 4 shows schematically the architecture of a communications system; figure 5 Illustrates preferred operating mode regimes; figures 6 to 9 illustrate the operation of the system of figure 4 in the modes of figure 5; and figure 10 illustrates a strategy for selecting an operating mode. Figure 4 shows a schematic view of a communications syntem. The communications system comprises a sending unit 20 connected to a receiving unit 21 by a bi-directional communications path 22- The sending unit is capable of breaking a message into packets and sending it to the receiving unit using the TCP protocol. For ease of explanation the communications path 22 is shown as comprising outward channel 23 and return channel 24 operable to send signals in opposite directions, but in practice the path m&y be a single physical channel at any point along its length. The path may be provided by a chain of one or more links set in series, which could be of the same or different physical types (e,g. fixed wires, radio channels or optical channels),. Set in the communication path 22 is a node 25. The node 25 comprises switches 26, 27 set in the outward and return channels 23, 24 respectively. The switches operate under the control of a controller 28. Connected to one output of switch 26 is a packet detector 29. Connected to one output of switch 27 is an acknowledgement detector 30, The other outputs of the switches 26, 27 pass to the receiver 21 and sender 20 respectively. The outputs of the detectors 29, 30 pass to the controller 28, The node also includes a memory 31 > in which data can be stored by the controller 28, and an acknowledgement generator 36 which can generate. acknowledgement messages for packets under the direction of the controller 28. In one setting ("A") of the switch 26 incoming signals to the node on channel 23 {from input 32) are directed straight to the output 33 of the node 25 on channel 23. In the other setting ("B") of the switch 26 signals from input 32 are isolated from output 33; instead the output of the memory 31 is directed to the • output 33. In one setting (•'X") of the switch 27 incoming signals to the node on channel 24 (from Input 34) are directed straight to the output 35 of the node 25 on channel 24. In the other setting ("Y") of the swftch 27 signals from input 34 are isolated from output 35; instead the output of the acknowledgement generator 36 is directed to the output 35, The controller 28 operates under the supervision of a mode selection unit 37 which monitors the channels 23 and 24 to determine the status of the communications system and is controllable by an external signal at 38. The mode selection unit 37 can also monitor the channels 23 and 24, especially when they include a wireless path or some other path that may be a bottleneck. For clarity of description the node 25 is described herein as comprising distinct items of apparatus. However, the node 25 could be provided as one or more blocks of different functionality from those shown in figure 4. The functions of the node 25 could be provided wholly or partly by software operating on one or more microprocessors. In operation the node 25 has three modes, referred to herein as a "normal" mode, a "fast" mode and an "early acknowledgement" mode. • In the normal mode switch 26 Is set to setting A and switch 27 is set to setting X. This allows signals from the sending unit 20 to pass straight through the node to the receiving unrt 21, and signals from the receiving unit to pass straight through to the sending unit. • In the fast mode switch 26 is set to setting A, switdi 27 is set to setting Y. When the node receives a packet from the sending unit 20 the controller 2S relays it to the receiving unit. The receiving unit generates acknowledgements for the packets it receives. When a. packet is acknowledged the node 25 relays the acknowledgement after a delay to the sending unit. Additionally, the node 25 may store the packet received from sending unit 21 and resend it to receiving unit 21 if no acknowledgement is received after a set period of time. In the early acknowledgement switches 26 and 27 are set to setting B and Y respectively. This process is described In more detail below. In the normal mode the link 22 between the sending unit 20 and the receiving unit 21 operates end-to-end as if the node 25 v/ere not present. In the early acknowledgement mode the node provides the ability to accelerate the increase in transmission rate by the sending unit under TCP slow start by sending prompt acknowledgements. In the fast mode the node can reduce the rate of transmission by the sender, in order to cope with reduced capacity over the link or filling of the nodes buffer memory. The availability of more than one of these modes provides the node wrth the ability to enhance operation of the TCP link in a wide range of circumstances, as will be described in more detail below. In particular, the range of modes permit a scheme of operation which can get around shortcomings of the TCP slow stare algorithm and relieve buffer build up in the relaying node. The mode selection unit 37 monitors the link 22 and causes the controller 23 to adopt one of the available modes in dependence on the link conditions. Figure 5 illustrates one preferred strategy. In normal operation the mode selection unit 37 selects the nonnal mode. When the buffer memory 31 has available space and there is available bandwidth on the link in both directions the mode selection unit selects early acknowledgement mode to drive the packet transmission rate to increase. When there is congestion on the link, or the buffer memory is fud the mode selection unit selects fast mode to drive the packet transmission rate to decrease. The effect of the available modes wil! now be described in more detail. When there is available bandwidth above a set threshold, and the mode selector 37 detects no packet loss due to congestion, eariy acknowledgement mode is selected. When a packet is received by node 25 and detected by the detector 29 the controller 28 controls the acknowledgement generator 36 to generate an "early" acknowledgement, and releases it to the sender 20. The packet number specified in the early acknowledgement message is that of a packet that has not yet been received by the node 25 (but, for compatibility with most protocols, one that is likely to have been sent by the sender before the acknowledgement reaches it). Thus, whilst that actual data packet is on its way from acknowledgement controller to the TCP receiver and/or the acknowledgement generated by the TCP receiver is on its way from the receiver to the acknowledgement controller The number by which the acknowledgement number is in advance of the last packet received by the node depends on the available bandwidth, nature of packet losses and available buffer space in the network node. Thus the acknowledgement controller predias the need to send a true acknowledgement message for a certain packet and sends an anticipatory acknowledgement generated by itself to the TCP source so that the TCP source gets an acknowledgement earlier than it would even if a snooping node were used. The node 25 will then forward the packet, when received, to the receiver, or just allow the packet to pass through the node 25. When the con-esponding acknowledgement message that is generated by the TCP receiver reaches the node the controller 28 discards it from the memory 31. In early acknowledgement mode the TCP source is rapidly acknowledged that its packets has been received, and the source starts to increase its transmission rate. This in turn reduces the time taken for the TCP protocol to reach its full speed and improves overall throughput. Since function f (equation 2) takes into account the available bandwidth and the buffer occupancy, it overcomes problems of the TCP snooping method. Effectively, the transmitted ACK^ approaches ACK when the available buffer space and/or bandwidth decreases. When no unused bandwidth is available, ACK! = ACK^ and the normal operation of TCP has been reached. On the other hand, when the available bandwidth and/or buffer space increases, ACI^ approaches PK. Thus, when there is lot of unused available bandwidth, the node 25 in early acknowledgement mode operates in a similar way to the TCP snooping method described above. The normal mode is used once the TCP system at the sender has reached full speed and there is substantially no unused available bandwidth in the direction from the sender to the receiver The arrival of a TCP packet at the node no longer thggers generation of early acknowledgement Instead, the acknowledgement controller simply lets the TCP packets and corresponding acknowledgements flow through It In a natural, undisturbed way. In the fast TCP mode, which Is used if the mode selector senses packet loss due to congestion, the acknowledgement controller postpones the returning of acknowledgements to the sender. This could be done by the node receiving acknowledgements from the receiver, storing them for a period and then relaying them to the sender; or by the node introducing a delay before It generates an acknowledgement itself. The process of postponing acknowledgements could be conducted in a manner as described in WO 99/04536, the contents of which are incorporated herein by reference. The effect of the delaying of acknowledgements is to reduce congestion, and therefore packet loss. Figure 6 illustrates early acknowledgement mode further. Based on the information it has sensed about the nature of packet loss and the available bandwidth the mode selector of the node 25 has selected early acknowledgement mode, and has caused the controller to operate in that mode. A TCP packet with the sequence number PK is coming from the source to the node. The acknowledgement controller receives the TCP packet. An acknowledgement ACK^ is sent by the node to the TCP source. The acknowledgement could be generated wholly by the node or a suitable acknowledgement packet passing the node at that time (having been generated by the TCP receiver) could be captured and modified to carry the ACK^. One method for the node to use in calculating the ■ value of ACK0 has been shown in equation 1 above. The sending of ACK° and the like will cause the TCP source to speed up rapidly since it will now receive acknowledgements faster than with other methods. There is essentially a saving of more than the round trip time between the node and the TCP receiver. Effectively, the TCP source sees there to be a shorter distance to the receiver than even the distance to the node. -The TCP packet PK is fonwarded to the TCP receiver. Notice that the generation and transmission (or capture and alteration) of ACK° and. the fon/varding (or allowing to pass) of PK can occur also in reverse order. A copy of TCP packet PK is stored in memory 31 so that ft can be retransmitted by the node rf the packet is lost between the ACK controller and the TCP receiver. The TCP receiver receives the TCP packet PK and. as usual, acknowledges It by sending a con-esponding ACKo towards the TCP source. Finally, the ACK controller intercepts ACKo and discards it or uses the ACK for some other ACK°. The ACK controller must also take care of retransmissions. Thus it monitors the flow of acknowledgements ACK' from the TCP receiver. If within some specified time no ACK has been forthcoming, it retransmits the TCP packet with sequence number PK. Notice that here it is possible to use the standard TCP retransmission mechanisms as specmed in IETF RFC 793, Transport Control Protocol", September 1981. Figure 7 illustrates a more detailed example of transmission according to the present invention. Here rt is assumed that there Is enough bandwidth and buffer space available for transmission rates to increase further. Suppose that a packet with the sequence number 64 arnves at the node from the source whilst an aci At a later stage, illustrated by figure 8, there is no longer any unused bandwidth available. Therefore, acknowledgements coming from TCP receiver to the node are now let simply through, so that ACK^ = ACK'. This corresponds to the normal TCP mode. At some other stage, as illustrated by figure 9, congestion may occur. The buffer in the network node has become full and/or the unused bandwidth is small and/or errors due to congestion are detected. Then the node starts to delay acknowledgements (ACK's) flowing from the TCP receiver to the TCP source in order to reduce congestion. The present invention is especially suitable for use in conjunction with radio networks, such as GPRS or third generation cellular networks (3GN), or other systems in which there may be a link that has a rapidly varying capacity for the TCP connection (due, for example, to changing levels of interference). In a radio system the node 25 could be sited near the radio interface in a communications link. The node could receive a signal indicative of the capacity currently available over the radio interface. For example, the node could be sited at the radio network controller (RNC) of a 3GN system. The node monitors the available capacity. When there is a lot of capacity free for TCP traffic coming from outside 3GN system, the node starts to generate early acknowledgements, even though the actual octets are still on their way over the radio interface. Thus, the TCP transmitter will get acknowledgements sooner, speed up rt transmissions, and make better use of the capacity available. On the other hand, during congestion (for example due to poor radio condid'ons) the node can enter the fast TCP mode. • The early acknowledgement method can speed up the TCP slow start process and this way utilise more effectively the available bandwidth, as well as relieve buffer build up problems that can be experienced in prior TCP snooping systems. The method is "perfomied by a node located between a TCP transmitter and a TCP receiver. The node generates and returns acknowledgements to the TCP transmitter for data packets that have not yet reached the node, and therefore have not been received and acknowledged by the TCP receiver. This can reduce the time that TCP transmitter has to wait for an acknowledgement, and thus allows the TCP transmitter to accelerate it transmissions faster than without this mechanism- The sequence of acknowledgements is adjusted according to available bandwidth and buffer space, measurement of sequence number of anival packets and of arival acknowledgements to the node. The early acknowledgement method can be embodied in a node that can operate in two or more (preferably at least three) modes, for example: the early acknowledgement mode, a normal TCP mode and a fast TCP mode. The decision on the mode to be used can, for example, be based on the available, unused bandwidth, on buffer occupancy levels, and on congestion. Figure 10 is a flow diagram that illustrates one example of a decision process on which mode to use. The present invention is not limited to the examples described above. The applicant draws attention to the ^ct that the present invention may include any feature or combination of features disclosed herein efther implicitly or explicitly or any generalisation thereof, without limitation to the scope of any of the present claims. In view of the foregoing description it will be evident to a person skilled in the art that various modifications may be made within the scope of the invention. WE CLAIM: 1. A data communication node for operation in a communication path between a transmitter of datagrams and a receiver of datagrams under a protocol wherein the transmission of datagrams by the transmitter is dependent on it receiving an acknowledgement message for a previously transmitted datagram, the node comprising: detection apparatus for detecting communications in the path; an acknowledgement generator capable of generating acknowledgement messages for datagrams and transmitting those messages to the transmitter; and flow interruption apparatus capable of interrupting communications in the path; characterized in that the node is capable of operating in the second and at least one of the first and third following modes: a first mode in which it does not interrupt communications in the path; a second mode in which it transmits acknowledgement messages for a datagrams succeeding the latest datagram detected at the node; and third mode in which it delays the communication of acknowledgement messages to the transmitter. 2. The data communication node as claimed in claim 1, wherein the second and/or third modes the node interrupts the communication of acknowledgement messages from the receiver to the transmitter. 3. The data communication node as claimed in claim 1 or 2, comprising a memory; and wherein in the second and/or third mode the node stores in the memory datagrams detected in transmission from the transmitter to the receiver. 4. The data communication node as claimed in claim 3, wherein in the second and/or third mode the node interrupts the communication of datagrams from the transmitter to the receiver. 5. The data communication node as claimed in claim 3 or 4, wherein in the second and/or third mode if the node detects no acknowledgement message for a datagram from the receiver within a set period it retransmits that datagram to the receiver. 6. The data communication node as claimed in any one of claims 3 to 5, wherein in the second and/or third mode on receiving an acknowledgement message for a datagram the node deletes that datagram from the memory. 7. The data communication node as claimed in any one of the preceding claims, comprising mode determination unit for determining the mode of operation of the node. 8. The data communication node as claimed in claim 7, wherein the mode determination unit is capable of determining whether there is available capacity in the communication path and if there is available capacity causing the node to operate in the second mode. 9. The data communication node as claimed in claim 7 or 8, wherein the mode determination unit is capable of determining whether there is congestion in the communication path and if there is congestion causing the node to operate in the third mode. 10. The data communication node as claimed in claim 9 as dependent on claim 8, wherein if there is no available capacity or congestion in the communication path the determination unit is capable of causing the node to enter the first mode. 11. The data communication node as claimed in any one of the preceding claims, wherein the node is capable of operating in any of the first, second and third modes. 12. The data communication node as claimed in any one of the preceding claims, wherein the protocol is a transmission control protocol (TCP). 13. The data communication node as claimed in any one of the preceding claims, wherein the protocol provides an operation type in which the transmitter will not transmit a datagram unit it has received an acknowledgement message for a datagram transmitted a stored interval previously. 14. The data communication node as claimed in claim 13, wherein in the said operation type the protocol provides that the stored interval is increased if an acknowledgement message is received. 15. The data communication node as claimed in claim 13 or 14, wherein the said operation type is slow start operation type. 16. The data communication node as claimed in any one of the preceding claims, wherein at least part of the communication path is a radio link. 17. The data communication node as claimed in claim 12, wherein the radio link is a cellular radio link. 18. A method for data communication over a communication path between a transmitter of datagrams and a receiver of datagrams under a protocol wherein the transmission of datagrams by the transmitter is dependent on it receiving an acknowledgement message for a previously transmitted datagram, there being a node located in the communication path between the transmitter and the receiver; characterized in that the method comprises: the transmitter transmitting datagrams towards the receiver; the node detecting the said datagrams; and the node repeatedly transmitting to the transmitter an acknowledgement message for a datagram succeeding the latest datagram detected at the node. 19. The method as claimed in claim 18, wherein the protocol is a transmission control protocol (TCP). 20. The method as claimed in claim 18 or 19, wherein the protocol provides an operation type in which the transmitter will not transmit a datagram until it has received an acknowledgement message for a datagram transmitted a stored interval previously. 21. The method as claimed in claim 20, wherein in the said operation type the protocol provides that the stored interval is increased if an acknowledgement message is received. 22. The method as claimed in claim 20 or 21, wherein the said operation type is a slow start operation type. 23. The method as claimed in any one of the preceding claims, wherein at least part of the communication path is a radio link. 24. The method as claimed in claim 23, wherein the radio link is a cellular radio link. 25. A data communication node substantially as herein described with reference to the accompanying drawings. 26. A method for data communication substantially as herein described with reference to the accompanying drawings.

Documents:

139-chenp-2003-abstract.pdf

139-chenp-2003-claims duplicate.pdf

139-chenp-2003-claims original.pdf

139-chenp-2003-correspondnece-others.pdf

139-chenp-2003-correspondnece-po.pdf

139-chenp-2003-description(complete) duplicate.pdf

139-chenp-2003-description(complete) original.pdf

139-chenp-2003-drawings.pdf

139-chenp-2003-form 1.pdf

139-chenp-2003-form 19.pdf

139-chenp-2003-form 26.pdf

139-chenp-2003-form 3.pdf

139-chenp-2003-form 5.pdf

139-chenp-2003-pct.pdf