US8688859B2ActiveUtilityA1

Network transcoding system

83
Assignee: VECCHIO JOHNPriority: Nov 17, 2008Filed: Jan 25, 2012Granted: Apr 1, 2014
Est. expiryNov 17, 2028(~2.4 yrs left)· nominal 20-yr term from priority
H04N 21/2662H04N 21/2343
83
PatentIndex Score
8
Cited by
7
References
14
Claims

Abstract

The system is a distributed video transcoding system that allows content to be transformed from one digital format to another close to the ingest and delivery points to minimize the time and cost of the transfer between end points. Additionally by making transcoding an integral part of the distribution of content itself, significant efficiencies can be gained. The distribution can be improved by transcoding at different phases of the transfer. Within the system decisions can be made to utilize different transcoding resources based on various business rules and priorities.

Claims

exact text as granted — not AI-modified
We claim: 
     
       1. A system for delivering content comprising:
 a first data center for receiving and optimizing the content and having a plurality of transcoding resources; 
 a second data center at a different geographic location than the first data center, the second data center having a plurality of transcoding resources; and 
 a decision engine coupled to the data center for scheduling and queueing the content for delivery to a service provider and for selecting one of the plurality of transcoding resources to utilize to transcode the content, where the decision engine includes a processor for determining a priority value, an affinity value based on a preference of a transcoder, and a time to transfer the content to an input of the first data center and the second data center, wherein the priority value is determined by a value associated with an owner of the content that is adjusted based on a relative priority of a specific content source, a time required to process the content, a time that the processed content is due at the service provider, a time required to transfer the content to and from the selected transcoding resource, and a current time. 
 
     
     
       2. The system of  claim 1  wherein the decision engine selects the first or second data center based on the scheduling and queueing of the content. 
     
     
       3. A method for delivering content comprising:
 determining, by a processor, a Priority value of the content; 
 determining, by the processor and based on a preference of a given transcoder and a time to transfer the content to an input of the given transcoder, an Affinity value of the content; 
 scheduling, by the processor, the content at a transcoder based on the Priority and Affinity values, wherein the Priority value is determined by a value associated with an owner of the content that is adjusted based on a relative priority of a specific content source, a time required to process the content, a time that the processed content is due at a destination, a time required to transfer the content to and from the transcoder, and a current time. 
 
     
     
       4. The method of  claim 3  wherein the Affinity value is based on a delivery time, a cost to process, and a load balancing of transcoding clusters associated with the content. 
     
     
       5. The method of  claim 4  wherein the transcoding clusters are distributed geographically on a network. 
     
     
       6. The method of  claim 4  wherein the delivery time is dependent on a geographic location of a transcoding cluster. 
     
     
       7. The method of  claim 4  wherein the cost to process is dependent on transcoding resources at a transcoding cluster. 
     
     
       8. The method of  claim 4  wherein the load balancing is dependent on a number of transcoding operations scheduled at a transcoding cluster. 
     
     
       9. A method for delivering content comprising:
 determining, by a processor, a Priority value of the content; 
 determining, by the processor and based on a preference of a given transcoder, an Affinity value of the content; 
 scheduling, by the processor, the content at a transcoder based on the Priority and Affinity values, 
 wherein the Priority value is given by: 
 
       
         
           
             
               Priority 
               = 
               
                 
                   
                     V 
                     Content 
                   
                   
                     min 
                     ⁡ 
                     
                       ( 
                       
                         1 
                         , 
                         
                           
                             T 
                             Due 
                           
                           - 
                           
                             ( 
                             
                               
                                 T 
                                 Now 
                               
                               + 
                               
                                 T 
                                 Proc 
                               
                               + 
                               
                                 T 
                                 Transfer 
                               
                             
                             ) 
                           
                         
                       
                       ) 
                     
                   
                 
                 · 
                 100 
               
             
           
         
         
           
             where 
           
         
         
           
             
               
                 0 
                 < 
                 
                   V 
                   Content 
                 
                 ≤ 
                 1 
               
               , 
             
           
         
         V Content  represents a value associated with an owner of the content and is adjusted based on a relative priority of a specific content source; 
         T Due  is a time that processed content is due at a destination; 
         T Proc  is a time required to process the content; 
         T Transfer  is a time required to transfer the content to and from a transcoding farm; and 
         T Now  is a current time. 
       
     
     
       10. The method of  claim 9  wherein the Affinity value is based on a delivery time, a cost to process, and a load balancing of transcoding clusters associated with the content. 
     
     
       11. The method of  claim 10  wherein the transcoding clusters are distributed geographically on a network. 
     
     
       12. The method of  claim 10  wherein the delivery time is dependent on a geographic location of a transcoding cluster. 
     
     
       13. The method of  claim 10  wherein the cost to process is dependent on transcoding resources at a transcoding cluster. 
     
     
       14. The method of  claim 10  wherein the load balancing is dependent on a number of transcoding operations scheduled at a transcoding cluster.

Cited by (0)

No later patents cite this yet.

References (0)

No backward citations on record.