# US 2020/0128261 A1 · Packetized data communication over multiple unreliable channels

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

- Number: US 2020/0128261 A1
- Document ID: US20200128261A1
- Status: Published application
- Kind: A1
- Application number: 16/699,786
- Filed: 2019-12-02
- Published: 2020-04-23
- Earliest claimed: 2018-03-22
- Assignees: Zixi, LLC
- Applicants: Zixi, LLC
- Inventors: Uri AVNI; Israel DRORI
- Web page: https://patentgrep.com/patent/US20200128261A1

## CPC

- H04N 19/184: the unit being bits, e.g. of the compressed video stream
- H04N 21/6125: {involving transmission via Internet (transmission by internet of broadcast information H04H60/82)}
- H04L 65/611: for multicast or broadcast (systems for broadcast or conference H04L12/18; arrangements for broadcast or distribution combined with broadcast H04H20/00; arrangements for broadcast applications with a direct linkage to broadcast information or to broadcast space-time H04H60/00; selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS], H04W4/06)
- H04L 65/762: {at the source (reformatting of additional data in video distribution servers H04N21/2355)}
- H04L 65/764: {at the destination (reformatting of additional data in video clients H04N21/4355)}
- H04N 19/126: Details of normalisation or weighting functions, e.g. normalisation matrices or variable uniform quantisers
- H04N 19/64: characterised by ordering of coefficients or of bits for transmission
- H04N 21/4381: {Recovering the multiplex stream from a specific network, e.g. recovering MPEG packets from ATM cells (transmission of MPEG streams over ATM H04L12/5601)}
- H04N 21/64322: {IP}
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method comprising: receiving a plurality of duplicates of a serial bit stream, wherein said serial bit stream comprises a sequence of data packets; continuously dividing each of said duplicates of said serial bit stream based on sequential time windows; with respect to each of said time windows, aligning said data packets associated with each of said duplicates of said serial bit stream, received within said time window, based, at least in part, on data packet similarity; and recreating in real time said serial bit stream by selecting at least one of said aligned data packets as representing a next data packet in said sequence of data packets.

## Claims

### Claim 1

A method comprising:
receiving a plurality of duplicates of a serial bit stream, wherein said serial bit stream comprises a sequence of data packets;
continuously dividing each of said duplicates of said serial bit stream based on sequential time windows;
with respect to each of said time windows, aligning said data packets associated with each of said duplicates of said serial bit stream, received within said time window, based, at least in part, on data packet similarity; and
recreating in real time said serial bit stream by selecting at least one of said aligned data packets as representing a next data packet in said sequence of data packets.

### Claim 2 (depends on 1)

The method of claim 1, wherein each of said plurality of duplicates of said serial bit stream is transmitted over a different communication channel.

### Claim 3 (depends on 2)

The method of claim 2, wherein each of said communication channels is selected from the group consisting of: a private IP network, a public IP network, the interne, a global system for mobile communications (GSM) network, a local area network (LAN), a metropolitan area network (MAN), a wide area network (WAN), a wireless network, a satellite communication network, a cellular communication network, a Bluetooth communication channel, and a Wi-Fi network.

### Claim 4 (depends on 1)

The method of claim 1, wherein said aligning comprises arranging said data packets, received within a time window, in columns of an alignment score matrix, based, at least in part, on said data packet similarity, wherein each row in said matrix represents one of said duplicates of said serial bit stream.

### Claim 5 (depends on 4)

The method of claim 4, further comprising assigning an alignment score to each of said columns based on one of data packet gaps and data packet mismatches in said column.

### Claim 6 (depends on 4)

The method of claim 4, wherein, with respect to each column of said matrix, said selecting is based, at least in part, on a consensus determined by data packet similarity of a majority of data packets in said column.

### Claim 7 (depends on 1)

The method of claim 1, wherein said data packet similarity is determined based, at least in part, on a comparison of data packet content, wherein said data packet content is represented by a hash function.

### Claim 8

A system comprising:
at least one hardware processor; and
a non-transitory computer-readable storage medium having program code embodied therewith, the program code executable by said at least one hardware processor to:
receive a plurality of duplicates of a serial bit stream, wherein said serial bit stream comprises a sequence of data packets,
continuously divide each of said duplicates of said serial bit stream based on sequential time windows,
with respect to each of said time windows, align said data packets associated with each of said duplicates of said serial bit stream, received within said time window, based, at least in part, on data packet similarity, and
recreate in real time said serial bit stream by selecting at least one of said aligned data packets as representing a next data packet in said sequence of data packets.

### Claim 9 (depends on 8)

The system of claim 8, wherein each of said plurality of duplicates of said serial bit stream is transmitted over a different communication channel.

### Claim 10 (depends on 9)

The system of claim 9, wherein each of said communication channels is selected from the group consisting of: a private IP network, a public IP network, the interne, a global system for mobile communications (GSM) network, a local area network (LAN), a metropolitan area network (MAN), a wide area network (WAN), a wireless network, a satellite communication network, a cellular communication network, a Bluetooth communication channel, and a Wi-Fi network.

### Claim 11 (depends on 8)

The system of claim 8, wherein said aligning comprises arranging said data packets, received within a time window, in columns of an alignment score matrix, based, at least in part, on said data packet similarity, wherein each row in said matrix represents one of said duplicates of said serial bit stream.

### Claim 12 (depends on 11)

The system of claim 11, wherein said instructions are further executable to assign an alignment score to each of said columns based on one of data packet gaps and data packet mismatches in said column.

### Claim 13 (depends on 12)

The system of claim 12, wherein, with respect to each column of said matrix, said selecting is based, at least in part, on a consensus determined by data packet similarity of a majority of data packets in said column.

### Claim 14 (depends on 8)

The system of claim 8, wherein said data packet similarity is determined based, at least in part, on a comparison of data packet content, wherein said data packet content is represented by a hash function.

### Claim 15

A computer program product comprising a non-transitory computer-readable storage medium having program instructions embodied therewith, the program instructions executable by at least one hardware processor to:
receive a plurality of duplicates of a serial bit stream, wherein said serial bit stream comprises a sequence of data packets;
continuously divide each of said duplicates of said serial bit stream based on sequential time windows;
with respect to each of said time windows, align said data packets associated with each of said duplicates of said serial bit stream, received within said time window, based, at least in part, on data packet similarity; and
recreate in real time said serial bit stream by selecting at least one of said aligned data packets as representing a next data packet in said sequence of data packets.

### Claim 16 (depends on 15)

The computer program product of claim 15, wherein each of said plurality of duplicates of said serial bit stream is transmitted over a different communication channel selected from the group consisting of: a private IP network, a public IP network, the internet, a global system for mobile communications (GSM) network, a local area network (LAN), a metropolitan area network (MAN), a wide area network (WAN), a wireless network, a satellite communication network, a cellular communication network, a Bluetooth communication channel, and a Wi-Fi network.

### Claim 17 (depends on 15)

The computer program product of claim 15, wherein said aligning comprises arranging said data packets, received within a time window, in columns of an alignment score matrix, based, at least in part, on said data packet similarity, wherein each row in said matrix represents one of said duplicates of said serial bit stream.

### Claim 18 (depends on 17)

The computer program product of claim 17, wherein said instructions are further executable to assign an alignment score to each of said columns based on one of data packet gaps and data packet mismatches in said column.

### Claim 19 (depends on 17)

The computer program product of claim 17, wherein, with respect to each column of said matrix, said selecting is based, at least in part, on a consensus determined by data packet similarity of a majority of data packets in said column.

### Claim 20 (depends on 15)

The computer program product of claim 15, wherein said data packet similarity is determined based, at least in part, on a comparison of data packet content, wherein said data packet content is represented by a hash function.
