The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Mar. 17, 2015

Filed:

Jul. 01, 2013
Applicant:

Avid Technology, Inc., Burlington, MA (US);

Inventors:

Eric C. Peters, Carlisle, MA (US);

Stanley Rabinowitz, Westford, MA (US);

Herbert R. Jacobs, Hudson, NH (US);

Peter J. Fasciano, Natick, MA (US);

Assignee:

Avid Technology, Inc., Burlington, MA (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 12/00 (2006.01); G06F 17/30 (2006.01); G06F 11/10 (2006.01); G06F 11/20 (2006.01); H04N 7/173 (2011.01); H04N 21/218 (2011.01); H04N 21/231 (2011.01); H04N 21/2312 (2011.01); H04N 21/2315 (2011.01); H04N 21/232 (2011.01); H04N 21/239 (2011.01); H04N 21/24 (2011.01); H04N 21/241 (2011.01); H04N 21/262 (2011.01); H04N 21/44 (2011.01); H04N 21/442 (2011.01); H04N 21/472 (2011.01); H04N 21/845 (2011.01); H04L 29/06 (2006.01); H04L 29/08 (2006.01); G06F 11/16 (2006.01);
U.S. Cl.
CPC ...
G06F 17/30194 (2013.01); H04L 67/1002 (2013.01); H04L 67/1029 (2013.01); G06F 11/1076 (2013.01); G06F 11/1662 (2013.01); G06F 11/2094 (2013.01); G06F 11/2097 (2013.01); G06F 17/30215 (2013.01); G06F 17/30781 (2013.01); G06F 2211/1028 (2013.01); H04N 7/17336 (2013.01); H04N 21/2182 (2013.01); H04N 21/23103 (2013.01); H04N 21/23116 (2013.01); H04N 21/2312 (2013.01); H04N 21/2315 (2013.01); H04N 21/232 (2013.01); H04N 21/2393 (2013.01); H04N 21/2396 (2013.01); H04N 21/2405 (2013.01); H04N 21/241 (2013.01); H04N 21/262 (2013.01); H04N 21/44004 (2013.01); H04N 21/442 (2013.01); H04N 21/47202 (2013.01); H04N 21/8456 (2013.01); Y10S 707/99953 (2013.01); Y10S 707/99956 (2013.01); H04L 65/4084 (2013.01); H04L 67/1097 (2013.01);
Abstract

Multiple applications request data from multiple storage units over a computer network. The data is divided into segments and each segment is distributed randomly on one of several storage units, independent of the storage units on which other segments of the media data are stored. At least one additional copy of each segment also is distributed randomly over the storage units, such that each segment is stored on at least two storage units. This random distribution of multiple copies of segments of data improves both scalability and reliability. When an application requests a selected segment of data, the request is processed by the storage unit with the shortest queue of requests. Random fluctuations in the load applied by multiple applications on multiple storage units are balanced nearly equally over all of the storage units. This combination of techniques results in a system which can transfer multiple, independent high-bandwidth streams of data in a scalable manner in both directions between multiple applications and multiple storage units.


Find Patent Forward Citations

Loading…