Form of presentation | Articles in international journals and collections |
Year of publication | 2015 |
Язык | английский |
|
Pleshhinskiy Nikolay Borisovich, author
Tumakov Dmitriy Nikolaevich, author
|
|
Tormasov Aleksandr Gennadevich, author
|
Bibliographic description in the original language |
Pleshchinskii N., Tormasov A., Tumakov D. Analysis of the fault tolerance of the distributed data storage with controlled redundancy // Applied Mathematical Sciences. – 2015. – Vol. 9, No. 141. – P. 7011-7025. |
Annotation |
Distributed data storages built on the (N,k) threshold scheme (modification of erasure codes) are considered. Storages are represented as two-level trees. An expression for the probability of a complete failure of such systems is received. Dependencies of the failure probability on the value of k, total number of nodes and probability of a single node failure are researched. An approximate formula for calculating the probability of a complete failure event in a large number of nodes is obtained. |
Keywords |
Distributed data storages, (N,k) threshold scheme, Fault tolerance |
The name of the journal |
Applied Mathematical Sciences
|
URL |
http://www.m-hikari.com/ams/ams-2015/ams-141-144-2015/59572.html |
Please use this ID to quote from or refer to the card |
https://repository.kpfu.ru/eng/?p_id=123131&p_lang=2 |
Full metadata record |
Field DC |
Value |
Language |
dc.contributor.author |
Pleshhinskiy Nikolay Borisovich |
ru_RU |
dc.contributor.author |
Tumakov Dmitriy Nikolaevich |
ru_RU |
dc.contributor.author |
Tormasov Aleksandr Gennadevich |
ru_RU |
dc.date.accessioned |
2015-01-01T00:00:00Z |
ru_RU |
dc.date.available |
2015-01-01T00:00:00Z |
ru_RU |
dc.date.issued |
2015 |
ru_RU |
dc.identifier.citation |
Pleshchinskii N., Tormasov A., Tumakov D. Analysis of the fault tolerance of the distributed data storage with controlled redundancy // Applied Mathematical Sciences. – 2015. – Vol. 9, No. 141. – P. 7011-7025. |
ru_RU |
dc.identifier.uri |
https://repository.kpfu.ru/eng/?p_id=123131&p_lang=2 |
ru_RU |
dc.description.abstract |
Applied Mathematical Sciences |
ru_RU |
dc.description.abstract |
Distributed data storages built on the (N,k) threshold scheme (modification of erasure codes) are considered. Storages are represented as two-level trees. An expression for the probability of a complete failure of such systems is received. Dependencies of the failure probability on the value of k, total number of nodes and probability of a single node failure are researched. An approximate formula for calculating the probability of a complete failure event in a large number of nodes is obtained. |
ru_RU |
dc.language.iso |
ru |
ru_RU |
dc.subject |
Distributed data storages |
ru_RU |
dc.subject |
(N |
ru_RU |
dc.subject |
k) threshold scheme |
ru_RU |
dc.subject |
Fault tolerance |
ru_RU |
dc.title |
Analysis of the fault tolerance of the distributed data storage with controlled redundancy |
ru_RU |
dc.type |
Articles in international journals and collections |
ru_RU |
|