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

On the Delivery Probability of Two-Hop Relay MANETs with erasure coding

IEEE TRANSACTIONS ON COMMUNICATIONS 2013年第4期61卷 1314-1326页

作者： Liu, Jiajia Jiang, Xiaohong Nishiyama, Hiroki Kato, Nei Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan Future Univ Hakodate Sch Syst Informat Sci Hakodate Hokkaido 0418655 Japan

This paper focuses on the delivery probability performance in a two-hop relay mobile ad hoc network (MANET) with erasure coding. Available works in this line either considered a simple extreme case of achieving the delivery probability 1, or assumed a simple traffic pattern with only one source-destination pair, or studied a very special MANET scenario (i.e., the sparsely distributed MANET) by assuming that whenever two nodes meet together they can transmit to each other. Obviously, such models cannot be applied for an accurate delivery probability analysis in the general MANETs where the interference, medium contention and traffic contention issues are of significant importance. In this paper, a general finite-state absorbing Markov chain theoretical framework is first developed to model the complicated message spreading process in the challenging MANETs. Based on the theoretical framework, closed-form expressions are further derived for the corresponding message delivery probability under any given message lifetime and message size, where all the above important issues in MANETs are carefully incorporated into analysis. As verified through extensive simulation studies, the new framework can be used to accurately predict the message delivery probability behavior and characterize its relationship with the message size, replication factor and node density there.

关键词： Mobile ad hoc networks delivery probability two-hop relay erasure coding

来源：评论

学校读者我要写书评

暂无评论

Dynamic erasure coding decision for modern block-oriented distributed storage systems

引用

JOURNAL OF SUPERCOMPUTING 2016年第4期72卷 1312-1341页

作者： Ahn, Hoo-Young Lee, Kyong-Ha Lee, Yoon-Joon Korea Adv Inst Sci & Technol Sch Comp 291 Daehak Ro Taejon 305701 South Korea KISTI Sci Data Res Ctr 245 Daehak Ro Daejeon 305806 South Korea

Modern block-oriented distributed storage systems like Hadoop distributed file system have proliferated in this era of big data and cloud computing. These systems feature block-level replication in which their files are partitioned into equal-sized blocks and multiple copies for each block are then arbitrarily distributed across nodes for fault tolerance and data availability. However, many storage volumes are just wasted only for keeping block copies whose data may not be accessed frequently in the strategy. Therefore, distributed storage systems begin to adopt erasure codes. However, classical parity encoding scheme are hard to be directly applied to the distributed storage systems since block copies are arbitrarily placed across nodes in the systems. We present a novel technique, called DynaEC, to address the issues in modern block-oriented distributed storage systems. DynaEC provides a unique parity encoding algorithm that encodes data blocks arbitrarily distributed across machines to parities and then places the parities guaranteeing fault tolerance. Parity encoding in DynaEC is performed without any change of the original block placement policy in Hadoop distributed file system. This makes DynaEC work seamlessly with Hadoop distributed file system. Finally, during the encoding procedure each data node encodes each own data blocks, not requiring any information about other blocks located in other data nodes. As such, the encoding procedure in DynaEC is fully performed in parallel without any synchronization issue. With extensive experiments, we show that DynaEC saves storage volumes up to the theoretical limit while outperforming previous approaches by multiple orders of magnitude.

关键词： Distributed storage system Storage overhead Hadoop HDFS Data replication erasure coding RAID

来源：评论

学校读者我要写书评

暂无评论

On erasure coding in Intermittently Connected Networks

引用

WIRELESS PERSONAL COMMUNICATIONS 2017年第1期97卷 1579-1595页

作者： Altamimi, Ahmed B. Gulliver, T. Aaron Univ Victoria Dept Elect & Comp Engn STN CSC POB 1700 Victoria BC V8W 2Y2 Canada

An intermittently connected network (ICN) is defined as a mobile network that uses cooperation between nodes to facilitate communication when a connected path between the source and destination does not exist. This cooperation consists of nodes carrying messages from other nodes to help deliver them to their destinations. An ICN does not require an infrastructure and routing information is not retained by the nodes. While this may be a useful environment for message dissemination, there are challenges in routing messages. In particular, providing satisfactory delivery performance while maintaining a low overhead ratio is difficult without routing information or a network infrastructure. In this paper, erasure coding is employed to improve the delivery rate in an ICN. The message delivery probability is derived and used to evaluate the performance. It is shown that the use of erasure coding can significantly improve the message delivery rate.

关键词： Intermittently connected network erasure coding Fragmentation Routing

来源：评论

学校读者我要写书评

暂无评论

NetEC: Accelerating erasure coding Reconstruction With In-Network Aggregation

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2022年第10期33卷 2571-2583页

作者： Qiao, Yi Zhang, Menghao Zhou, Yu Kong, Xiao Zhang, Han Bi, Jun Xu, Mingwei Wang, Jilong Tsinghua Univ Inst Network Sci & Cyberspace Beijing 100084 Peoples R China Beijing Natl Res Ctr Informat Sci & Technol BNRis Beijing 100084 Peoples R China Alibaba Inc Hangzhou 311121 Peoples R China Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China Quail Cheng Lab Jinan 250103 Peoples R China Peng Cheng Lab Shenzhen 518066 Guangdong Peoples R China

In distributed storage systems, erasure coding (EC) is a crucial technology to enable high data availability. By downloading parity data from survived machines, EC can reconstruct lost data with much lower storage overheads than data replication. However, this reduction in storage cost comes at the expense of extra performance problems: low reconstruction rate, high degraded read latency, and high host CPU utilization. Our analysis shows that these performance problems are deeply rooted in the host-based EC processing. To resolve these problems, we present NetEC, an in-network accelerating framework that fully offloads EC to the new generation programmable switching ASICs. We propose Explicit Buffer Size Notification (EBSN) to constrain decoding buffer usage, and design an on-switch one-to-many TCP proxy to integrate EBSN with TCP. We also design two parallel Galois Field (GF) offloading methods-table lookup and bitmatrix methods-to maximize parsable bytes. We implement NetEC on programmable switches and integrate it with HDFS. Extensive evaluations show that NetEC improves the reconstruction rate by 2.7x-6.8x, reduces the degraded read latency significantly, and removes the host CPU overhead completely. We also emulate multi-rack scenarios and show that NetEC is able to support similar to GB/s reconstruction rate and tens of concurrent tasks.

关键词： erasure coding distributed storage sytems programmable switch software-defined networks

来源：评论

学校读者我要写书评

暂无评论

BPR: An erasure coding Batch Parallel Repair Approach in Distributed Storage Systems

引用

IEEE ACCESS 2023年 11卷 44509-44518页

作者： Song, Ying Zhao, Wenxuan Wang, Bo Beijing Informat Sci & Technol Univ Beijing Key Lab Internet Culture & Digital Dissemi Beijing 100101 Peoples R China Beijing Informat Sci & Technol Univ Beijing Adv Innovat Ctr Mat Genome Engn Beijing 100101 Peoples R China Chinese Acad Sci Inst Comp Technol State Key Lab Comp Architecture Beijing 100086 Peoples R China Zhengzhou Univ Light Ind Software Engn Coll Zhengzhou 450002 Peoples R China

Today, erasure coding is one of the most significant techniques widely used in distributed systems because it can improve reliability for large amounts of data with low storage overhead. However, when the distributed system encounters a large number of data loss in stripes and requires batch-stripes data recovery, current data recovery methods either repeat the single-stripe recovery method or only optimize partial stripe recovery when recovering large-scale stripes, which incurs heavy upload and download repair traffics and imbalanced load, affecting the efficiency of fault recovery and wasting additional resources. In this paper, we propose BPR, an erasure coding batch parallel repair approach for distributed storage systems. BPR reduces cross-rack network transfer time and increases recovery throughput by classifying the stripes and recovering the data of stripes in batches through the forward and reverse parallel data recovery. The experiment results show that for large-scale stripes recovery, BPR reduces the cross-rack network transfer time by up to 10% and increases the recovery throughput by up to 8% compared with the rPDL in some scenarios.

关键词： Distributed processing Business process re-engineering Traffic congestion Encoding Full-duplex system Decoding Bandwidth Storage management Distributed storage system erasure coding data recovery

来源：评论

学校读者我要写书评

暂无评论

Accelerating erasure coding by exploiting multiple repair paths in distributed storage systems

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2024年第6期27卷 8621-8635页

作者： Kim, Chanki Chon, Kang-Wook Jeonbuk Natl Univ Dept Comp Sci & Artificial Intelligence 567 Baekje Daero Jeonju Si 54896 Jeollabuk Do South Korea Korea Univ Technol & Educ Sch Comp Sci & Engn 1600 Chungjeol Ro Cheonan Si 31253 Chungcheongnam South Korea

High reliability must be ensured in distributed storage systems (DSSs) to maintain the stability of warehouse-scale computing and high-performance computing (HPC) systems. For system-level reliability, a repair operation using redundant storage nodes can be used in conjunction with erasure coding (EC), which can also affect the system performance. The existing EC design mainly focused on minimizing the required bandwidth for the repair and storage overheads. However, the computing performance for EC should be considered to achieve high bandwidth in order to exploit back-end network link capacity with heterogeneous and high-speed interconnects over 10 Gbps Ethernet. In this study, a new computing acceleration method for repair operation in EC is proposed using multiple repair paths and modifying the computation kernel on the graphics processing unit (GPU) device. For the Cauchy Reed-Solomon (CRS) codes, the proposed scheme is observed to achieve sufficient repair bandwidth compared to the theoretical bound or exceed the current maximum Ethernet link bandwidth.

关键词： Cauchy Reed-Solomon (CRS) codes Computing acceleration erasure coding Fault-tolerant system Graphics processing units (GPUs) High-performance computing (HPC)

来源：评论

学校读者我要写书评

暂无评论

A Secure and Efficient Distributed Storage Scheme SAONT-RS Based on an improved AONT and erasure coding

引用

IEEE ACCESS 2018年 6卷 55126-55138页

作者： Yao, Lili Lu, Jintian Liu, Jiabing Wang, Dejun Meng, Bo South Cent Univ Nationalities Sch Comp Sci Wuhan 430074 Hubei Peoples R China

Distributed storage has been widely used by enterprises in big data and cloud computing. However, the open nature of distributed storage and the geographical restrictions have constrained distributed storage development. People have put forward higher requirements on the security of node data, especially focusing on confidentiality, recoverability, and integrity. In this paper, we find that there are four security vulnerabilities in AONT-RS and RAONT-RS. In addition, we propose an improved AONT called SAONT in which a canary is not used. After that, we present a secure and efficient distributed storage scheme called SAONT-RS based on SAONT and erasure coding. Finally, the security analysis is given from the four aspects of confidentiality, recoverability, integrity, and anti-short plaintext attack. The experiments show that SAONT-RS has high security and efficiency of node data in distributed storage.

关键词： Distributed storage erasure coding efficiency information dispersal algorithm

来源：评论

学校读者我要写书评

暂无评论

Packet Delivery Ratio/Cost in MANETs With erasure coding and Packet Replication

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2015年第5期64卷 2062-2070页

作者： Yang, Bin Chen, Yin Cai, Ying Jiang, Xiaohong Future Univ Hakodate Sch Syst Informat Sci Hakodate Hokkaido 0418655 Japan Chuzhou Univ Sch Comp & Informat Engn Chuzhou 239012 Peoples R China Beijing Informat Sci & Technol Univ Beijing Key Lab Internet Culture & Digital Dissem Beijing 100101 Peoples R China Chinese Acad Sci State Key Lab Informat Secur Inst Informat Engn Beijing 100093 Peoples R China

This paper studies the performance of a general two-hop relay (2HR)-(x, w, f) packet delivery scheme that combines both erasure coding and packet replication techniques in mobile ad hoc networks (MANETs). Under this packet delivery scheme, a group of x packets is first encoded into w(w >= x) coded packets using erasure coding, and each coded packet is then replicated to at most f distinct relay nodes that can help to forward the coded packets to its destination node. The original packets can be recovered when x distinct coded packets reach the destination node. To understand the packet delivery process under the 2HR-(x, w, f) scheme, we develop a multidimensional Markov chain framework, and based on this analytical expressions on the packet delivery ratio and corresponding expected packet delivery cost are further derived. Finally, extensive simulation and numerical studies are conducted to illustrate the efficiency of the developed theoretical models and to illustrate our findings. Our results indicate that the replication parameter f should be carefully selected in order to obtain a high packet-delivery-ratio performance while maintaining a relatively low delivery cost.

关键词： Ad hoc networks erasure coding packet replication routing protocol

来源：评论

学校读者我要写书评

暂无评论

erasure coding Based Optimization in Decentralized Distributed Storage Systems 17

Erasure Coding Based Optimization in Decentralized Distribut...

引用

17th International Conference on Networking, Architecture and Storage

作者： Gan, Yiwei Huang, Zhijie Shi, Yulong Zhang, Xiao Zhao, Nannan Northwestern Polytech Univ Sch Comp Sci Xian Peoples R China

ISBN: (纸本)9798331520519;9798331520502

Node failures in decentralized distributed storage systems are common. To ensure data availability, these systems employ data redundancy mechanisms, typically relying on replicas. This paper proposes a decentralized data redundancy scheme based on erasure coding, with Reed-Solomon and IPFS as examples. Compared with replication, the proposed scheme reduces storage space and enhances fault tolerance. Files are sharded and encoded across multiple nodes, avoiding the high redundancy of replicas. Users can retrieve any K shards from N nodes to reconstruct the original files. This erasure coding optimization combines efficient data exchange among decentralized nodes with erasure coding technology, significantly reducing storage space compared with the replica mechanism. The implementation involves truncating and sharding the blocks within the Merkle DAG generated by files, enabling flexible adjustments to the code rate of erasure codes and the allocation of storage nodes based on user needs and available resources. This method achieves a balance between storage efficiency and data availability.

关键词： Decentralized Distributed Storage System erasure coding Reed-Solomon IPFS Merkle DAG

来源：评论

学校读者我要写书评

暂无评论

Topology-Transparent Broadcast Scheduling with erasure coding in Wireless Networks

引用

IEEE COMMUNICATIONS LETTERS 2013年第8期17卷 1660-1663页

作者： Liu, Yiming Li, Victor O. K. Leung, Ka-Cheong Zhang, Lin Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Univ Hong Kong Dept Elect & Elect Engn Hong Kong Hong Kong Peoples R China

Broadcasting is an important function in wireless networks. Ensuring broadcast efficiency and reliability with low communication overhead is challenging, especially with error-prone links. In this letter, we employ erasure coding together with topology-transparent scheduling as a coded transmission strategy in the MAC (Medium Access Control) layer rather than the physical layer to combat collisions and channel errors, implementing an efficient and reliable broadcast algorithm in wireless networks without introducing any additional communication overhead. We achieve the optimal frame structure that maximizes the average network throughput, and investigate the performance of our proposed algorithm in terms of the average network throughput and the packet failure probability. Simulation results show that our proposed algorithm with erasure coding outperforms other existing topology-transparent broadcast algorithms and the conventional TDMA dramatically.

关键词： Efficient and Reliable Broadcast erasure coding Topology-Transparent Scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：