# US 2018/0026900 A1 · Method Of Transmitting Data Between A Source Node And Destination Node

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2018/0026900 A1
- Document ID: US20180026900A1
- Status: Published application
- Kind: A1
- Application number: 15/674,021
- Filed: 2017-08-10
- Published: 2018-01-25
- Earliest claimed: 2015-02-11
- Assignees: National University of Ireland Maynooth
- Applicants: National University of Ireland, Maynooth
- Inventors: Andrés Garcia SAAVEDRA; Mohammad KARZAND; Douglas LEITH
- Web page: https://patentgrep.com/patent/US20180026900A1

## CPC

- H04L 47/283: in response to processing delays, e.g. caused by jitter or round trip time [RTT]
- H04L 47/125: by balancing the load, e.g. traffic engineering
- H04L 47/15: {in relation to multipoint traffic (arrangements for broadcast or multicast in data networks H04L12/18)}
- H04L 47/41: by acting on aggregated flows or links
- H04L 47/56: implementing delay-aware scheduling
- Y02D 30/50: in wire-line communication networks, e.g. low power modes or reduced link rate
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

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<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.

## Claims

### Claim 1

A method of transmitting data between a source node and destination node connected via multiple paths of a heterogeneous network, at least one of said paths delivering packets with a non-deterministic delivery time ak, said method comprising:
dividing said data into frames, each frame comprising a number of packets N, 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<p;
allocating, for each network path k, a number of sequential transmission slots s, each for transmitting a given packet p of said frame;
providing a set D of possible assignments x of packets to transmission slots for a frame;
determining an assignment x with minimum in-order delivery delay of said packets:
min
x
∈
D

∑
p
=
1
N

E

[
a
p
]
+
E

[
r
p
]
where:
E[ap] is an expected arrival time of packet p to its destination: E[ap]=E]ΣEkΣs(Tk+s, tk), xp,k,s]
where:
Tk is a propagation delay of a packet through the network path k;
xp,k,s=1 where, in a given assignment x, a packet p is to be transmitted in a transmission slot s of network path k; and 0 otherwise;
tk is a transmission delay for a packet through a network path k; and
E[rp] is an expected reordering delay for packet p:
E[rp]=E[max{0, max{a1, a2, . . . , ap−1}−ap}]; and
transmitting said packets in accordance with said determined assignment x.

### Claim 2 (depends on 1)

A method according to claim 1 further comprising modelling the transmission delay for a network path k as a Gaussian distributed random variable with an average delivery time tk and a variance σk2.

### Claim 3 (depends on 1)

A method according to claim 1 comprising removing from consideration in the calculation of said expected reordering delay for a packet p, the expected arrival time of any packet i scheduled to be transmitted before packet p in the same network path k as packet p.

### Claim 4 (depends on 1)

A method according to claim 1 comprising removing from consideration in the calculation of said expected reordering delay for a packet p, any packet i scheduled to arrive at said destination node substantially before packet p.

### Claim 5 (depends on 2)

A method according to claim 2 comprising removing from consideration in the calculation of said expected reordering delay for a packet p, any packet i where:
E[ai]+3σai<E[ap]−3σap
where σax2 is the variance for the arrival of packet x in the network path in which a packet x is assigned, E[ax] is the expected arrival of packet x at destination and i<p.

### Claim 6 (depends on 2)

A method according to claim 2 wherein responsive to a set A={a1, a2, . . . , ap−1} employed in determining said expected reordering delay E[rp] for packet p including more than 2 non-zero elements for consideration, using a Partition Max Binary Tree algorithm to provide an estimate φ≈max{A}−ap.

### Claim 7 (depends on 1)

A method according to claim 1 comprising excluding from said set of assignments D any assignment in which a packet p is scheduled in the same path before a packet i where i<p.

### Claim 8 (depends on 1)

A method according to claim 1 comprising excluding from said set of assignments any assignment when it is statistically unlikely that a packet i<p could be delivered before packet p.

### Claim 9 (depends on 8)

A method according to claim 8 comprising excluding from said set of assignments any assignment in which a packet i is scheduled in a transmission slot where:
E[ai]−3σai>E[ap]+3σap
where σax2 is the variance for the arrival of packet x in the network path in which a packet x is assigned, E[ax] is the expected arrival of packet x at destination and i<p

### Claim 10 (depends on 1)

A method according to claim 1 comprising assigning each packet of a frame to only one transmission slot.

### Claim 11 (depends on 1)

A method according to claim 1 wherein at least one of said packets comprises redundant data.

### Claim 12 (depends on 11)

A method according to claim 11 comprising preferentially scheduling packets comprising redundant data in an available network path having a highest packet loss rate.

### Claim 13 (depends on 1)

A method according to claim 1 where the transmission delay on a path k depends on the average amount of time required by a source node to transmit a packet in path k.

### Claim 14 (depends on 1)

A method according to claim 1 where the transmission delay on a path k depends on the average amount of time it takes a packet p to be transmitted from source to destination and the average amount of time required by a source node to transmit a packet in path k.

### Claim 15 (depends on 1)

A method according to claim 1 where one or both of a start time or end time for transmitting packets for a frame through one path differs from the start time or end time for transmitting packets for the frame through others of said multiple paths.

### Claim 16 (depends on 1)

A method according to claim 1 further comprising modelling the transmission delay for a network path k as a discrete valued variable.

### Claim 17

A method of transmitting data between a source node and destination node connected via multiple paths of a heterogeneous network, said method comprising:
dividing said data into frames, each frame comprising a number of packets N, 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<p and wherein at least one of said packets comprises redundant data;
allocating, for each network path k, a number of sequential transmission slots s, each for transmitting a given packet p of said frame;
providing a set D of possible assignments x of packets to transmission slots for a frame including preferentially scheduling packets comprising redundant data in the available network path having a highest packet loss rate;
determining an assignment x with minimum in-order delivery delay of said packets; and
transmitting said packets in accordance with said determined assignment x.

### Claim 18 (depends on 17)

A method according to claim 17 comprising periodically determining which of said multiple paths has the highest packet loss rate.
