Systems and methods for storage shuffling techniques to download content to a file

• US 20070204115A1
• Filed: 06/29/2006
• Published: 08/30/2007
• Est. Priority Date: 02/28/2006
• Status: Abandoned Application

• Current Assignee: Verizon Patent and Licensing Incorporated (Verizon Communications Inc.)
• Original Assignee: Maven Networks, Inc. (theMaven, Inc.)
• Inventors: Abramson, Nathan
• Application Number:
  US11/477,891
• Publication Number:
  US 20070204115A1
• Time in Patent Office: Days
• US Class Current: 711/154
• CPC Class Codes: H04L 67/02 based on web technology, e.g. hypertext transfer protocol [HTTP]
• CPC Class Codes: H04L 67/06 specially adapted for file transfer, e.g. file transfer protocol [FTP]
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1068 Discovery involving direct consultation or announcement among potential requesting and potential source peers
• CPC Class Codes: H04L 67/1076 Resource dissemination mechanisms or network resource keeping policies for optimal resource availability in the overlay network
• CPC Class Codes: H04L 67/108 characterised by resources being split in blocks or fragments
• CPC Class Codes: H04L 67/1091 Interfacing with client-server systems or between P2P systems

Abstract

The present invention provides a comprehensive development platform and client-side technology for intelligent and cost-effective delivery of video, audio and broadband content over a network, such as the Internet, to desktop, mobile computing, and network connected devices. In one embodiment of the present invention, an intelligent delivery system (IDS) uses a storage shuffling technique to efficiently store to a target file segments of downloaded content received in a random order from a content source. The IDS shuffles the randomly received content segments as they are received in allocated ordered physical piece positions of the target file such that at any point during the download, the target file does not need to be larger than the cumulative size of the content segments currently downloaded or received. Additionally, each received content segment only needs a small, bounded amount of processing at any point during the download. Upon receipt of the last of the randomly received content segments, the IDS has shuffled or otherwise provides the target file with all the content segments in the correct order as desired. As such, the IDS reduces download performance degradation due to large media files and disk swapping from using virtual memory.

Claims

1. A method for storing segments of downloaded content received in a random order to a storage, the method comprising the steps of:

(a) receiving a content segment of a plurality of content segments representing content downloaded from a content source, the first content segment associated with a segment position identifier identifying an ordered position of the content segment within the content,

(a) allocating a next available physical location of a portion of storage providing a plurality of ordered physical locations for storing the plurality of content segments;

(b) determining via the segment position identifier that the ordered position of the content segment within the content is greater than an ordered location of the next available physical location within the storage; and

(c) storing the content segment to the next available physical location in storage.

2. The method of claim 1, comprising the steps of:

(e) determining via the segment position identifier that the ordered position of the content segment within the content is less than the ordered location of the next available physical location within the storage;

(f) storing in the next available physical location a previously received content segment stored in the ordered physical location of storage corresponding to the ordered position of the content segment within the content; and

(g) storing the content segment to the ordered physical location of storage corresponding to the ordered position of the content segment within the content;

3. The method of claim 1, wherein step (b) comprises the steps of:

(b-a) determining a previously stored content segment is associated with an ordered position within the content segment corresponding to the ordered physical location of the next available physical location; and

(b-b) moving the previously stored content segment to the next available physical location.

4. The method of claim 1, comprising receiving the plurality of content segments in random order.

5. The method of claim 4, comprising storing each of the received plurality of content segments in one of the next available physical location or a previously allocated physical location of storage.

6. The method of claim 5, comprising rearranging each of the received plurality of content segments in allocated ordered physical locations of storage, wherein a number of ordered physical locations of storage allocated is equal to a number of content segments received.

7. The method of claim 1, wherein step (b) comprises allocating a size of the next available physical location equal to a size of the content segment.

8. The method of claim 1, comprising receiving content segments of equal size.

9. The method of claim 8, comprising receiving a last content segment of the plurality of content segments set to a size of one of less than or equal to the equal size.

10. The method of claim 1, comprising allocating the next available physical location adjacent to a previously allocated physical location.

11. The method of claim 1, wherein the storage comprises one of a file, a memory element, or a data structure.

12. A client for storing segments of downloaded content received in a random order to a storage, the client comprising:

means for receiving a content segment of a plurality of content segments representing content downloaded from a content source, the content segment associated with a segment position identifier identifying an ordered position of the content segment within the content,

means for allocating a next available physical location of a portion of storage providing a plurality of ordered physical locations for storing the plurality of content segments;

means for determining via the segment position identifier that the ordered position of the content segment within the content is greater than an ordered location of the next available physical location within the storage; and

means for storing the content segment to the next available physical location in storage.

13. The client of claim 12, comprising:

means for determining via the segment position identifier that the ordered position of the content segment within the content is less than the ordered location of the next available physical location within the storage;

means for storing in the next available physical location a previously received content segment stored in the ordered physical location of storage corresponding to the ordered position of the content segment within the content; and

means for storing the content segment to the ordered physical location of storage corresponding to the ordered position of the content segment within the content;

14. The client of claim 12, comprising:

means for determining a previously stored content segment is associated with an ordered position within the content segment corresponding to the ordered physical location of the next available physical location; and

means for moving the previously stored content segment to the next available physical location.

15. The client of claim 12, comprising means for receiving the plurality of content segments in random order.

16. The client of claim 15, comprising means for storing each of the received plurality of content segments in one of the next available physical location or a previously allocated physical location of storage.

17. The client of claim 16, comprising means for rearranging each of the received plurality of content segments in allocated ordered physical locations of storage, wherein a number of ordered physical locations of storage allocated is equal to a number of content segments received.

18. The client of claim 12, wherein the means for allocating comprises allocating a size of the next available physical location equal to a size of the content segment.

19. The client of claim 12, comprising means for providing content segments of equal size.

20. The client of claim 19, comprising means for providing a last content segment of the plurality of content segments set to a size of one of less than or equal to the equal size.

21. The client of claim 12, comprising means for allocating the next available physical location adjacent to a previously allocated physical location.

22. The client of claim 12, wherein the storage comprises one of a file, a memory element, or a data structure.