{"title":"Analyzing storage requirements of the resilient information-centric SeDAX architecture","authors":"M. Höfling, C. G. Mills, M. Menth","doi":"10.1109/SmartGridComm.2013.6687975","DOIUrl":null,"url":null,"abstract":"We develop and analyze algorithms that reduce the storage capacity required by SeDAX (Secure Data-centric Application eXtensible) in the presence of simultaneous node failures. The SeDAX infrastructure for smart grids uses data redundancy for a high level of reliability. It is an information-centric approach using resilient data forwarding in a Delaunay triangulated overlay. While SeDAX's data forwarding scheme is well understood, there is no study that considers the SeDAX storage capacity necessary to survive multiple node failures. Our results are compared with the theoretical lower bound of SeDAX and the lower bound of an idealized storage system. The presented algorithms can be used to reduce storage requirements of SeDAX in practice.","PeriodicalId":136434,"journal":{"name":"2013 IEEE International Conference on Smart Grid Communications (SmartGridComm)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Smart Grid Communications (SmartGridComm)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SmartGridComm.2013.6687975","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
We develop and analyze algorithms that reduce the storage capacity required by SeDAX (Secure Data-centric Application eXtensible) in the presence of simultaneous node failures. The SeDAX infrastructure for smart grids uses data redundancy for a high level of reliability. It is an information-centric approach using resilient data forwarding in a Delaunay triangulated overlay. While SeDAX's data forwarding scheme is well understood, there is no study that considers the SeDAX storage capacity necessary to survive multiple node failures. Our results are compared with the theoretical lower bound of SeDAX and the lower bound of an idealized storage system. The presented algorithms can be used to reduce storage requirements of SeDAX in practice.