IP Library Granted Patent US 8,224,868
Granted Patent B2
US 8,224,868 · App. 12/183,559 · Granted Jul 17, 2012

Network coding with last modified dates for P2P web caching

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 8,224,868
App. No.
12/183,559
Granted
Jul 17, 2012
Kind
B2
Abstract

A method may include obtaining a source file at a node in peer-to-peer network and dividing the source file into a plurality of pieces. The pieces of the source file may be encoded using network coding principles. A last-modified-date (LMD) value may be appended to each of the encoded pieces, the LMD value being the same for each of the encoded pieces of the source file. The encoded pieces with the LMD values may be sent to one or more other nodes in the peer-to-peer network.

Claims (29)

1. A method, comprising:

receiving two or more encoded pieces of a source file at a node in a peer-to-peer network, each of the two or more encoded pieces including a last-modified-date (LMD) value;

comparing the LMD values of each of the two or more encoded pieces;

combining at least two of the two or more encoded pieces that have a common LMD value into a new encoded piece;

discarding any encoded pieces that have an LMD value different than the common LMD value; and

appending the common LMD value to the new encoded piece.

2. The method of claim 1 , further comprising:

sending the new encoded piece to another node in the peer-to-peer network.

3. The method of claim 1 , where combining at least two of the two or more encoded pieces that have a common LMD value into a new encoded piece comprises:

forming a new random linear combination of the at least two of the two or more encoded pieces; and

supplying a new encoding vector for the new random linear combination.

4. The method of claim 3 , where the common LMD value is appended to the new encoding vector.

5. A system comprising:

a network node including:

a memory to store a plurality of instructions; and

a processor to execute instructions in the memory to:

receive two or more encoded pieces of a source file, each of the two or more encoded pieces including a last-modified-date (LMD) value;

compare the LMD values of each of the two or more encoded pieces;

combine at least two of the two or more encoded pieces that have a common LMD value into a new encoded piece;

discard any encoded pieces that have an LMD value different than the common LMD value; and

append the common LMD value to the new encoded piece.

6. The system of claim 5 , where the network node is further to:

send the encoded pieces with the common LMD to another network node in a peer-to-peer network.

7. The system of claim 5 , where the network node is further to identify the two or more encoded pieces from a common source file that have a common LMD value.

8. The system of claim 5 , where the network node is further to:

associate an encoding vector with each of the two or more encoded pieces, and append the common LMD value to the encoding vector.

9. The system of claim 5 , where each LMD value includes a date and time value calculated using a Network Time Protocol or a Simple Network Time Protocol.

10. The system of claim 5 , where the network node is further to:

receive the two or more encoded pieces from another node, and determine which of the two or more encoded pieces are current based on LMD values associated with each of the two or more encoded pieces.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 14, 2009
From: VERIZON CORPORATE SERVICES GROUP INC.
To: VERIZON PATENT AND LICENSING INC.
Reel/Frame 023225/0242 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 31, 2008
From: CONWAY, ADRIAN E.
To: VERIZON CORPORATE SERVICES GROUP INC.
Reel/Frame 021324/0101 →