Current studentsExisting staffContact us
 

Repair topology design for distributed storage systems

Simple item page
dc.contributor.authorYu, Q.
dc.contributor.authorSung, C.W.
dc.contributor.authorChan, T.H.
dc.contributor.conference2012 IEEE International Conference on Communications workshop (ICC'12 WS) : emerging data storage technologies (10 Jun 2012 - 15 Jun 2012 : Ottawa, Canada)
dc.date.issued2012
dc.description.abstractIn a heterogenous networking environment, a new practical distributed storage model is defined by introducing the concepts of repair topology and retrieval sets. How to repair a failed storage node so as to minimize the system repair cost is investigated. It is shown that the repair cost minimization problem can be decomposed into a combinatorial problem and an integer linear programming problem. Moreover, a heuristic algorithm to find suboptimal repair topologies is given.
dc.identifier.citation2013 National Conference on Communications, NCC 2013, 2012, pp.7009-7013
dc.identifier.doi10.1109/ICC.2012.6364721
dc.identifier.isbn9781457720529
dc.identifier.issn1550-3607
dc.identifier.urihttps://hdl.handle.net/1959.8/135880
dc.language.isoen
dc.publisherIEEE
dc.publisher.placeUS
dc.relation.fundingUniversity Grants Committee of the Hong Kong Special Administrative Region Project no. AoE/E-02/08
dc.relation.ispartofseriesIEEE International Conference on Communications
dc.rightsCopyright 2012 IEEE
dc.source.urihttps://doi.org/10.1109/ICC.2012.6364721
dc.subjectcombinatorial problem
dc.subjectdistributed storage systems
dc.subjectheterogenous networking environment
dc.subjectheuristic algorithm
dc.subjectinteger linear programming
dc.subjectrepair topology design
dc.subjectretrieval sets
dc.titleRepair topology design for distributed storage systems
dc.typeConference paper
pubs.publication-statusPublished
ror.mmsid9915909763101831

Files

Collections