Methods and systems for content storage

US10924805B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10924805-B2
Application numberUS-201916404560-A
CountryUS
Kind codeB2
Filing dateMay 6, 2019
Priority dateJul 1, 2015
Publication dateFeb 16, 2021
Grant dateFeb 16, 2021

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Provided are methods and systems for reducing content storage space and network resources. A device, such as a network storage device, can receive a plurality of requests to record a content item with varying start times and end times. The network device can map the start time and end time of each request to a subscriber, premises, and/or device. The network device can determine the earliest of the start times associated with the content item and the latest of the end times associated with the content item. In an aspect, the network device can make a recording, starting at the earliest start time and ending at the latest end time.

First claim

Opening claim text (preview).

What is claimed is: 1. A method comprising: receiving a plurality of requests to store a content item, wherein each request of the plurality of requests comprises a requested start-time and a requested end-time; determining, based on the plurality of requests, an earliest requested start-time and a latest requested end-time; generating, based on the earliest requested start-time and the latest requested end-time, a stored content item, wherein the stored content item comprises the earliest requested start-time and the latest requested end-time; receiving, from a user device, a request to view a version of the content item; and sending, to the user device, based on the request to view the version of the content item, the stored content item and associated information, wherein the associated information comprises cropping instructions associated with the requested start-time and the requested end-time. 2. The method of claim 1 , further comprising cropping, based on the associated information, the stored content item. 3. The method of claim 1 , wherein the content item comprises a non-cropped version of the content item. 4. The method of claim 1 , further comprising deleting at least one instance of the content item. 5. The method of claim 1 , wherein the requested end-time is an offset of time after the content item is scheduled to end. 6. The method of claim 1 , wherein the content item comprises video-on-demand content. 7. The method of claim 1 , wherein the requested start-time is an offset of time before the content item is scheduled to start. 8. The method of claim 1 , wherein the user device comprises a set-top box. 9. A system, comprising: a user device configured to: send a plurality of requests to store a content item, wherein each request of the plurality of requests comprises a requested start-time and a requested end-time; send a request to view a version of the content item; receive, based on the request to view the version of the content item, a stored content item and associated information, wherein the associated information comprises cropping instructions associated with the requested start-time and the requested end-time; and a computing device configured to: receive the plurality of requests; determine, based on the plurality of requests, an earliest requested start-time and a latest requested end-time; generate, based on the earliest requested start-time and the latest requested end-time, the stored content item, wherein the stored content item comprises the earliest requested start-time and the latest requested end-time; receive the request to view the version of the content item; and send based on the request to view the content item, the stored content item and the associated information. 10. The system of claim 9 , wherein the stored content item comprises a non-cropped version of the content item. 11. The system of claim 9 , wherein the computing device is further configured to delete at least one instance of the stored content item. 12. The system of claim 9 , wherein the user device comprises a set-top-box. 13. The system of claim 9 , further comprising cropping, by the user device, based on the associated information, the stored content item. 14. The system of claim 9 , wherein the requested start-time is an offset of time before the content item is scheduled to start. 15. A non-transitory computer readable medium storing processor executable instructions that, when executed by at least one processor, cause the at least one processor to: receive, a plurality of requests to store a content item, wherein each request of the plurality of requests comprises a requested start-time and a requested end-time; determine, based on the plurality of requests, an earliest requested start-time and a latest requested end-time; generate, based on the earliest requested start-time and the latest requested end-time, a stored content item, wherein the stored content item comprises the earliest requested start-time and the latest requested end-time; receive a request to view a version of the content item; and send based on the request to view the version of the content item, the stored content item and associated information, wherein the associated information comprises cropping instructions associated with the requested start-time and the requested end-time. 16. The non-transitory computer readable medium of claim 15 , wherein the stored content item comprises a non-cropped version of the content item. 17. The non-transitory computer readable medium of claim 15 , further comprising processor executable instructions that, when executed by the at least one processor, cause the at least one processor to delete at least one instance of the stored content item. 18. The non-transitory computer readable medium of claim 15 , wherein the requested start-time is an offset of time before the content item is scheduled to start. 19. The non-transitory computer readable medium of claim 15 , further comprising processor executable instructions that, when executed by the at least one processor, cause the at least one processor to crop, based on the associated information, the stored content item. 20. An apparatus comprising: one or more processors; and memory storing processor executable instructions that, when executed by the one or more processors, cause the apparatus to: receive a first request to store a content item, wherein the first request comprises a first requested start-time and a first requested end-time; receive a second request to store a content item, wherein the second request comprises a second requested start-time and a second requested end-time; determine, based on the first request and the second request, an earliest requested start-time and a latest requested end-time; store, based on the earliest requested start-time and the latest requested end-time, the content item, wherein the content item comprises the earliest requested start-time and the latest requested end-time; receive a request to view a version of the content item; and send, based on the request to view the version of the content item, the stored content item and associated information, wherein the associated information comprises cropping instructions associated with either of the first request to store the content item or the second request to store the content item.

Assignees

Inventors

Classifications

  • Remote storage of video programmes received via the downstream path, e.g. from the server · CPC title

  • for content reservation or setting reminders; for requesting event notification, e.g. of sport results or stock market (stock exchange data over packet-switching network H04L12/1804; push services over packet-switching network H04L12/1859; notification of incoming messages in packet switching networks H04L51/224) · CPC title

  • Recording operations (recording of a television signal H04N5/76; arrangements for recording or accumulating broadcast information or broadcast-related information H04H60/27) · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10924805B2 cover?
Provided are methods and systems for reducing content storage space and network resources. A device, such as a network storage device, can receive a plurality of requests to record a content item with varying start times and end times. The network device can map the start time and end time of each request to a subscriber, premises, and/or device. The network device can determine the earliest of…
Who is the assignee on this patent?
Comcast Cable Comm Llc
What technology area does this patent fall under?
Primary CPC classification H04N21/47214. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Feb 16 2021 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 7 related publications on this page (citations in our corpus or others sharing the same primary CPC).