IP Library Granted Patent US 9,258,084
Granted Patent B2
US 9,258,084 · App. 14/538,793 · Granted Feb 9, 2016

Method and implementation for network coefficents selection

Inventors: Igor Zhovnirnovsky (Newton, MA); Roy Subhash (Lexington, MA)
Assignee: Q FACTOR COMMUNICATIONS CORP.
H04L1/0042H03M13/616H03M13/6502H04L69/16H04W80/06
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,258,084
App. No.
14/538,793
Granted
Feb 9, 2016
Kind
B2
Abstract

A method and apparatus that improves the performance of TCP (and other protocols) in a data network by implementing segmenting the TCP path and implementing a proprietary protocol (DPR™) over the network. The DPR™ protocol provides a multiplexed tunnel for a multiplicity of TCP sessions from a client to a cloud proxy. DPR™ implements congestion management, flow control, reliability, and link monitoring. Other network protocols (such as UDP) are supported with a reliability protocol based upon network coding that improves the transmission reliability. A network and a method for transmitting processes in a network are disclosed, using deterministic coefficients for encoding packets based on network coding principles. Disclosed is a method and implementation for using deterministic coefficients for encoding packets based on network coding principles. The use of deterministic coefficients reduces the need for extra information to be transmitted to recover the lost packets and results in significantly reduced overhead and increased performance, security and reliability.

Claims (14)

1. A method of transmitting blocks of data packets from a source node to a receiver node in a network by way of a coding node, where every coding node generates deterministically without randomness, a vector of reusable coding coefficients using a deterministic function universally known throughout the network topology comprising:

(a) generating at the coding node at system start up, the coding coefficients in a predictable manner through usage of a codebook;

(b) transmitting, from a source node, source processes;

(c) receiving, at the coding node, the source processes for the purpose of implementing downstream reception of the source processes, received from the source nodes;

(d) calculating an output process as a linear combination of the source processes using the vector of coding coefficients;

(e) transmitting the output process from the coding node wherein there is no transmission of the vector of coding coefficients through the network;

(f) receiving, at the receiver node the output process; and

(g) reconstructing the source processes using the vector of coding coefficients pre-generated using the deterministic function that is universally available at every coding node throughout the network topology and the output processes received from the source nodes which are a linear combination of the source processes and coding coefficients, wherein there is no transmission of the vector of coding coefficients through the network; wherein the codebook contains a symbol lookup table for coding and decoding; each symbol having one or more symbols which replace it and wherein all of the decoding nodes have a-priori knowledge of the codebook.

2. The method as in claim 1 wherein the network is an unrestricted topology network.

3. The method as in claim 1 , wherein a code book comprising a plurality of coefficient determining methodologies is resident at said coding node and at said receiver node, and a designation of one of said coefficient determining methodologies is transmitted from said coding node to said receiver node, and said vector of coding coefficients is determined at said coding node and at said receiver node using said designated one of said coefficient determining methodologies.

4. The method as in claim 1 wherein the set of generated coefficients belongs to a finite field.

5. An algorithm used in the method as in claim 1 to generate the N×N coding matrix based on rotating coefficients in the row vector of coefficients by one position and generating extra coefficients as needed by shifting the original row vector by one position in the ordered list.

6. An algorithm used in the method as in claim 1 to reorder a set of coefficients to ensure linear independence of the additionally generated linear equations.

7. A method as in claim 1 of initializing both ends of a link to ensure proper operation to pre-determining the sequence as well as informing the receiver of this choice by a field in the control packet header.

Assignments (7)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 20, 2020
From: INSTART LOGIC, INC.
To: AKAMAI TECHNOLOGIES, INC.
Reel/Frame 052175/0621 →
CORRECTIVE ASSIGNMENT TO CORRECT THE RECEIVING PARTY NAME PREVIOUSLY RECORDED ON REEL 037791 FRAME 0094. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Feb 29, 2016
From: Q FACTOR COMMUNICATIONS CORP
To: Q FACTOR, LLC
Reel/Frame 037953/0531 →
CORRECTIVE ASSIGNMENT TO CORRECT THE CONVEYING PARTY (ASSIGNOR) PREVIOUSLY RECORDED ON REEL 037791 FRAME 0107. ASSIGNOR(S) HEREBY CONFIRMS THE THE CONVEYING PARTY (ASSIGNOR) SHOULD READ: Q FACTOR, LLC. Recorded Feb 29, 2016
From: Q FACTOR, LLC
To: INSTART LOGIC, INC.
Reel/Frame 037958/0297 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 22, 2016
From: Q FACTOR COMMUNICATIONS CORP
To: Q FACTOR
Reel/Frame 037791/0094 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 22, 2016
From: Q FACTOR
To: INSTART LOGIC, INC.
Reel/Frame 037791/0107 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 5, 2015
From: ZHOVNIROVSKY, IGOR; ROY, SUBHASH
To: Q FACTOR COMMUNICATIONS CORP.
Reel/Frame 035977/0839 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 17, 2015
From: ROY, SUBHASH
To: Q FACTOR COMMUNICATIONS CORP.
Reel/Frame 035855/0675 →
Continuity (6)
Continuation PCTUS2013069018 · Nov 7, 2013
Continuation PCTUS2013068820 · Nov 6, 2013
Provisional Application 61724275 · Nov 8, 2012
Provisional Application 61820682 · May 7, 2013
Provisional Application 61867583 · Aug 19, 2013
Related Publication 20150095739A1 · Apr 2, 2015