US20110206043A1 - System and method for achieving accelerated throughput - Google Patents

System and method for achieving accelerated throughput Download PDF

Info

Publication number
US20110206043A1
US20110206043A1 US13/097,991 US201113097991A US2011206043A1 US 20110206043 A1 US20110206043 A1 US 20110206043A1 US 201113097991 A US201113097991 A US 201113097991A US 2011206043 A1 US2011206043 A1 US 2011206043A1
Authority
US
United States
Prior art keywords
data
method
encoded
data units
encoding
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.)
Abandoned
Application number
US13/097,991
Inventor
Matthew Robert WILLIAMS
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.)
LiveQoS Inc
Original Assignee
IPeak Networks Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority to US10/912,200 priority Critical patent/US7742501B2/en
Priority to US12/193,345 priority patent/US8009696B2/en
Priority to US12/718,650 priority patent/US7953114B2/en
Application filed by IPeak Networks Inc filed Critical IPeak Networks Inc
Priority to US13/097,991 priority patent/US20110206043A1/en
Assigned to IPEAK NETWORKS INCORPORATED reassignment IPEAK NETWORKS INCORPORATED ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: VEMULAPALI, MOHAN KRISHNA, WILLIAMS, MATTHEW ROBERT
Publication of US20110206043A1 publication Critical patent/US20110206043A1/en
Assigned to LiveQoS Inc. reassignment LiveQoS Inc. CHANGE OF NAME (SEE DOCUMENT FOR DETAILS). Assignors: IPEAK NETWORKS INCORPORATED
Application status is Abandoned legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Application independent communication protocol aspects or techniques in packet data networks
    • H04L69/30Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32High level architectural aspects of 7-layer open systems interconnection [OSI] type protocol stacks
    • H04L69/322Aspects of intra-layer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/325Aspects of intra-layer communication protocols among peer entities or protocol data unit [PDU] definitions in the network layer, i.e. layer three, e.g. X.25
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/0001Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0006Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format
    • H04L1/0007Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format by modifying the frame length
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041Arrangements at the transmitter end
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0067Rate matching
    • H04L1/0068Rate matching by puncturing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0071Use of interleaving
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0072Error control for data other than payload data, e.g. control data
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/08Arrangements for detecting or preventing errors in the information received by repeating transmission, e.g. Verdan system
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing packet switching networks
    • H04L43/08Monitoring based on specific metrics
    • H04L43/0823Errors
    • H04L43/0829Packet loss
    • H04L43/0835One way packet loss
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing packet switching networks
    • H04L43/08Monitoring based on specific metrics
    • H04L43/0876Network utilization
    • H04L43/0888Throughput
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0057Block codes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements 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/18Automatic repetition systems, e.g. van Duuren system ; ARQ protocols
    • H04L1/1809Selective-repeat protocols
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements 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/18Automatic repetition systems, e.g. van Duuren system ; ARQ protocols
    • H04L1/1812Hybrid protocols
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L2001/0092Error control systems characterised by the topology of the transmission link
    • H04L2001/0097Relays

Abstract

Systems and methods for transporting data between two endpoints over an encoded channel are disclosed. Data transmission units (data units) from the source network are received at an encoding component logically located between the endpoints. These first data units are subdivided into second data units and are transmitted to the destination network over the transport network. Also transmitted are encoded or extra second data units that allow the original first data units to be recreated even if some of the second data units are lost. These encoded second data units may be merely copies of the second data units transmitted, parity second data units, or second data units which have been encoded using erasure correcting coding. At the receiving endpoint, the second data units are received and are used to recreate the original first data units.

Description

    CROSS REFERENCE TO RELATED APPLICATIONS
  • This application is a continuation-in-part of U.S. application Ser. No. 12/193,345, filed Aug. 18, 2008, which is a continuation-in-part of U.S. application Ser. No. 10/912,200, filed Aug. 6, 2004, the contents of which are incorporated herein by reference in their entirety.
  • FIELD OF THE INVENTION
  • The present invention relates to communication data networks. More specifically, the present invention relates to systems and methods for increasing the throughput of data transmissions through a transport network as seen from the edge of the transport network.
  • BACKGROUND OF THE INVENTION
  • Most, if not all, transport networks are packet based networks that break up data streams into smaller packets of data which are then transmitted from a first source network, or endpoint, to a third destination network, or endpoint, via a second transport network. However, due to congestion and other network limitations, not all packets successfully arrive at the destination network. What matters to the source and end destination networks is the performance of the transport network. The transport network must, from the point of view of the applications at the end networks, ideally be perfect with no lost packets. However, it would be preferred if such performance could be had for a price lower than the usual costs of leasing high performance transport networks.
  • Accordingly, there is a need for systems and methods, which can be used with low cost communications transport networks to provide end network applications with a high performance view of the transport network.
  • Approaches have been tried to address the above situation. In one approach, custom protocol stacks are installed at the endpoints to improve the response to loss and latency. However, this approach requires that both end networks communicate according to the same custom protocol, which generally requires extensive reprogramming.
  • Another approach uses network elements that intercept standard protocols and send protocol responses on behalf of a far-end element. Custom protocols are then used between the intercepting network elements. This approach is limited to TCP/IP applications and adds complexity, especially in regards to troubleshooting network problems.
  • SUMMARY OF THE INVENTION
  • In a first aspect, there is provided a method of accelerating data communications over an unreliable network. The method comprises: providing encoding components associated with each of two endpoints to a communication; establishing an encoded channel between the encoding components for a communication session between the endpoints; intercepting a plurality of data packets related to the communication at one of the encoding components; segmenting and packaging each of the plurality of data packets to provide a segmented and packaged data packet having at least one encoded data segment and at least one extra encoded segment for transmission to the other of the encoding components; storing the segmented and packaged data packets at the one of the encoding components; transmitting the segmented and packaged data packets to the other of the encoding components over the encoded channel when a predetermined condition is met; decoding and reassembling the plurality of data packets at the other of the encoding components based on received encoded data segments and received extra encoded segments; and transmitting the reassembled data packets from the other of the encoding components to its respective endpoint.
  • The predetermined condition can be expiry of a timer, which can, for example, be activated when a respective one of the plurality of data packets is intercepted. The predetermined condition can also be interception of a packet containing real-time sensitive data, or storage of a predetermined number of the segmented and packaged data packets.
  • The encoded data segments and the at least one extra encoded segment for the plurality of data packets can be interleaved and transmitted in a manner to preserve their ordering. For example, the packaged and segmented data packets can be stored in order and according to their respective sizes, and segments can be transmitted in turn from each packaged and segmented data packet. Alternately, the encoded data segments and the at least one extra encoded segment for each of the plurality of data packets are transmitted in random order.
  • The method can further comprise determining that one of the encoded data segments is lost if it has not been received at the other of the encoding components within a predetermined period, such as upon expiry of a timer set when a first encoded data segment for a given data packet is received, or by reference to a ring buffer. In the latter case, the ring buffer can track sequence numbers of missing encoded data segments, and determine that a given encoded data segment is lost when the ring buffer cycles back to a sequence number of the given encoded data segment. The method can further comprise interleaving encoded data segments from the plurality of data packets when it is determined that a predetermined number of encoded data segments from a given segmented and packaged data packet have been lost.
  • Segmenting and packaging a data packet can comprise segmenting and packaging the data packet into n encoded data segments, where n>1. In this case, n can be dynamically adjusted based on size of the data packet; for example, n can be selected such that size of encoded data segments does not exceed a predetermined maximum transfer unit size.
  • In a further aspect, there is provided a method of accelerating data communications over an unreliable network. The method comprises establishing an encoded channel between first and second encoding components for a communication session between two endpoints by: detecting, at the first encoding component, a message originating from a first of the two endpoints and destined to the other of the two endpoints, creating a marked message destined to the other endpoint with a mark to indicate that the first endpoint is enabled to segment and encode data packets according to a protocol known to both encoding components, wherein the mark is selected from a plurality of available marks, forwarding the marked message to the other endpoint, receiving a reply to the marked message from the second encoding component, and exchanging control messages to establish a communication channel between the encoding components; intercepting a data packet related to the communication at one of the first and second encoding components; segmenting and packaging the data packet to provide encoded data segments for transmission to the other of the first and second encoding components; transmitting the encoded data segments and at least one extra encoded segment to the other of the first and second encoding components over the encoded channel; decoding and reassembling the data packet at the other of the first and second encoding components based on the received encoded data segments; and transmitting the reassembled data packet from the other of the first and second encoding components to its respective endpoint.
  • According to this aspect, establishing the encoded channel can further comprise storing information uniquely identifying the communication session. An identification of the mark for use in subsequent communication sessions between the encoding components can be stored. If no reply is received within a predetermined time, a further marked message can be created by selecting a further mark from the plurality of available marks. If no reply is received for any of the plurality of available marks, a network manager is advised that the second endpoint is not enabled for accelerated communication with the first endpoint.
  • The method can further comprise entering a tear down state if no encoded data packets are transmitted within a predetermined timeout period. During the tear down state, newly received data packets are not segmented and packaged. The encoding components can further transmit keep alive messages during periods of inactivity. One of the endpoints can also be designated as a master endpoint, and the method can further comprise the master endpoint determining if tear down of the encoded channel is indicated. For example, the master endpoint can determine that tear down is indicated if no new data packets are received within a predetermined period.
  • The first and second encoding components can have precedence over other encoding components. If they have precedence, the method can further comprise receiving, at the first encoding component, a marked packet from an encoding component other than the first and second encoding components; asserting precedence by: removing marking from the marked packet; and establishing the encoded channel between the first and second encoding components. The first and second encoding components can also be configured to ignore marked packets received from specified encoding components, and to transmit the marked packets transparently.
  • In a further aspect, there is provided a method of setting an encoding rate for encoding data for accelerated data communication across an unreliable network between two endpoints each respectively associated with an encoding component; comprising: establishing an encoded channel between the encoding components for a communication session between the endpoints; intercepting a data packet related to the communication at one of the encoding components; segmenting and packaging the data packet to provide encoded data segments for transmission to the other of the encoding components; transmitting the encoded data segments and at least one extra encoded segment to the other of the encoding components over the encoded channel; decoding and reassembling the data packet at the other of the encoding components based on the received encoded data segments; transmitting the reassembled data packet from the other of the encoding components to its respective endpoint; computing a weighted loss ratio for the communication session; and adjusting the encoding rate based on the weighted loss ratio. Computing the weighted ratio can, for example, comprise computing the weighted ratio in accordance with average loss ratios of previous communication sessions, or in accordance with retransmission requests.
  • The method can further comprise computing a current loss level in accordance with the weighted loss ratio. The weighted loss ratio can also be normalized. The current loss level can be communicated to the other of the encoding components, such as over a control channel, or in a header portion of one of the encoded data segments. The header portion can further identify a desired level of protection, which can be determined in accordance with loss objectives configured according to a network policy.
  • Other aspects and features of the present invention will become apparent to those ordinarily skilled in the art upon review of the following description of specific embodiments of the invention in conjunction with the accompanying figures.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • Embodiments of the present invention will now be described, by way of example only, with reference to the attached Figures, wherein:
  • FIG. 1 is a block diagram of an environment in which the invention may be practiced.
  • FIG. 2 is a block diagram illustrating the components in a server used in FIG. 1.
  • FIG. 3 is a block diagram illustrating the components in another server used in FIG. 1.
  • FIG. 4 shows an example of burst mode according to an embodiment of the present invention.
  • FIG. 5 shows an example of multi-level burst mode according to an embodiment of the present invention.
  • FIG. 6 is a flowchart illustrating the steps executed when first data units are received and transformed into second data units for transmission to the transport network.
  • FIG. 7 is a flowchart illustrating the steps executed when second data units are received from the transport network and transformed into first data units for transmission to an end network.
  • FIG. 8 illustrates an exemplary system and a connection negotiation protocol according to an embodiment of the present Invention.
  • FIG. 9 shows an example network with multiple encoding components according to an embodiment of the present invention.
  • FIG. 10 illustrates a generic segmentation and encoding of a packet according to the present invention.
  • FIG. 11 shows an exemplary segmentation and encoding of a packet according to an embodiment of the present invention.
  • FIG. 12 shows a first example algorithm to evaluate loss according to an embodiment of the present invention.
  • FIG. 13 shows an example embodiment considering average loss according to an embodiment of the present invention.
  • DETAILED DESCRIPTION
  • Referring to FIG. 1, a block diagram of an environment in which the invention may be practiced is illustrated. A first endpoint 10 communicates, through a network 20, with a second endpoint 30. The first endpoint 10 and the network 20 communicate through an encoding/decoding component 40, while the network 20 communicates with the second endpoint 30 through an encoding/decoding component 50. The encoding/decoding components 40 and 50, hereafter referred to as encoding components, can be resident at the endpoints, or in an intermediate device, such as a server. The first and second endpoints 10 and 30 can be terminals, such as personal computers connected through a modem, local or wide-area networks, or other devices or systems having access to the network 20. The network 20 can be, for example, the Internet or other communications network.
  • As used herein, a data unit is any unit of data that can be used to transmit data digitally over a network. Such data units can take the form of packets, cells, frames, or any other such units, provided the data is encapsulated within the unit, or carried as a payload. The term data unit is applicable to any and all packets and frames that implement specific protocols, standards, or transmission schemes. Typically, a header, carrying routing, control and identification information, is added to the data payload.
  • The present system provides a means for insulating the endpoints from the vagaries of the network 20. The encoding components 40 and 50 are provided with means to insulate the endpoints 10 and 30 from the network 20 by handling the encoding and decoding of data units, and their transmission through the network 20. The endpoints 10 and 30 can communicate using any protocol, as can the encoding components 40 and 50. The encoding components 40 and 50 receive original data units in one protocol from the endpoints 10 and 30, and encode the original data units by subdividing them into preferably smaller data units, creating extra data units that can be used to recreate or reconstruct the original data units in the event that some of the data units transmitted through the transport network are lost, and repackaging the subdivided and extra data units according to the present protocol prior to transmitting them through the transport network.
  • Once the data units transmitted through the transport network 20 are received at the encoding component associated with the far endpoint, the original data units from the originating endpoint are recreated or reconstructed. This recreation or reconstruction can be done by reordering the received data units, if necessary, and, if some data units were lost during transmission, using the extra data units to recreate missing data units. In the event the extra data units received are insufficient to recreate the original data units, the receiving encoding component can optionally request a re-transmission of the data units previously sent.
  • For ease of explanation, data units originating from or received at the endpoints will be referred to as first data units, or packets, and as being of a first type of data unit. Data units being transmitted across and/or received from the transport network will be referred to as second data units, or segments and as being of a second type of data unit. The second data units are also referred to as encoded data units.
  • FIG. 2 shows an exemplary embodiment of modules necessary to implement the present invention within encoding component 40, and their respective data flows. The modules can be resident in a single device, or can be distributed amongst several devices. As can be seen, encoding component 40 has a first interface 60, a second interface 70, a reassembly module 80, and a segmentation module 90. The first interface 60 sends and receives first data units to and from an endpoint 10. The second interface 70 of the server 40 sends and receives second data units to and from the transport network 20.
  • The reassembly module 80 receives second data units from the second interface 70 and produces first data units for transmission to the first network 10 by way of the first interface 60. The segmentation module 90, on the other hand, receives first data units from the first interface 60 and produces second data units for transmission to the transport network 20 by way of the second interface 70.
  • Once the second data units have been transmitted through the transport network, they are received by the encoding component at the other endpoint. To illustrate this, FIG. 3 illustrates an exemplary embodiment of the modules and data flow of encoding component 50, which communicates with the transport network and endpoint 30.
  • The modules in the encoding component 50 are the same as those in encoding component 40 and, in fact, have the same functions. The second interface 70A in encoding component 50 also communicates with the transport network and sends and receives second data units. The first interface 60A also communicates with an endpoint (in this case the endpoint 30) and sends and receives first data units. The reassembly module 80A receives second data units and produces first data units while the segmentation module 90A receives first data units and produces second data units.
  • As noted above, first data units are the data units used by the end networks, while second data units are used by the transport network and the encoding components 40, 50 when transmitting data to and from each other. The second data units are derived from the first data units. The payload of the first data units can be divided into smaller units and each smaller unit can be the payload in a second data unit. As such, each second data unit can be smaller than the original first data unit from which it was derived. As an example, a 10 kB first data unit may be subdivided into five 2 kB units. These may be the payload of five second data units, each of which may be smaller than 10 kB. This function of creating second data units from first data units is accomplished by the segmentation modules 90, 90A.
  • To assist in recreating the original first data unit from which the second data units were derived from, the segmentation module also creates extra second data units. These extra second data units can be derived from the first and second data units. The extra second data units assist the reassembly modules 80, 80A in recreating or reassembling the original first data unit in the event one or more second data units are lost during their transmission through the transport network.
  • The extra second data units can take many forms. In perhaps the simplest embodiment, the extra second data units are merely copies of selected second data units previously sent. As an example, if a first data unit is divided or segmented into four second data units (e.g. DU1, DU2, DU3, DU4), then the extra second data units could be copies of DU2 and DU3. As such, if DU2 or DU3 are lost during the transmission, then the original first data unit can still be recreated. The number and identification of the second data units that are duplicated can be predetermined, or left to the discretion of the system administrator. More redundancy can be built in to the system by including more duplicate second data units, or vice versa for less redundancy, depending on the actual or expected degree of loss in the network 20. In the simplest case, all the second data units can be duplicated to ensure that, in essence, two copies of each second data unit are sent to the destination encoding component.
  • Parity data units can also be used as the second extra data units. As is well known in the art, a parity data unit can be created using the XOR function. The bits of the different second data units created from the original first data unit can be XOR'd to result in bit values which can be stored in an extra second data unit. If any one of the second data units (not including the extra second data unit) is lost during transmission, the other received second data units and the extra second data unit can be used to recreate the lost second data unit. Performing an XOR function on the received second data units and the extra second data unit will recreate the missing second data unit.
  • It should be noted that the extra second data units may be encoded using other erasure correcting codes. As an example, if n second data units are generated for a single first data unit, m extra second data units may be generated to allow the lost second data units to be recreated. As noted above, the m extra second data units may be viewed as “redundant” second data units and, if mere duplication is used, m≦n with complete duplication being achieved at m=n. However, if erasure correcting codes are used, with m=2, it is possible to encode the redundant information in such a way that any two second data units can be lost and the reassembly modules can still reconstruct the lost second data units. Well-known methods and coding techniques such as Reed-Solomon, Forward Erasure Correction techniques, and Bose-Chaudhuri-Hochquenghem (BCH) codes, and a multitude of others may be used.
  • While the extra second data units should assist in counteracting the effects of losing some second data units, losing too many second data units cannot be completely compensated for. As such, losing a number of second data units past a threshold level can optionally cause the reassembly modules to request a re-transmission of a package or group of second data units. As an example, if the extra second data units can recover from a 25% loss of data units and there are four second data units generated from a single first data unit, then the loss of a single second data unit would not trigger a re-transmission request. However, with the loss of two second data units (i.e. a 50% loss) the reassembly module could request a re-transmission. If re-transmission is enabled, the re-transmission threshold is ideally related to the error or loss-correcting capability of the coding used for the extra or redundant second data units. The reassembly modules can keep track of the number of second data units received for each first data unit that has been segmented, as the reassembly modules will need to properly sequence the payloads of the second data units.
  • As can be noted from the above, the reassembly modules 80 and 80A decode and reassemble the second data units received to form the original first data units. The second and extra second data units received are tracked to determine if a sufficient number have been received to recreate the original first data unit. If a sufficient number have not been received, retransmission can optionally be requested. If some second data units have been lost, then the reassembly modules can recreate or reconstruct the missing second data units. As noted above, this process depends upon the coding used and the overall strategy employed. Such decoding and error correction processes are well known to those versed in this art.
  • Once the required number of second data units has been received, their payloads are extracted and used to reconstruct the original first data unit from which the second data units were derived. This may be as simple as concatenating the payloads of the second data units to result in the reconstructed first data unit. However, as noted above regarding the decoding, the reconstruction process will depend upon the process used to segment or divide the original first data unit. Once the original first data unit is reconstructed, it can be forwarded to the appropriate Interface communicating with the receiving endpoint.
  • Regarding the segmentation modules, these modules perform the task of segmenting or dividing the first data units and “repackaging” the segments into second data units. The segmentation modules also encode the extra second data units as discussed above. The second data units, both those derived from the first data unit and the extra second data units, are then passed on to the interface module, which communicates with the transport network. To facilitate the optional re-transmission of second data units, the segmentation module can also buffer second data units. As an example, if five first data units have been segmented into twenty second data units and five extra second data units, the segmentation module can buffer the last three sets of second data units corresponding to the last three first data units encoded. Thus, twelve second data units and three extra second data units would be buffered by the segmentation module.
  • The segmentation module can also be configured to transmit second data units in an interleaved manner, to spread the risk of losing multiple second data units across different segmented first data units. Thus, instead of sequentially sending groups of second data units such that each group corresponds to a single first data unit, second data units from different first data units can be interleaved with one another. FIG. 4 illustrates an example of the interleaving mode. In this example, it is assumed that first data units A, B, and C are respectively segmented into second data units A1, A2; B1, B2, B3; C1, C2, C3 and C4. Second data units A2, B3 and C4 are extra second data units. Instead of sending these second data units grouped according to their respective first data units, they can be interleaved by groups of k first data units. In the example of FIG. 4, k=3. The encoder stores the second data units corresponding to k first data units into a buffer 1303. Alternatively, the encoder stores a number of packets that arrive during a predetermined time period or until a packet with time sensitive information is detected (e.g. via deep packet inspection). To avoid reordering, the set of second data units is aligned to the left such that the last second data of each first data unit is at the tail and will be sent last and the first second data unit of each first data unit is at the head and will be transmitted first. The encoding component transmits on the physical interface 1304 the data units at the head in order of top to bottom or any order that will minimize sending two consecutive second data unit from the same first data unit. In the example of FIG. 4, the second data units could be sent in the following order C1, B1, C2, A1, B2, C3, A2, B3, C4. Sending all the extra second data units last can minimize delay. The interleaving can also be done randomly. The group of data units to interleave can include all the second data units transmitted from the interface or the interleaving group can include second data units of the same application (e.g. same channels of a video conference), the same destination or a preconfigured grouping. In FIG. 5, another level of interleaving can be achieved, by interleaving the second data units of different interleaved groups 1401, 1402, 1403 of interleaved second data units. By such interleaving, the impact of any large loss of data units can be minimized, and, depending on the coding and strategy employed, this type of loss may be recoverable.
  • An exemplary method according to the present invention, as implemented in one of encoding components 40 and 50, is shown in FIG. 6. The process begins, with step 100, by receiving a first data unit from the source endpoint. After being received, the first data unit is then divided or segmented (step 110) and the segments are packaged into second data units (step 120). Once the second data units are created, the extra or redundant second data units are encoded and created (step 130). The second data units can then be optionally buffered (step 140) and transmitted to the transport network (step 150). The method then returns to step 100 via connector A. If re-transmission is enabled, an optional check for a re-transmission request can be made (step 160) asynchronously. If such a request is received, then the decision flow returns to step 150, and the requested second data units, previously buffered in optional step 140, can be transmitted.
  • FIG. 7 shows an exemplary embodiment of steps executed by an encoding component receiving second data units from the transport network. The process begins at step 180 as the server receives second data units from the transport network. Decision 190 then determines if all the second data units have been received to reconstruct the first data unit from which the second data units were derived. The encoding component receiving the second data units determines that a second data unit is lost if it has not been received after a predetermined amount of time and/or if a predetermined number of second data units with higher sequence numbers is received. Another technique to determine if a second data unit is lost is to use a ring buffer to keep track of the sequence number of the missing second data unit while waiting for it to arrive. When the buffer cycles back over a second data unit that has still not been received, then that second data unit is deemed lost. If all the second data units have been received, then the original first data unit is recreated at step 200. Once the first data unit have been recreated, the recreated data unit is transmitted to the destination endpoint (step 205) and the control flow moves back to step 180 by way of connector D.
  • Returning to decision 190, if not all the second data units have been received, then a decision is made to determine if extra second data units have been received (step 220). If no extra second data units have been received, re-transmission can be optionally requested (step 230). After the optional re-transmission request, the control flow returns to step 180 by way of connector D. If extra second data units have been received, decision 240 determines if sufficient extra second data units and second data units have been received to reconstruct the original first data unit. If an insufficient number have been received, the original packet can be dropped, or, optionally, the control flow can return, as indicated by connector C, to step 230: requesting a re-transmission. If a sufficient number of second data units and extra second data units have been received, then the extra second data units can be used to recreate or reconstruct the missing second data units (step 260). Connector B then returns the control flow to step 200.
  • Some specific examples of implementation will aid in understanding the operation of the present system and method. FIG. 8 shows an exemplary system having endpoints A and B. Endpoint A communicates with a network 300, such as the Internet, through an encoding component 302. Endpoint B is also in communication with the network 300 through an encoding component 304. Encoding components 302 and 304 include the interfaces, segmentation and reassembly modules described in relation to FIGS. 2 and 3, and can be implemented wholly in software or can be implemented as pre-programmed hardware units, other related software, or as a combination of hardware and software components. An Ethernet, or other suitable connection, can be used to connect each endpoint to its respective encoding component.
  • For the purposes of this example, it is assumed that a bidirectional communication is occurring between endpoints A and B, and that endpoint A initiates the communication. The present communication protocol is invisible to both endpoints A and B; all functionality resides in the encoding components 302 and 304. To set up a session between endpoints A and B, and to determine if both endpoints are associated with encoding components to permit communication in accordance with the present protocol, the connection negotiation protocol illustrated in FIG. 8 can be used. Endpoint A sends a packet P destined to endpoint B. The packet P and its destination are detected or noticed (306) by encoding component 302, and encoding component 302 stores information uniquely identifying the communication session. Packet P is also detected or noticed (308) by encoding component 304. Encoding component 304 stores information uniquely identifying the communication session (310) related to the packet and sends the packet to endpoint B. When endpoint B sends a reply packet R to endpoint A, the reply packet R is intercepted by encoding component 304, matched with the previously stored information identifying the communication session and marked (312). The information uniquely identifying the communication session can be, for example, the source IP address, the destination IP address, the protocol contained within the IP packet (e.g. UDP or TCP), and the source and destination ports. For Ethernet frames, the VLAN ID can also be used.
  • The marked packet Rm is used to signal to encoding component 302 that encoding component 304 is capable of receiving and sending packets segmented and encoded according to the present invention. Marking the packet can consist of, for example, setting an option in the IP header of the packet, and/or setting the IP Identification field to a known value. Routers and other devices in the public network 300 may leave the IP identification field unchanged during transmission. Other suitable marking or signaling schemes, such as setting the IP address flag in the timestamp, can be used, provided that they are preferably non-destructive, and non-disruptive to devices that are not capable of communication in accordance with the present protocol.
  • Encoding component 304 then forwards the marked packet Rm to endpoint A, via the public network 300. The marked packet Rm is detected by encoding component 302, which updates the previously stored information identifying the communication session (316), and sends the packet to endpoint A. The encoding component 302 can optionally remove the mark prior to forwarding the packet to endpoint A. When endpoint A sends another packet P2 destined to endpoint B, encoding component 302 matches (318) the packet P2 with the previously stored information identifying the communication session. Recognizing that endpoint B is provided with an encoding component enabled to communicate in accordance with the present protocol, encoding component 302 sends a “hello” message in addition to forwarding the packet P2.
  • On receipt of the “hello” message from encoding component 302, encoding component 304 replies with a “hello” reply. Encoding component 302 then sends a reply acknowledgment (“reply ack”) to encoding component 304, and begins to segment and encode data packets destined for endpoint B using the present protocol. When component 304 receives the reply acknowledgment from component 302, it also begins to segment and encode data packets destined for endpoint A to provide the second data units previously described. The encoded channel between encoding component 302 and 304 is thus successfully automatically detected and negotiated. The encoded channel can be used to carry both data and control information. Once an encoded channel has been negotiated between two encoding components enabled to use the present protocol, segmented and/or encoded messages can now be sent and received.
  • Encoding component 304 optionally maintains a table of the different types of markings that are possible. If the marked packet Rm is not detected by the encoding component 302, either because it does not recognize the mark or because a router or other device in the path removed the mark, then no “hello” reply will be sent back to encoding component 304. After some predetermined delay, the encoding component 304 will mark another packet Rm2 with a different type of mark from the table of the different types of markings. The encoding component can continue to change the mark until encoding component 302 sends the “hello” message to acknowledge receipt of the mark. Encoding component 304 can keep track of which mark was successful to reach another encoding component and use that mark first when it tries to reach that encoding component again in the future. After all the types of mark have been unsuccessfully tried to establish a channel, the encoding component 304 can indicate to a network management system or to an interface that a given encoding component 302 is not capable of understanding the mark or is not present in the network. Statistics can be gathered by the encoding component 304 or an external system on how often the other encoding component 302 would have been part of an encoded channel to prioritize the installation of more encoding software.
  • The encoded channel remains active until a predetermined timeout period has elapsed during which the encoding components fail to receive any further packets. Both sides then tear down the encoded channel. Since the timers at both ends of the communication channel are not synchronized, an endpoint can enter a “tear down” state after the predetermined timeout period. During the “tear down” state, the incoming packets continue to be decoded, but the outgoing packets are no longer encoded. The “tear down” state is active for a predetermined period, or until no encoded packets are received. The endpoints can send “keep alive” messages to keep the channel alive while there is no traffic. After a predetermined period where no traffic is sent, the keep alive can be stopped and the channel will be tore down after a predetermined timeout period. Alternatively, one of the endpoints can be designated as the master endpoint (either endpoint A or endpoint B), and can explicitly tear down the channel by sending a tear down message. Upon receipt of the tear down notification, the non-master endpoint stops to decode incoming packets from the master endpoint and stops encoding packets destined to the master endpoint. Other methods for negotiating the encoded channel between two endpoints are also contemplated. For example, the encoded channel can be negotiated through a pre-existing control channel between the endpoints to the communication.
  • It should be noted that all communication between the endpoints and the components 302 and 304 occurs over the established or existing communication channel. The channel can implement known communication protocols, such as Universal Datagram Protocol (UDP) and Transmission Control Protocol (TCP), both over IP. If the connection is a UDP connection, messages according to the present invention are inserted directly into the UDP data payload.
  • If sending data over an existing TCP connection, the original TCP header can be appended to each segment, with the sequence numbers modified. Thus, the source port and destination ports remain the same. The first segment is given the sequence number of the original packet, but subsequent segments are provided with new sequence numbers. In a presently preferred embodiment, an encoded or extra segment re-uses a sequence number of one of its related segments. This permits the extra segment to pass through firewalls in the same manner as would a re-transmitted packet. The data offset and checksum are modified in each segment and the flags, or control bits, are modified for all but the initial segment. For non-segmented messages (i.e. control messages), the remaining message bytes immediately follow the modified TCP header. For segmented messages, a segment payload follows the modified TCP header to provide, for example, identifying information, such as a serial number, to identify a segment and its relation to other segments, and to enable reassembly of the original packet. The data payload of the segment then follows.
  • As will be appreciated, a packet marked or created as described above will pass unchallenged through firewalls and Network Address Translation (NAT) translators. Effectively, the encoded channel establishes a control channel between the encoding components 302 and 304, and packets can pass from either end without being recognized or challenged by any intermediate component, such as a firewall or NAT.
  • Referring now to FIG. 9, multiple encoding components 1001, 1002, 1003, 1004 are present in a path. In one embodiment of the invention, the encoding is only performed in the inner most path between encoding components 1002 and encoding component 1003. Since encoding component 1001 is not aware of the presence of the other encoding components, which have precedence, it marks the packet to establish a channel as described above. The encoding component 1002, which is configured to have precedence, removes the information and establishes an encoding session to encoding component 1003. Encoding component 1003 is configured to terminate the encoding session and perform the decoding as described above. The encoded channel will be active between the inner encoding components 1002, 1003. Encoding components can be configured to take precedence such that specific parts or paths of the network are always encoded.
  • Encoding component B 1002 and encoding component C 1003 can be configured to ignore the marks incoming from specific physical ports and to carry the mark transparently, in this case, the encoding is present in the entire path between encoding component A 1001 and D 1004. The encoding components can also learn topology of the other encoding components in the network and, based on network policy, ignore or react to a mark arriving on a specific physical port.
  • Segmentation and encoding of a packet according to an embodiment of the present invention will now be described with reference to FIG. 10. To simplify the discussion, headers have been omitted from the original packet and the segmented packets. An original data payload 400 is received at an encoding component according to the present invention. The original data payload has x bytes, and is segmented into n segments 402. Where n is chosen as an integer factor of x, each of the n segments will have x/n bytes, as shown. In addition, m additional segments are created. In the example shown in FIG. 10, m=1 and the additional or extra packet 404 is a parity segment created by applying an XOR function to one of the n segments. The encoding component can take into account the size of the packet and can increase n automatically to avoid transmitting a second data unit of a size that would exceed the Maximum Transfer Unit (MTU) of the network when the encoding header is added to the second data unit. This capability can also be useful for splitting jumbo frames prior to entering a network that cannot handle them.
  • It may not always be possible or desirable to divide the original data payload 400 into even segments. For example, it may be necessary to pad the last segment to ensure all segments are of equal length where n is not a factor of x. For example, if x=17 and n=2, the nearest integer value to x/n is 9. Segment sizes that are factors of 4 or 8 are generally preferred, thus the segment size in this case is chosen to be the next factor of 4 greater than, or equal to x/n (e.g. 12 bytes). As shown in FIG. 11, the original 17 byte data payload 410 is segmented into two 12 byte segment payloads 412 and 414. Segment payload 412 contains the first 12 bytes of the original data payload 410, and segment payload 414 contains the remaining 5 bytes from the original data payload 410 optionally padded out to 12 bytes. A further extra segment 416, which is a parity segment of segment 412, forms the final segment in the sequence. It should be noted that all the segments related to a single original packet or frame have the same serial number to permit their identification and reassembly at the receiving end.
  • The encoding rate is determined by both n and m. The encoding rate can be set to predetermined values (e.g. n=2, m=1 as shown in FIG. 11), or can be adjusted based on observed and/or reported network performance for all encoded channels terminating at an encoding component associated with a given endpoint.
  • Referring to FIG. 12. The determination of the loss level is described in relation to the encoded channel between encoding component A 1106 and encoding component B 1107, more specifically looking at the channel in the direction from encoding component A to encoding component B 1110. Under a “no loss” condition, the encoding can be set to n=1 and m=0 to avoid using extra bandwidth in the network when it is not necessary. The receiving process 1109 of the encoding component B 1107 counts the number of packets received Px and the number of packets lost LPx over an interval period of size of W units of time (for example W=8 seconds) 1100. Alternatively, LPx can represent the number of retransmission requests, such that the successfully recovered loss is not counted as part of the loss ratio. The loss ratio Lx is calculated 1101 using for example the following ratio:

  • L x=LP x /(P x +LP x)  (1)
  • To avoid reacting to random events, an average loss 1102 can be computed over the last z loss measurements. In order to take into account the most recent network status, a weighted average can be performed to weight the most recent measurements as per the following equation:
  • WL x = i = ( x - z ) x ( L i · w i ) i = 1 z w i ( 2 )
  • where WLx represents the weighted average of the most recent loss measurements for interval x. The weights wi are such that wi<wj for i<j<=x.
  • To avoid keeping track of many loss measurements, the previous weighted loss can also be used to evaluate the new weighted loss:
  • WL x = ( WL x - 1 · w old ) + ( L x · w new ) w new + w old ( 3 )
  • where wold and wnew are weights that are set in general such that wold<Wnew.
  • Optionally the welgthed loss ratio can be normalized 1103 to simplify the lookup using integers only. The normalized loss NLx can be computed using the following equation:
  • NL x = N · WL x P x ( 4 )
  • where N is the normalization factor (e.g. N=10000).
  • NLx is then used to index a loss level table 1104 to extract the current loss level. An example of a loss level table is shown below, providing 8 loss levels, where INT_max represents the largest integer or a large value (e.g. 10000).
  • NLx min NLx max Current Loss level
    0 0 0
    1 75 1
    76 145 2
    146 185 3
    186 210 4
    211 260 5
    261 370 6
    371 INT_max 7
  • The sending process 1111 of encoding component B 1107 then inserts the current loss level 1105 in the header of each second data unit sent for that session to encoding component A 1106. The receiving process 1112 in encoding component A 1106 reads the current loss level from the received packets. It then indexes a new parameter table with the current loss level to obtain the value of n and Max_n. Max_n represents the largest value that n should be set given the current loss level. Multiple new parameter tables can be used to achieve different loss objectives based on the application requirements and acceptable overhead. An example of such new parameter table using 8 loss levels is shown below.
  • Loss level Max_n m
    0 Int_max 0
    1 Int_max 1
    2 Int_max 1
    3 3 1
    4 2 1
    5 2 1
    6 1 1
    7 1 1
  • Where INT_max represents the largest integer (infinity). Before the sending process 1108 of encoding component A 1106 encodes a packet of size s, it indexes a preconfigured packet size table with s, to obtain rec_n, which represents the recommended value of m given the packet size. An example packet size table is show below:
  • Packet size
    (bytes) Rec_n
    <88 1
     89 to 264 2
    265 to 528 3
    >528 4
  • Using this table, a packet with s<88 bytes returns Rec_n=1. If s>528 bytes, then Rec_n=4. The value of n used to encode the packet is then determined as n=min(Rec_n, Max_n).
  • In another embodiment of the invention, the receiving process 1109 calculates the weighted loss ratio WLx as per equation (2) or (3) above. It can optionally normalize to compute NLx as per equation (4). The exact loss value (WLx or NLx) is sent at regular intervals (e.g. every second) to the receiving process 1112 into a control message that is inserted in the encoded channel for the session. The receiving process 1112 extracts the exact loss value from the control messages. The sending encoding component 1108 uses the exact loss value to index a new parameter table to obtain Max_n and m.
  • NLx min NLx max Max_n m
    0 0 Int_max 0
    1 75 Int_max 1
    76 145 Int_max 1
    146 185 3 1
    186 210 2 1
    211 260 2 1
    261 370 1 1
    371 10000 1 1
  • The value of nis derived as n=min(Rec_n, Max_n). Multiple new parameter tables can be configured to reflect different loss objectives and the sending process 1108 uses the appropriate table based on the loss objectives of the application. Sending the actual loss rate, instead of the current loss level, allows to only configure the parameter tables at the encoding side thus simplifying the configurations.
  • An example of another embodiment of the invention is shown in FIG. 13. In this embodiment, the encoding components estimate where the loss is occurring in the network 1201, that can comprise for example of a combination of the internet, a private network or virtual private network, to determine whether to change the encoding parameters. The encoded session 1204 between encoding component A 1202 and encoding component D 1203 is used to describe the embodiment, more specifically looking at the flow in the direction from A 1202 to D 1203.
  • As previously described, receiving process of encoding component D 1203, computes the loss level of each encoded flows it receives. In this example, it computes loss levels of 3 flows 1204, 1205 and 1206 originating from encoding components A 1202, B 1207 and C 1208 respectively. In addition to returning the loss level measured for the flow, the receiving encoding component computes the average of the weighted loss ratio ALx from the f flows that are sending to it over an interval period x.
  • The interval period can be the same as the interval period used for calculating the loss ratio for a single flow. The average loss ratio can be calculated, for example, as:
  • AL x = i = 1 f WL i f ( 5 )
  • where WLi can be calculated as per equation (2) or (3) above. The ALx can then be normalized as per equation (4) above to create a normalized average loss ratio, NALx. The NALx is then indexed in a loss level table to obtain an average loss level at the far end (ALFEx). The loss level table can be the same as above or preconfigured with different numbers. The ALFNx is added to the packet header of the second data units transmitted by the sending process of encoding component D 1203 to the respective encoding components 1202, 1207, 1208 along with the per flow current loss level computed as above.
  • If the aggregate information is included in the packet header, the sending encoding component 1202, 1207, 1208 can use the information to decide whether to change its encoding level. The receiving process of encoding component A 1202 also calculates the average loss at near end (ALNEx) which is the average of the current loss level received in the return channel from the g encoded sessions 1211, 1212, 1204 active during measurement period x,
  • A L N E x = i = 1 g CurrentLossLevel i g ( 6 )
  • In the example of FIG. 12, the ALNEx calculated at encoding component A represents the average of the current loss level received from encoding component D 1203, encoding component E 1209 and encoding component F 1210.
  • If the difference between the current loss level for the session and the ALFEx is below a predetermined threshold, the current loss level is used to set m and n, as per the description above. In this case, it is assumed unlikely that the sessions are congesting the upstream network since the current loss level is better or a little worst than the computed ALFEx.
  • If the difference between the current loss level and the ALFEx is greater or equal to a predetermined threshold AND the current loss level minus the ALNEx is greater of equal to a predetermined threshold, then the current loss level is ignored and m and n are set according to the packet size table only to minimize bandwidth usage by choosing the most bandwidth efficient encoding method for the given packet. The predetermined thresholds could be different and set according to network policies and topology.
  • If the loss level increases beyond a predetermined interleaving threshold, the sending encoding component can switch to the interleaving mode to attempt to further reduce the loss. When the loss level is below another threshold the interleaving mode can be turned off to reduce the delay. Alternatively, a count of how often a predetermined number of second data unit were lost in the same packet is kept and when such count exceed a predetermined threshold, the encoding component switches to the interleaving mode. When the count is below a predetermined threshold for a predetermined amount of time, the encoding component returns to the non-interleaving mode to reduce delay.
  • The examples described above generally relate to bidirectional communications between endpoints, where negotiation of the encoded channel is feasible and desirable. However, the present invention can also be used in substantially unidirectional, or streaming, applications to accelerate their performance, and in other applications where negotiating the connection between the encoding components is impractical or otherwise undesirable. In such applications, no negotiation is required between the encoding components associated with each endpoint. The encoded channel is established by recognizing call signaling messages, and subsequent deep packet analysis permits messages related to the communication session to be recognized.
  • For example, the encoding/decoding components of the present invention can be used to take advantage of the stateful nature of Real-Time Streaming Protocol (RTSP) to set up and monitor a connection for streaming. The default port for RTSP commands is port 554. Therefore, the encoding components of the present invention can analyze packet headers to determine if they are destined to, or originate from, the RTSP default port, and thereby identify RTSP packets. If a RTSP message is detected, the message can be parsed to determine if it contains a SETUP request, a SETUP response, a TEARDOWN request, or a general RTSP response. A SETUP request from a user contains the media stream URL and a local port for receiving RTP data (audio or video). The RTSP server reply confirms the chosen parameters, and provides the server's chosen ports. By parsing the reply from the RTSP server, the encoding components can determine the RTSP session identification assigned to the data stream, the RTSP sequence number for the message, and the RTP ports that have been allocated for the session by the user terminal and the RTSP server. In this way, an encoded channel for streaming can be set up between the encoding components. Subsequent data units between the client and server can then be analyzed, such as by deep packet analysis. If the ports match those set in the SETUP reply, the message can be intercepted for segmentation and encoding, or decoding and reassembly, as described above, without any negotiation to set up the encoded channel.
  • Similarly, for H.323, the encoding components can analyze packets for messages indicating an H.323 call is being set up. For example, the encoding components can detect and do a deep packet analysis on H.225/Q.931 call setup messages and/or H.245 negotiation and path setup messages to identify called and caller data ports that will be used for the associated H.323 session. An encoded channel according to the present protocol can then be set up to intercept and encode the data flow as described above.
  • Within the context on a given session, the different streams can be treated with different loss objectives. DPI can be used to detect the type of application and set the loss objectives according to a configured network policy for that type of application. Ultimately each packet can have its own loss objective based on information provided in the header that identifies the level of protection required (e.g. SVC—scalable video codec).
  • In another embodiment of the invention, the increase in the value of n is performed gradually to avoid a big step in increase of overhead. When a higher value of n is recommended using the table, it is applied to only a subset of the following first data unit. Using this embodiment, only v first data unit out of the next incoming w first data unit use the increased value of n while the other w-v will use the previous lower value for n. The value of v and w can also change if the measured loss ratio continues to increase or as the measured loss ratio approaches the next level.
  • For example, if the measured loss (weighted or normalized) is 0% then, n=1, m=0 and v=w=1. Therefore all packets are encoded with n=1, m=0. If the measured loss increase to greater than 0% but lower than 0.05%, then n=4, m=1, but v=1 and w=3, such that only one out of 3 packets is encoded with n=4, while the others use the previous encoding level n=1, m=0. When the measured loss exceeds 0.05% but is below 0.1%, then change to v=1 and w=2, such that every second packet is encoded with n=4, while the others use the previous encoding level n=1, m=0. When the measured loss exceeds 0.1% but is below or equal to 0.2%, then use v=1 and w=1, such that every packet is encoded with n=4. Different values of v and w can be configured to smooth out the overhead increase at different predetermined loss levels. This capability can significantly smooth out the transfer function between different loss ratios.
  • In the following description, for purposes of explanation, numerous details are set forth in order to provide a thorough understanding of the present invention. However, it will be apparent to one skilled in the art that these specific details are not required in order to practice the present invention. In other instances, well-known electrical structures and circuits are shown in block diagram form in order not to obscure the present invention. For example, specific details are not provided as to whether the embodiments of the invention described herein are implemented as a software routine, hardware circuit, firmware, or a combination thereof.
  • Embodiments of the invention may be implemented in a network having endpoints, such as servers or other computing devices, and associated encoding components. The encoding components, and the described methods, can be implemented in hardware, software or a combination thereof. Those portions that are implemented in software can represented as a software product stored in a machine-readable medium (also referred to as a computer-readable medium, a processor-readable medium, or a computer usable medium having a computer readable program code embodied therein). The machine-readable medium may be any suitable tangible medium, including magnetic, optical, or electrical storage medium including a diskette, compact disk read only memory (CD-ROM), memory device (volatile or non-volatile), or similar storage mechanism. The machine-readable medium may contain various sets of instructions, code sequences, configuration information, or other data, which, when executed, cause a processor to perform steps in a method according to an embodiment of the invention. Those of ordinary skill in the art will appreciate that other instructions and operations necessary to implement the described invention may also be stored on the machine-readable medium. Software running from the machine readable medium may interface with circuitry to perform the described tasks.
  • The above-described embodiments of the present invention are intended to be examples only. Alterations, modifications and variations may be effected to the particular embodiments by those of skill in the art without departing from the scope of the invention, which is defined solely by the claims appended hereto.

Claims (27)

1. A method of accelerating data communications over an unreliable network; comprising:
providing encoding components associated with each of two endpoints to a communication;
establishing an encoded channel between the encoding components for a communication session between the endpoints;
intercepting a plurality of data packets related to the communication at one of the encoding components;
segmenting and packaging each of the plurality of data packets to provide a segmented and packaged data packet having at least one encoded data segment and at least one extra encoded segment for transmission to the other of the encoding components;
storing the segmented and packaged data packets at the one of the encoding components;
transmitting the segmented and packaged data packets to the other of the encoding components over the encoded channel when a predetermined condition is met;
decoding and reassembling the plurality of data packets at the other of the encoding components based on received encoded data segments and received extra encoded segments; and
transmitting the reassembled data packets from the other of the encoding components to its respective endpoint.
2. The method of claim 1, wherein the predetermined condition is expiry of a timer.
3. The method of claim 2, wherein the timer is activated when a respective one of the plurality of data packets is intercepted.
4. The method of claim 1, wherein the predetermined condition is interception of a packet containing real-time sensitive data.
5. The method of claim 1, wherein the predetermined condition is storage of a predetermined number of the segmented and packaged data packets.
6. The method of claim 1, wherein the encoded data segments and the at least one extra encoded segment for the plurality of data packets are interleaved and transmitted in a manner to preserve their ordering.
7. The method of claim 6, wherein the packaged and segmented data packets are stored in order and according to their respective sizes, and segments are transmitted in turn from each packaged and segmented data packet.
8. The method of claim 1, wherein the encoded data segments and the at least one extra encoded segment for each of the plurality of data packets are transmitted in random order.
9. The method of claim 1, further comprising determining that one of the encoded data segments is lost if it has not been received at the other of the encoding components within a predetermined period.
10. The method of claim 9, wherein the predetermined period is determined by expiry of a timer set when a first encoded data segment for a given data packet is received.
11. The method of claim 9, wherein the predetermined period is determined by reference to a ring buffer.
12. The method of claim 10, wherein the ring buffer tracks sequence numbers of missing encoded data segments, and a given encoded data segment is determined to be lost when the ring buffer cycles back to a sequence number of the given encoded data segment.
13. The method of claim 9, further comprising interleaving encoded data segments from the plurality of data packets when it is determined that a predetermined number of encoded data segments from a given segmented and packaged data packet have been lost.
14. The method of claim 1, wherein segmenting and packaging a data packet comprises segmenting and packaging the data packet into n encoded data segments, where n>1.
15. The method of claim 14, wherein n is dynamically adjusted based on size of the data packet.
16. The method of claim 15, wherein n is selected such that size of encoded data segments does not exceed a predetermined maximum transfer unit size.
17-29. (canceled)
30. A method of setting an encoding rate for encoding data for accelerated data communication across an unreliable network between two endpoints each respectively associated with an encoding component; comprising:
establishing an encoded channel between the encoding components for a communication session between the endpoints;
intercepting a data packet related to the communication at one of the encoding components;
segmenting and packaging the data packet to provide encoded data segments for transmission to the other of the encoding components;
transmitting the encoded data segments and at least one extra encoded segment to the other of the encoding components over the encoded channel;
decoding and reassembling the data packet at the other of the encoding components based on the received encoded data segments;
transmitting the reassembled data packet from the other of the encoding components to its respective endpoint;
computing a weighted loss ratio for the communication session; and
adjusting the encoding rate based on the weighted loss ratio.
31. The method of claim 30, wherein computing the weighted ratio comprises computing the weighted ratio in accordance with average loss ratios of previous communication sessions.
32. The method of claim 30, wherein computing the weighted ratio comprises computing the weighted ratio in accordance with retransmission requests.
33. The method of claim 30, further comprising computing a current loss level in accordance with the weighted loss ratio.
34. The method of claim 33, wherein the weighted loss ratio is normalized.
35. The method of claim 33, wherein the current loss level is communicated to the other of the encoding components.
36. The method of claim 35, wherein the current loss level is communicated in a header portion of one of the encoded data segments.
37. The method of claim 36, wherein the header portion further identifies a desired level of protection.
38. The method of claim 37, wherein the desired level of protection is determined in accordance with loss objectives configured according to a network policy.
39. The method of claim 35, wherein the current loss level is communicated over a control channel.
US13/097,991 2004-08-06 2011-04-29 System and method for achieving accelerated throughput Abandoned US20110206043A1 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
US10/912,200 US7742501B2 (en) 2004-08-06 2004-08-06 System and method for higher throughput through a transportation network
US12/193,345 US8009696B2 (en) 2004-08-06 2008-08-18 System and method for achieving accelerated throughput
US12/718,650 US7953114B2 (en) 2004-08-06 2010-03-05 System and method for achieving accelerated throughput
US13/097,991 US20110206043A1 (en) 2004-08-06 2011-04-29 System and method for achieving accelerated throughput

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US13/097,991 US20110206043A1 (en) 2004-08-06 2011-04-29 System and method for achieving accelerated throughput
US14/821,718 US20150350390A1 (en) 2004-08-06 2015-08-08 System and method for achieving accelerated throughput

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US12/718,650 Division US7953114B2 (en) 2004-08-06 2010-03-05 System and method for achieving accelerated throughput

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US14/821,718 Division US20150350390A1 (en) 2004-08-06 2015-08-08 System and method for achieving accelerated throughput

Publications (1)

Publication Number Publication Date
US20110206043A1 true US20110206043A1 (en) 2011-08-25

Family

ID=44541705

Family Applications (3)

Application Number Title Priority Date Filing Date
US12/718,650 Active US7953114B2 (en) 2004-08-06 2010-03-05 System and method for achieving accelerated throughput
US13/097,991 Abandoned US20110206043A1 (en) 2004-08-06 2011-04-29 System and method for achieving accelerated throughput
US14/821,718 Pending US20150350390A1 (en) 2004-08-06 2015-08-08 System and method for achieving accelerated throughput

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US12/718,650 Active US7953114B2 (en) 2004-08-06 2010-03-05 System and method for achieving accelerated throughput

Family Applications After (1)

Application Number Title Priority Date Filing Date
US14/821,718 Pending US20150350390A1 (en) 2004-08-06 2015-08-08 System and method for achieving accelerated throughput

Country Status (5)

Country Link
US (3) US7953114B2 (en)
EP (1) EP2543156A4 (en)
JP (1) JP2013526098A (en)
CN (1) CN102859921A (en)
WO (1) WO2011107963A1 (en)

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100272122A1 (en) * 2004-08-06 2010-10-28 Ipeak Networks Incorporated System and method for achieving accelerated throughput
US20130111002A1 (en) * 2011-10-31 2013-05-02 Mike Leber Systems and methods for establishing a virtual local area network
WO2013084128A1 (en) * 2011-12-05 2013-06-13 LiveQoS Inc. Methods for achieving target loss ratio
US20130194934A1 (en) * 2012-01-27 2013-08-01 Electronics And Telecommunications Research Institute Packet processing apparatus and method for detecting duplicate acknowledgement packet
US8717900B2 (en) 2011-02-07 2014-05-06 LivQoS Inc. Mechanisms to improve the transmission control protocol performance in wireless networks
WO2014099815A1 (en) * 2012-12-22 2014-06-26 Edgewater Networks, Inc Methods and systems to split equipment control between local and remote processing units
US8990956B2 (en) 2012-08-06 2015-03-24 Hurricane Electric Systems and methods of exchanging information for a reward
US9189307B2 (en) 2004-08-06 2015-11-17 LiveQoS Inc. Method of improving the performance of an access network for coupling user devices to an application server
US9590913B2 (en) 2011-02-07 2017-03-07 LiveQoS Inc. System and method for reducing bandwidth usage of a network
US9647952B2 (en) 2004-08-06 2017-05-09 LiveQoS Inc. Network quality as a service
US9965760B2 (en) 2012-06-29 2018-05-08 Hurricane Electric Systems and methods for facilitating electronic transactions utilizing a mobile computing device

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2755342A1 (en) 2013-01-10 2014-07-16 LiveQoS Inc. Network Quality as a Service
US7953114B2 (en) * 2004-08-06 2011-05-31 Ipeak Networks Incorporated System and method for achieving accelerated throughput
US9143386B1 (en) * 2010-09-27 2015-09-22 Sprint Communications Company L.P. Remote keep-alive message management in a wireless communication network
WO2012099589A1 (en) * 2011-01-20 2012-07-26 Vidyo, Inc. Participant aware configuration for video encoder
US8925027B2 (en) * 2011-01-20 2014-12-30 Vidyo, Inc. Participant aware configuration for video encoder
US8437370B2 (en) * 2011-02-04 2013-05-07 LiveQoS Inc. Methods for achieving target loss ratio
US9143454B2 (en) 2012-10-03 2015-09-22 LiveQoS Inc. System and method for a TCP mapper
US8711690B2 (en) * 2012-10-03 2014-04-29 LiveQoS Inc. System and method for a TCP mapper
CN105450967B (en) * 2014-07-31 2019-05-03 杭州海康威视数字技术股份有限公司 The method and device that video record data are packaged

Citations (87)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4908827A (en) * 1987-07-27 1990-03-13 Tiw Systems, Inc. Forward error correction system
US5600663A (en) * 1994-11-16 1997-02-04 Lucent Technologies Inc. Adaptive forward error correction system
US5677918A (en) * 1995-07-28 1997-10-14 Motorola, Inc. Method and device for efficient error correction in a packet-switched communication system
US5751970A (en) * 1996-08-08 1998-05-12 International Business Machines Corp. Method for determining an optimal segmentation size for file transmission in a communications system
US5857072A (en) * 1996-04-30 1999-01-05 Sprint Communications Co. L.P. System and method for distributing data simultaneously to multiple computers on a network, with advanced notice to intended recipients
US6000053A (en) * 1997-06-13 1999-12-07 Microsoft Corporation Error correction and loss recovery of packets over a computer network
US6012159A (en) * 1996-01-17 2000-01-04 Kencast, Inc. Method and system for error-free data transfer
US6126310A (en) * 1996-07-26 2000-10-03 Telefonaktiebolaget Lm Ericsson Method apparatus and packet transmission system using error correction of data packets
US6172972B1 (en) * 1996-05-28 2001-01-09 Microsoft Corporation Multi-packet transport structure and method for sending network data over satellite network
US20010009547A1 (en) * 2000-01-25 2001-07-26 Akira Jinzaki Data communications system
US6272658B1 (en) * 1997-10-27 2001-08-07 Kencast, Inc. Method and system for reliable broadcasting of data files and streams
US6278716B1 (en) * 1998-03-23 2001-08-21 University Of Massachusetts Multicast with proactive forward error correction
US20010040088A1 (en) * 2000-05-12 2001-11-15 Alps Electric Co., Ltd. Roller connector mounted on steering device
US20010040883A1 (en) * 2000-01-07 2001-11-15 Chang Kirk K. Method and system for interleaving of full rate channels suitable for half duplex operation and statistical multiplexing
US6336200B1 (en) * 1998-05-22 2002-01-01 Kencast, Inc. Method for validating communicated packets of data and for locating erroneous packets
US20020061059A1 (en) * 2000-07-24 2002-05-23 Alberto Ginesi Scheme for the initialization of ADSL modems
US6421387B1 (en) * 1998-05-15 2002-07-16 North Carolina State University Methods and systems for forward error correction based loss recovery for interactive video transmission
US6421805B1 (en) * 1998-11-16 2002-07-16 Exabyte Corporation Rogue packet detection and correction method for data storage device
US6445717B1 (en) * 1998-05-01 2002-09-03 Niwot Networks, Inc. System for recovering lost information in a data stream
US6449251B1 (en) * 1999-04-02 2002-09-10 Nortel Networks Limited Packet mapper for dynamic data packet prioritization
US20020146016A1 (en) * 2001-04-04 2002-10-10 Changwen Liu Transferring transmission control protocol packets
US20020151448A1 (en) * 2000-03-24 2002-10-17 Shumanta Mitra Mixed surfactant cleaning compositions with reduced streaking
US20020154631A1 (en) * 1998-07-31 2002-10-24 Tarek Makansi Method and apparatus for transmitting messages
US20020164024A1 (en) * 2000-08-25 2002-11-07 Hiroshi Arakawa Data transmission method and data relay method
US20030002499A1 (en) * 2001-06-22 2003-01-02 Broadcom Corporation FEC block reconstruction system, method and computer program product for mitigating burst noise in a communications system
US20030018793A1 (en) * 2001-07-19 2003-01-23 Oscar Mora Reliable transport layer protocol in low performance 8-bit microcontrollers
US6529552B1 (en) * 1999-02-16 2003-03-04 Packetvideo Corporation Method and a device for transmission of a variable bit-rate compressed video bitstream over constant and variable capacity networks
US20030053461A1 (en) * 2001-09-14 2003-03-20 Snowshore Networks Inc. Selective packet processing in a packet based media processor for latency reduction
US6570843B1 (en) * 1998-05-22 2003-05-27 Kencast, Inc. Method for minimizing the number of data packets required for retransmission in a two-way communication system
US20030105997A1 (en) * 2000-10-12 2003-06-05 3Com Corporation Performance evaluation of multicarrier channels
US20030108044A1 (en) * 2001-12-11 2003-06-12 Roland Hendel Stateless TCP/IP protocol
US20030152058A1 (en) * 2001-11-19 2003-08-14 At&T Corp. Adaptive MAC fragmentation and rate selection for 802.11 wireless networks
US6609223B1 (en) * 1999-04-06 2003-08-19 Kencast, Inc. Method for packet-level fec encoding, in which on a source packet-by-source packet basis, the error correction contributions of a source packet to a plurality of wildcard packets are computed, and the source packet is transmitted thereafter
US20040010736A1 (en) * 2002-06-05 2004-01-15 Alapuranen Pertti O. Hybrid ARQ for a wireless Ad-Hoc network and a method for using the same
US20040015686A1 (en) * 2002-07-16 2004-01-22 Connor Patrick L. Methods and apparatus for determination of packet sizes when transferring packets via a network
US20040039827A1 (en) * 2001-11-02 2004-02-26 Neoteris, Inc. Method and system for providing secure access to private networks with client redirection
US6728924B1 (en) * 1999-10-21 2004-04-27 Lucent Technologies Inc. Packet loss control method for real-time multimedia communications
US20040095885A1 (en) * 2002-11-15 2004-05-20 Samsung Electronics Co., Ltd. Priority queuing method and apparatus
US20040267945A1 (en) * 2001-08-02 2004-12-30 Christophe Reiss Filtering redundant packets in computer network equipments
US20040264396A1 (en) * 2003-06-30 2004-12-30 Boris Ginzburg Method for power saving in a wireless LAN
US20050025185A1 (en) * 2003-07-31 2005-02-03 International Business Machines Corporation System and method of reducing data corruption due to recycled IP indentification numbers
US20050053002A1 (en) * 2003-09-09 2005-03-10 Chan Mun Choon Methods and devices for maximizing the throughput of TCP/IP data along wireless links
US6868083B2 (en) * 2001-02-16 2005-03-15 Hewlett-Packard Development Company, L.P. Method and system for packet communication employing path diversity
US6876669B2 (en) * 2001-01-08 2005-04-05 Corrigent Systems Ltd. Packet fragmentation with nested interruptions
US6901051B1 (en) * 1999-11-15 2005-05-31 Fujitsu Limited Server-based network performance metrics generation system and method
US20050130646A1 (en) * 2001-12-26 2005-06-16 Bellsouth Intellectual Property Corporation Auto sensing home base station for mobile telephone with remote answering capabilities
US20050195859A1 (en) * 1989-08-03 2005-09-08 Mahany Ronald L. Radio frequency communication network having adaptive communication parameters
US20060029101A1 (en) * 2004-08-06 2006-02-09 Williams Matthew R System and method for higher throughput through a transportation network
US20060031518A1 (en) * 2004-04-30 2006-02-09 Jennings Raymond B Iii Method and apparatus for transparent negotiations
US7016409B2 (en) * 2003-11-12 2006-03-21 Sony Corporation Apparatus and method for use in providing dynamic bit rate encoding
US7024609B2 (en) * 2001-04-20 2006-04-04 Kencast, Inc. System for protecting the transmission of live data streams, and upon reception, for reconstructing the live data streams and recording them into files
US7035217B1 (en) * 2000-10-20 2006-04-25 Cisco Technology, Inc. Router-assisted multicast congestion control
US7050396B1 (en) * 2000-11-30 2006-05-23 Cisco Technology, Inc. Method and apparatus for automatically establishing bi-directional differentiated services treatment of flows in a network
US7075936B2 (en) * 2000-11-02 2006-07-11 Agere Systems, Inc. Voice packet processor and method of operation thereof
US20060178143A1 (en) * 2000-12-12 2006-08-10 Chang Donald C D Communication system using multiple link terminals for aircraft
US20060210037A1 (en) * 1999-04-12 2006-09-21 Silicon Laboratories Inc. Modem with hold and quick connect functionality
US20060268717A1 (en) * 2001-05-15 2006-11-30 Golden Bridge Technology, Inc. Channel capacity optimization for packet services
US20070011321A1 (en) * 2001-07-17 2007-01-11 Huntington Stephen G Network Data Retrieval and Filter Systems and Methods
US7215683B2 (en) * 2000-07-14 2007-05-08 Siemens Aktiengesellschaft Method and apparatus for protecting against packet losses in packet-oriented data transmission
US7236481B2 (en) * 2000-12-28 2007-06-26 Lg-Nortel, Co., Ltd. System and method for processing multimedia packets for a network
US20070157060A1 (en) * 2006-01-04 2007-07-05 Ganga Ilango S Techniques to perform forward error correction for an electrical backplane
US7310670B1 (en) * 2000-04-25 2007-12-18 Thomson Licensing S.A. Multi-channel power line exchange protocol
US7319701B2 (en) * 2000-12-29 2008-01-15 Texas Instruments Incorporated Modem relay protocol redundancy for reliable low speed modem communications over IP networks with substantial packet loss
US20080089268A1 (en) * 2006-10-17 2008-04-17 Kinder Richard D Media distribution in a wireless network
US20080095247A1 (en) * 2004-11-17 2008-04-24 Michihiro Ohno Transmitter, Receiver And Communication System
US20080151776A1 (en) * 2006-12-25 2008-06-26 Yoshinobu Kure Data Communication System, Data Transmitting Apparatus, Data Transmitting Method, and Method for Determining Packet Size and Redundancy
US20080151823A1 (en) * 2004-04-05 2008-06-26 Broadcom Corporation Establishing communication between entities in a wireless communication system
US20080240108A1 (en) * 2005-09-01 2008-10-02 Kim Hyldgaard Processing Encoded Real-Time Data
US20080304483A1 (en) * 2004-08-06 2008-12-11 Ipeak Networks Incorporated System and method for achieving accelerated throughput
US20090006920A1 (en) * 2007-06-26 2009-01-01 Michelle Christine Munson Bulk data transfer
US20090049189A1 (en) * 2003-11-07 2009-02-19 Cisco Technology, Inc. Methods and apparatus for supporting transmission of streaming data
US7522606B1 (en) * 2004-11-09 2009-04-21 Network Equipment Technologies, Inc. Passive packet re-ordering and packet loss detection
US20090116487A1 (en) * 2000-11-30 2009-05-07 Tandberg Telecom As Communications system
US20090135950A1 (en) * 1999-03-05 2009-05-28 Ipr Licensing Inc. Maximizing data rate by adjusting codes and code rates
US20090268742A1 (en) * 2005-11-07 2009-10-29 Nec Corporation Session relay device and session relay method
US20100005177A1 (en) * 2006-09-05 2010-01-07 Cagenius Torbjoern Ip unicast streaming service delivery
US20100009547A1 (en) * 2006-07-03 2010-01-14 Hamamatsu Photonics K.K. Laser working method
US20100023842A1 (en) * 2008-07-25 2010-01-28 Nortel Networks Limited Multisegment loss protection
US20100080167A1 (en) * 2005-06-28 2010-04-01 Koninklijke Philips Electronics, N.V. Handshaking method and apparatus for ofdm systems with unknown sub-channel availability
US7739398B1 (en) * 2000-11-21 2010-06-15 Avaya Inc. Dynamic load balancer
US20100242122A1 (en) * 2007-10-30 2010-09-23 Kyocera Corporation Information processing apparatus
US7821937B1 (en) * 2007-06-29 2010-10-26 Symantec Corporation Network protocol with damage loss resilient congestion control algorithm
US7889654B2 (en) * 2005-03-30 2011-02-15 At&T Intellectual Property Ii, L.P. Loss tolerant transmission control protocol
US7936785B2 (en) * 2005-12-16 2011-05-03 Coding Technologies Ab Apparatus for generating and interpreting a data stream modified in accordance with the importance of the data
US7953114B2 (en) * 2004-08-06 2011-05-31 Ipeak Networks Incorporated System and method for achieving accelerated throughput
US20120201136A1 (en) * 2011-02-07 2012-08-09 Ipeak Networks Incorporated Mechanisms to improve the transmission control protocol performance in wireless networks
US20120203893A1 (en) * 2011-02-04 2012-08-09 Ipeak Networks Incorporated Methods for achieving target loss ratio

Family Cites Families (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH10119426A (en) 1996-10-15 1998-05-12 Dainippon Printing Co Ltd Recording sheet
JPH11225161A (en) 1998-02-05 1999-08-17 Matsushita Electric Ind Co Ltd Data processing method and its device
US6188674B1 (en) * 1998-02-17 2001-02-13 Xiaoqiang Chen Method and apparatus for packet loss measurement in packet networks
US6920602B1 (en) * 1998-03-31 2005-07-19 Samsung Electronics Co., Ltd. Turbo encoding/decoding device and method for processing frame data according to QoS
JP3054613B2 (en) 1998-11-05 2000-06-19 沖電気工業株式会社 Packet communication system
JP3910770B2 (en) 1999-10-15 2007-04-25 株式会社エヌ・ティ・ティ・ドコモ Receiver using the error control method and method
JP2002290459A (en) * 2001-03-27 2002-10-04 Nec Corp Device for transferring packets and method for the same
JP3573426B2 (en) 2001-12-28 2004-10-06 東芝テック株式会社 Card processing device and card payment system
JP2003298560A (en) 2002-04-04 2003-10-17 Communication Research Laboratory Transmission apparatus and transmission method, receiving apparatus and reception method, optical wireless communication apparatus, and optical wireless communication method
SG111978A1 (en) * 2002-11-20 2005-06-29 Victor Company Of Japan An mpeg-4 live unicast video streaming system in wireless network with end-to-end bitrate-based congestion control
US7668712B2 (en) * 2004-03-31 2010-02-23 Microsoft Corporation Audio encoding and decoding with intra frames and adaptive forward error correction
JP5425397B2 (en) * 2004-12-02 2014-02-26 トムソン ライセンシングThomson Licensing Apparatus and method for adaptive forward error correction
US20060245384A1 (en) * 2005-05-02 2006-11-02 Talukdar Anup K Method and apparatus for transmitting data
AT514246T (en) 2005-08-19 2011-07-15 Hewlett Packard Development Co Hint of lost segments via layer borders
JP2007184836A (en) * 2006-01-10 2007-07-19 Nippon Telegr & Teleph Corp <Ntt> Communication method and communication equipment
AT526746T (en) * 2006-03-03 2011-10-15 Koninkl Philips Electronics Nv Method and apparatus for transmitting and receiving a data block in a wireless communication system
US7852242B2 (en) * 2008-05-15 2010-12-14 Taiwan Semiconductor Manufacturing Company, Ltd. Increasing 8B/10B coding speed using a disparity look-ahead table
US8190848B2 (en) * 2008-07-28 2012-05-29 Lantiq Deutschland Gmbh Interleaver memory allocation method and apparatus
US8320364B2 (en) * 2009-12-15 2012-11-27 Hong Kong Applied Science And Technology Research Institute Co., Ltd. Control of bit-rate and packet duplication in a real-time media stream

Patent Citations (97)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4908827A (en) * 1987-07-27 1990-03-13 Tiw Systems, Inc. Forward error correction system
US20050195859A1 (en) * 1989-08-03 2005-09-08 Mahany Ronald L. Radio frequency communication network having adaptive communication parameters
US5600663A (en) * 1994-11-16 1997-02-04 Lucent Technologies Inc. Adaptive forward error correction system
US5677918A (en) * 1995-07-28 1997-10-14 Motorola, Inc. Method and device for efficient error correction in a packet-switched communication system
US6012159A (en) * 1996-01-17 2000-01-04 Kencast, Inc. Method and system for error-free data transfer
US5857072A (en) * 1996-04-30 1999-01-05 Sprint Communications Co. L.P. System and method for distributing data simultaneously to multiple computers on a network, with advanced notice to intended recipients
US6172972B1 (en) * 1996-05-28 2001-01-09 Microsoft Corporation Multi-packet transport structure and method for sending network data over satellite network
US6126310A (en) * 1996-07-26 2000-10-03 Telefonaktiebolaget Lm Ericsson Method apparatus and packet transmission system using error correction of data packets
US5751970A (en) * 1996-08-08 1998-05-12 International Business Machines Corp. Method for determining an optimal segmentation size for file transmission in a communications system
US6000053A (en) * 1997-06-13 1999-12-07 Microsoft Corporation Error correction and loss recovery of packets over a computer network
US6272658B1 (en) * 1997-10-27 2001-08-07 Kencast, Inc. Method and system for reliable broadcasting of data files and streams
US6278716B1 (en) * 1998-03-23 2001-08-21 University Of Massachusetts Multicast with proactive forward error correction
US6445717B1 (en) * 1998-05-01 2002-09-03 Niwot Networks, Inc. System for recovering lost information in a data stream
US6421387B1 (en) * 1998-05-15 2002-07-16 North Carolina State University Methods and systems for forward error correction based loss recovery for interactive video transmission
US6336200B1 (en) * 1998-05-22 2002-01-01 Kencast, Inc. Method for validating communicated packets of data and for locating erroneous packets
US6570843B1 (en) * 1998-05-22 2003-05-27 Kencast, Inc. Method for minimizing the number of data packets required for retransmission in a two-way communication system
US6606723B2 (en) * 1998-05-22 2003-08-12 Kencast, Inc. System, computer-readable medium, and method for validating communicated packets of data and for locating erroneous packets
US20020154631A1 (en) * 1998-07-31 2002-10-24 Tarek Makansi Method and apparatus for transmitting messages
US6421805B1 (en) * 1998-11-16 2002-07-16 Exabyte Corporation Rogue packet detection and correction method for data storage device
US6529552B1 (en) * 1999-02-16 2003-03-04 Packetvideo Corporation Method and a device for transmission of a variable bit-rate compressed video bitstream over constant and variable capacity networks
US20090135950A1 (en) * 1999-03-05 2009-05-28 Ipr Licensing Inc. Maximizing data rate by adjusting codes and code rates
US6449251B1 (en) * 1999-04-02 2002-09-10 Nortel Networks Limited Packet mapper for dynamic data packet prioritization
US6609223B1 (en) * 1999-04-06 2003-08-19 Kencast, Inc. Method for packet-level fec encoding, in which on a source packet-by-source packet basis, the error correction contributions of a source packet to a plurality of wildcard packets are computed, and the source packet is transmitted thereafter
US20060210037A1 (en) * 1999-04-12 2006-09-21 Silicon Laboratories Inc. Modem with hold and quick connect functionality
US6728924B1 (en) * 1999-10-21 2004-04-27 Lucent Technologies Inc. Packet loss control method for real-time multimedia communications
US6901051B1 (en) * 1999-11-15 2005-05-31 Fujitsu Limited Server-based network performance metrics generation system and method
US20010040883A1 (en) * 2000-01-07 2001-11-15 Chang Kirk K. Method and system for interleaving of full rate channels suitable for half duplex operation and statistical multiplexing
US7133407B2 (en) * 2000-01-25 2006-11-07 Fujitsu Limited Data communications system
US20010009547A1 (en) * 2000-01-25 2001-07-26 Akira Jinzaki Data communications system
US20020151448A1 (en) * 2000-03-24 2002-10-17 Shumanta Mitra Mixed surfactant cleaning compositions with reduced streaking
US7310670B1 (en) * 2000-04-25 2007-12-18 Thomson Licensing S.A. Multi-channel power line exchange protocol
US20010040088A1 (en) * 2000-05-12 2001-11-15 Alps Electric Co., Ltd. Roller connector mounted on steering device
US7215683B2 (en) * 2000-07-14 2007-05-08 Siemens Aktiengesellschaft Method and apparatus for protecting against packet losses in packet-oriented data transmission
US20020061059A1 (en) * 2000-07-24 2002-05-23 Alberto Ginesi Scheme for the initialization of ADSL modems
US20020164024A1 (en) * 2000-08-25 2002-11-07 Hiroshi Arakawa Data transmission method and data relay method
US20030105997A1 (en) * 2000-10-12 2003-06-05 3Com Corporation Performance evaluation of multicarrier channels
US7035217B1 (en) * 2000-10-20 2006-04-25 Cisco Technology, Inc. Router-assisted multicast congestion control
US7075936B2 (en) * 2000-11-02 2006-07-11 Agere Systems, Inc. Voice packet processor and method of operation thereof
US7739398B1 (en) * 2000-11-21 2010-06-15 Avaya Inc. Dynamic load balancer
US20090116487A1 (en) * 2000-11-30 2009-05-07 Tandberg Telecom As Communications system
US7050396B1 (en) * 2000-11-30 2006-05-23 Cisco Technology, Inc. Method and apparatus for automatically establishing bi-directional differentiated services treatment of flows in a network
US7167704B2 (en) * 2000-12-12 2007-01-23 The Directv Group, Inc. Communication system using multiple link terminals for aircraft
US20060178143A1 (en) * 2000-12-12 2006-08-10 Chang Donald C D Communication system using multiple link terminals for aircraft
US7236481B2 (en) * 2000-12-28 2007-06-26 Lg-Nortel, Co., Ltd. System and method for processing multimedia packets for a network
US7319701B2 (en) * 2000-12-29 2008-01-15 Texas Instruments Incorporated Modem relay protocol redundancy for reliable low speed modem communications over IP networks with substantial packet loss
US6876669B2 (en) * 2001-01-08 2005-04-05 Corrigent Systems Ltd. Packet fragmentation with nested interruptions
US6868083B2 (en) * 2001-02-16 2005-03-15 Hewlett-Packard Development Company, L.P. Method and system for packet communication employing path diversity
US20020146016A1 (en) * 2001-04-04 2002-10-10 Changwen Liu Transferring transmission control protocol packets
US7024609B2 (en) * 2001-04-20 2006-04-04 Kencast, Inc. System for protecting the transmission of live data streams, and upon reception, for reconstructing the live data streams and recording them into files
US20060268717A1 (en) * 2001-05-15 2006-11-30 Golden Bridge Technology, Inc. Channel capacity optimization for packet services
US7089478B2 (en) * 2001-06-22 2006-08-08 Broadcom Corporation FEC block reconstruction system, method and computer program product for mitigating burst noise in a communications system
US20030002499A1 (en) * 2001-06-22 2003-01-02 Broadcom Corporation FEC block reconstruction system, method and computer program product for mitigating burst noise in a communications system
US20070011321A1 (en) * 2001-07-17 2007-01-11 Huntington Stephen G Network Data Retrieval and Filter Systems and Methods
US20030018793A1 (en) * 2001-07-19 2003-01-23 Oscar Mora Reliable transport layer protocol in low performance 8-bit microcontrollers
US20040267945A1 (en) * 2001-08-02 2004-12-30 Christophe Reiss Filtering redundant packets in computer network equipments
US20030053461A1 (en) * 2001-09-14 2003-03-20 Snowshore Networks Inc. Selective packet processing in a packet based media processor for latency reduction
US20040039827A1 (en) * 2001-11-02 2004-02-26 Neoteris, Inc. Method and system for providing secure access to private networks with client redirection
US20030152058A1 (en) * 2001-11-19 2003-08-14 At&T Corp. Adaptive MAC fragmentation and rate selection for 802.11 wireless networks
US20030108044A1 (en) * 2001-12-11 2003-06-12 Roland Hendel Stateless TCP/IP protocol
US20050130646A1 (en) * 2001-12-26 2005-06-16 Bellsouth Intellectual Property Corporation Auto sensing home base station for mobile telephone with remote answering capabilities
US20040010736A1 (en) * 2002-06-05 2004-01-15 Alapuranen Pertti O. Hybrid ARQ for a wireless Ad-Hoc network and a method for using the same
US6744766B2 (en) * 2002-06-05 2004-06-01 Meshnetworks, Inc. Hybrid ARQ for a wireless Ad-Hoc network and a method for using the same
US20040015686A1 (en) * 2002-07-16 2004-01-22 Connor Patrick L. Methods and apparatus for determination of packet sizes when transferring packets via a network
US20040095885A1 (en) * 2002-11-15 2004-05-20 Samsung Electronics Co., Ltd. Priority queuing method and apparatus
US20040264396A1 (en) * 2003-06-30 2004-12-30 Boris Ginzburg Method for power saving in a wireless LAN
US20050025185A1 (en) * 2003-07-31 2005-02-03 International Business Machines Corporation System and method of reducing data corruption due to recycled IP indentification numbers
US20050053002A1 (en) * 2003-09-09 2005-03-10 Chan Mun Choon Methods and devices for maximizing the throughput of TCP/IP data along wireless links
US20090049189A1 (en) * 2003-11-07 2009-02-19 Cisco Technology, Inc. Methods and apparatus for supporting transmission of streaming data
US7016409B2 (en) * 2003-11-12 2006-03-21 Sony Corporation Apparatus and method for use in providing dynamic bit rate encoding
US20080151823A1 (en) * 2004-04-05 2008-06-26 Broadcom Corporation Establishing communication between entities in a wireless communication system
US20060031518A1 (en) * 2004-04-30 2006-02-09 Jennings Raymond B Iii Method and apparatus for transparent negotiations
US7953114B2 (en) * 2004-08-06 2011-05-31 Ipeak Networks Incorporated System and method for achieving accelerated throughput
US20110103388A1 (en) * 2004-08-06 2011-05-05 Ipeak Networks Incorporated System and method for achieving accelerated throughput
US8009696B2 (en) * 2004-08-06 2011-08-30 Ipeak Networks Incorporated System and method for achieving accelerated throughput
US7742501B2 (en) * 2004-08-06 2010-06-22 Ipeak Networks Incorporated System and method for higher throughput through a transportation network
US20120213232A1 (en) * 2004-08-06 2012-08-23 LiveQoS Inc. System and method for achieving accelerated throughput
US20060029101A1 (en) * 2004-08-06 2006-02-09 Williams Matthew R System and method for higher throughput through a transportation network
US20080304483A1 (en) * 2004-08-06 2008-12-11 Ipeak Networks Incorporated System and method for achieving accelerated throughput
US20120287806A1 (en) * 2004-08-06 2012-11-15 LiveQoS Inc. System and method for achieving accelerated throughput
US7522606B1 (en) * 2004-11-09 2009-04-21 Network Equipment Technologies, Inc. Passive packet re-ordering and packet loss detection
US20080095247A1 (en) * 2004-11-17 2008-04-24 Michihiro Ohno Transmitter, Receiver And Communication System
US7889654B2 (en) * 2005-03-30 2011-02-15 At&T Intellectual Property Ii, L.P. Loss tolerant transmission control protocol
US20100080167A1 (en) * 2005-06-28 2010-04-01 Koninklijke Philips Electronics, N.V. Handshaking method and apparatus for ofdm systems with unknown sub-channel availability
US20080240108A1 (en) * 2005-09-01 2008-10-02 Kim Hyldgaard Processing Encoded Real-Time Data
US20090268742A1 (en) * 2005-11-07 2009-10-29 Nec Corporation Session relay device and session relay method
US7936785B2 (en) * 2005-12-16 2011-05-03 Coding Technologies Ab Apparatus for generating and interpreting a data stream modified in accordance with the importance of the data
US20070157060A1 (en) * 2006-01-04 2007-07-05 Ganga Ilango S Techniques to perform forward error correction for an electrical backplane
US20100009547A1 (en) * 2006-07-03 2010-01-14 Hamamatsu Photonics K.K. Laser working method
US20100005177A1 (en) * 2006-09-05 2010-01-07 Cagenius Torbjoern Ip unicast streaming service delivery
US20080089268A1 (en) * 2006-10-17 2008-04-17 Kinder Richard D Media distribution in a wireless network
US20080151776A1 (en) * 2006-12-25 2008-06-26 Yoshinobu Kure Data Communication System, Data Transmitting Apparatus, Data Transmitting Method, and Method for Determining Packet Size and Redundancy
US20090006920A1 (en) * 2007-06-26 2009-01-01 Michelle Christine Munson Bulk data transfer
US7821937B1 (en) * 2007-06-29 2010-10-26 Symantec Corporation Network protocol with damage loss resilient congestion control algorithm
US20100242122A1 (en) * 2007-10-30 2010-09-23 Kyocera Corporation Information processing apparatus
US20100023842A1 (en) * 2008-07-25 2010-01-28 Nortel Networks Limited Multisegment loss protection
US20120203893A1 (en) * 2011-02-04 2012-08-09 Ipeak Networks Incorporated Methods for achieving target loss ratio
US20120201136A1 (en) * 2011-02-07 2012-08-09 Ipeak Networks Incorporated Mechanisms to improve the transmission control protocol performance in wireless networks

Cited By (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9189307B2 (en) 2004-08-06 2015-11-17 LiveQoS Inc. Method of improving the performance of an access network for coupling user devices to an application server
US20110103388A1 (en) * 2004-08-06 2011-05-05 Ipeak Networks Incorporated System and method for achieving accelerated throughput
US9893836B2 (en) 2004-08-06 2018-02-13 LiveQoS Inc. System and method for achieving accelerated throughput
US9647952B2 (en) 2004-08-06 2017-05-09 LiveQoS Inc. Network quality as a service
US9379913B2 (en) 2004-08-06 2016-06-28 LiveQoS Inc. System and method for achieving accelerated throughput
US8548003B2 (en) 2004-08-06 2013-10-01 LiveQoS Inc. System and method for achieving accelerated throughput
US20100272122A1 (en) * 2004-08-06 2010-10-28 Ipeak Networks Incorporated System and method for achieving accelerated throughput
US9590913B2 (en) 2011-02-07 2017-03-07 LiveQoS Inc. System and method for reducing bandwidth usage of a network
US10057178B2 (en) 2011-02-07 2018-08-21 LiveQoS Inc. System and method for reducing bandwidth usage of a network
US8717900B2 (en) 2011-02-07 2014-05-06 LivQoS Inc. Mechanisms to improve the transmission control protocol performance in wireless networks
US9647945B2 (en) 2011-02-07 2017-05-09 LiveQoS Inc. Mechanisms to improve the transmission control protocol performance in wireless networks
US20130111002A1 (en) * 2011-10-31 2013-05-02 Mike Leber Systems and methods for establishing a virtual local area network
US10320951B2 (en) * 2011-10-31 2019-06-11 Hurricane Electric Systems and methods for establishing a virtual local area network
CN103975570A (en) * 2011-12-05 2014-08-06 生活服务质量有限公司 Methods for achieving target loss ratio
WO2013084128A1 (en) * 2011-12-05 2013-06-13 LiveQoS Inc. Methods for achieving target loss ratio
US20130194934A1 (en) * 2012-01-27 2013-08-01 Electronics And Telecommunications Research Institute Packet processing apparatus and method for detecting duplicate acknowledgement packet
US9264185B2 (en) * 2012-01-27 2016-02-16 Electronics And Telecommunications Research Institute Packet processing apparatus and method for detecting duplicate acknowledgement packet
US9965760B2 (en) 2012-06-29 2018-05-08 Hurricane Electric Systems and methods for facilitating electronic transactions utilizing a mobile computing device
US8990956B2 (en) 2012-08-06 2015-03-24 Hurricane Electric Systems and methods of exchanging information for a reward
US9407557B2 (en) 2012-12-22 2016-08-02 Edgewater Networks, Inc. Methods and systems to split equipment control between local and remote processing units
WO2014099815A1 (en) * 2012-12-22 2014-06-26 Edgewater Networks, Inc Methods and systems to split equipment control between local and remote processing units

Also Published As

Publication number Publication date
US7953114B2 (en) 2011-05-31
CN102859921A (en) 2013-01-02
WO2011107963A1 (en) 2011-09-09
US20100220728A1 (en) 2010-09-02
JP2013526098A (en) 2013-06-20
EP2543156A4 (en) 2017-10-04
EP2543156A1 (en) 2013-01-09
US20150350390A1 (en) 2015-12-03

Similar Documents

Publication Publication Date Title
Samaraweera Non-congestion packet loss detection for TCP error recovery using wireless links
Speakman et al. PGM Reliable Transport Protocol Specification.
US7443797B2 (en) Medium streaming distribution system
US5768527A (en) Device, system and method of real-time multimedia streaming
US6434191B1 (en) Adaptive layered coding for voice over wireless IP applications
JP3967338B2 (en) Wireless packet transfer apparatus
JP5009978B2 (en) Bidirectional rlc non-persistent mode for low-latency services
US8537675B2 (en) Loss tolerant transmission control protocol
US7643480B2 (en) Method and system for reliably and efficiently transporting data over a network
US6243846B1 (en) Forward error correction system for packet based data and real time media, using cross-wise parity calculation
US7636298B2 (en) Apparatus and method for packet error correction
CN100342680C (en) Grouped missing notice of semi reliable retransfer protocol
JP5550834B2 (en) Variable fec overhead and streaming and buffering using the protection period
US7376880B2 (en) Transmission apparatus, transmission control program, and transmission method
US6445717B1 (en) System for recovering lost information in a data stream
US6975647B2 (en) Enhancements for TCP performance enhancing proxies
US20130155888A1 (en) Method and system of renegotiating end-to-end voice over internet protocol codecs
JP3590949B2 (en) Data transmission apparatus and data transmission method
CN101080914B (en) Method, system and article for improved network performance by avoiding data corruption
US7965729B2 (en) Transferring data such as files
JP4460455B2 (en) Adaptive forward error control scheme
Iren et al. The transport layer: tutorial and survey
CN1139219C (en) Method and system for implementing hybrid automatic request using parity check combining
CN1319306C (en) ARQ protocol with packet-based reliability level setting
US6542490B1 (en) Data link control proctocol for 3G wireless system

Legal Events

Date Code Title Description
AS Assignment

Owner name: IPEAK NETWORKS INCORPORATED, CANADA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:WILLIAMS, MATTHEW ROBERT;VEMULAPALI, MOHAN KRISHNA;REEL/FRAME:026333/0594

Effective date: 20100316

AS Assignment

Owner name: LIVEQOS INC., CANADA

Free format text: CHANGE OF NAME;ASSIGNOR:IPEAK NETWORKS INCORPORATED;REEL/FRAME:030194/0749

Effective date: 20120301

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION