To reduce the time required to complete the regeneration process of erasure codes, we propose a Tree-structured Parallel Regeneration (TPR) scheme for multiple data losses in distributed storage systems. Under the sch...To reduce the time required to complete the regeneration process of erasure codes, we propose a Tree-structured Parallel Regeneration (TPR) scheme for multiple data losses in distributed storage systems. Under the scheme, two algorithms are proposed for the construction of multiple regeneration trees, namely the edge-disjoint algorithm and edge-sharing algorithm. The edge-disjoint algorithm constructs multiple independent trees, and is simple and appropriate for environments where newcomers and their providers are distributed over a large area and have few intersections. The edge-sharing algorithm constructs multiple trees that compete to utilize the bandwidth, and make a better utilization of the bandwidth, although it needs to measure the available band-width and deal with the bandwidth changes; it is therefore difficult to implement in practical systems. The parallel regeneration for multiple data losses of TPR primarily includes two optimizations: firstly, transferring the data through the bandwidth optimized-paths in a pipe-line manner; secondly, executing data regeneration over multiple trees in parallel. To evaluate the proposal, we implement an event-based simulator and make a detailed comparison with some popular regeneration methods. The quantitative comparison results show that the use of TPR employing either the edge-disjoint algorithm or edge-sharing algorithm reduces the regeneration time significantly.展开更多
In distributed cloud storage systems, inevitably there exist multiple node failures at the same time. The existing methods of regenerating codes, including minimum storage regenerating(MSR) codes and minimum bandwidth...In distributed cloud storage systems, inevitably there exist multiple node failures at the same time. The existing methods of regenerating codes, including minimum storage regenerating(MSR) codes and minimum bandwidth regenerating(MBR) codes, are mainly to repair one single or several failed nodes, unable to meet the repair need of distributed cloud storage systems. In this paper, we present locally minimum storage regenerating(LMSR) codes to recover multiple failed nodes at the same time. Specifically, the nodes in distributed cloud storage systems are divided into multiple local groups, and in each local group(4, 2) or(5, 3) MSR codes are constructed. Moreover, the grouping method of storage nodes and the repairing process of failed nodes in local groups are studied. Theoretical analysis shows that LMSR codes can achieve the same storage overhead as MSR codes. Furthermore, we verify by means of simulation that, compared with MSR codes, LMSR codes can reduce the repair bandwidth and disk I/O overhead effectively.展开更多
Erasure code is widely used as the redundancy scheme in distributed storage system. When a storage node fails, the repair process often requires to transfer a large amount of data. Regenerating code and hierarchical c...Erasure code is widely used as the redundancy scheme in distributed storage system. When a storage node fails, the repair process often requires to transfer a large amount of data. Regenerating code and hierarchical code are two classes of codes proposed to reduce the repair bandwidth cost. Regenerating codes reduce the amount of data transferred by each helping node, while hierarchical codes reduce the number of nodes participating in the repair process. In this paper, we propose a "sub-code nesting framework" to combine them together. The resulting regenerating hierarchical code has low repair degree as hierarchical code and lower repair cost than hierarchical code. Our code can achieve exact regeneration of the failed node, and has the additional property of low updating complexity.展开更多
While the peripheral nervous system has regenerative ability,restoration of sufficient function remains a challenge.Vimentin has been shown to be localized in axonal growth fronts and associated with nerve regeneratio...While the peripheral nervous system has regenerative ability,restoration of sufficient function remains a challenge.Vimentin has been shown to be localized in axonal growth fronts and associated with nerve regeneration,including myelination,neuroplasticity,kinase signaling in nerve axoplasm,and cell migration;however,the mechanisms regulating its expression within Schwann cell（SC） remain unexplored.The aim of this study was to profile the spatial and temporal expression profile of micro RNA（mi RNA） in a regenerating rat sciatic nerve after transection,and explore the potential role of mi R-138-5 p targeting vimentin in SC proliferation and migration.A rat sciatic nerve transection model,utilizing a polyethylene nerve guide,was used to investigate mi RNA expression at 7,14,30,60,and 90 days during nerve regeneration.Relative levels of mi RNA expression were determined using microarray analysis and subsequently validated with quantitative real-time polymerase chain reaction.In vitro assays were conducted with cultured Schwann cells transfected with mi RNA mimics and assessed for migratory and proliferative potential.The top seven dysregulated mi RNAs reported in this study have been implicated in cell migration elsewhere,and GO and KEGG analyses predicted activities essential to wound healing.Transfection of one of these,mi RNA-138-5 p,into SCs reduced cell migration and proliferation.mi R-138-5 p has been shown to directly target vimentin in cancer cells,and the luciferase assay performed here in rat Schwann cells confirmed it.These results detail a role of mi R-138-5 p in rat peripheral nerve regeneration and expand on reports of it as an important regulator in the peripheral nervous system.展开更多
基金supported by the National Grand Fundamental Research of China (973 Program) under Grant No. 2011CB302601the National High Technology Research and Development of China (863 Program) under GrantNo. 2013AA01A213+2 种基金the National Natural Science Foundation of China under Grant No. 60873215the Natural Science Foundation for Distinguished Young Scholars of Hunan Province under Grant No. S2010J5050Specialized Research Fund for the Doctoral Program of Higher Education under Grant No. 20124307110015
文摘To reduce the time required to complete the regeneration process of erasure codes, we propose a Tree-structured Parallel Regeneration (TPR) scheme for multiple data losses in distributed storage systems. Under the scheme, two algorithms are proposed for the construction of multiple regeneration trees, namely the edge-disjoint algorithm and edge-sharing algorithm. The edge-disjoint algorithm constructs multiple independent trees, and is simple and appropriate for environments where newcomers and their providers are distributed over a large area and have few intersections. The edge-sharing algorithm constructs multiple trees that compete to utilize the bandwidth, and make a better utilization of the bandwidth, although it needs to measure the available band-width and deal with the bandwidth changes; it is therefore difficult to implement in practical systems. The parallel regeneration for multiple data losses of TPR primarily includes two optimizations: firstly, transferring the data through the bandwidth optimized-paths in a pipe-line manner; secondly, executing data regeneration over multiple trees in parallel. To evaluate the proposal, we implement an event-based simulator and make a detailed comparison with some popular regeneration methods. The quantitative comparison results show that the use of TPR employing either the edge-disjoint algorithm or edge-sharing algorithm reduces the regeneration time significantly.
基金supported in part by the National Natural Science Foundation of China (61640006, 61572188)the Natural Science Foundation of Shaanxi Province, China (2015JM6307, 2016JQ6011)the project of science and technology of Xi’an City (2017088CG/RC051(CADX002))
文摘In distributed cloud storage systems, inevitably there exist multiple node failures at the same time. The existing methods of regenerating codes, including minimum storage regenerating(MSR) codes and minimum bandwidth regenerating(MBR) codes, are mainly to repair one single or several failed nodes, unable to meet the repair need of distributed cloud storage systems. In this paper, we present locally minimum storage regenerating(LMSR) codes to recover multiple failed nodes at the same time. Specifically, the nodes in distributed cloud storage systems are divided into multiple local groups, and in each local group(4, 2) or(5, 3) MSR codes are constructed. Moreover, the grouping method of storage nodes and the repairing process of failed nodes in local groups are studied. Theoretical analysis shows that LMSR codes can achieve the same storage overhead as MSR codes. Furthermore, we verify by means of simulation that, compared with MSR codes, LMSR codes can reduce the repair bandwidth and disk I/O overhead effectively.
基金Supported by 973 Project of China (No. 2012CB315803)Research Fund for the Doctoral Program of Higher Education of China (No. 20100002110033)Open research Fund of National Mobile Communications Research Laboratory, Southeast University (No. 2011D11)
文摘Erasure code is widely used as the redundancy scheme in distributed storage system. When a storage node fails, the repair process often requires to transfer a large amount of data. Regenerating code and hierarchical code are two classes of codes proposed to reduce the repair bandwidth cost. Regenerating codes reduce the amount of data transferred by each helping node, while hierarchical codes reduce the number of nodes participating in the repair process. In this paper, we propose a "sub-code nesting framework" to combine them together. The resulting regenerating hierarchical code has low repair degree as hierarchical code and lower repair cost than hierarchical code. Our code can achieve exact regeneration of the failed node, and has the additional property of low updating complexity.
文摘While the peripheral nervous system has regenerative ability,restoration of sufficient function remains a challenge.Vimentin has been shown to be localized in axonal growth fronts and associated with nerve regeneration,including myelination,neuroplasticity,kinase signaling in nerve axoplasm,and cell migration;however,the mechanisms regulating its expression within Schwann cell（SC） remain unexplored.The aim of this study was to profile the spatial and temporal expression profile of micro RNA（mi RNA） in a regenerating rat sciatic nerve after transection,and explore the potential role of mi R-138-5 p targeting vimentin in SC proliferation and migration.A rat sciatic nerve transection model,utilizing a polyethylene nerve guide,was used to investigate mi RNA expression at 7,14,30,60,and 90 days during nerve regeneration.Relative levels of mi RNA expression were determined using microarray analysis and subsequently validated with quantitative real-time polymerase chain reaction.In vitro assays were conducted with cultured Schwann cells transfected with mi RNA mimics and assessed for migratory and proliferative potential.The top seven dysregulated mi RNAs reported in this study have been implicated in cell migration elsewhere,and GO and KEGG analyses predicted activities essential to wound healing.Transfection of one of these,mi RNA-138-5 p,into SCs reduced cell migration and proliferation.mi R-138-5 p has been shown to directly target vimentin in cancer cells,and the luciferase assay performed here in rat Schwann cells confirmed it.These results detail a role of mi R-138-5 p in rat peripheral nerve regeneration and expand on reports of it as an important regulator in the peripheral nervous system.
