BATS: Network coding in action

Yang, Shenghao; Yeung, Raymond W.; Cheung, Jay H. F.; Yin, Hoover H. F.

doi:10.1109/allerton.2014.7028592

Cited by 39 publications

(38 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Various chunked code-based transmission schemes have been designed and implemented recently [18,22,32], which are consistent with our transfer matrix model.…”

Section: Related Workmentioning

confidence: 75%

“…For convenience, we refer to a packet with chunk ID j as a j packet. Now, we describe a chunk transmission model through a network employing linear network coding, which is consistent with the recent design and implementation of chunked code-based network protocols [18,22,32]. Consider the jth chunk of packets b j 1 , b j 2 , .…”

Section: Transmission Of Chunksmentioning

confidence: 98%

“…Note that in (1), we only need to combine the j packets with linearly independent coefficient vectors. For the scheduling issue, i.e., how to choose a chunk B j by each intermediate node for each transmission, please refer to some recent proposed network protocols [18,22,32]. At the destination node, let T j be the matrix formed by the coefficient vectors of all the j packets received, and let Y j be the matrix formed by the payloads of all the j packets received.…”

Section: At An Intermediate Network Node Suppose That H J Packets Hamentioning

confidence: 99%

“…Here, for a given value of M j , S j is a totally random matrix, i.e., every entry of S j is chosen from F q uniformly and independently at random. Also, we assume that H j and S j are independent conditionings on M j and rk(S j ), which holds for all the recent chunked code-based network protocols [18,22,32].…”

Section: At An Intermediate Network Node Suppose That H J Packets Hamentioning

confidence: 99%

See 3 more Smart Citations

Expander chunked codes

Tang

Yang

et al. 2015

EURASIP J. Adv. Signal Process.

Self Cite

View full text Add to dashboard Cite

Chunked codes are efficient random linear network coding (RLNC) schemes with low computational cost, where the input packets are encoded into small chunks (i.e., subsets of the coded packets). During the network transmission, RLNC is performed within each chunk. In this paper, we first introduce a simple transfer matrix model to characterize the transmission of chunks and derive some basic properties of the model to facilitate the performance analysis. We then focus on the design of overlapped chunked codes, a class of chunked codes whose chunks are non-disjoint subsets of input packets, which are of special interest since they can be encoded with negligible computational cost and in a causal fashion. We propose expander chunked (EC) codes, the first class of overlapped chunked codes that have an analyzable performance, where the construction of the chunks makes use of regular graphs. Numerical and simulation results show that in some practical settings, EC codes can achieve rates within 91 to 97 % of the optimum and outperform the state-of-the-art overlapped chunked codes significantly.

show abstract

“…Various chunked code-based transmission schemes have been designed and implemented recently [18,22,32], which are consistent with our transfer matrix model.…”

Section: Related Workmentioning

confidence: 75%

Section: Transmission Of Chunksmentioning

confidence: 98%

Section: At An Intermediate Network Node Suppose That H J Packets Hamentioning

confidence: 99%

Section: At An Intermediate Network Node Suppose That H J Packets Hamentioning

confidence: 99%

See 2 more Smart Citations

Expander chunked codes

Tang

Yang

et al. 2015

EURASIP J. Adv. Signal Process.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Application of BATS codes in various network communication scenarios have been studied in [10][11][12]. BATS code based network transmission protocols (BATS protocols) is proposed in [13].…”

Section: Introductionmentioning

confidence: 99%

Fast degree-distribution optimization for BATS codes

Zhao

Yang

Feng³

2017

Sci. China Inf. Sci.

Self Cite

View full text Add to dashboard Cite

A complexity-reduced fast successive cancellation list decoder for polar codes SCIENCE CHINA Information Sciences 61, 022309 (2018); The lower and upper bounds of the degree distribution of a graded algebra SCIENCE CHINA Mathematics 56, 983 (2013); Low-degree root-MUSIC algorithm for fast DOA estimation based on variable substitution technique SCIENCE CHINA Information Sciences 63, 159206 (2020); Period distribution of generalized B-J codes and constructions of cyclically permutable (CP ) codesAbstract Batched sparse (BATS) codes have been proposed for communication through networks with packet loss. BATS codes include a matrix generalization of fountain codes as the outer code and random linear network coding at the intermediate network nodes as the inner code. BATS codes, however, do not possess a universal degree distribution that achieves an optimal rate for any distribution of the transfer matrix ranks. Therefore, it is important to have a fast degree-distribution optimization approach for finite-length BATS codes. In this paper, we propose the concept of batch release probability (BRP), and demonstrate some characteristics of BRPs from the degree distributions achieving nearly optimal performance. Based on these BRP characteristics, we propose a novel degree-distribution optimization approach that achieves the similar decoding performance with a much shorter optimization time, compared with the previous approach. Moreover, the universality of BRPs observed in this paper can further simplify the degree-distribution optimization of BATS codes.

show abstract

Practical Inner Codes for Batched Sparse Codes

Zhang

Guang

2017

GLOBECOM 2017 - 2017 IEEE Global Communications Conference

View full text Add to dashboard Cite

BATS: Network coding in action

Cited by 39 publications

References 23 publications

Expander chunked codes

Expander chunked codes

Fast degree-distribution optimization for BATS codes

Practical Inner Codes for Batched Sparse Codes

Contact Info

Product

Resources

About