In an example, there is disclosed a computing apparatus, having one or more logic elements, including at least one hardware logic element, comprising a network-aware data repair engine to compute a feasible repair log for n fragments of an original data structure, comprising: receiving a predictive
In an example, there is disclosed a computing apparatus, having one or more logic elements, including at least one hardware logic element, comprising a network-aware data repair engine to compute a feasible repair log for n fragments of an original data structure, comprising: receiving a predictive failure scenario; identifying at least one repair ξi for the failure scenario; determining that ξi is feasible; and logging ξi to a feasible repair log. When a node failure occurs, a network cost may be computed for each repair in the feasible repair log, and an optimal repair may be selected.
대표청구항▼
1. A computing apparatus, comprising: one or more logic elements, including at least one hardware logic element, comprising a network-aware data repair engine to compute a feasible repair log for n fragments of an original data structure, comprising:receiving a predictive failure scenario;identifyin
1. A computing apparatus, comprising: one or more logic elements, including at least one hardware logic element, comprising a network-aware data repair engine to compute a feasible repair log for n fragments of an original data structure, comprising:receiving a predictive failure scenario;identifying at least one repair ξi for the predictive failure scenario;determining that ξi is a feasible repair to the predictive failure scenario; andlogging ξi to a feasible repair log only if ξi is (a) determined to be a feasible repair to the predictive failure scenario and (b) potentially a lowest-cost repair;wherein ξi is not logged in the feasible repair log if ξi is not determined to be a feasible repair or ξi is not a potentially a lowest-cost repair option. 2. The computing apparatus of claim 1, wherein the n fragments of the original data structure comprise an erasure encoded transformation. 3. The computing apparatus of claim 2, wherein determining that ξi is feasible comprises determining that ξi retains the maximum distance separating (MDS) property. 4. The computing apparatus of claim 1, wherein the network-aware data repair engine is further to react to a failure event, comprising: computing a network cost for at least two repairs ξ of the feasible repair log; andselecting an optimal repair ξo. 5. The computing apparatus of claim 4, wherein selecting the optimal repair comprises identifying a repair with a least weighted network cost. 6. The computing apparatus of claim 1, wherein the network-aware data repair engine is to determine that a repair is a potentially lowest-cost repair, comprising sorting surviving nodes in increasing order of repair bandwidth and assigning more fragment transfers to less costly nodes. 7. The computing apparatus of claim 1, wherein the network-aware data repair engine is to operate on random linear network codes (RLNC) and is to determine that a repair is a potentially lowest-cost repair, comprising considering only repairs wherein a total bandwidth transferred by any L nodes is equal to a size of fragments to be used in the repair. 8. The computing apparatus of claim 1, wherein the computing apparatus is a predictive repair appliance. 9. A method of performing network-aware data repairs to compute a feasible repair log for n fragments of an original data structure, comprising: receiving a predictive failure scenario;identifying at least one repair ξi for the predictive failure scenario;determining that ξi is a feasible repair to the predictive failure scenario; andlogging ξi to a feasible repair log only if ξi is (a) determined to be a feasible repair to the predictive failure scenario and (b) potentially a lowest-cost repair;wherein ξi is not logged in the feasible repair log if ξi is not determined to be a feasible repair or ξi is not a potentially a lowest-cost repair option. 10. The method of claim 9, wherein the n fragments of the original data structure comprise an erasure encoded transformation. 11. The method of claim 10, wherein determining that ξi is feasible comprises determining that ξi retains the maximum distance separating (MDS) property. 12. The method of claim 9, further comprising: computing a network cost for at least two repairs ξ of the feasible repair log; andselecting an optimal repair ξo. 13. The method of claim 12, wherein selecting the optimal repair comprises identifying a repair with a least weighted network cost. 14. The method of claim 9, wherein the network-aware data repair engine is to determine that a repair is a potentially lowest-cost repair, comprising sorting surviving nodes in increasing order of repair bandwidth and assigning more fragment transfers to less costly nodes. 15. The method of claim 9, wherein the network-aware data repair engine is to operate on random linear network codes (RLNC) and is to determine that a repair is a potentially lowest-cost repair, comprising considering only repairs wherein a total bandwidth transferred by any L nodes is equal to a size of fragments to be used in the repair. 16. One or more tangible, non-transitory computer-readable storage mediums having stored thereon executable instructions for performing network-aware data repairs to predictively compute a feasible repair log for n fragments of an original data structure, comprising: receiving a predictive failure scenario;identifying at least one repair ξi for the predictive failure scenario;determining that ξi is a feasible repair to the predictive failure scenario; andlogging ξi to a feasible repair log only if ξi is (a) determined to be a feasible repair to the predictive failure scenario and (b) potentially a lowest-cost repair;wherein ξi is not logged in the feasible repair log if ξi is not determined to be a feasible repair or ξi is not a potentially a lowest-cost repair option. 17. The one or more tangible, non-transitory computer-readable storage mediums of claim 16, wherein the n fragments of the original data structure comprise an erasure encoded transformation. 18. The one or more tangible, non-transitory computer-readable storage mediums of claim 17, wherein determining that ξi is feasible comprises determining that ξi retains the maximum distance separating (MDS) property.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (216)
Anderson, Michael H.; Mann, Sarah, Accelerated erasure coding system and method.
Pangal,Gururaj; Schmitz,Michael B.; Ravindran,Vinodh; McClanahan,Edward D., Apparatus and method for data virtualization in a storage processing device.
Smith Ralph S. (Forest Grove OR) Kruegeer William J. (Redmond WA), Apparatus and method for enabling a network interface to dynamically assign an address to a connected computer and to es.
Coronado,Juan A.; Kalos,Matthew J.; Nordahl,Donald M.; Ripberger,Richard A., Apparatus and method to control access to logical volumes using parallel access volumes.
McGrath, Michael P.; Hicks, Matthew; Wiest, Thomas; McPherson, Daniel C., Application partitioning in a multi-tenant platform-as-a-service environment in a cloud computing system.
Molloy,Christopher L; Quesenberry,Gary M; Robinson,Robert, Automatic data interpretation and implementation using performance capacity management framework over many servers.
Mestery, Kyle Andrew Donald; Chang, David; Anantha, Murali, Automatically scaled network overlay with heuristic monitoring in a hybrid cloud environment.
Dupont, Laurent; Charnock, Elizabeth B.; Roberts, Steve; Amesefe, Eli Yawo; Schon, Keith Eric; Oehrle, Richard Thomas, Continuous anomaly detection based on behavior modeling and heterogeneous information analysis.
Dasu, Santa; Pitta, Srinivas; Talagadadeevi, Venkata Ramana, Diagnosis and throughput measurement of fibre channel ports in a storage area network environment.
Brendel, Juergen; Marino, Christopher C.; Amor, Patrick; Kothari, Pritesh, Fully distributed routing over a user-configured on-demand virtual network for infrastructure-as-a-service (IaaS) on hybrid cloud networks.
Rosset, Sebastien T.; Kewalram, Suresh Kumar, Hybrid fibre channel storage with end-to-end storage provisioning and external connectivity in a storage area network environment.
St. Pierre Edgar J. ; Gill Alton ; Mutalik Madhav ; Wallace John, Method and apparatus for backing up data before updating the data and for restoring from the backups.
Hilla Stephen C. ; Edwards James M. ; Masterson Timothy F. ; Jennings William E., Method and apparatus for generating error detection data for encapsulated frames.
Gross, Danny Brice; O'Donnell, Michael Douglas; Borgeson, Brian L., Method and apparatus for simultaneous online access of volume-managed data storage.
Aamer Latif ; Rodney N. Mullendore ; Joseph L. White ; Brian Y. Uchino, Method and apparatus for transferring data between IP network devices and SCSI and fibre channel devices over an IP network.
Head, Michael R.; Kochut, Andrzej; Schulz, Charles O.; Shaikh, Hidayatullah H., Method and system for abstracting non-functional requirements based deployment of virtual machines.
Cabrera, Luis Felipe; Oltean, Paul; Golds, David P.; Steiner, Stefan R., Method and system for providing common coordination and administration of multiple snapshot providers.
Gunlock, Richard D.; Burris, Dustin D., Method for recovery of paths between storage area network nodes with probationary period and desperation repair.
Williams, Brent Ashley; Abel, John; Nolan, Keith Matthew; Palermo, Keith; Demarest, Scott, Method of regulating a flow of data in a communication system and apparatus therefor.
Pesola, Troy Raymond; Kavuri, Ravi Kumar; Booth, Michael W., Method, system, and product for maintaining within a virtualization system a historical performance database for physical devices.
Chandrasekaran, Varagur V.; Sivakolundu, Ramesh; Fong, Dennis Kai-Fat, Methods and apparatus for implementing exchange management for virtualization of storage within a storage area network.
Chandrasekaran, Varagur V.; Sivakolundu, Ramesh; Fong, Dennis Kai-Fat, Methods and apparatus for implementing exchange management for virtualization of storage within a storage area network.
Bramhall, Walter; Dekoning, Rodney A.; Delaney, William P.; Jantz, Ray, Methods and apparatus for seamless firmware update and propagation in a dual raid controller system.
Jayaraman, Raja; Rizzo, James A.; Chandra, Rakesh; Velayudhan, Vinu; Nguyen, Phillip V., Methods and structure for load balancing of background tasks between storage controllers in a clustered storage environment.
Sharma, Samar; Gai, Silvano; Dutt, Dinesh; Kumar, Sanjaya; Mahajan, Umesh, Mirroring mechanisms for storage area networks and network based virtualization.
Igarashi,Yoichiro; Yamamura,Shinya; Kakemizu,Mitsuaki; Murata,Kazunori; Wakamoto,Masaaki, Network system with dynamic service profile updating functions.
Bono, Jean-Pierre; Corniquet, Frederic; de Forest, Miles A.; Tummala, Himabindu; Forrester, Walter C., Providing multi-tenancy within a data storage apparatus.
Young Paul R. (Cromwell CT) Solari Peter L. (Lebanon CT) Shumski Gregory J. (Colchester CT) So Yin Cheung (Fremont CA), Redundant array of solid state memory devices.
Yanai, Moshe; Vishlitzky, Natan; Alterescu, Bruno; Castel, Daniel D. C.; Shklarsky, Gadi G., Remote data mirroring system using local and remote write pending indicators.
Norman Robert D. (San Jose CA) Lofgren Karl M. J. (Newport Beach CA) Stai Jeffrey D. (Placentia CA) Gupta Anil (Irvine CA) Mehrotra Sanjay (Milpitas CA), Solid state memory system including plural memory chips and a serialized bus.
Blumenau Steven M. ; Raz Yoav, Storage mapping and partitioning among multiple host processors in the presence of login state changes and host controller replacement.
Reuter, James M.; St. Martin, Andrew C.; Wrenn, Richard F., Structure and process for distributing SCSI LUN semantics across parallel distributed components.
Gottumukkula, Aditya; Kadam, Vishal P.; Balakrishnan, Nivetha; Bhat, Rohit G., System and method for dynamic maintenance of fabric subsets in a network.
Kirschner, Wesley A.; Sisson, Robert W.; Hurd, John A.; Jacobson, Gary S., System and method for efficient uncorrectable error detection in flash memory.
Andreasson,Eva, System and method for garbage collection in a computer system, which uses reinforcement learning to adjust the allocation of memory space, calculate a reward, and use the reward to determine further .
Swanson,Sheldon Keith John; MacQueen,Kenneth Glenn, System and method for managing configurable elements of devices in a network element and a network.
Chang, David Wei-Shen; Patra, Abhijit; Bagepalli, Nagaraj A.; Anantha, Murali; Zhang, Jason Zhen, System and method for migrating application virtual machines in a network environment.
Kedem Nadav,ILX ; Bitner Haim,ILX, System and method for reconstructing data associated with protected storage volume stored in multiple modules of back-up mass data storage facility.
Prahlad,Anand; Kavuri,Srinivas; Madeira,Andre Duque; Lunde,Norman R.; Bunte,Alan G.; May,Andreas; Schwartz,Jeremy, Systems and methods for generating a storage-related metric.
Lagar-Cavilla, Horacio Andres; Bryant, Roy; Hiltunen, Matti; Irzak, Olga; Joshi, Kaustubh; Scannell, Adin Matthew; Tumanov, Alexey; de Lara, Eyal, Tagging a copy of memory of a virtual machine with information for fetching of relevant portions of the memory.
Mukkara, Umasankar; Xavier, Felix; Balaram, Srivibhavan; Bam, Shailesh, Techniques for providing tenant based storage security and service level assurance in cloud storage environment.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.