Presentation 2013-07-25
A Consideration on Modeling and Optimality of Regenerating Codes Considering Security of Shares
Takahiro YOSHIDA, Hajime JINUSHI, Toshiyasu MATSUSHIMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We consider regenerating codes. Regenerating codes are a class of codes for distributed storage systems that enable a data collector to recover the original data by connecting to any k of n storage nodes, and also can repair a failed node by downloading data from any d (≧=k) nodes. In regenerating codes, there exists a tradeoff between the storage size of each node and repair-bandwidth. In this study, we define two classes of regenerating codes considering security of each node's share, and show that the regenerating codes, which was proposed by Rashmi, Shah and Kumar, achieve the minimum storage size and repair-bandwidth for our class of regenerating codes.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Distributed storage / node repair / regenerating codes / storage / repair-bandwidth
Paper # IT2013-16
Date of Issue

Conference Information
Committee IT
Conference Date 2013/7/18(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Consideration on Modeling and Optimality of Regenerating Codes Considering Security of Shares
Sub Title (in English)
Keyword(1) Distributed storage
Keyword(2) node repair
Keyword(3) regenerating codes
Keyword(4) storage
Keyword(5) repair-bandwidth
1st Author's Name Takahiro YOSHIDA
1st Author's Affiliation Faculty of Commerce, Yokohama College of Commerce()
2nd Author's Name Hajime JINUSHI
2nd Author's Affiliation College of Science and Engineering, Aoyama Gakuin University
3rd Author's Name Toshiyasu MATSUSHIMA
3rd Author's Affiliation Department of Applied Mathematics, Waseda University
Date 2013-07-25
Paper # IT2013-16
Volume (vol) vol.113
Number (no) 153
Page pp.pp.-
#Pages 6
Date of Issue