Nationaluniversity of Ireland, Maynooth

Massachusetts Institute of Technology

Douglas Leith

Mohammad Karzand

Muriel Medard

Andres Garcia Saavedra

Robert Shorten

David W Malone

Andrés Garcia Saavedra

Domenico Giustiniano

Provided is a method for correcting errors in a data transmission network, comprising: transmitting a plurality of uncoded information packets across a network path; transmitting a plurality of coded packets for recovering information packets lost in transmission across said network path, the coded packets being temporally interspersed among said uncoded information packets, wherein the coded packets are encoded based on information packets transmitted prior to a previously transmitted coded packet; and determining the interspersion of the coded packets according to a packet loss rate.

Low-delay packet erasure coding

A method is disclosed for transmitting data between a source node and destination node connected via multiple paths of a heterogeneous network, at least one of the paths delivering packets with a non-deterministic delivery time. Data is divided into frames, each frame comprising a number of packets, where processing by the destination node of an information packet p is conditional on receipt of the data for any information packet i where i&#x3c;p. A number of sequential transmission slots s, each for transmitting a given packet p of a frame, are allocated for each network path k. A set D of possible assignments of packets to transmission slots for a frame are provided. The method comprises determining an assignment x with minimum in-order delivery delay of said packets based on expected arrival times of packets to their destination and expected reordering delay for packets. Packets are then transmitted in accordance with the determined assignment x.

Method of transmitting data between a source node and destination node

A driver for an IEEE 802.11 wireless network node determines a metric for link quality between the node and a remote node. The nodes communicate using a handshake protocol in which the first node expects to receive an acknowledgement (ACK) of receipt of a data packet from the remote node. The driver provides a measure for: collision induced losses (pc) between the first and remote nodes; a slot being erroneously detected as busy when a successful transmission could have been made (pexp) between the first and remote nodes; and a probability of successful reception of a packet when a collision occurs (pplc) between the first and remote nodes. The measure is based on a number (A) of acknowledgements received from the remote node vis-&#xe0;-vis a number (T) of packets transmitted to the remote node. The driver can adjust one of carrier sensitivity or node transmission power based on the measure.

Method and apparatus for estimating link quality

Disclosed are methods of congestion control in transmission of data in packets over a network link using a transport layer protocol, and transmission methods and protocol systems to implement such methods. The number of unacknowledged packets in transit is less than or equal to a congestion window value cwndwhich can be varied according to an additive-increase multiplicative-decrease (AIMD) law having an increase parameter &#x3b1;. In embodiments, &#x3b1;can be increased during each congestion epoch at a time after the start of a congestion epoch, or based on time since the start of a congestion epoch. In embodiments, a multiplicative decrease parameter &#x3b2;can be set based on a characteristic(s) of a data flow(s) carried over the network link. For example, the value of &#x3b2;may be set as the value of the round-trip time of data traversing the link or based on the minimum of the mean inter-packet time.

Growing community of inventors

Dublin, Ireland

Douglas Leith