English
Related papers

Related papers: Capacity of Clustered Distributed Storage

200 papers

Efficient node repair is a central requirement in distributed storage systems, particularly in high-rate erasure-coded deployments where repair traffic directly affects network overhead and recovery cost. Piggybacking codes reduce the…

Information Theory · Computer Science 2026-05-06 Hao Shi , Zhengyi Jiang , Gefeng Deng , Zhongyi Huang , Hanxu Hou

This paper describes a non-homogeneous distributed storage systems (DSS), where there is one super node which has a larger storage size and higher reliability and availability than the other storage nodes. We propose three distributed…

Information Theory · Computer Science 2012-08-13 Vo Tam Van , Chau Yuen , Jing Li

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 cloud radio access networks (C-RANs), a substantial amount of data must be exchanged in both backhaul and fronthaul links, which causes high power consumption and poor quality of service (QoS) experience for real-time services. To solve…

Information Theory · Computer Science 2016-11-18 Zhongyuan Zhao , Mugen Peng , Zhiguo Ding , Wenbo Wang , H. Vincent Poor

Clustering large datasets is a fundamental problem with a number of applications in machine learning. Data is often collected on different sites and clustering needs to be performed in a distributed manner with low communication. We would…

Data Structures and Algorithms · Computer Science 2017-02-02 Jiecao Chen , He Sun , David P. Woodruff , Qin Zhang

In distributed communication, each transmitter prepares an ensemble of channel codes. To encode a message, a transmitter chooses a channel code individually without sharing the coding choice with other transmitters or with the receiver.…

Information Theory · Computer Science 2018-05-08 Yanru Tang , Faeze Heydaryan , Jie Luo

We consider distributed storage (DS) for a wireless network where mobile devices arrive and depart according to a Poisson random process. Content is stored in a number of mobile devices, using an erasure correcting code. When requesting a…

Information Theory · Computer Science 2016-01-05 Jesper Pedersen , Alexandre Graell i Amat , Iryna Andriyanova , Fredrik Brännström

Cascading failures are a critical vulnerability of complex information or infrastructure networks. Here we investigate the properties of load-based cascading failures in real and synthetic spatially-embedded network structures, and propose…

Physics and Society · Physics 2017-09-21 Alaa Moussawi , Noemi Derzsy , Xin Lin , Boleslaw K. Szymanski , Gyorgy Korniss

Distributed learning platforms for processing large scale data-sets are becoming increasingly prevalent. In typical distributed implementations, a centralized master node breaks the data-set into smaller batches for parallel processing…

Information Theory · Computer Science 2016-10-03 Mohamed Attia , Ravi Tandon

Design of distributed caching mechanisms is considered as an active area of research due to its promising solution in reducing data load in the backhaul link of a cellular network. In this paper, the problem of distributed content caching…

Information Theory · Computer Science 2020-10-14 S. Krishnendu , B. N. Bharath , Navneet Garg , Vimal Bhatia , Tharmalingam Ratnarajah

Given two independent point processes and a certain rule for matching points between them, what is the fraction of matched points over infinitely long streams? In many application contexts, e.g., secure networking, a meaningful matching…

Information Theory · Computer Science 2016-11-17 Stefano Marano , Vincenzo Matta , Ting He , Lang Tong

There have been emerging lots of applications for distributed storage systems e.g., those in wireless sensor networks or cloud storage. Since storage nodes in wireless sensor networks have limited battery, it is valuable to find a repair…

Information Theory · Computer Science 2013-01-31 Majid Gerami , Ming Xiao , Carlo Fischione , Mikael Skoglund

Wireless traffic that is destined for a certain device in a network, can be exploited in order to minimize the availability and delay trade-offs, and mitigate the Energy consumption. The Energy Conservation (EC) mechanism can be…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-17 Marios C. Charalambous , Constandinos X. Mavromoustakis , Muneer Bani Yassein

In this paper, a new repair scheme for a modified construction of MDS codes is studied. The obtained repair scheme has optimal bandwidth for multiple failed nodes under the cooperative repair model. In addition, the repair scheme has…

Information Theory · Computer Science 2022-01-19 Xing Lin , Han Cai , Xiaohu Tang

In a secure coded caching system, a central server balances the traffic flow between peak and off-peak periods by distributing some public data to the users' caches in advance. Meanwhile, these data are securely protected against the…

Information Theory · Computer Science 2019-10-21 Kangning Ma , Shuo Shao

Today's data centers have an abundance of computing resources, hosting server clusters consisting of as many as tens or hundreds of thousands of machines. To execute a complex computing task over a data center, it is natural to distribute…

Information Theory · Computer Science 2017-02-24 Qian Yu , Songze Li , Mohammad Ali Maddah-Ali , A. Salman Avestimehr

Wireless information-centric networks consider storage as one of the network primitives, and propose to cache data within the network in order to improve latency and reduce bandwidth consumption. We study the throughput capacity and delay…

Networking and Internet Architecture · Computer Science 2015-05-01 Bita Azimdoost , Cedric Westphal , Hamid R. Sadjadpour

A network coding-based scheme is proposed to improve the energy efficiency of distributed storage systems in WSNs (wireless sensor networks), which mainly focuses on two problems: firstly, consideration is given to effective distributed…

Networking and Internet Architecture · Computer Science 2013-04-08 Wang Lei , Yang Yuwang , Zhao Wei , Lu Wei

Content distribution over networks is often achieved by using mirror sites that hold copies of files or portions thereof to avoid congestion and delay issues arising from excessive demands to a single location. Accordingly, there are…

Information Theory · Computer Science 2016-11-15 Shurui Huang , Aditya Ramamoorthy , Muriel Medard

With files proactively stored at base stations (BSs), mobile edge caching enables direct content delivery without remote file fetching, which can reduce the end-to-end delay while relieving backhaul pressure. To effectively utilize the…

Networking and Internet Architecture · Computer Science 2017-10-25 Shan Zhang , Peter He , Katsuya Suto , Peng Yang , Lian Zhao , Xuemin , Shen