IP Library Granted Patent US 9,497,282
Granted Patent B2
US 9,497,282 · App. 14/470,788 · Granted Nov 15, 2016

Network coding for content-centric network

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,497,282
App. No.
14/470,788
Granted
Nov 15, 2016
Kind
B2
Abstract

One embodiment of the present invention provides a system for facilitating network coding in an information centric network. During operation, the system sends, from a content consumer node, one or more interests for a plurality of chunks associated with a content object. A respective interest indicates the corresponding chunk using a hierarchically structured variable length identifier which comprises contiguous name components ordered from a most general level to a most specific level. In response, the system then receives a number of network-coded data packets, wherein a respective data packet corresponds to an independent linear combination of all the chunks for the content object. The system subsequently re-constructs the content object based on the received data packets.

Claims (24)

1. A computer-executable method for facilitating network coding in an information centric network, the method comprising:

sending, from a content consumer node, one or more interests for a plurality of chunks associated with a content object, wherein a respective interest indicates the corresponding chunk using a hierarchically structured variable length identifier which comprises contiguous name components ordered from a most general level to a most specific level,

wherein the identifier includes a name component which indicates whether the corresponding interest is a retry interest;

in response, receiving a number of network-coded data packets, wherein a respective data packet corresponds to an independent linear combination of all the chunks for the content object; and

re-constructing the content object based on the received data packets, which involves:

determining that at least one more data packet is needed for re-constructing a missing chunk; and

sending a first retry interest which indicates the missing chunk.

2. The method of claim 1 , wherein sending the first retry interest is in response to determining that the corresponding missing chunk has not been seen by the content consumer node and that a previous pending interest for the corresponding missing chunk has timed out.

3. The method of claim 1 , wherein the hierarchically structured variable length identifier includes a component which indicates use of network coding and a number of chunks for the content object.

4. The method of claim 1 , wherein a name for the first retry interest includes a name component which indicates that the corresponding interest is a retry interest.

5. The method of claim 1 , wherein the hierarchically structured variable length identifier includes a component which indicates one or more chunks that have already been re-constructed.

6. A computer system for facilitating network coding in an information centric network, the computer system comprising:

a processor; and

a storage device storing instructions that when executed by the processor cause the processor to perform a method, the method comprising:

sending, from a content consumer node, one or more interests for a plurality of chunks associated with a content object, wherein a respective interest indicates the corresponding chunk using a hierarchically structured variable length identifier which comprises contiguous name components ordered from a most general level to a most specific level,

wherein the identifier includes a name component which indicates whether the corresponding interest is a retry interest; and

in response, receiving a number of network-coded data packets, wherein a respective data packet corresponds to an independent linear combination of all the chunks for the content object; and

re-constructing the content object based on the received data packets, which involves:

determining that at least one more data packet is needed for re-constructing a missing chunk; and

sending a first retry interest which indicates the missing chunk.

7. The computer system of claim 6 , wherein sending the first retry interest is in response to determining that the corresponding missing chunk has not been seen by the content consumer node and that a previous pending interest for the corresponding missing chunk has timed out.

8. The computer system of claim 6 , wherein the hierarchically structured variable length identifier includes a component which indicates use of network coding and a number of chunks for the content object.

9. The computer system of claim 6 , wherein a name for the first retry interest includes a name component which indicates that the corresponding interest is a retry interest.

10. The computer system of claim 6 , wherein the hierarchically structured variable length identifier includes a component which indicates one or more chunks that have already been re-constructed.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 14, 2017
From: PALO ALTO RESEARCH CENTER INCORPORATED
To: CISCO SYSTEMS, INC.
Reel/Frame 041714/0373 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 14, 2017
From: CISCO SYSTEMS, INC.
To: CISCO TECHNOLOGY, INC.
Reel/Frame 041715/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 28, 2014
From: KURIHARA, JUN; UZUN, ERSIN; GARCIA-LUNA-ACEVES, JOSE J.
To: PALO ALTO RESEARCH CENTER INCORPORATED
Reel/Frame 033634/0340 →