US 9,537,759 B2Grant

Multi-path data transfer using network coding

Issue Date:2017-01-03

•15 Claims

•20 Drawing Sheets

Abstract

Techniques, devices, systems, and protocols are disclosed herein that relate to data transfer between communication nodes via multiple heterogeneous paths. In various embodiments, network coding may be used to improve data flow and reliability in a multiple path scenario. Transmission control protocol (TCP) may also be used within different paths to further enhance data transfer reliability. In some embodiments, multiple levels of network coding may be provided within a transmitter in a multiple path scenario, with one level being applied across ail paths and another being applied within individual paths.

Metadata

Assignee

MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Inventors

Flavio du Pin Calmon
Jason M. Cloud
Muriel Medard
Weifei Zeng

Application Information

Application Number:US 13/754,398

Filing Date:2013-01-30

Priority Date:2012-01-31

Art Unit:2477

Classifications

IPC:

H04L12/707H04B7/155H04L29/06H04L1/00

Patent Drawings (20 sheets)

Description

Cross Reference to Related Application

[0001] The present application claims the benefit of U.S. Provisional Patent Application No. 61/592,746 filed on Jan. 31, 2012, which is incorporated by reference herein in its entirety.

Government Rights

[0002] This invention was made with government support under Contract No. FA8721-05-C-0002 awarded by the U.S. Air Force and under Grant No. FA9550-09-1-0196 awarded by the Air Force Office of Scientific Research. The government has certain rights in the invention.

Field

[0003] Subject matter disclosed herein relates generally to data communications and, more particularly, to techniques, systems, and protocols for use in transferring data between locations via multiple different paths.

Background

[0004] Modern communication devices (e.g., smart phones and other handheld communicators, tablet computers with communication functionality, etc.) often possess multiple network interfaces for use with different network technologies having different connectivity characteristics. The different network technologies may each have, for example, different delay, throughput, and reliability characteristics. A mobile device that is connected to a remote source node through both a 30 network and an IEEE 802.11 wireless LAN may, for example, observe different usage costs and quality of service through each interface. It would be desirable to be able to utilize multiple available network resources to carry out a data transfer operation for a communication device to, for example, increase throughput, decrease data transit time, and/or make efficient use of available resources. It would also be desirable if this could be done in a reliable and efficient manner that takes advantage of already existing communication techniques and protocols.

Summary

[0005] Techniques, devices, systems, and protocols are described herein that support efficient and reliable data transfer between communication nodes via multiple different paths involving different network technologies. A novel transport layer protocol is proposed (i.e., the Multi-Path Transfer Control Protocol with Network Coding protocol or MPTCP/NC) that may be used to coordinate several parallel connections over multiple interfaces/networks. The proposed protocol incorporates some features of the multi-path TCP (MPTCP) protocol introduced by the Internet Engineering Task Force (IETF), but builds on the protocol to allow many of the benefits of network coding to be achieved in a multi-path scenario, it has been shown through simulation that the techniques described herein are capable of achieving a significant improvement in data transfer completion times and average transfer rates over other known multi-path approaches. Simulations have also shown that the techniques are more robust and reliable to link failure and variation than other multi-path schemes.

[0006] In accordance with one aspect of the concepts, systems, circuits, and techniques described herein, a machine implemented method for use in transferring data to a destination node comprises: obtaining a plurality of original data packets to be transferred to the destination node; generating first coded packets by linearly combining original data packets using network coding; distributing the first coded packets among multiple available paths leading to the destination node; generating second coded packets by linearly combining first coded packets distributed to a first path of the multiple available paths, using network coding; and transmitting the second coded packets associated with the first path to the destination node via as network associated with the first path.

[0007] In one embodiment, the method further comprises: generating second coded packets by linearly combining first coded packets distributed to a second path of the multiple available paths, using network coding; and transmitting the second coded packets associated with the second path to the destination node via a network associated with the second path.

[0008] In one embodiment, generating first coded packets includes generating first coded packets by linearly combining original data packets that are within a sliding coding window. In one embodiment, the sliding coding window has a variable width. In one embodiment, the method further comprises: receiving acknowledgement messages from the destination node that each indicate that a new degree of freedom has been received by the destination node in connection with the data transfer; and adjusting the width of the sliding coding window based, at least in part, on received acknowledgement messages.

[0009] In one embodiment, generating second coded packets includes generating second coded packets by linearly combining first coded packets that are within a sliding coding window. In one embodiment, generating second coded packets includes generating redundant second coded packets for each set of first coded packets within the sliding coding window.

[0010] In one embodiment, each of the multiple available paths includes a transmission control protocol (TCP) layer that adds sequence numbers to first coded packets distributed to the path, wherein generating second coded packets by linearly combining first coded packets masks the sequence numbers added to the first coded packets associated with a path.

[0011] In one embodiment, each of the multiple available paths includes a transmission control protocol (TCP) layer; and distributing the first coded packets includes distributing the first coded packets among the multiple available paths based, at least in part, on TCP congestion control window dynamics.

[0012] In one embodiment, the multiple available paths are associated with different network technologies.

[0013] In one embodiment, obtaining a plurality of original data packets includes receiving the original data packets from an application layer.

[0014] In accordance with another aspect of the concepts, systems, circuits, and techniques described herein, a machine implemented method for use in processing coded packets received from a source node via multiple different paths comprises: receiving coded packets associated with a first connection via multiple different paths, the coded packets each including a linear combination of original data packets; for each coded packet associated with the first connection that is successfully received, sending an acknowledgement message to the source node without first determining whether the coded packet is linearly independent of previously received coded packets associated with the first connection; forwarding all coded packets associated with the first connection, received from all paths, to a common processing layer without decoding the coded packets; and for each coded packet associated with the first connection forwarded to the common processing layer: (a) determining whether the coded packet is linearly independent of coded packets associated with the connection that were previously forwarded to the common processing layer; and (b) sending an acknowledgement message to the source node acknowledging that a new degree of freedom has been received for the first connection if the coded packet is determined to be linearly independent.

[0015] In one embodiment, determining whether the coded packet is linearly independent includes performing a Gauss-Jordan elimination operation on a coefficient matrix.

[0016] In one embodiment, receiving coded packets associated with a first connection via multiple different paths includes receiving coded packets from patios that use different network technologies, wherein each of the different paths uses transmission control protocol (TCP) to control a transfer of packets through the path. In one embodiment, sending an acknowledgement message to the source node without first determining whether the coded packet is linearly independent from previously received coded packets is performed as part of a TCP layer, in one embodiment, sending an acknowledgement message to the source node without first determining whether the coded packet is linearly independent of previously received coded packets is performed within a first portion of the TCP layer for coded packets received via a first path and within a second portion of the TCP layer for coded packets received via a second path that is different from the first path.

[0017] In one embodiment, die method further comprises discarding a received coded packet if it is determined that the packet is not linearly independent.

[0018] In one embodiment, receiving coded packets associated with as first connection via multiple different paths includes receiving first coded packets via a first path following an IEEE 802.16 wireless networking standard and receiving second coded packets via a second path following an LTE wireless cellular standard.

[0019] In one embodiment, forwarding all coded packets associated with the first connection to a common processing layer includes forwarding the coded packets to a multiple path transfer control protocol with network coding (MPTCP-NC) layer that is higher than a TCP layer in a corresponding protocol architecture. In one embodiment, the protocol architecture includes separate protocol stacks associated with each of the multiple different paths.

[0020] In accordance with still another aspect of the concepts, systems, circuits, and techniques described herein, a communication device comprises: a first network interface unit configured for communication in a first network; a second network interface unit configured for communication in a second network that is different from the first network; and at least one processor to manage data transfer between the communication device and a destination node using multiple different paths, the at least one processor to: (a) obtain a plurality of original packets representative of data to be transferred to the destination node; (b) generate first coded packets by linearly combining original data packets using network coding; (c) distribute first coded packets to the multiple different paths to the destination node; and (d) generate second coded packets within individual paths by linearly combining first coded packets distributed to the path, using network coding.

[0021] In one embodiment, the at least one processor is configured to transmit second coded packets generated within individual paths to the destination node via corresponding networks.

[0022] In one embodiment, the at least one processor is configured to generate first coded packets by linearly combining original data packets within a sliding coding window.

[0023] In one embodiment, the at least one processor is configured to generate second coded packets for a first path by linearly combining first coded packets within a sliding coding window. In one embodiment, the at least one processor is configured to generate redundant second coded packets for the first path for each set of first coded packets within the sliding coding window.

[0024] In one embodiment, the at least one processor is configured to distribute the first coded packets to the multiple different paths based, at least in part, on TCP congestion control window dynamics.

[0025] In one embodiment, a first of the multiple different paths is associated with the first network interface unit and a second of the multiple different paths is associated with the second network interface unit.

[0026] In accordance with a further aspect of the concepts, systems, circuits, and techniques described herein, a communication device comprises: a first network interface unit configured for communication in a first network; a second network interface unit configured for communication in a second network that is different from the first network; and at least one processor to manage processing of coded data packets received from a source node via multiple different paths as part of a first connection, the coded data packets each including a linear combination of original data packets, the at least one processor to: (a) send an acknowledgement message to the source node for each coded data packet associated with the first connection that is successfully received; (b) forward coded data packets associated with the first connection, received from all paths, to a common processing layer without first decoding the coded packets; and (c) for each coded packet associated with the first connection forwarded to the common processing layer: (i) determine whether the coded packet is linearly independent of coded packets associated with the connection that were previously forwarded to the common processing layer; and (ii) send an acknowledgement message to the source node acknowledging that a new degree of freedom has been received for the first connection if the coded packet is determined to be linearly independent.

[0027] In one embodiment, the at least one processor is configured to determine whether the coded packet is linearly independent by performing a Gauss-Jordan elimination operation on a coefficient matrix.

[0028] In one embodiment, the at least one processor is configured to discard a received coded packet if it is determined that the packet is not linearly independent.

[0029] In one embodiment, a first of the multiple different paths is associated with the first network interface unit and a second of the multiple different paths is associated with the second network interface unit.

Brief Description of the Drawings

[0030] The foregoing features may be more fully understood from the following description of the drawings in which:

[0031] FIG. 1 is a diagram illustrating an exemplary multiple path communication scenario that can utilize one or more of the techniques or features described herein;

[0032] FIG. 2 is a diagram illustrating another exemplary multiple path communication scenario that can utilize one or more of the techniques or features described herein;

[0033] FIG. 3 is a diagram illustrating an exemplary protocol architecture that may be used within a communication system having heterogeneous links in accordance with an embodiment;

[0034] FIG. 4 is a diagram illustrating an exemplary communication scenario involving a transfer of data between a source node and a destination node in accordance with an embodiment;

[0035] FIG. 5 is a diagram illustrating operation of an exemplary process for encoding data within a source node in accordance with an embodiment;

[0036] FIG. 6 is a flowchart illustrating an exemplary method for use in transmitting data from a source node to a destination node via multiple different paths in accordance with an embodiment;

[0037] FIGS. 7a and 7b are portions of a flowchart illustrating a method for use in processing coded packets received at a destination node via, multiple different paths in accordance with an embodiment;

[0038] FIG. 8 is a diagram illustrating a round duration approach used for analyzing operation of an MPTCP/NC protocol;

[0039] FIG. 9 is a diagram illustrating round trip time and packet loss probability parameters for several different wireless standards;

[0040] FIGS. 10a-10c are diagrams illustrating analysis results for three considered models using two sub-flows having parameters RTT₁=15 ms, p₁=10⁻³, RTT₂=80 ms, and p₂=10⁻²;

[0041] FIGS. 11a-11c are diagrams illustrating analysis results for three considered models using two sub-flows having parameters RTT₁=1500 ms, p₁=10⁻², RTT₂=80 ms, and p₂=10⁻¹;

[0042] FIGS. 12a-12c are diagrams illustrating analysis results for three considered models using two sub-flows having parameters RTT₁=1500 ms, p₁=10⁻³, RTT₂=15 ms, and p₂0.3;

[0043] FIGS. 13a-13c are diagrams illustrating analysis results for three considered models using two sub-flows having parameters RTT₁=80 ms, p₁=10⁻¹, RTT₂=250 ms, and p₂=10⁻¹; and

[0044] FIG. 14 is a block diagram illustrating an exemplary node device architecture that may be used in a node device incorporating features described in the present disclosure in one or more embodiments.

Detailed Description

[0045] Techniques, devices, systems, protocols described herein relate to the transfer of data between communication nodes via multiple heterogeneous paths. In various embodiments, network coding is used to improve data flow and reliability within a multiple path scenario. Transmission control protocol (TCP) may also be implemented within each of the different paths to further enhance data transfer reliability. In some embodiments, multiple levels of network coding may be provided within a transmitter in a multiple path networking scenario, one level that is applied across all of the different paths (or sub-flows) and another level that is applied within each individual path. As will be described in greater detail, a communication protocol (MPTCP/NC) is also described for use in implementing and standardizing these techniques in some embodiments.

[0046] FIG. 1 is a diagram illustrating an exemplary multiple path communication scenario 10 that may utilize one or more of the techniques or features described herein. As shown, a first node 12 (e.g., a smart phone) may wish to exchange information with a second node 14 (e.g., server) via a network cloud 16. As is known, a network cloud 16 may provide multiple different routes or paths that data packets can traverse between the first and second nodes 12, 14. In addition, some of the different routes through the network cloud 16 may involve different network technologies in some cases. For example, in the illustrated embodiment, a first path 18 may exist between the first and second nodes 12, 14 that is associated with a WiFi-based network 22 (i.e., based on the IEEE 802.11 family of wireless networking standards) and a second path 20 may exist that is associated with a long teen evolution (LTE) based 40 cellular network 24. To use either of these different paths 18, 20, the first and second nodes 12, 14 would have to include (or have access to) appropriate hardware and software to be able to communicate according to the corresponding standards. Many modern communication devices (e.g., cell phones, smart phones, handheld communicators, computers or servers with communication functionality, network gateways, wireless access points, audio/video devices with communication functionality, appliances with communication functionality, wearable communication devices, etc.) include network adapters for multiple different network technologies.

[0047] FIG. 2 is a diagram illustrating another exemplary multiple path communication scenario 30 that may utilize one or more of the techniques or features described herein. As shown, an aircraft 32 may act as a communication platform or node that is capable of supporting wireless communication in accordance with a number of different technologies, specifications, and/or standards (military and/or commercial). Aircraft 32 may desire to perform a data transfer operation with a remote terrestrial server 34. One or more communication satellites 36, 38 may be within communication range of aircraft 32. Each of these satellites 36, 38 may provide a corresponding path 42, 44 through which aircraft 32 can communicate with server 34. One or more ground stations 40 may also be within communication range of aircraft 32. Ground station 40 may also provide a path 48 through which aircraft 32 can establish communication with remote server 34. The satellites 36, 38 and the ground station 40 may each operate in accordance with a different wireless standard.

[0048] In each of the above-described scenarios, it may be possible to use multiple different network technologies to support a single data transfer operation (or a single connection) between communication nodes. The use of multiple different network technologies associated with multiple different paths to support a single data transfer operation or other function may be referred to as “heterogeneous networking.” As used herein, phrases such as “network technologies” and “network access technologies” encompass both wireless and wired technologies and can involve various different wireless and/or wire line standards, specifications, and/or protocols. The different wireless standards may include, for example, wireless networking standards, wireless cellular standards, wireless satellite communication standards, infrared communications standards, point to point microwave link technologies, LMDS and MMDS technologies, and/or other forms of wireless standards. Although specific heterogeneous network scenarios are shown in FIGS. 1 and 2, it should be appreciated that the number and type of network technologies used in particular heterogeneous network implementations may vary widely. As described above, various techniques, devices, and systems are described, herein that allow heterogeneous network arrangements to be used to facilitate data transfer between two communicating nodes in a system in an efficient and reliable manner.

[0049] Transmission control protocol (TCP) is a communication protocol that may be used to provide reliable data stream service between, for example, a source node and a destination node in a network. TCP makes use of positive acknowledgment with retransmission to improve the reliability of data transfer in both accuracy and sequence. A TCP source node may keep a record of each packet transmitted as part of a data transfer operation. After transmitting a packet, the source node may automatically retransmit the packet if an acknowledgement message is not received from the destination node within a predetermined time period. TCP is considered a part of the TCP/IP protocol suite and provides a communication service at an intermediate layer between an application program and the Internet Protocol (IP).

[0050] Internet Protocol (IP) typically uses “IP packets” as a vehicle to transfer data between nodes on a physical medium. An IP packet is a sequence of octets that includes both a header and a body. Among other things, the header of an IP packet may include destination node address information to identify a destination of the IP packet. The body of an IP packet may include the data being transferred. When an application program within a first node desires to send a large amount of data to a remote node, the program can split up the data into smaller portions and then issue a series of IP requests to an IP layer to transfer the data. Alternatively, the program can issue a single TCP request and let TCP deal with the IP layer. For various reasons, IP packets can be lost, duplicated, or delivered out of sequence in a network. TCP can detect such problems, request retransmission of lost data, and rearrange packets in a receiver that were delivered out of sequence. TCP can also operate to reduce congestion in a network. Once a TCP enabled receiver has received and reassembled a number of octets, it may pass them to an application program for use in performing a particular function. The operation of TCP can be relatively transparent to an application.

[0051] Network coding is a coding technique that may be used to, among other things, improve information flow in a network. Network coding usually involves the generation of linear combinations of data packets to form “coded packets” for transmission in a network. One form of network coding, known as Random Linear Network Coding (RLNC), uses randomly generated coefficients to form linear combinations of packets (or coded packets) to be transmitted in the network. In some cases, information describing the coefficients used to make the linear combination may be appended to the coded packet before transmission. RLNC has been shown to be a powerful technique for achieving robust, high throughput packet distribution in certain network environments. One example system and method fir implementing RLNC is described in U.S. Pat. No. 7,706,365 to Effros et al. entitled “Randomized Distributed Network Coding,” which is hereby incorporated by reference in its entirety.

[0052] In a network that uses RLNC, a source node that has a number of original data packets to transfer to a destination node may combine the packets together into a “coded packet” that is then transmitted into the network. A destination node in the network that receives the coded packet may then store the packet for eventual decoding. The destination node will typically require a particular number of coded packets before it is able to decode the coded packets to extract the original data packets. The decoding process may involve, for example, the solution of a system of linear equations having a number of independent variables (i.e., the data packets) and a number of independent equations. Before a destination node can reliably solve for the original data packets, the number of “degrees of freedom” (or DOFs) received must equal or exceed the number of original packets. The DOFs missing may in some cases be defined as the number of unknown independent variables of a system of equations less the number of independent equations. In some implementations, each coded packet successfully received at a destination node may provide another equation for use in decoding and thus reduce the number of DOFs needed by the node by one (assuming the coded packet is linearly independent of previously received coded packets). In some networks, a source node may transmit a stream of coded packets until a destination node is able to decode the original data packets.

[0053] In developing the techniques, devices, systems, and protocols described herein, it was determined that improved throughput performance and decreased communication delay could be achieved in a network by intelligently combining TCP, network coding, and heterogeneous networking. The techniques, devices, systems, and protocols are also capable of increasing data transfer reliability and decreasing management overhead when transmitting a single source-destination flow over multiple interfaces/networks. Although described herein in connection with network coding, it should be appreciated that some or all of the techniques described herein may use other similar codes in place of, or in addition to, network coding in some implementations (e.g., fountain codes, systematic codes, structured codes, etc.).

[0054] FIG. 3 is a diagram illustrating an exemplary protocol architecture 50 that may be used within a communication system having heterogeneous links in accordance with an embodiment. The corresponding protocol will be referred to herein as multi-path TCP with network coding (MPTCP-NC). Protocol architecture 50 may be used to split a data transfer operation involving a source node and a destination node between multiple different heterogeneous communication links (o paths or sub-flows) in certain situations. As will be described in greater detail, protocol architecture 50 may also be used to provide two separate levels of network coding to signals being transferred to a destination node via multiple heterogeneous links. The phrases “data flow” and “connection” may be used herein to refer to a data transfer operation that seeks to transfer a certain amount of data (e.g., a data file of a particular size, etc.) from a source node to a destination node.

[0055] As shown in FIG. 3, protocol architecture 50 may include: an application layer 52, an MPTCP/NC layer 54, a TCP (or transport) layer 56, a fast-TCP/NC layer 58, an IP layer 60, and a network interface layer 62. Application layer 52, TCP layer 56, IP layer 60, and network interface layer 62 may perform similar functions to corresponding layers in the basic TCP/IP protocol stack. The MPTCP/NC layer 54 may sit directly above TCP layer 56 in protocol architecture 50. Fast-TCP/NC layer 58 may sit directly below TCP layer 56. Application layer 52 is the highest layer in protocol architecture 50 and is the layer where one or more application programs may be executed that may require one or more communications-related processes to be performed in a corresponding system. MPTPC/NC layer 54 is operative for performing one level of network coding operations for the system and for dividing data transfer operations between the different paths, or sub-flows 64, 66. TCP layer 56 is operative for implementing transmission control protocol within the communication system. Fast-TCP/NC layer 58 is operative for performing a second level of network coding operations for the system and for simplifying the implementation of network coding within the TCP framework. IP layer 60 is operative for providing internet protocol (IP) related services in the communication system. Network interface layer 62 is operative for providing an interface to a physical network medium for the system.

[0056] As illustrated, the lower portion of protocol architecture 50 is divided into a number of different “sub-flows” 64, 66 that may each correspond to a different networking technology and a different path between a source node and a destination node. Each sub-flow 64, 66 within protocol architecture 50 may include a corresponding protocol stack. For example, first sub-flow 64 may include a stack with a TCP layer 56a, Fast-TCP/NC layer 58a, IP layer 60a, and network interface layer 62a. Likewise, second sub-flow 66 may include a stack with a TCP layer 56b, Fast-TCP/NC layer 58b, IP layer 60b, and network interface layer 62b. The protocol stack associated with each sub-flow 64, 66 may be used to process communications flowing through the sub-flow 64, 66 for a corresponding networking technology. Thus, if the first sub-flow 64 corresponds to an IEEE 802.11 based network, TCP layer 56a will be used to provide TCP services for the IEEE 802.11 based communications and network interface 62a will be used to interface to a corresponding IEEE 802.11 wireless medium, and so on. Although illustrated in FIG. 3 with only two sub-flows, it should be appreciated that protocol architecture 50 may be implemented with any number of different sub-flows (greater than one) in different implementations.

[0057] In a typical communication scenario, an application program within application layer 52 may determine that a large amount of data (e.g., a large data file, etc.) needs to be transferred to a remote destination node. The application program may then transfer some or all of the data to MPTCP/NC layer 54 with instructions to transfer the data to the destination node. MPTCP/NC layer 54 may then apply network coding to the data and then divide the coded data amongst the various sub-flows 64, 66 for transmission to the destination node. Thus, instead of seeing multiple TCP links, application layer 52 only needs to interface with MPTCP/NC layer 54.

[0058] In one implementation, the data transferred from application layer 52 to MPTCP/NC layer 54 will include data packets that will be referred to herein as “original packets.” As will be described in greater detail, MPTCP/NC layer 54 may process original packets received from application layer 52 using network coding to generate “coded packets.” As described previously, coded packets may be generated by forming linear combinations of original packets using, for example, randomly generated coefficients. In one approach, MPTCP/NC layer 54 may generate a new coded packet by linearly combining all original packets that are within a coding buffer of MPTCP/NC layer 54 all original packets received so far that are associated with the corresponding connection). In another approach, MPTCP/NC layer 54 may generate a new coded packet by linearly combining all original packets that are within a sliding coding window of MPTCP/NC layer 54. Each new original packet added to the coding window may drive an older original packet out of the window. The coded packets generated by MPTCP/NC layer 54 will be referred to herein as “first coded packets” to distinguish them from subsequently generated coded packets. The sliding coding window of MPTCP/NC layer 54 may have a fixed or variable length in different implementations.

[0059] In the discussion that follows, it will be assumed that two or more TCP sub-flows are properly established and managed under a common connection. In at least one implementation, the procedure for initiating and managing multiple TCP sub-flows will be the same as, or similar to, the procedures described in the MPTCP protocol proposed by the IETF (e.g., MPTCP Application Interface Considerations, by Scharf at el., draft-ietf-mptcp-api-06, 2012-10-22, which is incorporated by reference herein in its entirety), although other processes may alternatively be used. MPTCP/NC layer 54 may monitor the different TCP sub-flows 64, 66 of protocol architecture 50 to determine when a particular sub-flow is able to receive one or more first coded packets. As TCP transmits packets over the network, its window slides or expands to include new packets. When there is a chance to inject a new coded packet to one of the TCP sub-flows 64, 66, the MPTCP/NC layer 54 may produce a new random linear network, coded packet (i.e., a new “first coded packet”) and inject the new coded packet to the identified TCP sub-flow.

[0060] As described above, in one possible scenario, the MPTCP/NC layer 54 may decide to inject a new coded packet into, for example, sub-flow 64. The TCP layer 56a of sub-flow 64 may operate in a conventional. TCP manner as all operations in MPTCP/NC layer 54 and Fast-TCP/NC layer 58a may be transparent to the TCP protocol. However, it should be noted that all packets in the TCP window of TCP layer 56a of protocol architecture 50 will be coded packets (i.e., first coded packets). These packets are pushed from TCP layer 56a to Fast-TCP/NC layer 58a, which maintains another coding window. Fast-TCP/NC layer 58a may then apply a second level of network coding to first coded packets in its coding window to generate second coded packets. For each first coded packet TCP layer 56a sends to Fast-TCP/NC 58a, the latter may produce R second coded packets that are random linear combinations of all first coded packets in its coding window. The second coded packets are eventually passed to IP layer 60a, after which they may be transmitted over a corresponding network (via network interface layer 62a) to a destination node or nodes. Thus, the transmitted packets are twice-encoded packets.

[0061] Although packets received by TCP layer 56 are previously coded by MPTCP/NC layer 54, TCP will not be aware of this and will assign sequence numbers to the packets. In a conventional system, the sequence numbers will allow the destination node to determine whether any of the transmitted packets were lost in transit. Due to the nature of network coding, assuming the network coding window is designed correctly, sequence as are no longer necessary to identify packets lost in transit. That is, once enough packets have been successfully received in the destination node, the node will be able to decode the original packets, regardless of the sequence in which the coded packets were transmitted. Thus, the second layer of coding provided by Fast-TCP/NC layer 58a will serve to mask the sequence numbers of the packets added by TCP layer 56a as they are not needed.

[0062] FIG. 4 is a diagram illustrating an exemplary communication scenario 80 involving a transfer of data between a source node 82 and a destination node 84 that both utilize protocol architecture 50 of FIG. 3 in accordance with an embodiment. As shown, a first network 86 provides a first link (or path) between the nodes 82, 84 and a second network 88 provides a second link (or path) between the nodes 82, 84. These links may be heterogeneous. Referring now to FIG. 4, at the destination node 84, if a twice-encoded packet is successfully received at the Fast-TCP/NC layer 58 (i.e., it is not erased in transit), the layer may immediately send an acknowledgement (ACK) message to the TCP/NC layer 58 of the source node 82. The Fast-TCP/NC layer 58 of destination node 84 may then pass the received packet up the protocol stack. All of the packets delivered by the various TCP sub-flows will eventually reach the MPTCP/NC layer 54 of destination node 84. The MPTCP/NC layer 54 may then perform Gaussian-Jordan elimination (or a similar procedure) progressively as it receives new packets from the different sub-flows.

[0063] A received packet is considered “innovative” if it is linearly independent of all previously received packets associated with the connection. If innovative, the packet will contribute a new “degree of freedom” and induce a new “seen packet” after Gaussian-Jordan elimination. Once the MPTCP/NC layer 54 receives an innovative packet from any of the sub-flows, it sends an ACK message (i.e., DATA_ACK) to acknowledge the new degree of freedom to the MPTCP/NC layer 54 of source node 82. Eventually, the MPTCP/NC layer 54 of the destination node 84 collects enough linearly independent packets to allow it to solve the linear system and recover all original packets. The original packets may then be delivered to the application level 52 of the destination node 84.

[0064] As described above, the Fast-TCP/NC layer 58 is directly below the transport layer 56. In the Fast-TCP/NC layer 58 of destination node 84, received packets are not checked for linear independence. That is, Gaussian-Jordan elimination is not performed and the seen packet concept is not employed. Instead, for each packet successfully received, regardless of whether it is linearly independent of previously received packets, Fast-TCP/NC layer 58 will automatically send an acknowledgement message badly to source node 82. This is because in any particular sub-flow TCP layer or below, there is no global knowledge of the linear space spanned by the packets received from all sub-flows. Therefore, a linear dependency check will not be efficient at the Fast-TCP/NC layer 58. Instead, Fast-TCP/NC layer 58 may deliver packets upwards to MPTCP/NC layer 54, which does have global knowledge of all packets, to handle the linear independency cheek and decoding. Furthermore, assuming that the coefficients in the packet header are properly organized and adjusted, the results of the second encoding are just other random linearly encoded packets. These packets can be decoded at the MPTCP/NC layer 54 of destination node 84, without intermediate decoding at the lower level. Since the Fast-TCP/NC layer 58 does not handle linear dependency issues, it may send an ACK every time a packet is received. This is reasonable as packet linear dependency is a problem associated with the coding operation, rather than with link congestion. The fast ACK allows the window management to be more efficient.

[0065] The MPTCP/NC layer 54 may maintain a coding window which decides the number of original packets to be coded and pushed to the TCP slab-flows 64, 66. As mentioned above, MPTCP/NC layer 54 has global knowledge of all packets received from all TCP sub-flows. Therefore, Gaussian-Jordan elimination may be carried out here, whenever a packet is received, to check linear dependency. The MPTCP/NC layer 54 of source node 82 receives a DATA_ACK for each degree of freedom received at destination node 84 and may adjust its coding window accordingly. The design of the coding window is very flexible, as is not constrained by the TCP congestion window. For example, the left boundary of the window could slide according to the slowest TCP sub-flow, while the right side of the window can slide when the fastest sub-flow contributes a degree of freedom. This will allow packets delivered by any sub-flow to be innovative with high probability.

[0066] FIG. 5 is a diagram illustrating operation of an exemplary process 100 for encoding data within a source node in accordance with an embodiment. As shown, a data file to be transferred to a remote destination node may be comprised of (or divided into) a number of original packets 102 (i.e., p₁to p_a). In the illustrated scenario, it is assumed that the MPTPC/NC coding window is currently four packets wide and the fast-TCP/NC coding window is 2 packets wide. As shown, the first four original packets (p₁-p₄) may first be shifted into the MPTPC/NC coding window and used to generate a coded packet 104 (c₁) by forming a linear combination using randomly generated coefficients. As shown, it may be decided to inject c₁into a first sub-flow 112 (based on, for example, TCP congestion control window dynamics or some other criterion). A new original packet p₅may then be shifted into the coding window, thus pushing the first original packet p₁out of the window. A next coded packet 106 (c₂) may then be generated. It may be decided to inject c₂into a second sub-flow 114. A similar process may then be used to generate a coded packet 108 (c₃) and coded packet 110 (c₄). As shown, it may be decided to inject coded packet c₃into first sub-flow 112 and coded packet c₄into second sub flow 114.

[0067] Within the first sub-flow 112, a number of redundant coded packets 116, 118 may be generated using coded packet c₁and coded packet c₃(and randomly generated coefficients). The redundant packets are generated to overcome potential packet losses in transit. Likewise, within the second sub-flow 114, a number of redundant coded packets 120, 122, 124 may be generated using coded packet c₂, and coded packet c₄(and randomly generated coefficients). Once generated, the coded packets 116, 118, 120, 122, 124 may be transmitted to a remote destination node via corresponding network media. It should be noted that the number of redundant coded packets generated within first sub-flow 112 does not have to be the same as the number generated within second sub-flow 114 (although it could be the same in some scenarios).

[0068] FIG. 6 is a flowchart illustrating a method 130 for use in transmitting data from a source node to a destination node via multiple different paths (or sub-flows) in accordance with an embodiment. As described previously, the multiple different paths may be associated with different communication technologies in some implementations to form a heterogeneous networking arrangement. First, a number of original data packets may be obtained that are representative of the data to be transferred (step 132). For example, the data to be transferred may comprise a large data file and the original data packets may be generated by splitting up the file into smaller components. In some embodiments, the division of a larger file into original packets may be performed in an application layer or an MPTCP/NC layer of an underlying protocol. First coded data packets may then be generated by combining some or all of the original data packets using network coding (block 134). In some implementations, a first coding window (e.g., a MPTCP/NC coding window, as described previously) may be used to generate the first coded packets. The first coding window may have a particular packet width (e.g., four packets wide, etc.) and a first coded packet may be generated by forming a linear combination of the original packets currently within the first coding window, using randomly generated coefficients. A random number generator (or similar functionality) may be used to generate the random coefficients. As each new original packet is added to the first coding window, an oldest original packet in the window may be shifted out. A new first coded packet may be generated for each new original packet added to the first coding window in some implementations. The size of the first coding window may be fixed or variable.

[0069] The multiple different paths may be monitored to identify one or more paths that can receive a new first coded packet at a particular point in time (136). This monitoring process may continue until all of the desired data has been successfully transferred to and decoded at the destination node. In some embodiments, the monitoring process may be based upon the dynamics of a TCP congestion control window. When a path is identified, one or more first coded packets may be injected into the identified path (block 138). The injected packet may then be added to a second coding window (e.g., a Fast TCP/NC, coding window, etc.) associated with the identified path. Over time, different first coded packets may be injected into different paths using the above-described technique. For each path, one or more second coded packets may be generated by linearly combining the first coded packets that currently reside within a corresponding second coding window using network coding (block 140). Randomly generated coefficients may be used to perform the linear combination, as described above.

[0070] In some implementations, a number of redundant second coded packets may be generated for each set of first coded packets within the second coding window associated with a particular path. As before, for each new first coded packet added to a second coding window, an older first coded packet may be shifted out of the window. A new set of redundant packets may be generated for each new first coded packet added to a second coding window in some implementations. The redundant packets may be transmitted to the destination node via a corresponding network medium after they have been generated (block 142). The process of generating second coded packets within each path may be ongoing until all of the desired data has been successfully transferred to, and decoded at, the destination node. As described previously, the generation of second coded packets using first coded packets may mask any sequence numbers added to the first coded packets by corresponding TCP functionality.

[0071] FIGS. 7a and 7b are portions of a flowchart illustrating a method 160 for use in processing coded packets received at a destination node from a source node via multiple different paths in accordance with an embodiment. The method 160 may be used, for example, to process second coded packets generated in a source node using method 130 of FIG. 6 or a similar method. Referring now to FIG. 7a, coded packets that are associated with a first connection (or a first data transfer operation) are received at a destination node via multiple different paths (block 162). For each coded packet successfully received, an acknowledgement (ACK) message may be sent to the source node acknowledging the receipt of the packet (block 164). The ACK message may be sent without first determining whether the coded packet is linearly independent of previously received coded packets associated with the first connection. All coded packets associated with the first connection that are received via all active paths may be forwarded to a common processing layer (e.g., an MPTCP/NC, layer or other layer common to all paths, etc.) (block 166). The common processing layer may watch for newly forwarded coded packets associated with the first connection (block 168).

[0072] Referring now to FIG. 7b, when a new coded packet has been forwarded to the common processing layer, it may be next be determined whether the new coded packet is linearly independent of previously received coded packets associated with the first connection (block 170). To determine Whether the new packet is linearly independent, a Gaussian-Jordan elimination operation (or similar process) may be performed on a coefficient matrix associated with previously received packets. If the packet is not linearly independent (block 170-N), the packet may be discarded (block 180) and the common processing layer may proceed to look for new coded packet (block 168). If the packet is linearly independent (block 170-Y), then the common processing layer may send an ACK message (e.g., DATA_ACK, etc.) to the source node indicting that a new degree of freedom has been received for the first connection (block 172). The source node may use these degree of freedom related ACK messages to, for example, modify a coding window size within the source node.

[0073] After the ACK message has been transmitted, it may next be determined whether enough linearly independent coded packets have been successfully received for the first connection to be able to decode the received coded packets to extract the original packets (block 174). If enough linearly independent coded packets have not been received to allow decoding (block 174-N), the common processing layer may proceed to look for a new coded packet (block 168). If enough linearly independent packets have been received (block 174-Y), then a decoding procedure may be performed to extract the original packets from the received coded packets (block 176). The extracted original packets may then be forwarded to a corresponding application for use thereby (block 178). The above-described process may be repeated for each data transfer operation to be carried out between the source node and the destination node.

[0074] In Table 1 below, the proposed protocol is compared with some existing methods that use TCP connections for data transmission. In Table 1, the TCP/NC protocol is referring to that proposed in “Network Coding Meets TCP: Theory and Implementation,” by Sundararajan et al, Proceedings of the IEEE, vol. 99, no. 3, pp. 490-512, March 2011.

[0075]

TABLE 1

TCP	TCP/NC	MPTCP	MPTCP/NC

One TCP per	One TCP per	Multiple TCP per	Multiple TCP per
connection	connection	connection	connection
Split a file or a stream	Split a file offline into	Online and	Online and
offline into different	different parts, one for	dynamically split file	dynamically assign
parts, one for each	each TCP flow	based on sub-flow	coded packets to TCP
TCP flow		TCP window	sub-flows
		evolutions
Each part treated as a	Coding occurs within	Original data packets
separate file	each flow for disjoint	assigned to sub-flows
transmission	parts

[0076] An analytical model will now be presented to evaluate the performance of MPTCP/NC. The model will use several key elements presented in previous sections to provide some of the relevant abstractions. First, the model will assume that the MPTCP/NC layer provides a method that eliminates the need to track specific packets sent over a sub-flow. Because degrees of freedom are delivered to a sub-flow, rather than individual uncoded packets, the analysis presented will only need to track each degree of freedom through the network. Second, the model will assume that the congestion control algorithm used is similar to that of TCP Reno. For example, the congestion window increases by the number of received acknowledgements divided by the current window size, decreases by half upon receipt of a triple-duplicate acknowledgement, and completely closes if no acknowledgement is received after a given time-out period. Third, the model will assume that the network coding operations performed by the past-TCP/NC layer eliminate the need to consider the effects of triple-duplicates on TCP s window size, instead, network coding simplifies the analysis. Since each received acknowledgement is an indication of a degree of freedom obtained by the receiver, only the effects of coded packet losses need to be considered. As a result, packet losses are interpreted as an increase in the round-trip time (RTT) between the source and destination. Finally, the concept of sending redundant coded packets will be used. For every packet contained in the TCP contention window, R linearly independent packets will be transmitted. This added redundancy significantly reduces the probability of a time-out and it will be assumed that R is large enough to reduce the probability of a time-out to zero. Each of the above abstractions contributes to the ability to analyze the performance of MPTCP/NC.

[0077] MPTCP/NC will be analyzed below using two metrics, the average throughput custom character

and the expected MPTCP/NC congestion window evolution custom character

[W]. Since the instantaneous throughput of TCP is directly related to custom character

[W], the analysis will focus on finding custom character

[W] and then take an average of custom character

[W] over time to find custom character

. MPTCP/NC's behavior will be modeled in terms of rounds. Within a round i, MPTCP/NC's expected congestion window size W_iwill be determined, which is defined as the sum of each sub-flow's congestion window size custom character

for sub-flows j={1,2}:

[0078]

\begin{matrix} W_{i} = \sum_{j} W_{i}^{(j)} = W_{i}^{(1)} + W_{i}^{(2)} . & (1) \end{matrix}

[0079] The natural choice for determining the duration of a round is to use the round trip time (RTT) from the sender to the receiver (i.e., duration(i)=RTT), where equation (1) assumes that RTT₁=RTT₂. While this may work if there is a single TCP connection, each sub-flow in MPTCP/NC will typically have different round trip times making it difficult to determine which RTT to use. In order to account for this, the duration of each round will be set equal to the least common multiple (LCM) of the RTT for sub-flow 1 and sub-flow 2 (i.e., duration(i)=LCM(RTT₁, RTT₂)). FIG. 8 provides an illustration of this concept. The TCP congestion window size will now need to be determined for each sub-flow, given the duration of a round. This may be done by defining α and β as follows:

[0080]

\begin{matrix} α := \frac{{RTT}_{1}}{LCM ({RTT}_{1}, {RTT}_{2})} and β := \frac{{RTT}_{2}}{LCM ({RTT}_{1}, {RTT}_{2})}, & (2) \end{matrix}

The window size for sub-flow j in round i is then custom character

for k={α,β}. Equation (1) now becomes:
W_i=W_┌iα┐⁽¹⁾+W_┌iβ┐⁽²⁾. (3)

[0081] The expected TCP congestion window size will now be analyzed for each sub-flow. The results will then be extended so that MPTCP/NC's end-to-end throughput can be determined. The analysis for the jth sub-flow in MPTCP/NC will be the same for each sub-flow. The most basic implementation of TCP will be used in the analysis and initially it will be assumed that each round's duration is equal to the RTT of sub-flow j. It will also be assumed that the window size dating round i is determined by the number of acknowledgements α obtained during round i−1. Specifically, the window size on each round is:

[0082]

\begin{matrix} W_{i}^{(j)} = W_{i - 1}^{(j)} + \frac{a_{i - 1}^{(j)}}{W_{i - 1}^{(j)}} . & (4) \end{matrix}

Assuming that R_jlinearly independent packets are sent for each packet contained the TCP congestion window and a packet loss rate of p_j, the expectation of the window size, E[W_i custom character

], may be expressed as:

[0083]

\begin{matrix} \begin{matrix} 𝔼 [W_{i}^{(j)}] = 𝔼 [W_{i - 1}^{(j)} + \frac{a_{i - 1}^{(j)}}{W_{i - 1}^{(j)}}] \\ = 𝔼 [W_{i - 1}^{(j)}] + 𝔼 [\frac{a_{i - 1}^{(j)}}{W_{i - 1}^{(j)}}] (6) \\ = 𝔼 [W_{i - 1}^{(j)}] + 𝔼 [𝔼 [\frac{a_{i - 1}^{(j)}}{W_{i - 1}^{(j)}} | W_{i - 1}^{(j)}]] (7) \\ = 𝔼 [W_{i - 1}^{(j)}] + 𝔼 [\frac{1}{W_{i - 1}^{(j)}} 𝔼 [a_{i - 1}^{(j)} | W_{i - 1}^{(j)}]] (8) \\ = 𝔼 [W_{i - 1}^{(j)}] + 𝔼 [\frac{1}{W_{i - 1}^{(j)}} ((1 - p_{j}) R_{j} W_{i - 1}^{(j)})] (9) \\ = 𝔼 [W_{i - 1}^{(j)}] + (1 - p_{j}) R_{j} . (10) \end{matrix} & (5) \end{matrix}

Since the window size of TCP can increase by a maximum of one packet per round,

[0084]

\begin{matrix} \begin{matrix} 𝔼 [W_{i}^{(j)}] = 𝔼 [W_{i - 1}^{(j)}] + \min (1, (1 - p_{j}) R_{j}) \\ = 𝔼 [W_{1}^{(j)}] + (i - 1) \min (1, (1 - p_{j}) R_{j}), (12) \end{matrix} & (11) \end{matrix}

where equation (12) is obtained by iterating equation (11).

[0085] Now that the expected window size in round i has been found, the throughput custom character

^(j)during the round can be calculated as follows:

[0086]

\begin{matrix} (1, (1 - p_{j}) R_{j}), & (13) \end{matrix}

where the minimization is necessary to account for packets that are received that do not deliver new degrees of freedom. Since the Fast-TCP/NC layer codes all packets within the TCP congestion window, delivered packets 1 through custom character

contain new degrees of freedom. If more than custom character

packets are received in the round, the MPTCP/NC layer will disregard them since they obtain no new degrees of freedom. Therefore, the throughput is adjusted to ensure that only new degrees of freedom are taken into account.

[0087] The fact that the round duration is not equal to sub-flow j's RTT (i.e., the duration of a round is equal to the LCM(RTT₁, RTT₂)) will now be taken into account. The expected window size in equation (12) can be adjusted to account for the shorter rounds by substituting ┌lγ┐ for i, were l is the round number when using the shorter round duration and γ={α,β}:
custom character

[W_┌l/γ┐^(j)]= custom character

[

]+(┌l/γ┐−1)min(1,(1−p_j)R_j). (14)
Substituting the above equation into equation (13), the per-round throughput for a TCP sub-flow j is obtained as follows:

[0088]

\begin{matrix} \begin{matrix} 𝒯_{i}^{(j)} = \frac{1}{γ} {γ𝒯}_{[l γ]}^{(j)} \\ = \frac{1}{γ \cdot {RTT}_{j}} (𝔼 [W_{1}^{(j)}] + (⌈ \frac{l}{γ} ⌉ - 1) \min (1, (1 - p_{j}) R_{j})) (16) \\ \min (1, (1 - p_{j}) R_{j}) . \end{matrix} & (15) \end{matrix}

This equation can be reduced if a large enough redundancy factor R_jis considered. As will be demonstrated later, the value chosen for R_jcan be critical in achieving the maximum throughput. If it is assumed that the network capacity between the source and the destination is larger than the maximum window size custom character

×R_jfor values of

[0089]

R_{j} > \frac{1}{1 - p_{j}},

then equation (16) becomes,

[0090]

\begin{matrix} 𝒯_{i}^{(j)} = \frac{1}{γ \cdot {RTT}_{j}} (𝔼 [W_{1}^{(j)}] + (⌈ \frac{l}{γ} ⌉ - 1)) . & (17) \end{matrix}

Finally, the fact that the window size of a TCP connection is limited by a maximum value custom character

needs to be addressed. This changes the expected window size during round l to be the minimum of equation (14) and custom character

. Furthermore, the per-round throughput becomes:

[0091]

\begin{matrix} 𝒯_{i}^{(j)} = \frac{1}{γ \cdot {RTT}_{j}} (\min (W_{\max}^{(j)}, 𝔼 [W_{1}^{(j)}] + (⌈ \frac{l}{γ} ⌉ - 1))) . & (18) \end{matrix}

[0092] The model used in the above analysis of MPTCP/NC sub-flow performance makes several assumptions that, in practice, should be considered. First, it is assumed that packet losses are independent and identically distributed (i.i.d.) with loss probability p_i. When the network is not congested and none of the links experience outages, this assumption is valid; but it fails when packet losses are correlated. A possible extension to the analysis presented here is to take correlated packet losses into account by modeling them using Gilbert-Elliot mode. Second, it is assumed that the number of redundant packets R_jsent for every packet contained in the TCP congestion window was sufficiently large to ignore the possibility of a time-out, which would close the TCP window to custom character

[

]. When R_j=1/(1−p_i), this assumption is not necessarily valid. As will be shown in subsequent sections, time-outs occur frequently with i.i.d. packet losses when R_j=1/(1−p_i). Specifically, a time-out occurs when the sum of received acknowledgements over two rounds, i and i+1, is less than the window size during round i with probability custom character

r(α_i+α_i+1<W_i). One possible direction is to model time-outs as a random walk with a threshold crossing (although time-outs are not included in the present analysis).

[0093] Third, it is assumed that RTT_jremains constant. In practice, this is not true. Implementations of TCP generally use an averaged round-trip time often referred to as the “smoothed” round-trip time SRTT. Because network coding masks i.i.d. packet losses by extending the duration of RTT and network congestion or transmission delay is not taken into account, the RTT used in our analysis is effectively equal to SRTT.

[0094] It is desirable to determine average end-to-end throughput for MPTCP/NC. As shown above, the throughput for TCP/NC is dependent on the TCP congestion window size. Likewise, the average MPTCP/NC throughput is dependent on the joint window size of all sub-flows (i.e., W_i=Σ_j custom character

). While the approach shown here can be used for any number of TCP/NC sub-flows, results will only be provided for two sub-flows designated as sub-flow 1 and sub-flow 2 with packet loss probabilities and round-trip times of p₁, RTT₁and p₂, RTT₂, respectively.

[0095] Using the least common multiple of RTT₁and RTT₂as the duration of each round and the values of α and β defined in (2), the expected congestion window size for MPTCP/NC is

[0096]

\begin{matrix} \begin{matrix} 𝔼 [W_{i}] = 𝔼 [W_{⌈ \frac{i}{α} ⌉}^{(1)} + W_{⌈ \frac{i}{β} ⌉}^{(2)}] \\ = 𝔼 [W_{⌈ \frac{i}{α} ⌉}^{(1)}] + 𝔼 [W_{⌈ \frac{i}{β} ⌉}^{(2)}] (20) \\ = 𝔼 [W_{1}^{(1)}] + (⌈ \frac{i}{α} ⌉ - 1) \min (1, (1 - p_{1}) R_{1}) + (21) \\ 𝔼 [W_{1}^{(2)}] + (⌈ \frac{i}{β} ⌉ - 1) \min (1, (1 - p_{2}) R_{2}) . \end{matrix} & (19) \end{matrix}

One thing that was not taken into account is the maximum window size of each TCP/NC, sub-flow. Incorporating the maximum window size of sub-flow 1, W_max⁽¹⁾, and sub-flow 2, W_max⁽²⁾, the expected MPTCP/NC window size becomes:

[0097]

\begin{matrix} 𝔼 [W_{i}] = \max (W_{\max}^{(1)}, 𝔼 [W_{1}^{(1)}] + (⌈ \frac{i}{α} ⌉ - 1) \min (1, (1 - p_{1}) R_{1})) + \max (𝔼 [W_{1}^{(2)}] + (⌈ \frac{i}{β} ⌉ - 1) \min (1, (1 - p_{2}) R_{2})) . & (22) \end{matrix}

The equation above shows that the expected MPTCP/NC window size is monotonically increasing. As a result, it would be desirable to determine how fast it increases. This may be investigated by finding the number of rounds custom character

_Wit takes to get to a window size of W. The intuition behind finding the expected number of rounds it will take to reach a window size of W is that each sub-flow is geometrically distributed. Letting 0≦x≦W:

[0098]

\begin{matrix} \begin{matrix} 𝔼 (ℛ_{W}] = 𝔼 [ℛ_{W}^{(1)}] + 𝔼 [ℛ_{W}^{(2)}] \\ = \frac{α}{1 - p_{1}} \sum_{i = 1}^{W_{x}^{(1)} - 1} i + \frac{β}{1 - p_{2}} \sum_{i = 1}^{W_{W - x}^{(2)} - 1} i (24) \\ = \frac{α (W_{x}^{(1)} (W_{x}^{(x)} - 1))}{2 (1 - p_{1})} + \frac{β (W_{W - x}^{(2)} (W_{W - x}^{(2)} - 1))}{2 (1 - p_{2})} (25) \end{matrix} & (23) \end{matrix}

[0099] Now that the expected MPTCP/NC congestion window size has been determined, the average end-to-end throughput for MPTCP/NC may be found, which is a function of the above window size:

[0100]

\begin{matrix} \begin{matrix} 𝒯 = \frac{1}{n} \sum_{i = 1}^{n} 𝒯_{i} \\ = \frac{1}{n} \sum_{i = 1}^{n} (𝒯_{i}^{(1)} + 𝒯_{i}^{(2)}) (27) \\ = \frac{1}{n \cdot α \cdot {RTT}_{1}} \sum_{i = 1}^{n} 𝔼 [W_{⌈ \frac{i}{α} ⌉}^{(1)}] + \frac{1}{n \cdot β \cdot {RTT}_{2}} \sum_{i = 1}^{n} 𝔼 [W_{⌈ \frac{i}{β} ⌉}^{(2)}] (28) \end{matrix} & (26) \end{matrix}

Assuming that nα, nβ ∈ custom character

[0101]

\begin{matrix} \begin{matrix} 𝒯 = \frac{1}{n \cdot {RTT}_{1}} \sum_{i = 1}^{n α} 𝔼 [W_{i}^{(1)}] + \frac{1}{n \cdot {RTT}_{2}} \sum_{i = 1}^{n β} 𝔼 [W_{i}^{(2)}] \\ = \frac{1}{n \cdot {RTT}_{1}} (\frac{n}{α} 𝔼 [W_{1}^{(1)}] + \frac{n α (n α - 1)}{2} \min (1, (1 - p_{1}) R_{1})) + (30) \\ \frac{1}{n \cdot {RTT}_{2}} (\frac{n}{β} 𝔼 [W_{1}^{(2)}] + \frac{n β (n β - 1)}{2} \min (1, (1 - p_{2}) R_{2})) \\ = \frac{1}{n \cdot α \cdot {RTT}_{1}} (n 𝔼 [W_{1}^{(1)}] + \frac{n (n - α)}{2 α} \min (1, (1 - p_{1}) R_{1})) + (31) \\ \frac{1}{n \cdot β \cdot {RTT}_{2}} (n 𝔼 [W_{1}^{(2)}] + \frac{n (n - β)}{2 β} \min (1, (1 - p_{2}) R_{2})) . \end{matrix} & (29) \end{matrix}

If nα, nβ ∉ custom character

, the above equation will contain additional terms that contain packets sent in the rounds from └nγ┘ to nγ for γ={α,β}. While these additional packets increase the throughput, their contribution is negligible for large enough n. Finally, the maximum window size of each sub-flow custom character

is considered, First, let:
r⁽¹⁾=α(W_max⁽¹⁾ custom character

[W₁⁽¹⁾]) and r⁽²⁾=β(W_max⁽²⁾− custom character

[W₁⁽²⁾]). (32)
Using equation (31) and assuming that R₁>1/(1−p₁) and R₂>1/(1−p₂), four cases for the average end-to-end throughput are generated:

[0102]

\begin{matrix} 𝒯 = {\begin{matrix} \begin{matrix} \frac{1}{n \cdot α \cdot {RTT}_{1}} (n 𝔼 [W_{1}^{(1)}] + \frac{n (n - α)}{2 α}) + \\ \frac{1}{n \cdot β \cdot {RTT}_{2}} (n 𝔼 [W_{1}^{(2)}] + \frac{n (n - β)}{2 β}) \end{matrix} & for n \leq r^{(1)}, r^{(2)}, \\ \begin{matrix} \frac{1}{n \cdot α \cdot {RTT}_{1}} (n 𝔼 [W_{1}^{(1)}] + \frac{n (n - α)}{2 α}) + \\ \frac{1}{n \cdot β \cdot {RTT}_{2}} (\begin{matrix} r^{(2)} 𝔼 [W_{1}^{(2)}] + \frac{r^{(2)} (r^{(2)} - β)}{2 β} + \\ W_{\max}^{(2)} (n - r^{(2)}) \end{matrix}) \end{matrix} & for r^{(2)} < n \leq r^{(1)}, \\ \begin{matrix} \frac{1}{n \cdot α \cdot {RTT}_{1}} (\begin{matrix} r^{(1)} 𝔼 [W_{1}^{(1)}] + \frac{r^{(1)} (r^{(1)} - β)}{2 β} + \\ W_{\max}^{(1)} (n - r^{(1)}) \end{matrix}) + \\ \frac{1}{n \cdot β \cdot {RTT}_{2}} (n 𝔼 [W_{1}^{(2)}] + \frac{n (n - β)}{2 β}) \end{matrix} & for r^{(1)} < n \leq r^{(2)}, \\ \begin{matrix} \frac{1}{n \cdot α \cdot {RTT}_{1}} (\begin{matrix} r^{(1)} 𝔼 [W_{1}^{(1)}] + \frac{r^{(1)} (r^{(1)} - β)}{2 β} + \\ W_{\max}^{(1)} (n - r^{(1)}) \end{matrix}) + \\ \frac{1}{n \cdot β \cdot {RTT}_{2}} (\begin{matrix} r^{(2)} 𝔼 [W_{1}^{(2)}] + \frac{r^{(2)} (r^{(2)} - β)}{2 β} + \\ W_{\max}^{(2)} (n - r^{(2)}) \end{matrix}) \end{matrix} & for r^{(1)}, r^{(2)} < n . \end{matrix} & (33) \end{matrix}

[0103] An analysis has thus been provided to determine the sub-flow performance and overall MPTCP/NC performance using the expected window size W and the end-to-end average throughput custom character

as metrics. As noted above, results were provided for two sub-flows; but network coding makes it possible to use the same technique for any umber of sub-flows. In the analysis, assumptions were made regarding the congestion control algorithm, time-outs and the amount of redundancy introduced into the network to account for packet losses. In the discussion that follows, numerical results are provided which show that the amount of redundancy is critical in eliminating time-outs.

[0104] The performance of the proposed MPTCP/NC scheme was analyzed through numerical simulations. As part of the analysis, the same two-link model used in the mathematical analysis was considered, where the packet losses on a given link are i.i.d. with probability p_i, i=1,2 and fixed throughout the use of the channel. In addition, the losses are independent between links, packets are not received out of order, the round trip time on each link is fixed and acknowledgments are not lost. This proposed model is suitable for a wireless scenario where congestion is not a major factor for packet losses.

[0105] In the simulations, TCP is restricted to operate in two modes: slow start and congestion avoidance. The slow start threshold (SST) for each TCP window is 64 packets, and the window can have a maximum size of W_max=128 packets. A timeout is declared by TCP when a packet is not acknowledged (remains in the window) for two round trip times. When a timeout occurs, the window is reset to one. Furthermore, the window size is reduced to half when a triple duplicate ACK is received. Note that this never occurs in MPTCP/NC, since every received package is acknowledged. In addition, it is assumed that the transmitter sends a file of a given (fixed) size, to which it has access before transmission starts.

[0106] Three MPTCP schemes were considered:

- [0107] (1) Uncoded MPTCP: this is traditional MPTCP operation where packets are dynamically allocated to a given TCP subflow when requested.
- [0108] (2) MPTCP/NC with low redundancy: MPTCP/NC operation is modeled with redundancy on each link equal to R_i=(1−p_i)⁻¹, i=1,2, as discussed in the mathematical analysis above. It is assumed that the entire transmitted file is coded.
- [0109] (3) MPTCP/NC with high redundancy: MPTCP/NC is modeled with redundancy 5% above the average loss, i.e., R_i=1.05(1−p_i)⁻¹, i=1,2.

[0110] Three parameters were measured for each of these schemes considering different the sizes, packet loss probabilities and round trip times: (i) completion time, (ii) average rate, and (iii) total window size (i.e., sum of the windows of the two TCP subflows). The round trip time and packet loss probability parameters are shown in FIG. 9, together with a correspondence between the parameters and different wireless standards.

[0111] The simulated model has several limitations. For example, it assumed that each link always supports up to 128 packets being transmitted simultaneously, regardless of the round trip time and link capacity. As mentioned previously, this model also does not consider losses due to congestion or lost acknowledgments. Furthermore, the assumption that the MPTCP/NC layer has access to the whole file being transmitted is unrealistic for several different applications, such as video streaming. Nevertheless, as will be shown in the following analysis, this model does capture some of the fundamental characteristics of MPTCP/NC's operation, clearly illustrating the benefits of coding over two TCP flows in regards using uncoded MPTCP.

[0112] In the discussion that follows, numerical results are provided for four different simulated scenarios, each with different values of RTT and link loss probability. The average results presented were taken over a set of 1000 different simulation instances done in MATLAB.

[0113] In the first scenario, the upper left hand side corner of the table in FIG. 3 is considered, modeling one link as very reliable and with low delay, with parameters RTT₁=15 ms, p₁=10⁻³, and the other link as slightly worse, but still reliable with average delay, with parameters RTT₂=80 ms and p₂=10⁻². The goal is to illustrate the performance and window size in a scenario with small loss rate and low round trip times. Out of all the scenarios considered, this is the one that achieves the highest transmission rates.

[0114] The average completion time and average rate for different the sizes are illustrated in FIGS. 10a and 10b. For this scenario, the average rate of uncoded MPTCP is considerably lower that the coded cases. In addition, the extra 5% redundancy introduced by MPTCP/NC also significantly increases the rate. Notice also that the average rate with MPTCP/NC with 5% extra redundancy increases with file size. This is due to the fact that each TCP subflow rarely times out in this low loss scenario, with the window staying at its maximum size during virtually all of the transmission time after it achieves its maximum value. The effect of time out events is more noticeable in the uncoded case and in MPTCP/NC with just average redundancy, with the average rate achieving its maximum size at files of size 10⁵packets. On the other hand, for the case with coding and extra redundancy, the rate steadily increases with file size.

[0115] The behavior of each of the three schemes can be better understood by FIG. 10c. Here “snapshots” of the joint window size are presented for specific instances of the initial operation of each scheme together with the averages calculated over different simulations of the channel, considering a file size of 10⁵packets. Observe that the extra 5% redundancy has two key contributions to MPTCP/NC: (i) the window size achieves its maximum value before the case where we use MPTCP/NC with average redundancy and (ii) each TCP subflow suffers less time outs. The first contribution follows naturally from the fact that extra redundancy increases the number of acknowledgments received from the Fast-TCP/NC layer. The second point stems from the fact that, for the proposed MPTCP/NC scheme, time out events have an extremely low probability of occurring. When an additional 5% redundancy is added, these events become even rarer, with a time out not being observed in this particular instance.

[0116] Even for this low loss scenario, uncoded MPTCP/NC performs poorly, with the joint window size never achieving the maximum value. Notice how for this particular instance uncoded TCP quickly “averages out”, already varying over its average joint window size after only the first second of transmission time.

[0117] The second considered scenario is more realistic, with one link representing, for example, a WiMax connection, with RTT₂=80 ms and p₂=10⁻¹, and the second link having a high round trip time and low packet loss probability, given by RTT₂=80 ms and p₂=10⁻¹. The second link could represent, for example, a satellite connection. Similarly to case 1, FIGS. 11a and 11b present the average completion time and average rate for different file sizes, and FIG. 11c depicts specific instances of the joint window size for each of the considered transmission schemes.

[0118] The advantage of MPTCP/NC over uncoded MPTCP becomes clear in this scenario, with an average rate increase of over 10× for the investigated file sizes. In the uncoded MPTCP scheme, the link with low RTT is underutilized due to the high number of losses. This can be seen by the small variations of the line corresponding to encoded MPTCP in FIG. 11c. As a consequence, the window size is mostly determined by the slow link which, due to the high round trip time, increases slowly.

[0119] On the other hand, MPTCP/NC is able to compensate for the packet loss rate in the link with low RTT through coding. When adding redundancy according to the average packet loss probability, time outs still occur periodically in the faster, less reliable link, as can be observed in the lowest curve in FIG. 11c. However, the corresponding Fast-TCP/NC subflow is still able to quickly recover from the time out events.

[0120] When an additional 5% redundancy is added, time out events become very rare in the low RTT link. Consequently, this link is fully utilized, with the corresponding TCP subflow achieving its maximal window during the beginning of the transmission. Time out events still occur, as shown in FIG. 11c, but the spacing between time outs increases significantly, and Fast-TCP/NC manages to quickly recover from these events. As a result, the increase of the joint window size is determined by the link with high RTT, and slowly grows towards its maximum value.

[0121] In the previous case, it was shown how uncoded MPTCP/NC tends to rely on the link with the lowest packet loss probability, regardless of the round trip time. In order to make this phenomena even more apparent, a third case will now be considered where one link is very reliable but with a very long round trip time, with RTT₁=1500 ms and p₁=10⁻³, and the second link has a low round trop time (100 times smaller) but is very unreliable, with RTT₂=15 ms and p₂=0.3. This corresponds to two opposite extreme points of FIG. 9. The corresponding results are illustrated in FIGS. 12a, 12b, and 12c.

[0122] The average rate obtained by MPTCP/NC with 5% extra redundancy is deafly two orders of magnitude larger than uncoded MPTCP. The dependence of MPTCP on the slower link becomes obvious in FIG. 12c, with the fast unreliable link corresponding, to variations in the joint window size of only a few packets, and the coarse changes due to the link with high RTT. Observe also that, for a file of size 10⁵packets, after over 25 seconds of transmission the joint window size of uncoded MPTCP is still approximating its final average values, whereas the MPTCP/NC has already concluded transmission.

[0123] Once again it is noted that MPTCP/NC manages to reduce the number of time outs with coding. In addition, when a time out occurs, it is able to quickly recover due to the Fast-TCP/NC mechanism. As noted previously, the extra 5% redundancy also contributes significantly towards less timeouts, resulting in a significantly larger throughput in this noise scenario.

[0124] In the final scenario, both links are assumed to have the same error probability and different but comparable round trip times, with RTT₁=80 ms, p₁=10⁻¹, RTT₂=250 ms and p₂=10⁻¹. This scenario could represent, for example, a 3G and a WiFi link in parallel. The results for this case are depicted in FIGS. 13a, 13b, and 13c.

[0125] Due to the high packet loss probability in both links, the MPTCP scheme quickly “averages out”, and does not manage to increase significantly the joint window size of the TCP sub-flows. Furthermore, for large file sizes, adding 5% redundancy to MPTCP/NC above the average throughput of the channel almost doubles the achievable average rate. As discussed previously, this is due to the fact that the extra redundancy makes time out events very rare, and a joint time out for the two links will almost never occur for most file sizes. On the other hand, when R=(1−p)⁻¹, time outs happen more frequently and can occur jointly for both links, reducing the window size to only a few packets. Nevertheless, even in this case, the Fast-TCP/NC layer manages to quickly increase the joint window size.

[0126] Based on the above analyses, it is apparent that MPTCP/NC can provide an average transmission rate that is an order of magnitude or more better than MPTCP in different cases of interest. Some conclusions that may be drawn include: (a) a little redundancy in MPTCP/NC can be very helpful, reducing time outs (by≈2× average rate in some noisy scenarios); (b) MPTCP performs poorly when compared to the coded case, even with low or probabilities; (c) MPTCP's performance is determined by the link with lower packet loss, nearly independent of RTT (d) using coding masks packet losses as higher RTTs, as expected; and (e) MPTCP/NC is effective in leveraging links with significantly different RTTs.

[0127] FIG. 14 is a block diagram illustrating an exemplary node device architecture 200 that may be used in a node device that incorporates features described in the present disclosure in one or more implementations. As illustrated, the node device architecture 200 may include: one or more digital processors 204, memory 206, a first wireless transceiver 206, a second wireless transceiver 210, a wired network interface 212, a user interface 214, and a network encoder/decoder 216. A bus 220 and/or other structure(s) may be provided for establishing interconnections between various components of device architecture 200. Digital processor(s) 204 may include one or more digital processing devices that are capable of executing programs or procedures to provide functions and/or services for a user. Memory 206 may include one or more digital data storage systems, devices, and/or components that may be used to store data and/or programs for other elements of node device architecture 200. User interface 214 may include any type of device, component, or subsystem for providing an interface between a user and a corresponding node device. First and second wireless transceivers 208, 210 may include any type of transceivers that are capable of supporting wireless communication with one or more remote wireless entities. Wired network interface 212 may include any type of transceiver that is capable of supporting wired communication with one or more external communication entities.

[0128] Digital processor(s) 204 may include, for example, one or more general purpose microprocessors, digital signals processors (DSPs), controllers, microcontrollers, application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), programmable to is arrays (PLAs), programmable logic devices (PLDs), reduced instruction set computers (RISCs), and/or other processing devices or systems, including combinations of the above. Digital processor(s) 204 may be used to, for example, execute an operating system for a corresponding node device. Digital processor(s) 204 may also be used to, for example, execute one or more application programs for a node device. In addition, digital processor(s) 204 may be used to implement, either partially or fully, one or more of the communications related processes or techniques described herein in some implementations.

[0129] As described above, first and second wireless transceivers 208, 210 may include any type of transceivers that are capable of supporting wireless communication with one or more remote wireless entities. In various implementations, these transceivers 208, 210 may be configured in accordance with one or more wireless standards (e.g., wireless networking standards, wireless cellular standards, etc.) for use in communicating with corresponding wireless networks, systems, or devices. In this fashion, these transceivers may be used to support heterogeneous communication as described above. Although illustrated with two wireless transceivers in FIG. 14, it should be appreciated that any number of transceivers may be used in various embodiments. In some implementations, one or both of wireless transceivers 208, 210 may be capable of communicating with peer devices in a peer-to-peer, ad-hoc or wireless mesh network arrangement. In addition, in some implementations, one or both of wireless transceivers 208, 210 may be capable of communicating with a base station or access point of an infrastructure-type wireless communication system or network. As illustrated in FIG. 14, wireless transceivers 208, 210 may each be coupled to one or more antennas 222, 224 and/or other transducers, to facilitate the transmission and/or reception of communication signals. In some implementations, wireless transceivers 208, 210 may be used to implement or facilitate, either partially or fully, one or more of the communications related processes or techniques described herein.

[0130] Wired network interface 212 may be configured in accordance with one or more wired communication standards. Although illustrated with a sin e wired network interface 212, it should be appreciated that any number of wired interfaces may be used in other implementations. In some embodiments, wired network interface 212 may be used to support heterogeneous networking in conjunction with one or more other transceivers (wired or wireless).

[0131] Memory 206 may include any type of system, device, or component, or combination thereof, that is capable of storing digital information (e.g., digital data, computer executable instructions and/or programs, etc.) for access by a processing device or other component. This may include, for example, semiconductor memories, magnetic data storage devices, disc based storage devices, optical storage devices, read only memories (ROMs), random access memories (RAMs), non-volatile memories, flash memories, USB drives, compact disc read only memories (CD-ROMs), DVDs, Blu-Ray disks, magneto-optical disks, erasable programmable ROMs (EPROMs), electrically erasable programmable ROMs (EEPROMs), magnetic or optical cards, and/or other digital storage suitable for storing electronic instructions and/or data. In some embodiments, computer executable instructions may be stored in memory 206 that, if executed within a digital processor, can result in the performance of one or more of the methods described herein, or portions thereof.

[0132] Network encoder/decoder 216 may include a device or system for performing network encoding and/or decoding for a node device. In a source node device that will generate and transmit network ceded packets, network encoder/decoder 216 may include network encoding functionality. Likewise, in a destination node device that will receive and decode network encoded packets, network encoder/decoder 216 may include decoding functionality. In a node that may serve as both a source node and a destination node, both network encoding and decoding functionality may be provided. It should be appreciated that, although illustrated as a separate unit, network encoder/decoder 216 may be implemented, at least partially, within another component or device of a node in some implementations (e.g., within processor(s) 204 of FIG. 14, etc.).

[0133] It should be appreciated that the node device architecture 200 of FIG. 14 represents one possible example of an architecture that may be used in an implementation. Other architectures may alternatively be used. As used herein, the terms “node device,” “node,” or “communication device” are used to describe any type of digital electronic device or system that includes some form of communication capability (wireless and/or wired) that can act as a source or destination of data flow. This may include, for example, a laptop, desktop, notebook, or tablet computer; a personal digital assistant (PDA); a personal communication service (PCS) device; a personal navigation assistant (PNA); a cellular telephone, smart phone, or other wireless communication device; a pager; a wireless sensor device; a satellite communication device; a media player having communication capability; a digital storage device with communication capability; an integrated circuit or multi-chip module, and/or other devices. It should be appreciated that all or part of the various devices, processes, or methods described herein may be implemented using any combination of hardware, firmware, and/or software. In some embodiments, methods described herein, or portions or variations thereof, may be implemented as computer executable instructions stored on one or more computer readable media. Any form of non-transitory computer readable media may be used in various embodiments.

[0134] Having described exemplary embodiments of the invention, it will now become apparent to one of ordinary skill in the art that other embodiments incorporating their concepts may also be used. The embodiments contained herein should not be limited to disclosed embodiments but rather should be limited only by the spirit and scope of the appended claims. All publications and references cited herein are expressly incorporated herein by reference in their entirety.

Claims

Certificate of Correction present

The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.

What is claimed is:

1. A machine implemented method for use at a source node for transferring data to a destination node, the method comprising:

receiving, from an application layer within the source node, a plurality of original data packets to be transferred to the destination node;

generating, at the source node, first coded packets by combining original data packets using a linear network code;

distributing the first coded packets among multiple available paths leading from the source node to the destination node;

generating, at the source node, second coded packets associated with a first path of the multiple available paths by combining two or more of the first coded packets distributed to the first path using the linear network code;

generating, at the source node, second coded packets associated with a second path of the multiple available paths by combining two or more of the first coded packets distributed to the second path using the linear network code;

transmitting the second coded packets associated with the first path to the destination node via the first path; and

transmitting the second coded packets associated with the second path to the destination node via the second path.

2. The method of claim 1, wherein:

generating first coded packets includes generating first coded packets by linearly combining original data packets that are within a sliding coding window.

3. The method of claim 2, further comprising:

receiving acknowledgement messages from the destination node that each indicate that a new degree of freedom has been received by the destination node in connection with the data transfer; and

adjusting the width of the sliding coding window based, at least in part, on received acknowledgement messages.

4. The method of claim 1, wherein:

generating second coded packets includes generating second coded packets by linearly combining first coded packets that are within a sliding coding window.

5. The method of claim 4, wherein:

generating second coded packets includes generating redundant second coded packets for each set of first coded packets within the sliding coding window.

6. The method of claim 1, wherein:

each of the multiple available paths includes a transmission control protocol (TCP) layer that adds sequence numbers to first coded packets distributed to the path, wherein generating second coded packets by linearly combining first coded packets masks the sequence numbers added to the first coded packets associated with a path.

7. The method of claim 1, wherein:

each of the multiple available paths includes a transmission control protocol (TCP) layer; and

distributing the first coded packets includes distributing the first coded packets among the multiple available paths based, at least in part, on TCP congestion control window dynamics.

8. The method of claim 1, wherein:

the multiple available paths are associated with different network technologies.

9. The method of claim 1, wherein:

obtaining a plurality of original data packets includes receiving the original data packets from an application layer.

10. A communication device comprising:

a first network interface unit configured for communication in a first network;

a second network interface unit configured for communication in a second network that is different from the first network; and

at least one processor to manage data transfer between the communication device and a destination node using multiple different paths, the at least one processor to:

receive, from an application layer, a plurality of original packets representative of data to be transferred to the destination node;

generate first coded packets by combining original data packets using a linear network code;

distribute the first coded packets to the multiple different paths to the destination node;

generate second coded packets associated with a first path of the multiple different paths by combining two or more of the first coded packets distributed to the first path using the linear network code;

generate second coded packets associated with a second path of the multiple available paths by combining two or more of the first coded packets distributed to the second path using the linear network code;

transmit the second coded packets associated with the first path to the destination node via the first network using the first network interface unit; and

transmit the second coded packets associated with the second path to the destination node via the second network using the second network interface unit.

11. The communication device of claim 10, wherein the at least one processor is configured to generate first coded packets by linearly combining original data packets within a sliding coding window.

12. The communication device of claim 10, wherein the at least one processor is configured to generate second coded packets for a first path by linearly combining first coded packets within a sliding coding window.

13. The communication device of claim 12, wherein the at least one processor is configured to generate redundant second coded packets for the first path for each set of first coded packets within the sliding coding window.

14. The communication device of claim 10, wherein the at least one processor is configured to distribute the first coded packets to the multiple different paths based, at least in part, on TCP congestion control window dynamics.

15. The communication device of claim 10, further comprising:

at least one additional network interface unit configured for communication within at least one additional network.

Patent Citations (95)

Patent	Date	Inventor	Cited By
US5577056(A)	1996-11-01	Malik et al.	Applicant
US6128773(A)	2000-10-01	Snider	Applicant
US6621851(B1)	2003-09-01	Agee et al.	Applicant
US6885653(B2)	2005-04-01	Choi et al.	Applicant
US7064489(B2)	2006-06-01	Price	Applicant
US7071853(B2)	2006-07-01	Price	Applicant
US7095343(B2)	2006-08-01	Xie et al.	Applicant
US7164691(B2)	2007-01-01	Knapp et al.	Applicant
US7283564(B2)	2007-10-01	Knapp et al.	Applicant
US7349440(B1)	2008-03-01	Chou et al.	Applicant
US7408938(B1)	2008-08-01	Chou et al.	Applicant
US7414978(B2)	2008-08-01	Lun et al.	Applicant
US7529198(B2)	2009-05-01	Jain et al.	Applicant
US7706365(B2)	2010-04-01	Effros et al.	Applicant
US7760728(B2)	2010-07-01	Chou et al.	Applicant
US7821980(B2)	2010-10-01	Chakrabarti et al.	Applicant
US7876677(B2)	2011-01-01	Cheshire	Applicant
US7912003(B2)	2011-03-01	Radunovic et al.	Applicant
US7945842(B2)	2011-05-01	He	Applicant
US8040836(B2)	2011-10-01	Wu et al.	Applicant
US8068426(B2)	2011-11-01	Sundararajan et al.	Applicant
US8130776(B1)	2012-03-01	Sundararajan et al.	Applicant
US8279781(B2)	2012-10-01	Lucani et al.	Applicant
US8451756(B2)	2013-05-01	Lucani et al.	Applicant
US8482441(B2)	2013-07-01	Medard et al.	Applicant
US8504504(B2)	2013-08-01	Liu	Applicant
US8571214(B2)	2013-10-01	Lima et al.	Applicant
US2003/0055614(A1)	2003-03-01	Pelikan	Applicant
US2003/0214951(A1)	2003-11-01	Joshi et al.	Applicant
US2004/0203752(A1)	2004-10-01	Wojaczynski et al.	Applicant
US2005/0010675(A1)	2005-01-01	Jaggi et al.	Applicant
US2005/0078653(A1)	2005-04-01	Agashe et al.	Applicant
US2005/0152391(A1)	2005-07-01	Effros et al.	Applicant
US2005/0251721(A1)	2005-11-01	Ramesh et al.	Applicant
US2006/0020560(A1)	2006-01-01	Rodriguez et al.	Applicant
US2006/0146791(A1)	2006-07-01	Deb et al.	Applicant
US2006/0224760(A1)	2006-10-01	Yu et al.	Applicant
US2007/0046686(A1)	2007-03-01	Keller	Applicant
US2007/0116027(A1)	2007-05-01	Ciavaglia et al.	Applicant
US2007/0274324(A1)	2007-11-01	Wu et al.	Applicant
US2008/0043676(A1)	2008-02-01	Mousseau et al.	Applicant
US2008/0049746(A1)	2008-02-01	Morrill et al.	Applicant
US2008/0123579(A1)	2008-05-01	Kozat et al.	Applicant
US2008/0259796(A1)	2008-10-01	Abousleman et al.	Applicant
US2008/0291834(A1)	2008-11-01	Chou et al.	Applicant
US2008/0320363(A1)	2008-12-01	He	Applicant
US2009/0003216(A1)	2009-01-01	Radunovic et al.	Applicant
US2009/0135717(A1)	2009-05-01	Kamal et al.	Applicant
US2009/0153576(A1)	2009-06-01	Keller	Applicant
US2009/0175320(A1)	2009-07-01	Haustein et al.	Applicant
US2009/0198829(A1)	2009-08-01	Sengupta et al.	Applicant
US2009/0207930(A1)	2009-08-01	Sirkeci et al.	Applicant
US2009/0238097(A1)	2009-09-01	Le Bars et al.	Applicant
US2009/0248898(A1)	2009-10-01	Gkantsidis et al.	Applicant
US2009/0285148(A1)	2009-11-01	Luo et al.	Applicant
US2009/0310582(A1)	2009-12-01	Beser	Applicant
US2009/0313459(A1)	2009-12-01	Horvath	Applicant
US2009/0316763(A1)	2009-12-01	Erkip et al.	Applicant
US2010/0014669(A1)	2010-01-01	Jiang	Applicant
US2010/0046371(A1)	2010-02-01	Sundararajan et al.	Examiner
US2010/0054164(A1)	2010-03-01	Lucani et al.	Examiner
US2010/0111165(A1)	2010-05-01	Kim et al.	Applicant
US2010/0146357(A1)	2010-06-01	Larsson	Applicant
US2011/0238855(A1)	2011-09-01	Korsunsky et al.	Applicant
US2011/0243324(A1)	2011-10-01	Lima et al.	Examiner
US2012/0057636(A1)	2012-03-01	Tian et al.	Applicant
US2012/0218891(A1)	2012-08-01	Sundararajan et al.	Examiner
US2012/0300692(A1)	2012-11-01	Sfar et al.	Applicant
US2013/0077501(A1)	2013-03-01	Krishnaswamy et al.	Examiner
US2013/0107764(A1)	2013-05-01	Zeger et al.	Applicant
US2013/0114481(A1)	2013-05-01	Kim et al.	Applicant
US2013/0114611(A1)	2013-05-01	Zeger et al.	Applicant
US2013/0195106(A1)	2013-08-01	Calmon et al.	Applicant
US2014/0064296(A1)	2014-03-01	Haeupler et al.	Applicant
US2014/0185803(A1)	2014-07-01	Lima et al.	Applicant
US2014/0268398(A1)	2014-09-01	Medard et al.	Applicant
US2014/0269485(A1)	2014-09-01	Medard et al.	Applicant
US2014/0269503(A1)	2014-09-01	Medard et al.	Applicant
US2014/0269505(A1)	2014-09-01	Medard et al.	Applicant
US2014/0280395(A1)	2014-09-01	Medard et al.	Applicant
US2014/0280454(A1)	2014-09-01	Medard et al.	Applicant
EP1638239(A1)	2006-03-01		Applicant
WO2007/109216(A1)	2007-09-01		Applicant
WO2010/005181(A2)	2010-01-01		Applicant
WO2010/005181(A3)	2010-01-01		Applicant
WO2010/025362(A2)	2010-03-01		Applicant
WO2010/025362(A3)	2010-03-01		Applicant
WO2011/043754(A1)	2011-04-01		Applicant
WO2011/119909(A1)	2011-09-01		Applicant
WO2012/167034(A2)	2012-12-01		Applicant
WO2013/006697(A2)	2013-01-01		Applicant
WO2013/067488(A1)	2013-05-01		Applicant
WO2013/116456(A1)	2013-08-01		Applicant
WO2014/159570(A1)	2014-10-01		Applicant
WO2014/160194(A3)	2014-10-01		Applicant

Non-Patent Literature (281)

J K Sundararajan et al., Network Coding Meets TCP: Theory and Implementation, Mar. 2011, IEEE, vol. 99, No. 3, all pages (i.e. p. 490 to p. 512).Examiner
U.S. Appl. No. 13/654,953, filed Oct. 18, 2012, Zeger, et al.Applicant
U.S. Appl. No. 13/655,034, filed Oct. 18, 2012, Medard, et al.Applicant
U.S. Appl. No. 13/890,604, filed May 9, 2013, Zeger, et al.Applicant
U.S. Appl. No. 14/208,683, filed Mar. 13, 2014, Calmon, et al.Applicant
“Data Service Options for Spread Spectrum Systems: Radio Link Protocol Type 3;” 3GPP2 C.S0017-010-A; Version 2.0; Sep. 2005.Applicant
“Guest Editorial Wireless Video Transmission;” IEEE Journal on Selected Areas in Communications; vol. 28; No. 3; Apr. 2010; pp. 297-298.Applicant
Abichar, et al.; “WiMax vs. LTE: Who Will Lead the Broadband Mobile Internet?;” Mobile Computing; IEEE Computer Society; IT Pro May/Jun. 2010; pp. 26-32.Applicant
AbuZeid, et al.; “IR-HARQ vs. Joint Channel-Network Coding for Cooperative Wireless Communication;” Cyber Journals: Multidisciplinary Journals in Science and Technology, Journal of Selected Areas in Telecommunications (JSAT); Aug. 2011; pp. 39-43.Applicant
Acedanski, et al.; “How Good is Random Linear Coding Based on Distributed Network Storage?;” Proc. 1st Workshop on Network Coding, Theory, and Applications (Netcod'05); Apr. 2005; 6 pages.Applicant
Adamson, et al.; “Multicast Negative-Acknowledgment (NACK) Building Blocks;” Internet Engineering Task Force (IETF),RFC; vol. 5401; Nov. 2008; 42 pages.Applicant
Adamson, et al.; “NACK-Oriented Reliable (NORM) Transport Protocol;” Internet Engineering Task Force (IETF); RFC; vol. 5740; Nov. 2009; 94 pages.Applicant
Adamson, et al.; “Quantitative Prediction of NACK-Oriented Reliable Multicast (NORM) Feedback;” Proceedings, MILCOM 2000; vol. 2; Oct. 2002; 6 pages.Applicant
Ahlswede, et al.; “Network Information Flow;” IEEE Transactions on Information Theory; vol. 46; No. 4; Jul. 2000; pp. 1204-1216.Applicant
Ahmed, et al.; “On the Scaling Law of Network Coding Gains in Wireless Networks;” IEEE; MILCOM 2007; Oct. 2007; 7 pages.Applicant
Allman, et al.; “Fast Retransmit / Fast Recovery—TCP Congestion Control;” IETF; Section 3.2; RFC 2581; http://tools.ietf.org/html/rfc2581#section-3.2; Apr. 1999; downloaded on Nov. 2, 2011; 14 pages.Applicant
Armstrong, et al.; “Distributed Storage with Communcation Costs;” IEEE Forty-Ninth Annual Allerton Conference—Allerton House; Sep. 28-30, 2011; pp. 1358-1365.Applicant
Awerbuch, et al.; “On-Line Generalized Steiner Problem;” Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms; pp. 1-12; 1996.Applicant
Baek, et al.; “The International Journal of Computer and Telecommunications Networking;” vol. 56; Issue 6; Apr. 2012; pp. 1745-1762.Applicant
Baron et al.; “Coding Schemes for Multislot Messages in Multichannel ALOHA With Deadlines;” IEEE Transactions on Wireless Communications; vol. 1; No. 2; Apr. 2002; pp. 292-301.Applicant
Bellare, et al.; “A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation;” Proc. 38th Annual Symposium on Foundations of Computer Science; Oct. 1997; pp. 1-32.Applicant
Berman, et al.; “Improved Approximations for the Steiner Tree Problem;” Journal of Algorithms; Chapter 39; pp. 325-334.Applicant
Bhadra, et al.; “Looking at Large Networks: Coding vs. Queuing;” Proc. of the 25th IEEE International Conference on Computer Communications (INFOCOM); Apr. 2006; 12 pages.Applicant
Bharath-Kumar, et al.; “Routing to Multiple Destinations in Computer Networks;” IEEE Transactions on Communications; vol. Com-31; No. 3; Mar. 1983; pp. 343-351.Applicant
Bhargava, et al.; “Forward Error Correction Coding:” Mobile Communications Handbook; Part 1: Basic Principals; 1999; 18 pages.Applicant
Birk, et al.; “Judicious Use of Redundant Transmissions in Multichannel ALOHA Networks with Deadlines;” IEEE Journal on Selected Areas in Communications; vol. 17; No. 2; Feb. 1999; pp. 257-269.Applicant
Bisson, et al.; “Reducing Hybrid Disk Write Latency with Flash-Backed I/O Requests;” Proceedings of the Fifteenth IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'07); Oct. 2007; pp. 402-409.Applicant
Bonnin, et al.; “Automatic Multi-Interface Management Through Profile Handling;” Springer; Mobile Networks and Applications; Feb. 2009; pp. 4-17.Applicant
Borokhovich, et al.; “Tight bounds for Algebraic Gossip on Graphs;” Proc. of the IEEE International Symposium on Information Theory (ISIT); Jun. 13-18, 2010; 14 pages.Applicant
Borst, et al.; “Distributed Caching Algorithms for Content Distribution Networks”; IEEE INFOCOM; 2010 Proceedings IEEE; Mar. 14-19, 2010; 9 pages.Applicant
Borst, et al.; “Distributed Caching Algorithms for Content Distribution Networks;” Power Point Presentation; BCAM Seminar; Bilbao, Sep. 30, 2010; 36 pages.Applicant
Bui, et al.; “A Markovian Approach to Multipath Data Transfer in Overlay Networks;” IEEE Transactions on Parallel and Distributed Systems; vol. 21; No. 10; Oct. 2010; pp. 1398-1411.Applicant
Cai, et al.; “Secure Network Coding;” IEEE; ISIT; Jun. 30-Jul. 5, 202; p. 323.Applicant
Calmon, et al.; “Network Coding Over Multiple Network Interfaces Using TCP;” Presentation; Information Theory and Applications Workshop (ITA) 2012; San Diego, CA; Feb. 5, 2012; 55 pages.Applicant
Cardinal, et al; “Minimum Entrophy Combinatorial Optimization Problems;” Data Structure and Algorithms, Discrete Mathematics; Aug. 17, 2010; pp. 1-16.Applicant
Castro, et al.; “Upper and Lower Error Bounds for Active Learning;” The 44'th Annual Allerton Conference on Communication, Control and Computing; vol. 2, No. 2.1; 2006, 10 pages.Applicant
Celik, et al.; “MAC for Networks with Multipacket Reception Capabiiity and Spatially Distributed Nodes;” Proc. IEEE INFOCOM 2008; Apr. 2008; 9 pages.Applicant
Celik; “Distributed MAC Protocol for Networks with Multipacket Reception Capability and Spatially Distributed Nodes;” Master's Thesis; MIT Department of Electrical Engineering and Computer Science; May 2007; 127 pages.Applicant
Cha, et al.; “I Tube, You Tube, Everybody Tubes: Analyzing the World's Largest User Generated Content Video System;” 7th ACM GIGCOMM Conference on Internet Measurement; IMC'07; Oct. 24-26, 2007; 13 pages.Applicant
Chakrabarti, et al.; “Approximation Algorithms for the Unsplittable Flow Problem;” Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization; Sep. 2005, pp. 1-27.Applicant
Chakrabarti, et al.; Approximation Algorithms for the Unsplittable Flow Problem; Algorithmica (2007); Springer Science—Business Media, Aug. 2006; 16 pages.Applicant
Charikar, et al.; “Approximation Algorithms for Directed Steiner Problems;” Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, pp. 1-15; 1998.Applicant
Chen, et al.; “Pipeline Network Coding for Multicast Streams;” ICMU Org.; 2010; 7 pages.Applicant
Chou, et al.; “FEC and Pseudo-ARQ for Receiver-driven Layered Multicast of Audio and Video;” Data Compression Conference (DCC), 2000; Proceedings; Jan. 2000; 10 pages.Applicant
Chou, et al.; “Practical Network Coding;” Proceedings of the 41st Annual Allerton Conference on Communication, Control, and Computing; Oct. 2003; 10 pages.Applicant
Cisco Visual Networking Index: Forecast and Methodology; 2009-2014; White Paper; Jun. 2, 2010; pp. 1-17.Applicant
Cloud, et al.; “Co-Designing Multi-Packet Reception, Network Coding, and MAC Using a Simple Predictive Model;” arXiv:1101.5779v1 [cs.NI]; Submitted to W.Opt 2011;Jan. 30, 2011; pp. 1-8.Applicant
Cloud, et al.; “Effects of MAC approaches on non-monotonic saturation with COPE—a simple case study;” Military Communication Conference, 2011—MILCOM; Aug. 11, 2011; 7 pages.Applicant
Cloud, et al.; “MAC Centered Cooperation—Synergistic Design of Network Coding, Multi-Packet Reception, and Improved Fairness to Increase Network Throughput;” IEEE Journal on Selected Areas in Communications; vol. 30; No. 2; Feb. 2012; pp. 1-8.Applicant
Cloud, et al.; “Multi-Path TCP with Network Coding;” Wireless@mit—MIT Center for Wireless Networks and Mobile Computing; 2012 Inaugural Retreat; Oct. 10-11, 2012.Applicant
Cloud, et al; U.S. Appl. No. 13/654,953, filed Oct. 18, 2012.Applicant
Costa, et al.; “Informed Network Coding for Minimum Decoding Delay;” Fifth IEEE International Conference on Mobile Ad-hoc and Sensor Systems; Sep. 2008; pp. 80-91.Applicant
Coughlin, et al.; Years of Destiny; HDD Capital Spending and Technology Developments from 2012-2016; IEEE Santa Clara Valley Magnetics Society; Jun. 19, 2012; pp. 1-28.Applicant
Dana, et al.; “Capacity of Wireless Erasure Networks;” IEEE Transactions on Information Theory; vol. 52; No. 3; Mar. 2006; pp. 789-804.Applicant
Dana, et al.; “Capacity of Wireless Erasure Networks;” Jan. 2006; 41 pages.Applicant
Deb, et al.; “Algebraic Gossip: A Network Coding Approach to Optimal Muitiple Rumor Mongering;” Proc. of the 42nd Allerton Conference on Communication, Control, and Computing; Jan. 2004; 10 pages.Applicant
Deb, et al.; “On Random Network Coding Based Information Dissemination;” Proc. of the IEEE International Symposium on Information Theory (ISIT); Sep. 4-9, 2005; 5 pages.Applicant
Demers, et al.; “Epidemic Algorithms for Replicated Database Maintenance;” PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing; Jan. 1987; pp. 1-12.Applicant
Dias, et al.; “Performance Analysis of HARQ in WiMax Networks Considering Imperfect Channel Estimation;” The 7th International Telecommunications Symposium (ITS 2010); 2010; 5 pages.Applicant
Dimakis, et al.; “A Survey on Network Codes for Distributed Storage;” Proceedings of the IEEE; vol. 99; No. 3; Mar. 2011; pp. 476-489.Applicant
Dimakis, et al.; “Network Coding for Distributed Storage Systems;” IEEE/ACM Transactions on Information Theory; vol. 56; No. 9; pp. 1-13.Applicant
Donoho, et al.; “Estimating Covariances of Locally Stationary Processes: Rates of Convergence of Best Basis Methods;” Statistics, Stanford University, Stanford, California, USA, Tech. Rep; 1998; pp. 1-64.Applicant
Effros; Distortion-Rate Bounds for Fixed-and Variable-Rate Multiresolution Source Codes; IEEE Transactions on Information Theory; vol. 45, No. 6; Sep. 1999; pp. 1887-1910.Applicant
Effros; “Universal Multiresolution Source Codes;” IEEE Transactions on Information Theory; vol. 47; No. 6; Sep. 2001; pp. 2113-2129.Applicant
El Bahri, et al.; “Performance Comparison of Type I, II and III Hybrid ARQ Schemes over AWGN Channels;” 2004 IEEE International Conference on Industrial Technology (ICIT); vol. 3; Dec. 8-10, 2004; pp. 1417-1421.Applicant
Eryilmaz, et al.; On Delay Performance Gains From Network Coding; Information Sciences and Systems; 2006 40th Annual Conference on Mar. 22-24, 2006; 7 pages.Applicant
Fan, et al.; “Readable Relay Assisted Wireless Multicast Using Network Coding;” IEEE Journal on Selected Areas in communications; vol. 27; No. 5; Jun. 2009; pp. 749-762.Applicant
Feizi, et al.; “Locally Adaptive Sampling;” Communication, Control, and Computing; 2010; 48th Annual Allerton Conference, IEEE; Sep. 29, 2010; pp. 152-159.Applicant
Feizi, et al.; “On Network Functional Compression;” arXiv online repository; URL: http://arxiv.org/pdf/1011.5496v2.pdf; Nov. 30, 2010p pp. 1-60.Applicant
Feizi, et al.; “When Do Only Sources Need to Compute? On Functional Compression in Tree Networks;” 47th Annual Allerton Conference, IEEE; Sep. 30, 2009; pp. 447-454.Applicant
Feizi, et al; “Cases Where Finding a Minimum Entrophy Coloring of a Characteristic Graph is a Polynomial Time Problem;” IEEE International Symposium on Information Theory; Jun. 13, 2010; pp. 116-120.Applicant
Ferner, et al.; “Toward Sustainable Networking: Storage Area Networks with Network Coding;” Fiftieth Annual Allerton Conference; IEEE; Oct. 1-5, 2012; pp. 517-524.Applicant
Ford; “Architectural Guidelines for Multipath TCP Development;” Internet Engineering Task Force; Internet-Draft; Dec. 8, 2010; 17 pages.Applicant
Ford; “TCP Extension for Multipath Operation with Multiple Addresses draft-ford-mptcp-multiaddressed-03;” Internet Engineering Task Force; Internet-Draft; Mar. 8, 2010; 35 pages.Applicant
Fragouli, et al.; “Wireless Network Coding: Opportunities & Challenges;” MILCOM; Oct. 2007; 8 pages.Applicant
Frossard, et al.; “Media Streaming With Network Diversity;” Invited Paper; Proceedings of the IEEE; vol. 96, No. 1; Jan. 2008; pp. 39-53.Applicant
Galbraith, et al.; (HGST); “Iterative Detection Read Channel Technology in Hard Disk Drives;” Whitepaper; Nov. 2008; 8 pages.Applicant
Garcia-Luna-Aceves; “Challenges: Towards Truly Scalable Ad Hoc Networks;” MobiCom 2007; Sep. 2007; pp. 207-214.Applicant
Garcia-Luna-Aceves; “Extending the Capacity of Ad Hoc Networks Beyond Network Coding;” IWCMC 07; Proceedings of the 2007 International Conference on Wireless Communications and Mobile Computing; ACM; 2007; pp. 91-96.Applicant
Ghaderi, et al.; Reliability Gain of Network Coding in Lossy Wireless Networks; Infocom 2008; The 27th Conference on Computer Communications IEEE; Apr. 13-18, 2008; 5 pages.Applicant
Gheorghiu, et al.; “Multipath TCP with Network Coding for Wireless Mesh Networks;” IEEE Communications (ICC) 2010 International Conference; May 23-27, 2010; 5 pages.Applicant
Gheorghiu, et al.; “On the Performance of Network Coding in Multi-Resolution Wireless Video Streaming;” IEEE International Symposium on Jun. 9-11, 2010; 6 pages.Applicant
Ghez, et al.; “Stability Properties of Slotted Aloha with Multipacket Reception Capability;” IEEE Transactions on Automatic Control; vol. 33; No. 7; Jul. 1988; pp. 640-649.Applicant
Gkantsidis, et al.; “Cooperative Security for Network Coding File Distribution;” Proc. IEEE Infocom; Apr. 2006; 13 pages.Applicant
Gollakota, et al.; “ZigZag Decoding: Combating Hidden Terminals in Wireless Networks;” SIGCOMM 08; Aug. 17-22; pp. 159-170.Applicant
Golrezaei, et al.; “FemtoCaching: Wireless Video Content Delivery Through Distributed Caching Helpers;” arXiv:1109.4179v2; Apr. 7, 2012; pp. 1-11.Applicant
Grant, et al.; “Graph Implementation for Nonsmooth Convex Programs;” LNCIS 371; Springer-Verlag Limited; Jan. 2008; pp. 95-110.Applicant
Gupta; “The Capacity of Wireless Networks;” IEEE Transactions on Information Theory; vol. 46; No. 2; Mar. 2000; pp. 388-404.Applicant
Hadzi-Velkov, et al.; “Capture Effect in IEEE 802.11 Basic Service Area Under Influence of Rayleigh Fading and Near/Far Effect;” IEEE; PIMRC 202; vol. 1, Sep. 2002; 5 pages.Applicant
Haeupler, et al.; “One Packet Suffices—Highly Efficient Packetized Network Coding With Finite Memory;” IEEE International Symposium on Information Theory (ISIT) Proceedings; Jul. 31, 2011-Aug. 5, 2011; 5 pages.Applicant
Haeupler; “Analyzing Network Coding Gossip Made Easy;” Proc. of the 43rd Symposium on Theory of Computing (STOC); Jan. 2011, 13 pages.Applicant
Haeupler, et al.; “Optimality of Network Coding in Packet Networks;” ArXiv, Feb. 17, 2011; 5 pages.Applicant
Haley, et. al.; “Reversible Low-Density Parity-Check Codes;” IEEE Transactions on Information Theory; vol. 55; No. 5; May 2009; pp. 2016-2036.Applicant
Halloush, et al.; “Network Coding with Multi-Generation Mixing: Analysis and Applications for Video Communication;” IEEE International Conference on Communications; May 19, 2008; pp. 198-202.Applicant
Han, et al.; “Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity in the Internet;” IEEE/ACM Transactions on Networking (TON); vol. 14; No. 6, Dec. 2006; 26 pages.Applicant
Han, et al.; “On Nework Coding for Security;” IEEE Military Communications Conference; Oct. 2007; pp. 1-6.Applicant
Hassner, et al.; “4K Bye-Sector HDD-Data Format Standard;” Windows Hardware and Driver Central; San Jose, CA; Aug. 14, 2013; 5 pages.Applicant
Ho, et al.; “A Random Linear Network Coding Approach to Multicast;” IEEE Transactions on Information Theory; vol. 52; No. 10; Oct. 2006, pp. 4413-4430.Applicant
Ho, et al.; “Byzantine Modification Detection in Multicast Networks using Randomized Network Coding;” IEEE; ISIT; Jun. 27-Jul. 2, 2004; p. 144.Applicant
Ho, et al.; “Network Coding from a Network Flow Perspective;” ISIT; Jun.-Jul. 2003; 6 pages.Applicant
Ho, et al.; “On Randomized Network Coding;” Proceedings of 41st Annual Allerton Conference on Communications, Control and Computing; Oct. 2003; 10 pages.Applicant
Ho, et al.; “On the utility of network coding in dynamic environments;” International Workshop on Wireless AD-HOC Networks (IWWAN); 2004; pp. 1-5.Applicant
Ho, et al.; “The Benefits of Coding over Routing in a Randomized Setting;” Proceedings of 2003 IEEE International Symposium on Information Theory; Jun. 2003; pp. 1-6.Applicant
Ho, et al.; “The Benefits of Coding over Routing in a Randomized Setting;” IEEE; ISIT Jun. 29-Jul. 4, 2003; p. 442.Applicant
Hofri; “Disk Scheduling: FCFS vs. SSTF Revisited;” Communications of the ACM; vol. 23; No. 11; Nov. 1980; pp. 645-653.Applicant
Hong, et al.; Network-coding-based hybrid ARQ scheme for mobile relay networks; Electronics Letters; vol. 46; No. 7; Apr. 1, 2010; 2 pages.Applicant
International Disk Drive Equipment and Materials Assoc.; “Advanced Standard;” in Windows Hardware Engineering Conf.; May 2005; 11 pages.Applicant
Iyer, et al.; “Anticipatory scheduling: A disk scheduling framework to overcome deceptive idleness in synchronous I/O;” SIGOPS Operating Sys. Review; vol. 35; No. 5; Dec. 2001; 14 pages.Applicant
Jacobson, et al.; “Disk scheduling algorithms based on rotational position;” Hewlett-Packard laboratories; Palo Alto, CA; Technical Report HPL-CSP-91-7rev1; Feb. 26, 1991; 17 pages.Applicant
Jaggi, et al.; “Low Complexity Algebraic Multicast Network Codes;” Proceedings of the IEEE International Symposium on Information Theory; Jul. 4, 2003; 1 page.Applicant
Jaggi, et al.; “Resilient Network Coding in the Presence of Byzantine Adversaries;” Proc. IEEE INFOCOM; May 2007; 9 pages.Applicant
Jakubczak, et al.; “One-Size-Fits-All Wireless Video;” ACM Sig-Comm Hotnets 2009; 6 pages.Applicant
Jamieson, et al.; “PPR: Partial Packet Recovery for Wireless Networks;” SIGCOMM 07; Aug. 27-31, 2007; 12 pages.Applicant
Jamieson, et al.; “PPR: Partial Packet Recovery for Wireless Networks;” Presentation; SIGCOMM 07; Aug. 27-31, 2007; 25 pages.Applicant
Jannaty, et al.; “Full Two-Dimensional Markov Chain Analysis of Thermal Soft Errors in Subthreshold Nanoscale CMOS Devices;” IEEE Transactions on Device and Materials Reliability; vol. 11; No. 1; Mar. 2011; pp. 50-59.Applicant
Ji, et. al; “A network coding based hybrid ARQ algorithm for wireless video broadcast;” Science China; Information Sciences; vol. 54; No. 6; Jun. 2011; pp. 1327-1332.Applicant
Jin, et al.; “Adaptive Random Network Coding in WiMAX;” Communications, 2008; ICC'08 IEEE International Conference on May 19-23, 2008; 5 pages.Applicant
Jin, et al.; “Is Random Network Coding Helpful in WiMax;” IEEE 27th Conference on Computer Communications; Apr. 2008; 5 pages.Applicant
Jolfaei, et al.; “A New Efficient Selective Repeat Protocol for Point-To—Muitipoint Communication;” Communications 1993; ICC'93 Genova Technical Program, Conference Record; IEEE International Conference on May 23-26, 1993; vol. 2; pp. 1113-1117.Applicant
Karkpinski, et al.; “New Approximation Algorithms for the Steiner Tree Problems;” Technical Report, Electronic Colloquium on Computational Complexity (ECCC) TR95-030; 1995; pp. 1-17.Applicant
Karp, et al.; “Randomized Rumor Spreading;” IEEE Proceeding FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science; Jan. 2000; pp. 565-574.Applicant
Katti, et al.; “XORs in the Air: Practical Wireless Network Coding;” IEEE/ACM Transactions on Networking; vol. 16; No. 3; 2008; pp. 1-14.Applicant
Katti, et al.; “XORs in the Air: Practical Wireless Network Coding;” ACM SIGCOMM '06; Computer Communications Review; vol. 36; Sep. 11-15, 2006; 12 pages.Applicant
Kempe, et al.; “Protocols and Impossibility Results for Gossip-Based Communication Mechanisms;” Foundations of Computer Science, Jan. 2002; Proceedings. The 43rd Annual IEEE Symposium; pp. 471-480.Applicant
Key, et al.; “Combining Multipath Routing and Congestion Control for Robustness;” In Proceedings of IEEE CISS, 2006, 6 pages.Applicant
Kim, et al.; “Modeling Network Coded TCP Throughout: A Simple Model and its Validation;” VALUETOOLS '11 Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools; May 16-20, 2011; 10 pages.Applicant
Kim, et al.; “Modeling Network Coded TCP Throughput: A Simple Model and its Validation”, Cornell University Library, http://arxiv.org/abs/1008.0420, Aug. 2010, 3 pages.Applicant
Kim, et al.; “Network coding for Multi-Resolution Multicast;” IEEE INFOCOM 2010; Mar. 2010; 9 pages.Applicant
Kim, et al.; “Transform-free analysis of the GI/G/1/K queue through the decomposed Little's formula;” Computers and Operations Research; vol. 30, No. 3; Mar. 2003; pp. 1-20.Applicant
Kim, et al.; “Modeling Network Coded TCP Throughput: A Simple Model and its Validation”, arXiv:1008.0420v1 [cs.IT] Aug. 2, 2010; 9 pages.Applicant
Kim, et. al.; “Modeling Network Coded TCP Throughput: A Simple Model and its Validation”, Nov. 2010, Presentation; 19 pages.Applicant
Kodialam, et al.; “Online Multicast Routing With Bandwidth Guarantees: A New Approach Using Multicast Network Flow;” IEEE/ACM Transactions on Networking; vol. 11; No. 4; Aug. 2003; pp. 676-686.Applicant
Koetter, et al.; “An Algebraic Approach to Network Coding;” IEEE/ACM Transactions on Networking; vol. 11, No. 5; Oct. 2003; pp. 782-795.Applicant
Koetter, et al.; “Beyond Routing: An Algebraic Approach to Network Coding;” IEEE Infocom; 2002; 9 pages.Applicant
Koutsonikolas, et al.; “Efficient Online WiFi Delivery of Layered-Coding Media using Inter-layer Network Coding;” Distributed Computing Systems (ICDCS); 2011 31st International Conference on Jun. 2011; 11 pages.Applicant
Kritzner, et al.; “Priority Based Packet Scheduling with Tunable Reliability for Wireless Streaming;” Lecture Notes in Computer Science; 2004; pp. 707-717.Applicant
Kuhn, et al.; “Distributed Computation in Dynamic Networks;” Proc. of the 42rd Symposium on Theory of Computing (STOC); Jun. 5-8, 2010; 10 pages.Applicant
Lai; “Sequential Analysis: Some Classical Problems and New Challenges”; Statistica Sinica, vol. 11, No. 2; 2001; pp. 303-350.Applicant
Landau; “Application of the Volterra Series to the Analysis and Design of an Angle Track Loop;” IEEE Transactions on Aerospace and Electronic Systems; vol. AES-8, No. 3; May 1972; pp. 306-318.Applicant
Larsson, et al.; “Analysis of Network Coded HARQ for Multiple Unicast Flows;” Communication (ICC) 2010 IEEE International Conference on May 23-27, 2010 pp. 1-6.Applicant
Larsson, et al.; “Multi-User ARQ;” Vehicular Technology Conference; 2006; VTC (2006-Spring); IEEE 63rd; vol. 4; May 7-10, 2006; pp. 2052-2057.Applicant
Larsson; “Analysis of Multi-User ARQ with Multiple Unicast Flows Under Non-iid Reception Probabilities;” Wireless Communication and Networking Conference 2007; WCNC 2007; IEEE; Mar. 11-15, 2007; pp. 384-388.Applicant
Larsson; “Multicast Multiuser ARQ;” Wireless Communications and Networking Conference (WCNC) 2008; IEEE; Apr. 3, 2008; pp. 1985-1990.Applicant
Le, et al.; “How Many Packets Can We Encode?—An Analysis of Practical Wireless Network Coding;” INFOCOM 2008; The 27th Conference on Computer Communications, IEEE; 2008; pp. 1040-1048.Applicant
Lee, et al.; “Content Distribution in VANETs using Network Coding: The Effect of Disk I/O and Processing O/H;” IEEE SECON; Jan. 2008; pp. 117-125.Applicant
Lehman, et al; “Complexity Classification of Network Information Flow Problems;” SODA 04' Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms; Jan. 2004; pp. 9-10.Applicant
Li, et al.; “N-in-1 Retransmission with Network Coding;” IEEE Transactions on Wireless Communications; vol. 9; No. 9; Sep. 2010; pp. 2689-2694.Applicant
Li, et al.; “Robust and Flexible Scalable Video Multicast with Network Coding over P2P Network;” 2nd International Congress on Image and Signal Processing, IEEE: Oct. 17, 2009; pp. 1-5.Applicant
Li,et al.; “Linear Network Coding;” IEEE Transactions on Information Theory; vol. 49; No. 2; Feb. 2003; pp. 371-381.Applicant
Lima, et al.; “An Information-Theoretic Cryptanalysis of Network Coding—is Protecting the Code Enough;” International Symposium on Information Theory and its Applications; Dec. 2008; 6 pages.Applicant
Lima, et al.; “Random Linear Network Coding: A free cipher?” IEEE International Symposium on Information Theory; Jun. 2007; pp. 1-5.Applicant
Lima, et al.; “Secure Network Coding for Multi-Resolution Wireless Video Streaming;” IEEE Journal on Selected Areas in Communications; vol. 28; No. 3; Apr. 2010; pp. 377-388.Applicant
Lima, et al.; “Towards Secure Multiresolution Network Coding;” IEEE Information Theory Workshop; Jun. 12, 2009; pp. 125-129.Applicant
Liu, et al.; “The Throughput Order of Ad Hoc Networks Employing Network Coding and Broadcasting;” Military Communications Conference; MILCOM 2006; Oct. 2006; pp. 1-7.Applicant
Liu, et al.; “Using Layered Video to Provide Incentives in P2P Live Streaming;” P2P-TV07: Proceedings of the 2007 Workshop on Peer-to-peer Streaming and IP-TV; Aug. 31, 2007 ACM; 6 pages.Applicant
Luby, et al.; “The Use of Forward Error Correction (FEC) in Reliable Multicast;” Internet Society Request for Comments; RFC 3453; Dec. 2002; 18 pages.Applicant
Lucani et al.; “On Coding for Delay New Approaches based on Network Coding in Network Coding in Networks with Large Latency;” Presentation in NetCod; Slide Presentation; Jun. 16, 2009; 17 pages.Applicant
Lucani et al; “Broadcasting in Time-Division Duplexing: A Random Linear Network Coding Approach;” presented Switzerland; Conference: NetCod 2009, Lausanne, Switzerland; Jun. 2009, 6 pages.Applicant
Lucani et al; “On Coding for Delay—New Approaches Based on Network Coding in Networks with Large Latency;” Conference: ITA Workshop, San Diego, USA; Feb. 2009; 10 pages.Applicant
Lucani et al; “On Coding for Delay New Approaches based on Network Coding in Networks with Large Latency;” Conference ITA Workshop, San Diego, USA; Slide Presentation; Feb. 13, 2009; 11 pages.Applicant
Lucani et al; “Random Linear Network Coding for Time Division Duplexing: Energy Analysis;” Conference: ICC 2009, Dresden, Germany; Jun. 2009; 5 pages.Applicant
Lucani et al; “Random Linear Network Coding for Time-Division Duplexing: when to stop talking and start listening;” Presentation in ICC; Slide Presentation; Jun. 16, 2009; 6 pages.Applicant
Lucani et al; “Random Linear Network Coding for Time-Division Duplexing: when to stop talking and start listening;” Presentation in INFOCOM; Slide Presentation; Apr. 23, 2009; 10 pages.Applicant
Lucani et al; “Random Linear Network Coding for Time-Division Duplexing: Queueing Analysis;” Conference ISIT 2009, Seoul, Korea; Jul. 2009; 5 pages.Applicant
Lucani et al; “Random Linear Network Coding for Time-Division Duplexing: Field Size Considerations;” Conference: GLOBECOM 2009, Hawaii, USA; Dec. 2009; 6 pages.Applicant
Lucani, et al.; “Network Coding for Data Dissemination: It is Not What You Know, But What Your Neighbors Don't Know;” Modeling and Optimization in Mobile, AdHoc, and Wireless Networks 2009; WiOPT 2009; 7th International Symposium on Jun. 23-27, 2009; pp. 1-8.Applicant
Lucani, et al.; “Network Coding Schemes for Underwater Networks;” WUWNet 07; Sep. 14, 2007; pp. 25-32.Applicant
Lucani, et al.; Systematic Network Coding for Time-Division Duplexing; Proceedings of the IEEE International Symposium on Information Theory (ISIT); ; Jun. 13-18, 2010; pp. 2403-2407.Applicant
Lun, et al.; “Further Results on Coding for Reliable Communication over Packet Networks;” Information Theory, ISIT 2005 Proceedings International Symposium on Sep. 4-9, 2005; 5 pages.Applicant
Lun, et al.; “On Coding for Reliable Communication Over Packet Networks;” Physical Communication; vol. 1; No. 1; Jan. 2008; pp. 10 pages.Applicant
Lun, et al.; “On Coding for Reliable Communication over Packet Networks;” LIDS Publication #2741; Jan. 2007; 33 pages.Applicant
Lun, et al.; An Analysis of Finite-Memory Random Linear Coding on Packet Streams; Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks; Apr. 3-6, 2006; pp. 1-6.Applicant
Lun; “Efficient Operation of Coded Packet Networks;” Ph.D. Dissertation; Massachusetts Institute of Technology; Jun. 2006; 130 pages.Applicant
Magli, et al.; “An Overview of Network Coding for Multimedia Streaming;” IEEE International Conference; Jun. 28, 2009; pp. 1488-1491.Applicant
Mallat, et al.; “Adaptive Covariance Estimation of Locally Stationary Processes;” Annals of Statistics, vol. 26, No. 1; 1998; pp. 1-43.Applicant
Manssour, et al.; “A Unicast Retransmission Scheme based on Network Coding;” IEEE Transactions on Vehicular Technology; vol. 61; Issue 2; Nov. 2011; 7 pages.Applicant
Maymounkov, et al.; “Methods for Efficient Network Coding;” Proc. of the 44th Allerton Conference on Communication, Control, and Computing; Sep. 2006; 10 pages.Applicant
Médard, et al.; “On Coding for Non-Multicast Networks;” invited paper, 41st Allerton Annual Conference on Communication, Control; Outgrowth of supervised student research Publications of Muriel Médard and Computing; vol. 1; Oct. 2003; 9 pages.Applicant
Medard; “Some New Directions for Network Coding in Content Distribution”, RLE, EECS, MIT, Seminar to Alcatel Lucent, Nov. 2010, 29 pages.Applicant
Merchant, et al.; “Analytic Modeling of Clustered RAID with Mapping Based on Nearly Random Permutation;” IEEE Transactions on Computers; vol. 45; No. 3; Mar. 1996; pp. 367-373.Applicant
Metzner; “An Improved Broadcast Retransmission Protocol;” IEEE Transactions on Communications; vol. COM-32; No. 6; Jun. 1984; pp. 679-683.Applicant
Mosk-Aoyama, et al.; “Information Dissemination via Network Coding;” ISIT 2006; IEEE; Jul. 9-14, 2006; pp. 1748-1752.Applicant
Moyer, et al.; “A Survey of Security Issues in Multicast Communications;” IEEE Network; vol. 13; No. 6; Nov./Dec. 1999; pp. 12-23.Applicant
Nguyen, et al.; “Internet Media Streaming Using Network Coding and Path Diversity;” IEEE Global Telecommunications Conference; Nov. 30-Dec. 4, 2008; 5 pages.Applicant
Nguyen, et al.; “Wireless Broadcast Using Network Coding;” Vehicular Technology IEEE Transactions on Feb. 2009; vol. 58; Issue 2; 25 pages.Applicant
Nguyen, et al; “Video Streaming with Network Coding;” Journal of Signal Processing Systems; vol. 59, Issue 3; DOI: 10.1007/s11265-009-0342-7; Jun. 2010; 25 pages.Applicant
Nobel; “Hypothesis Testing for Families of Ergodic Processes;” Bernoulli-London, vol. 12, No. 2; 2006; 21 pages.Applicant
Noguichi, et al.; “Performance Evaluation of New Multicast Architecture with Network Coding;” IEICE Transactions on Communication, E86-B; No. 6; Jun. 2003; 3 pages.Applicant
NS Version 1—LBNL Network Simulator; web page—http://ee.lel.gov/ns/; Mar. 21, 2011; 3 pages.Applicant
Nyandoro, et al.; “Service Differentiation in Wireless LANs based on Capture;” IEEE GLOBECOM 2005; vol. 6; Dec. 2005; 5 pages.Applicant
Oliveira, et al.; “A Network Coding Approach to Secret Key Distribution;” IEEE Transactions on Information Forensics and Security; vol. 3; No. 3; pp. 414-423; Sep. 2008.Applicant
ParandehGheibi, et al.; “Access-Network Association Policies for Media Streaming in Heterogeneous Environments;” Apr. 2010; pp. 1-8.Applicant
Peng, et al.; “Research on Network Coding based Hybrid-ARQ Scheme for Wireless Networks;” Communication Systems (ICCS); 2010 IEEE International Conference on Nov. 17-19, 2010; pp. 218-222.Applicant
Popovici, et al.; “Robust, Portable I/O Scheduling with the Disk Mimic;” Proc. USENIX Annual Tech. Conf. San Antonio, Texas, Jun. 2003; 14 pages.Applicant
Qureshi, et al.; “An Efficient Network Coding based Retransmission Algorithm for Wireless Multicast;” Personal, Indoor and Mobile Radio Communications, 2009 IEEE 20th international Symposium on Sep. 13-16, 2009; 5 pages.Applicant
Radunovic, et al.; “Horizon: Balancing TCP Over Multiple Paths in Wireless Mesh Network;” Proc. 14th ACM International Conference on Mobile Computing and Networking; Sep. 2008; 12 pages.Applicant
Ramanathan; “Multicast Tree Generation in Networks with Asymmetric Links;” IEEE Transactions on Networking; vol. 4; Aug. 1996; pp. 1-12.Applicant
Rezaee, et al.; “Multi Packet Reception and Network Coding;” Presentation at The 2010 Military Communications Conference Unclassified Technical Program; Nov. 2, 2010; 15 pages.Applicant
Rezaee, et al.; “An Analysis of Speeding Multicast by Acknowledgment Reduction Technique (SMART) with Homogeneous and Heterogeneous Links—A Method of Types Approach;” Signals, Systems and Computers (ASILOMAR) 2011 Conference; IEEE; Nov. 2011; pp. 21-27.Applicant
Rezaee, et al.; “Speeding Multicast by Acknowledgment Reduction Technique (SMART);” ArXiv:1104.2941v2 [cs.NI] Sep. 10, 2011; 6 pages.Applicant
Rezaee, et al.; “Speeding Multicast by Acknowledgment Reduction Technique (SMART) Enabling Robustness of QoE to the Number of Users;” IEEE Journal on Selected Areas in Communication; vol. 30, No. 7; Aug. 2012; pp. 1270-1280.Applicant
Rezaee, et al.; “Multi Packet Reception and Network Coding;” Military Communications Conference; 2010; MILCOM 2010; IEEE; Oct. 31, 2010-Nov. 3, 2010; pp. 1393-1398.Applicant
Rezaee; “Network Coding, Multi-Packet Reception, and Feedback: Design Tools for Wireless Broadcast Networks;” Submitted to Department of Electrical Engineering and Computer Science at Massachusetts Institute of Technology; Sep. 2011; 92 pages.Applicant
Riemensberger, et al.; “Optimal Slotted Random Access in Coded Wireless Packet Networks;” WiOPt 10: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks; Jul. 13, 2010; pp. 374-379.Applicant
Roughgarden, et al.; “How Bad is Selfish Routing?” Journal of the ACM; vol. 49, No. 2; Mar. 2002; pp. 236-259.Applicant
Ruemmler, et al.; “An introduction to disk drive modeling;” IEEE Computers; vol. 27; No. 3; Mar. 17-29, 1994; 17 pages.Applicant
Ryabko, et al.; “On Hypotheses Testing for Ergodic Processes;” Information Theory Workshop; ITW'08; IEEE; 2008; pp. 281-283.Applicant
Sanders, et al.; “Polynomial Time Algorithms for Network Information Flow;” 15th ACM Symposium on Parallel Algorithms and Architectures; Jun. 2003; pp. 1-9.Applicant
Sayenko, et al.; “Performance Analysis of the IEEE 802.16 ARQ Mechanism;” MSWiM'07; Oct. 22-26, 2007; pp. 314-322.Applicant
Scharf; “MPTCP Application Interface Considerations draft-scharf-mptcp-ap-04;” Internet Engineering Task Force; Internet-Draft; Nov. 22, 2010; 26 pages.Applicant
Seferoglu, et al.; “Opportunistic Network Coding for Video Streaming over Wireless;” Packet Video; Nov. 2007; 10 pages.Applicant
Sengupta, et al.; “An Analysis of Wireless Network Coding for Unicast Sessions: The Case for Coding-Aware Routing;” in INFOCOM 2007; 26th IEEE International Conference on Computer Communications; Jun. 2007; 9 pages.Applicant
Servetto, et al.; “Constrained Random Walks on Random Graphs: Routing Algorithms for Large Scale Wireless Sensor Networks;” WSNA 02; Sep. 28, 2002; 10 pages.Applicant
Shenker, et al.; “Pricing in computer networks: reshaping the research agenda;” Telecommunications Policy; vol. 20, No. 3; Jan. 1996; pp. 183-201.Applicant
Sherali, et al.; “Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs;” Elsevier Operations Research Letters 19 (Jan. 1996); pp. 105-113.Applicant
Shields; “The Interactions Between Ergodic Theory and Information Theory;” IEEE Transactions on Information Theory, vol. 44, No. 6; Oct. 1998; pp. 2079-2093.Applicant
Shrader, et al.; “Systematic wireless network coding;” Military Conference, 2009; MILCOM 2009; IEEE; 7 pages.Applicant
Shrader, et al; “Routing and Rate Control for Coded Cooperation in a Satellite-Terrestrial Network;” IEEE: The 2011 Military Communications Conference—Track 2—Network Protocols and Performance; Nov. 7-10, 2011; pp. 735-740.Applicant
Shriver, et al.; “An analytic behavior model for disk drives with readahead caches and request reordering;” Proc. SIGMETRICS/Performance, Joint Conf. on Meas. and Modeling Comp. Sys.; ACM; Jan. 1998; 10 pages.Applicant
Song, et al.; “Zero-Error Network Coding for Acyclic Networks;” IEEE Transactions on Information Theory; vol. 49, No. 12; Dec. 2003; pp. 3129-3139.Applicant
SongPu, et al.; Performance analysis of joint chase combining and network coding in wireless broadcast retransmission;38 Wireless Communication, Network and Mobile Computing 2008; WiCOM '08, 4th International Conference on Oct. 12-14, 2008; pp. 1-4.Applicant
Soo Suh; “Send-on-Delta Sensor Data Transmission With a Linear Predictor;” Sensors; ISSN 1424-8220; vol. 7; No. 4; Apr. 26, 2007; pp. 537-547.Applicant
Sun, et al.; “Cooperative Hybrid-ARQ Protocol with Network Coding;” Communications and Networking in China 2009—ChinaCOM 2009; Fourth International Conference on Aug. 26-28, 2009; pp. 1-5.Applicant
Sundaram, et al.; “Multirate Media Streaming Using Network Coding;” Proc. 43rd Allerton Conference on Communication, Control, and Computing; Sep. 2005; 7 pages.Applicant
Sundararajan, et al.; “ARQ for Network Coding;” ISIT Proc. of the IEEE International Symposium on Information Theory (ISIT); Jul. 6-11, 2008; pp. 1651-1655.Applicant
Sundararajan, et al.; “Network Coding Meets TCP: Theory and Implementation;” Proceedings of the IEEE; vol. 99, Issue 3; Mar. 2011; pp. 490-512.Applicant
Sundararajan, et al.; “Network coding meets TCP;” InfoCOM 2009; IEEE, Apr. 19-25, 2009; pp. 280-288.Applicant
Sundararajan, et al.; On Queueing in Coded Networks—Queue Size Follows Degrees of Freedom; IEEE Information Theory Workshop on Information Theory for Wireless Networks (ITW); Jul. 1-6, 2007; 6 pages.Applicant
Teerapittayanon, et al.; “Network Coding as a WiMAX Link Reliability Mechanism;” Multiple Access Communication; Lectures Notes in Computer Science; vol. 7642; pp. 1-12; 2012.Applicant
Teerapittayanon, et al.; “Performance Enhancements in Next Generation Wireless Networks Using Network Coding: A Case Study in WiMAX;” Massachusetts Institute of Technology; Jun. 2012; 130 pages.Applicant
Thobaben; “Joint Network/Channel Coding for Multi-User Hybrid-ARQ;” Source and Channel Coding (SCC) 2008; 7th International ITG Conference on Jan. 14-16, 2008; 6 pages.Applicant
Tosun, et al.; “Efficient Multi-Layer Coding and Encryption of MPEG Video Streams;” Proc. 2000 IEEE International Conference on Multimedia and Expo; vol. 1; 2000; pp. 119-122.Applicant
Tosun, et al.; “Lightweight Security Mechanisms for Wireless Video Transmission;” Proc. Intl. Conference on Information Technology, Coding and Computing; Apr. 2001; pp. 157-161.Applicant
Tran, et al.; “A Hybrid Network Coding Technique for Single-Hop Wireless Networks;” IEEE Journal on Selected Areas in Communications; vol. 27; No. 5; Jun. 2009; pp. 685-698.Applicant
Tran, et al.; “A Joint Network-Channel Coding Technique for Single-Hop Wireless Networks;” Network Coding, Theory and Applications; 2008; NetCod 2008; Fourth Workshop on Jan. 3-4, 2008; pp. 1-6.Applicant
Trung, et al.; “Quality Enhancement for Motion JPEG Using Temporal Redundancies;” IEEE Transactions on Circuits and System for Video Technology, vol. 18; No. 5; May 2008; pp. 609-619.Applicant
Tsatsanis, et al.; “Network Assisted Diversity for Random Access Wireless Data Networks;” Signals, Systems & amp; Computers; IEEE; vol. 1; Nov. 1-4, 1988; pp. 83-87.Applicant
Valancius, et al.; “Greening the Internet with Nano Data Centers;” Proc. 5th International Conference on Emerging Networking Experiments and Technologies; CoNEXT 2009; ACM 2009; Dec. 1-4, 2009; pp. 37-48.Applicant
Vasudevan, et al.; “Algebraic Gossip on Arbitrary Networks;” arXiv:0901.1444; Jan. 2009; 5 pages.Applicant
Velambi, et al.; “Throughput and Latency in Finite-Buffer Line Networks;” IEEE Transactions on Information Theory; vol. 57; No. 6; Jun. 2011; pp. 3622-3643.Applicant
Vien, al.; “Network Coding-based Block ACK for Wireless Relay Networks;” Proceedings of IEEE Vehicular Technology Conference (VTC2011-Spring); May 2011; 5 pages.Applicant
Vien, et al.; “Network Coding-based ARQ Retransmission Strategies for Two-Way Wireless Relay Networks;” Software, Telecommunications and Computer Networks (SoftCOM) 2010; International Conference on Sep. 23-25, 2010; 5 pages.Applicant
Vilela, et al.; “Lightweight Security for Network Coding;” IEEE International Conference on Communications; May 2008; 5 pages.Applicant
Wang, et al.; “Capacity-Delay Tradeoff for Information Dissemination Modalities in Wireless Networks;” in Information Theory; ISIT 2008; IEEE International Symposium; Jul. 2008; pp. 677-681.Applicant
Wang, et al.; “Embracing Interference in Ad Hoc Networks Using Joint Routing and Scheduling with Multiple Packet Reception;” in INFOCOM 2008; The 27th Conference on Computer Communications; IEEE; Apr. 2008; pp. 1517-1525.Applicant
Wang, et al.; Multipath Live Streaming via TCP: Scheme, Performance and Benefits; ACM Transactions on Multimedia Computing, Communications and Applications; vol. 5; No. 3; Article 25; Aug. 2009; pp. 1-23.Applicant
Widmer, et al.; “Network Coding for Efficient Communication in Extreme Networks;” Applications, Technologies, Architectures, and Protocols for Computer Communication; Aug. 2005; pp. 284-291.Applicant
Wieselthier, et al.; “Energy Efficient Broadcast and Multicast Trees in Wireless Networks;” Mobile Networks and Applications 7; Jan. 2002; pp. 481-492.Applicant
Wieselthier, et al.; “Energy-Aware Wireless Networking with Directional Antennas: The Case of Session-Based Broadcasting and Multicasting;” IEEE Transactions on Mobile Computing; vol. 1, No. 3; Jul.-Sep. 2002; pp. 176-191.Applicant
Wilhelm; “An Anomaly in Disk Scheduling: A Comparison of FCFS and SSTF Seek Scheduling Using an Empirical Model for Disk Access;” Communications of the ACM, vol. 19; No. 1; Jan. 1976; pp. 13-17.Applicant
Wu et al.; “A Trellis Connectivity Analysis of Random Linear Network Coding with Buffering;” Proc. of the international Symposium on Information Theory (ISIT); Jul. 9-14, 2006; pp. 768-772.Applicant
Yazdi, et al.; “Optimum Network Coding for Delay Sensitive Applications in WiMAX Unicast;” IEEE INFOCOM 2009; Apr. 19-25, 2009; pp. 1576-2580.Applicant
Yeung; “Multilevel Diversity Coding with Distortion;” IEEE Transactions on Information Theory; vol. 41, No. 2; Mar. 1995; pp. 412-422.Applicant
Yong, et al.; “XOR Retransmission in Multicast Error Recovery;” Networks 2000, ICON; Proceedings IEEE International Conference on Sep. 5-8, 2000; pp. 336-340.Applicant
Yun, et al.; “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm;” IEEE Transactions on Information Theory; vol. 53; No. 12; Dec. 2007; pp. 4628-4639.Applicant
Yun, et al.; Towards Zero Retransmission Overhead: A Symbol Level Network Coding Approach to Retransmission; IEEE Transactions on Mobile Computing; vol. 10; No. 8; Aug. 2011; pp. 1083-1095.Applicant
Zeger; “Packet Erasure Coding with Random Access to Reduce Losses of Delay Sensitive Multislot Messages;” IEEE; Paper ID #900482; Aug. 18, 2009; pp. 1-8.Applicant
Zhang, et al.; “Collision Resolution in Packet Radio Networks Using Rotational Invariance Techniques;” IEEE Transactions on Communication; vol. 50; No. 1; Jan. 2002; pp. 146-155.Applicant
Zhang et al.; “Optimized Multipath Network Coding in Loss Wireless Networks;” ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributing Computing Systems; Jan. 2008; 12 pages.Applicant
Zhang et al.; Dual XOR in the AIR: A Network Coding Based Retransmission Scheme for Wireless Broadcasting; Communications (ICC) 2011 IEEE International Conference on Jun. 5-9, 2011; pp. 1-6.Applicant
Zhao, et al.; “A Multiqueue Service Room MAC Protocol for Wireless Networks With Multipacket Reception;” IEEE/ACM Transactions on Networking; vol. 11; No. 1; Feb. 2003; pp. 125-137.Applicant
Zhao, et al.; “On analyzing and improving COPE performance;” Information Theory and Applications Workshop (ITA), Jan. 2010; pp. 1-6.Applicant
Zhu, et al.; “Multicast with Network Coding in Application-Layer Overlay Networks;” IEEE Journal on Selected Areas in Communications; vol. 22; No. 1; Jan. 2004; pp. 1-13.Applicant
Han, et al.; “Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity in the Internet;” Networking, IEEE/ACM Transaction; Dec. 2006; pp. 1260-1271.Applicant
Kim, et al.; “Modeling Network Coded TCP Throughout: A Simple Model and its Validation;” VALUETOOLS '11 Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools; May 16-20, 2011; pp. 131-140.Applicant
International Search Report and Written Opinion of the ISA for PCT/US2013/24039 dated Jan. 31, 2013.Applicant
PCT International Preliminary Report on Patentability with Written Opinion for PCT/US2013/024039 dated Aug. 14, 2014 7 pages.Applicant
Lucani et al; “Broadcasting in Time-Division Duplexing: A Random Linear Network Coding Approach;” presented Switzerland; Conference: NetCod 2009, Lausanne, Switzerland; Jun. 2009; 6 pages.Applicant
Lucani et al; “On Coding for Delay New Approaches based on Network Coding in Networks with Large Latency;” Conference ITA Workshop, San Diego, USA; Slide Presentation; Feb. 13, 2009; 12 pages.Applicant
PCT Search Report of the ISA for PCT/US2009/055359 dated Mar. 30, 2011.Applicant
Written Opinion of the ISA for PCT/US2009/055359 dated Mar. 30, 2011.Applicant
International Preliminary Report on Patentability of the ISA for PCT/US2009/055359 dated Apr. 21, 2011.Applicant
European Extended Search Report dated Aug. 7, 2015 corresponding to European Application No. 13742964.3; 11 Pages.Applicant
Tomozei et al., “First Report on Novel Protocol Components with Network Coding;” Network Coding for Robust Architectures in Volatile Environments: Collaborate Project, No. 215252; Submitted Jan. 15, 2010; 78 Pages.Applicant
Zhuoqun et al., “An Improved MPTCP in Coded Wireless Mesh Networks;” Proceedings of the 2nd IEEE International Conference on Broadband Network and Multimedia Technology; Oct. 18, 2009; 6 Pages.Applicant
U.S. Appl. No. 14/843,358, filed Sep. 2, 2015, Haupler, et al.Applicant
U.S. Appl. No. 14/826,256, filed Aug. 14, 2015, Zeger, et al.Applicant
Response (with Amended Claims) to European Office Action dated Apr. 8, 2016 corresponding to European Application No. 13742964.3; Response filed on Jun. 20, 2016; 12 Pages.Applicant
U.S. Appl. No. 14/297,090, filed Jun. 5, 2014, Kim, et al.Applicant
U.S. Appl. No. 14/678,359, filed Apr. 3, 2015, Zeger, et al.Applicant
U.S. Appl. No. 14/668,185, filed Mar. 25, 2015, Medard, et al.Applicant

Abstract