.png){kind=icon}
返回
Probabilistic Models and Algorithms for Data Synchronization/Broadcast Via Network Coding
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2016.2639027.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We investigate the problem of data synchronization in which a sender has a set of packets to be distributed to all the receivers via a broadcast channel. Initially, each receiver has some fraction of the packets. At each time slot, the sender might broadcast a packet to all the receivers. The goal is to find a broadcast scheme that minimizes the number of time slots until all the receivers successfully obtain all the packets. We propose two probabilisticmodels on howthe initial fractions of packets at receivers are distributed. These models arise naturally in many large-scale systems, such as peer-to-peer networks, data centers, and distributed storage systems. Based on these models, we establish probabilistic bounds and asymptotic results on the minimum number of time slots to successfully transmit all the packets to all the receivers. Next, we propose and analyze a number of random network coding algorithms for finding the approximately optimal solution. Theoretical analysis and simulations are provided to verify the probabilistic bounds and the proposed algorithms.
Keyword:
Data synchronization
Galois field
index coding problem
network coding (NC)
probability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.1
论文数:
1.8W
被引数:
6.6W
机构
引用论文
.png){kind=icon}
查看更多内容