2010 Information Theory and Applications Workshop (ITA) 2010
DOI: 10.1109/ita.2010.5454144
|View full text |Cite
|
Sign up to set email alerts
|

Network coding delay: A brute-force analysis

Abstract: Abstract-Understanding the delay behavior of network coding with a fixed number of receivers, small field sizes and a limited number of encoded symbols is a key step towards its applicability in real-time communication systems with stringent delay constraints. Previous results are typically asymptotic in nature and focus mainly on the average delay performance. Seeking to characterize the complete delay distribution of random linear network coding, we present a brute-force methodology that is feasible for up t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2011
2011
2017
2017

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 13 publications
0
4
0
Order By: Relevance
“…In addition, a non-asymptotic analysis of the delay distributions of RLNC [14] and various multicast scenarios [15], [16], [17] have also been investigated. Research looking at the in-order delivery delay in uncoded systems is provided in [2] and [18]; while [19], [20], and [21] consider the inorder delivery delay of non-systematic coding schemes. However, these non-systematic schemes may not be the optimum strategy in networks with a long RT T .…”
Section: Related Workmentioning
confidence: 99%
“…In addition, a non-asymptotic analysis of the delay distributions of RLNC [14] and various multicast scenarios [15], [16], [17] have also been investigated. Research looking at the in-order delivery delay in uncoded systems is provided in [2] and [18]; while [19], [20], and [21] consider the inorder delivery delay of non-systematic coding schemes. However, these non-systematic schemes may not be the optimum strategy in networks with a long RT T .…”
Section: Related Workmentioning
confidence: 99%
“…If the code is not systematic, only the coded packets are transmitted. Previous work has primarily focused on the decoding delay of non-systematic constructions [20], [21], [22], [23], [24], [25], [26], [27], and show that the decoding delay is essentially proportional to the block size. The in-order delivery delay of systematic block codes is lower than that of non-systematic codes but remains essentially proportional to the block size (with a smaller pre-factor than for non-systematic codes), see Cloud et al [28] and references therein.…”
Section: Block Codesmentioning
confidence: 99%
“…The last step follows from the fact that the decoding failure probability is zero if S 1 = 0 and for all S 1 ≥ 1 the decoding failure probability is upper bounded by (1 − 1 Q 2 ) k following the theorem 5. Putting together equations (24), (25) and Corollary 1, we have lim t→∞…”
Section: Proof Of Theorem 3 Part IImentioning
confidence: 99%
“…In addition, a non-asymptotic analysis of the delay distributions of random linear network coding (RLNC) ( [14]) and various multicast scenarios ( [15], [16], [17]) using a variant of the scheme in Figure 1(b) have also been investigated. Furthermore, the research that looks at the in-order packet delay is provided in [2] and [18] for uncoded systems, while [19], [20], and [21] considers the in-order packet delay for non-systematic coding schemes similar to the one shown in Figure 1(b). However, these non-systematic schemes may not be the optimum strategy in networks or communication channels with a long RT T .…”
Section: Related Workmentioning
confidence: 99%