检索结果-内蒙古大学图书馆

34th IEEE Annual Military Communications Conference (MILCOM) on Leveraging Technology - The Joint Imperative

作者： Bardis, Nikolaos Doukas, Nikolaos Markovskyi, Oleksandr P. Hellen Army Acad Informat LAB Fac Math & Engn Sci Dept Mil Sci Vari 16673 Greece Natl Tech Univ Ukraine Polytech Inst Kiev Dept Comp Engn UA-252056 Kiev Ukraine

ISBN: (纸本)9781509000739

In this work, a method for backup and restoring data is proposed. The data is stored on different remote disks (storage nodes) and temporary or permanent loss of access to any q of them appears. The high efficiency of the proposed method is achieved by using a theoretically proved minimum number of backup storage nodes, which is equal to the number of the disks to which access has been lost. The theoretical justification with a methodology of backup codes and their use for data recovery, which is illustrated by examples, is presented. The theoretical and experimental effectiveness evaluation of the proposed method is demonstrated as well. The proposed method is aimed to ensure a high level of survivability of system of distributed data storage for military applications.

关键词： distributed data storage data recovery codes military applications

来源：评论

学校读者我要写书评

暂无评论

PluriHis : A Highly Scalable Scheme of distributed Historical data storage and Access

PluriHis : A Highly Scalable Scheme of Distributed Historica...

引用

China International Conference on Electricity Distribution (CICED)

作者： Jin Shu Zhang Ying Bai Zhong-He Dong Sheng-Gang Nanjing SAC Metso Control Syst Co Ltd R&D Ctr Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781467390682

Overwhelmed by the massive volume of production data, traditional RDBMS-based historical storage solutions are going burst. A distributed data storage and access mechanism incorporating NoSQL designs is presented trying to solve the problem. With the orchestration of master nodes(2 machines, active-standby), real-time data incoming are routed to be cached on selected nodes to fulfill the load balancing requirements. Real-time data collected will pass two layers of local cache before finally dumped by each PluriHis node. Client modules on PluriHis nodes run in P2P mode and will actually register the name/location of a data point only after the corresponding request is successfully serviced. Master nodes will route all the data requests to the relevant PluriHis nodes and data query and retrieval is supported by NFS-like network file sharing protocol. As Indicated by the benchmark results recorded, PluriHis is a highly capable candidate in implementing the next generation SCADA system with big data support.

关键词： Historical data Production data storage distributed data storage SCADA PluriHis

来源：评论

学校读者我要写书评

暂无评论

Identity-Based Secure distributed data storage Schemes

引用

IEEE TRANSACTIONS ON COMPUTERS 2014年第4期63卷 941-953页

作者： Han, Jinguang Susilo, Willy Mu, Yi Univ Wollongong Ctr Comp & Informat Secur Res Sch Comp Sci & Software Engn Wollongong NSW 2522 Australia Nanjing Univ Finance & Econ Jiangsu Prov Key Lab E Business Nanjing 210003 Jiangsu Peoples R China

Secure distributed data storage can shift the burden of maintaining a large number of files from the owner to proxy servers. Proxy servers can convert encrypted files for the owner to encrypted files for the receiver without the necessity of knowing the content of the original files. In practice, the original files will be removed by the owner for the sake of space efficiency. Hence, the issues on confidentiality and integrity of the outsourced data must be addressed carefully. In this paper, we propose two identity-based secure distributed data storage (IBSDDS) schemes. Our schemes can capture the following properties: (1) The file owner can decide the access permission independently without the help of the private key generator (PKG);(2) For one query, a receiver can only access one file, instead of all files of the owner;(3) Our schemes are secure against the collusion attacks, namely even if the receiver can compromise the proxy servers, he cannot obtain the owner's secret key. Although the first scheme is only secure against the chosen plaintext attacks (CPA), the second scheme is secure against the chosen ciphertext attacks (CCA). To the best of our knowledge, it is the first IBSDDS schemes where an access permission is made by the owner for an exact file and collusion attacks can be protected in the standard model.

关键词： distributed data storage identity-based system access control security

来源：评论

学校读者我要写书评

暂无评论

SmartKV: A cost-effective and low-latency geo-distributed key-value store for the computing continuum

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2025年 171卷

作者： Poveda, Juan Aznar Ebner, Maximilian Franz Fahringer, Thomas Samani, Zahra Najafabadi Etheredge, Marlon Pedratscher, Stefan Saurabh, Nishant Univ Innsbruck Distributed & Parallel Syst Grp Tech Str 21A A-6020 Innsbruck Austria Univ Utrecht Dept Informat & Comp Sci Princetonpl 5 NL-3584 Utrecht Netherlands

Many data-intensive and distributed applications rely on low-latency and scalable key-value storage systems across the Computing Continuum. Key-value storage systems typically use consistent hashing or hash slotsharding mechanisms to distribute data across storage nodes, which ensures load balancing but often leads to sub-optimal response times and monetary costs, particularly in geo-distributed systems where nodes might have different unit prices and be widely dispersed. In this paper, we propose SmartKV, a cost-efficient geodistributed key-value store that optimizes data placement dynamically, abstracting the intricacies of data organization, transfer, access, and processing. SmartKV integrates a decentralized data placement algorithm that optimizes the replication factor and selects suitable locations for key-value pairs and replicas, balancing cost and access latency while keeping optimization overhead low. We employ a realistic cost model based on public and private Cloud and Edge providers that consider data transfer, request, and storage costs. In addition to conventional key-value pairs, SmartKV supports active key-value pairs, which enable the definition of custom data types and the execution of user-defined functions directly on the storage side. This contributes to reducing data transfer costs and round-trip times. We thoroughly evaluate SmartKV across different regions of the Chameleon testbed using several realistic workloads. Results show that the utilized decentralized data placement strategy allows SmartKV to reduce round trip times between 9 and 84% while reducing costs up to 4.84x under different client workloads and consistency models compared to state-of-the-art data placement strategies.

关键词： distributed data distributed key-value storage distributed data storage Decentralized data placement data migration Replica management Computing continuum

来源：评论

学校读者我要写书评

暂无评论

A distributed data storage protocol for heterogeneous wireless sensor networks with mobile sinks

引用

AD HOC NETWORKS 2013年第5期11卷 1588-1602页

作者： Maia, Guilherme Guidoni, Daniel L. Viana, Aline C. Aquino, Andre L. L. Mini, Raquel A. F. Loureiro, Antonio A. F. Univ Fed Minas Gerais Belo Horizonte MG Brazil INRIA Orsay France Univ Fed Alagoas Maceio AL Brazil Pontif Catholic Univ Belo Horizonte MG Brazil

This paper presents ProFlex, a distributed data storage protocol for large-scale Heterogeneous Wireless Sensor Networks (HWSNs) with mobile sinks. ProFlex guarantees robustness in data collection by intelligently managing data replication among selected storage nodes in the network. Contrarily to related protocols in the literature, ProFlex considers the resource constraints of sensor nodes and constructs multiple data replication structures, which are managed by more powerful nodes. Additionally, ProFlex takes advantage of the higher communication range of such powerful nodes and uses the long-range links to improve data distribution by storage nodes. When compared with related protocols, we show through simulation that Proflex has an acceptable performance under message loss scenarios, decreases the overhead of transmitted messages, and decreases the occurrence of the energy hole problem. Moreover, we propose an improvement that allows the protocol to leverage the inherent data correlation and redundancy of wireless sensor networks in order to decrease even further the protocol's overhead without affecting the quality of the data distribution by storage nodes. (c) 2013 Elsevier B.V. All rights reserved.

关键词： distributed data storage Heterogeneous wireless sensor networks Mobile sinks

来源：评论

学校读者我要写书评

暂无评论

Region-based compressive distributed storage in Mobile CrowdSensing

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2024年 158卷 200-209页

作者： Liu, Xingting Zhou, Siwang Luo, Jie Yu, Jianping Zhang, Wei Hunan Univ Coll Comp Sci & Elect Engn Changsha Peoples R China Hunan Vocat Coll Elect & Technol Changsha Peoples R China Hunan Normal Univ Coll Informat Sci & Engn Changsha Peoples R China Sch Changsha Univ Changsha Peoples R China

Compressive Sensing-based distributed data storage for Mobile CrowdSensing (MCS) primarily addresses the problem that data needs to be stored temporarily on mobile devices when the central server cannot work as expected. In the crowdsensing-aware platform, the emerging distributed storage scheme mainly recovers the data fields of the entire area. However, when only local area information is required, it is still necessary to recover the entire area, creating unnecessary waste. Based on this observation, this paper proposes a Regionbased distributed data storage with global Denoising (R-DDS-D) algorithm. Region -based distributed data storage strategy is individually coded in regional blocks, allowing users to reconstruct the regional information they need selectively. Simultaneously, global denoising can be achieved through the correlation between small regions, which can further improve the accuracy of reconstructed data. In addition, not all local region information is equally significant, an extended algorithm for sampling allocation is proposed considering the importance of different regions to further improve accuracy. Theoretical analysis demonstrates that R-DDS-D can recover the signal with high probability, and the sampling allocation method can more reasonably allocate sampling resources. Experimentally, the R-DDS-D scheme offers greater flexibility, recruiting cost savings, and smoother reconstruction performance for recovering local regions, and the sampling allocation method further enhances the reconstruction quality in the case of uneven data distribution.

关键词： Compressive sensing distributed data storage Global denoising Mobile crowdsensing Sampling allocation

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient distributed data storage for Wireless Sensor Networks Based on Compressed Sensing and Network Coding

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2013年第10期12卷 5087-5099页

作者： Yang, Xianjun Tao, Xiaofeng Dutkiewicz, Eryk Huang, Xiaojing Guo, Y. Jay Cui, Qimei Beijing Univ Posts & Telecommun Wireless Technol Innovat Inst Key Lab Univ Wireless Commun Minist Educ Beijing 100088 Peoples R China Macquarie Univ WiMed Res Ctr Sydney NSW 2109 Australia Macquarie Univ Sydney NSW 2109 Australia CSIRO ICT Ctr Sydney NSW Australia

Recently, distributed data storage (DDS) for Wireless Sensor Networks (WSNs) has attracted great attention, especially in catastrophic scenarios. Since power consumption is one of the most critical factors that affect the lifetime of WSNs, the energy efficiency of DDS in WSNs is investigated in this paper. Based on Compressed Sensing (CS) and network coding theories, we propose a Compressed Network Coding based distributed data storage (CNCDS) scheme by exploiting the correlation of sensor readings. The CNCDS scheme achieves high energy efficiency by reducing the total number of transmissions Nt(tot) and receptions Nr(tot) during the data dissemination process. Theoretical analysis proves that the CNCDS scheme guarantees good CS recovery performance. In order to theoretically verify the efficiency of the CNCDS scheme, the expressions for Nt(tot) and Nr(tot) are derived based on random geometric graphs (RGG) theory. Furthermore, based on the derived expressions, an adaptive CNCDS scheme is proposed to further reduce Nt(tot) and Nr(tot). Simulation results validate that, compared with the conventional ICstorage scheme, the proposed CNCDS scheme reduces Nt(tot), Nr(tot), and the CS recovery mean squared error (MSE) by up to 55%, 74%, and 76% respectively. In addition, compared with the CNCDS scheme, the adaptive CNCDS scheme further reduces Nt(tot) and Nr(tot) by up to 63% and 32% respectively.

关键词： Compressed sensing distributed data storage network coding random geometric graph wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

Privdata Network: A Privacy-Preserving On-Chain data Factory and Trading Market

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2024年第3期21卷 1424-1436页

作者： Lu, Tianpei Zhang, Bingsheng Ren, Kui Zhejiang Univ Coll Comp Sci & Technol Hangzhou 310027 Peoples R China

Privacy concerns often raise when sensitive data are collected, traded, and processed. The data owner typically loses her ultimate control of the data after data-outsourcing. In this work, we present the Privdata Network - a community-controlled privacy-preserving data factory and trading market. It can be viewed as a standalone data ecosystem that enables privacy-preserving data-driven workflows in a controlled environment for orchestrating and automating data movement and data transformation. In particular, we design a data encapsulation mechanism with privacy assurance, which can guarantee data privacy, usage policy compliance and metadata validity. We also design a privacy policy language and utilize a static analysis library that transfers the program to the defined policy language. To ensure the correctness of data processing, we propose a publicly verifiable secure multiparty computation protocol for mixed circuits, which guarantees the output correctness even if all parties are corrupted. Its online efficiency is comparable to conventional semi-honest secret-sharing-based MPC schemes. Finally, we implemented a prototype of our system in C++ and benchmark it on various tasks, such as biometric matching, logistic regression, and decision trees, etc.

关键词： Protocols data privacy Cryptography Arithmetic Blockchains Additives Regulation data encapsulation publicly verifiable MPC distributed data storage

来源：评论

学校读者我要写书评

暂无评论

Research on distributed Heterogeneous data storage Algorithm in Cloud Computing data Center

Research on Distributed Heterogeneous Data Storage Algorithm...

引用

International Conference on Mechatronics, Materials and Manufacturing (ICMMM)

作者： Yang, Jing-Bo Huang, Shu Jiang, Pan Jiangsu Prov Support Software Engn R&D Ctr Modern Suzhou Peoples R China Suzhou Ind Pk Inst Vocat Technol Suzhou Peoples R China Suzhou Ind Pk Inst Serv Outsourcing Suzhou Peoples R China

ISBN: (纸本)9783038352259

With the development of cloud computing, data center is also improved. cloud computing data center contains hundreds, even million of servers or PCs. It has many heterogeneous resources. data center is a key to promise high scalability and resource usage of cloud computing. In addition, replica is introduced into data center, which is an important method to improve availability and performance. In this paper, the research on distributed storage algorithm based on the cloud computing. This algorithm uses the design of system storage level indicators within classification of massive data storage mechanism to solve the allocation problem of data consistency between the data center;and send communication packets between data centers through the cloud computing. The full storage can achieve complete local storage of each data stream, and solve the original data stream unusually large-scale data storage allocation problem.

关键词： Cloud Computing data Center Heterogeneous data distributed data storage

来源：评论

学校读者我要写书评

暂无评论

The Service Rate Region Polytope

引用

SIAM JOURNAL ON APPLIED ALGEBRA AND GEOMETRY 2024年第3期8卷 553-582页

作者： Alfarano, Gianira N. Kilic, Altan B. Ravagnani, Alberto Soljanin, Emina Eindhoven Univ Technol Eindhoven Netherlands Rutgers State Univ Piscataway NJ 08854 USA

We investigate the properties of a family of polytopes that naturally arise in connection with a problem in distributed data storage, namely service rate region polytopes. The service rate region of a distributed coded system describes the data access requests that the underlying system can support. In this paper, we study the polytope structure of the service rate region with the primary goal of describing its geometric shape and properties. We achieve this by introducing various structural parameters of the service rate region and establishing upper and lower bounds for them. The techniques we apply in this paper range from coding theory to optimization. One of our main results shows that every rational point of the service rate region has a so-called rational allocation, answering an open question in the research area.

关键词： service rate region polytope error-correcting code distributed data storage linear programming combinatorial geometry convex polytopes erasure-coded systems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：