English
Related papers

Related papers: Repair Scheduling in Wireless Distributed Storage …

200 papers

A device-to-device (D2D) wireless network is considered, where user devices also have the ability to cache content. In such networks, users are mobile and communication links can be spontaneously activated and dropped depending on the…

Networking and Internet Architecture · Computer Science 2016-11-09 Chedia Jarray , Anastasios Giovanidis

We consider a wireless Device-to-Device (D2D) network where communication is restricted to be single-hop, users make arbitrary requests from a finite library of possible files and user devices cache information in the form of linear…

Information Theory · Computer Science 2013-04-23 Mingyue Ji , Giuseppe Caire , Andreas F. Molisch

The basic idea of device-to-device (D2D) communication is that pairs of suitably selected wireless devices reuse the cellular spectrum to establish direct communication links, provided that the adverse effects of D2D communication on…

Computer Science and Game Theory · Computer Science 2016-05-03 Setareh Maghsudi , Slawomir Stanczak

In a distributed storage system, recovering from multiple failures is a critical and frequent task that is crucial for maintaining the system's reliability and fault-tolerance. In this work, we focus on the problem of repairing multiple…

Information Theory · Computer Science 2018-05-09 Marwen Zorgui , Zhiying Wang

Maximum distance separable (MDS) codes facilitate the achievement of elevated levels of fault tolerance in storage systems while incurring minimal redundancy overhead. Reed-Solomon (RS) codes are typical MDS codes with the sub-packetization…

Information Theory · Computer Science 2024-05-07 Hao Shi , Zhengyi Jiang , Zhongyi Huang , Bo Bai , Gong Zhang , Hanxu Hou

The problem of securing data against eavesdropping in distributed storage systems is studied. The focus is on systems that use linear codes and implement exact repair to recover from node failures.The maximum file size that can be stored…

Information Theory · Computer Science 2013-04-15 Sreechakra Goparaju , Salim El Rouayheb , Robert Calderbank , H. Vincent Poor

The exponential growth of data necessitates distributed storage models, such as peer-to-peer systems and data federations. While distributed storage can reduce costs and increase reliability, the heterogeneity in storage capacity, I/O…

In \textit{Distributed Storage Systems} (DSSs), usually, data is stored using replicated packets on different chunk servers. Recently a new paradigm of \textit{Fractional Repetition} (FR) codes have been introduced, in which, data is…

Information Theory · Computer Science 2017-11-27 Krishna Gopal Benerjee , Manish K Gupta

Employing channel adaptive resource allocation can yield to a large enhancement in almost any performance metric of Device-to-Device (D2D) communications. We observe that D2D users are able to estimate their local Channel State Information…

Information Theory · Computer Science 2019-02-26 Rita Ibrahim , Mohamad Assaad , Berna Sayrac , Azeddine Gati

MDS codes are erasure-correcting codes that can correct the maximum number of erasures for a given number of redundancy or parity symbols. If an MDS code has $r$ parities and no more than $r$ erasures occur, then by transmitting all the…

Information Theory · Computer Science 2014-11-25 Zhiying Wang , Itzhak Tamo , Jehoshua Bruck

In distributed storage, erasure codes -- like Reed-Solomon Codes -- are often employed to provide reliability. In this setting, it is desirable to be able to repair one or more failed nodes while minimizing the repair bandwidth. In this…

Information Theory · Computer Science 2018-04-20 Jay Mardia , Burak Bartan , Mary Wootters

We study two approaches to distributed compressed sensing for in-network data compression and signal reconstruction at a sink in a wireless sensor network where sensors are placed on a straight line. Communication to the sink is considered…

Information Theory · Computer Science 2015-04-01 Christopher Lindberg , Alexandre Graell i Amat , Henk Wymeersch

In large scale distributed storage systems (DSS) deployed in cloud computing, correlated failures resulting in simultaneous failure (or, unavailability) of blocks of nodes are common. In such scenarios, the stored data or a content of a…

Information Theory · Computer Science 2017-02-22 Gokhan Calis , O. Ozan Koyluoglu

In this paper distributed storage systems with exact repair are studied. A construction for regenerating codes between the minimum storage regenerating (MSR) and the minimum bandwidth regenerating (MBR) points is given. To the best of…

Information Theory · Computer Science 2015-01-21 Toni Ernvall

To recover simultaneous multiple failures in erasure coded storage systems, Patrick Lee et al introduce concurrent repair based minimal storage regenerating codes to reduce repair traffic. The architecture of this approach is simpler and…

Information Theory · Computer Science 2016-04-25 Huayu Zhang , Hui Li , Hanxu Hou , K. W. Shum , ShuoYen Robert Li

Distributed storage systems provide large-scale reliable data storage services by spreading redundancy across a large group of storage nodes. In such a large system, node failures take place on a regular basis. When a storage node breaks…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-03-17 Yan Wang , Xunrui Yin , Dongsheng Wei , Xin Wang , Yucheng He

With the explosive growth of mobile demand, small cells in millimeter wave (mmWave) bands underlying the macrocell networks have attracted intense interest from both academia and industry. MmWave communications in the 60 GHz band are able…

Networking and Internet Architecture · Computer Science 2015-09-25 Yong Niu , Li Su , Chuhan Gao , Yong Li , Depeng Jin , Zhu Han

Compared to current mobile networks, next-generation mobile networks are expected to support higher numbers of simultaneously connected devices and to achieve higher system spectrum efficiency and lower power consumption. To achieve these…

Networking and Internet Architecture · Computer Science 2017-02-23 Kuo-Yi Chen , Jung-Chun Kao , Si-An Ciou , Shih-Han Lin

Erasure coding has been recognized as a powerful method to mitigate delays due to slow or straggling nodes in distributed systems. This work shows that erasure coding of data objects can flexibly handle skews in the request rates. Coding…

Information Theory · Computer Science 2021-06-29 Mehmet Aktas , Gauri Joshi , Swanand Kadhe , Fatemeh Kazemi , Emina Soljanin

Regenerating codes are a class of distributed storage codes that optimally trade the bandwidth needed for repair of a failed node with the amount of data stored per node of the network. Minimum Storage Regenerating (MSR) codes minimize…

Information Theory · Computer Science 2011-07-27 K. V. Rashmi , Nihar B. Shah , P. Vijay Kumar