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

Blockchain Technology: Universal Structure and Requirements

AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS 2017年第6期51卷 235-238页

作者： Biktimirov, M. R. Domashev, A. V. Cherkashin, P. A. Shcherbakov, A. Yu. Russian Acad Sci All Russian Inst Sci & Tech Informat Moscow 125190 Russia Sci & Tech Ctr Atlas Moscow 127018 Russia Granit Co Moscow 119019 Russia Russian Acad Sci Comp Sci & Control Fed Res Ctr Moscow 119333 Russia

The project elaboration of the configuration and mathematical model of distributed blockchain data storage, blockchain applications for implementing various information technologies, and blockchain requirements that s... 详细信息

关键词： blockchain distributed data storage information security e-voting auction encryption electronic signature

来源：评论

学校读者我要写书评

暂无评论

Constructions and Bounds for Batch Codes with Small Parameters 5th

Constructions and Bounds for Batch Codes with Small Paramete...

引用

5th International Castle Meeting on Coding Theory and Applications (ICMCTA)

作者： Thomas, Eldho K. Skachek, Vitaly Univ Tartu Inst Comp Sci Tartu Estonia

ISBN: (纸本)9783319662787;9783319662770

Linear batch codes and codes for private information retrieval (PIR) with a query size t and a restricted size r of the reconstruction sets are studied. New bounds on the parameters of such codes are derived for small values of t or r by providing corresponding constructions. By building on the ideas of Cadambe and Mazumdar, a new bound in a recursive form is derived for batch codes and PIR codes.

关键词： PIR codes Batch codes Private information retrieval Locally repairable codes distributed data storage

来源：评论

学校读者我要写书评

暂无评论

A Method for Cloud storage data Recovery with Limited Loss of Access 4

A Method for Cloud Storage Data Recovery with Limited Loss o...

引用

4th International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)

作者： Bardis, Nikolaos G. Doukas, Nikolaos Markovskyi, Oleksandr P. Hellen Mil Acad Dept Math & Engn Sci Vari 16673 Greece Natl Tech Univ Ukraine Dept Comp Engn KPI 2003 UA-252056 Kiev Ukraine

ISBN: (纸本)9781538628201

In this paper, the problem of recovering data stored in remote storage facilities is addressed, where user data are distributed in storage nodes, each possessing the same number of storage units. The problem addressed is getting uninterrupted data availability in the commonly occurring case where loss of access is temporary towards an entire data storage node, or concerns up to two data storage units located at different nodes. The backup procedure is explained and details are given about the calculations necessary for calculating the necessary checksums. The theoretical general form of the calculation of the data recovery in all instances is given. The scheme is illustrated via an arithmetic example.

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

来源：评论

学校读者我要写书评

暂无评论

Analysis on the Construction of Computer data Processing Mode in the Era of Big data

引用

AGRO FOOD INDUSTRY HI-TECH 2017年第1期28卷 798-802页

作者： Guo, Shi-Qi Zhai, Lei Hebei Software Inst Baoding Hebei Peoples R China Hebei Vocat Coll Labour Relat Shijiazhuang Hebei Peoples R China

Under the background of big data, the theory and technology of computer data processing have received more and more attention. According to the characteristics of data processing mode, the computer data processing mode can be divided into four kinds: information virtualization technology, cloud computing, automated resource scheduling technology, data transmission technology. In this paper, the big data processing was discussed. The spatial data processing analysis model was established and applied to the urban industrial census. The data and decision support were provided for the development of urban industrialization and the structural optimization of urban economic industry.

关键词： Big data data processing system structure distributed data storage

来源：评论

学校读者我要写书评

暂无评论

An Efficient Approach for storage Balancing in Wireless Sensor Networks

引用

INTERNATIONAL JOURNAL OF ONLINE ENGINEERING 2017年第9期13卷 4-18页

作者： Ez-Zaidi, Asmaa Rakrak, Said Cadi Ayyad Univ Fac Sci & Technol Marrakech Morocco Cadi Ayyad Univ Fac Sci & Technol Dept Comp Sci Marrakech Morocco

the use of mobile sinks in data collection has received much attention in recent years. In fact, mobility was introduced to solve problems that occur in data gathering with static sink such as hotspots, quick energy depletion of sensor nodes and so on. Using a mobile sink provides an effective mechanism to improve reliability, security as well as connectivity within the network. Nevertheless, the sink's mobility poses new challenges, especially when the sink follows an unpredictable movement while gathering data. In this case, the network will experience huge latency and suffer from significant packet loss particularly when sensor nodes do not have enough memory storage to buffer collected data between two consecutive visits of the mobile sink. In this paper we propose a new approach in which sensor nodes cooperate to manage the storage and prevent packet drops. When a node's memory is almost full, it of-floads its data to its neighbor nodes in function of their free spaces. In case there are no suitable neighbor nodes with sufficient storage space, the sink is urgently notified about the overloaded region that needs to be rapidly dumped. Simulation results reveal that our proposed approach balances the storage load and decreases drastically packet loss.

关键词： wireless sensor network packet loss distributed data storage data gathering data repartition buffer overflow

来源：评论

学校读者我要写书评

暂无评论

Cstorage: Decentralized compressive data storage in wireless sensor networks

引用

AD HOC NETWORKS 2016年第Part2期37卷 475-485页

作者： Talari, Ali Rahnavard, Nazanin Oklahoma State Univ Stillwater OK 74078 USA Univ Cent Florida Orlando FL 32806 USA

In this paper, we employ compressive sensing (CS) to design a distributed compressive data storage (Cstorage) algorithm for wireless sensor networks (WSNs). First, we assume that no neighbor information or routing table is available at nodes and employ the well-known probabilistic broadcasting (PB) to disseminate sensors reading throughout the network to form compressed samples (measurements) of the network readings at each node. After the dissemination phase, a data collector may query any arbitrary set of M << N nodes for their measurement and reconstruct all N readings using CS. We refer to the first implementation of Cstorage by Cstorage-P. Next, we assume that nodes collect two-hop neighbor information and design a novel parameterless and scalable data dissemination algorithm referred to by alternating branches (ABs), and design Cstorage-B. We discuss the advantages of Cstorage-P and Cstorage-B and show that they considerably decrease the total number of required transmissions for data storage in WSNs compared to existing work. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Compressive sensing/sampling distributed data storage Wireless sensor networks Probabilistic broadcasting data dissemination

来源：评论

学校读者我要写书评

暂无评论

Efficient distributed storage strategy based on compressed sensing for space information network

引用

INTERNATIONAL JOURNAL OF distributed SENSOR NETWORKS 2016年第8期12卷

作者： Kong, Bo Zhang, Gengxin Zhang, Wei Bian, Dongming Xie, Zhidong PLA Univ Sci & Technol Coll Commun Engn Nanjing 210007 Jiangsu Peoples R China

This article investigates the distributed data storage problem with compressed sensing in the space information network. Since there exists a performance-energy trade-off, most existing strategies focus only on improving the compressed sensing construction performance or reducing the energy consumption, respectively. In order to achieve a better balance, a novel and efficient strategy, referred to as distributed storage strategy based on compressed sensing, is proposed in this article. Unlike other strategies which require source packets visiting the entire network, the proposed strategy is a "one-hop" method since information exchange is only performed between neighbors. Therefore, the compressed sensing measurement matrix depends heavily on the degree of each space node. We prove that the proposed strategy guarantees the compressed sensing reconstruction performance under both sparse orthonormal basis and dense orthonormal basis. Simulation results validate that, compared with the representative Cstorage strategy and compressive data persistence strategy, the proposed strategy consumes the least energy and computational overheads, while almost without sacrificing the compressed sensing reconstruction performance.

关键词： Space information network distributed data storage compressed sensing energy efficient

来源：评论

学校读者我要写书评

暂无评论

Efficient distributed storage for Space Information Network Based on Fountain Codes and Probabilistic Broadcasting

引用

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2016年第6期10卷 2606-2626页

作者： Kong, Bo Zhang, Gengxin Zhang, Wei Dong, Feihong PLA Univ Sci & Technol Coll Commun Engn Nanjing Jiangsu Peoples R China

This article investigates the distributed data storage problem in the space information network (SIN) using distributed fountain codes. Since space nodes in the SIN are resource-limited, in order to reduce energy consumption while improving the storage reliability, an efficient distributed storage based on fountain codes and probabilistic broadcasting (DSFPB) strategy is proposed. In the proposed strategy, source packets are disseminated among the entire network according to probabilistic broadcasting (PBcast), and the final degree distribution is close to the desired robust soliton distribution (RSD), this is benefited from the appropriate packets encoding procedure of the proposed strategy. As presented by the analysis and simulations, the total cost of data dissemination is greatly reduced compared with existing representative strategies, while improving the decoding performance.

关键词： Space information network distributed data storage probabilistic broadcasting fountain codes LT codes

来源：评论

学校读者我要写书评

暂无评论

Region-Based Fault-Tolerant distributed File storage System Design in Networks

引用

NETWORKS 2015年第4期66卷 380-395页

作者： Sen, Arunabha Mazumder, Anisha Banerjee, Sujogya Das, Arun Zhou, Chenyang Shirazipourazad, Shahrzad Arizona State Univ Sch Comp Informat & Decis Syst Engn Comp Sci & Engn Program Tempe AZ 85287 USA

distributed storage of data files in different nodes of a network enhances its fault tolerance capability by offering protection against node and link failures. Reliability is often achieved through redundancy in one of the following two ways: (i) storage of multiple copies of the entire file at different locations (nodes) or (ii) storage of file segments (not entire files) at different node locations. In the (N, K) file distribution scheme, N file segments from a file F are created in such a way that it is possible to reconstruct the entire file, just by accessing any K = N segments. For the reconstruction scheme to work, it is essential that the K segments of the file are stored in nodes that are connected in the network. However, in the event of node/link failures, the network might become disconnected (i.e.,split into several connected components). We focus on node failures that are spatially correlated or region based. Such failures are often encountered in disaster situations or natural calamities where only the nodes in the disaster zone are affected. The first goal of this research is to design a least cost file storage scheme to ensure that no matter which region is destroyed;resulting in fragmentation of the network, a largest connected component of the residual network will have enough file segments with which to reconstruct the entire file. In case the least cost to ensure this objective is within the allocated budget, the storage design will be all region fault-tolerant (ARFT). In case the least cost exceeds the allocated budget, design of an ARFT file storage system design is impossible. The second goal of this research is to design file storage schemes that will be maximum region fault-tolerant within the allocated budget. The third goal of this research is to investigate the impact of the coding parameters N and K on storage requirements for ensuring all region or maximum region fault-tolerant design. We provide approximation algorithms for the probl

关键词： distributed data storage region-based faults fault tolerance ( N,K) coding budget constraints connected components

来源：评论

学校读者我要写书评

暂无评论

Scattering and placing data replicas to enhance long-term durability 14

Scattering and placing data replicas to enhance long-term du...

引用

IEEE 14th International Symposium on Network Computing and Applications NCA

作者： Simon, Veronique Monnet, Sebastien Feuillet, Mathieu Robert, Philippe Sens, Pierre Univ Paris 06 Sorbonne Univ F-75005 Paris France CNRS UMR 7606 LIP6 F-75005 Paris France Inria Equipe Regal F-75005 Paris France ANSSI F-75700 Paris 07 SP France INRIA Paris Rocquencourt F-78153 Le Chesnay France

ISBN: (纸本)9781509018499

distributed storage systems have to ensure data availability and durability despite the occurrence of failures. To do so, many of them rely on replication mechanisms. We show that the layout of the data block copies on the nodes, chiefly the way the copies are scattered, has a major impact on the reparation speed and thus on the data loss ratio. In this paper, we propose an approach that provides the ability: (i) to finely tune the proportion of common content stored by the nodes;and (ii) to control the storage load distribution while creating new data block copies. We propose a simulation model that allows us to present a long-term study of the impact of the data block copies layout and the system's storage load on the data loss ratio.

关键词： distributed data storage replication durability data placement load distribution backup

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：