2006
DOI: 10.1016/j.peva.2004.11.006
|View full text |Cite
|
Sign up to set email alerts
|

Parallel downloads for streaming applications—a resequencing analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
9
1

Year Published

2008
2008
2015
2015

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(10 citation statements)
references
References 17 publications
0
9
1
Order By: Relevance
“…This is different from the previous works [15]- [17] which only focus on mean value of the random delay. The rest of this paper is organized as follows.…”
Section: Introductioncontrasting
confidence: 70%
See 3 more Smart Citations
“…This is different from the previous works [15]- [17] which only focus on mean value of the random delay. The rest of this paper is organized as follows.…”
Section: Introductioncontrasting
confidence: 70%
“…In [15], authors analyze the resequencing buffer occupancy distribution based on discrete Markov-chain and propose a new packets assignment method to reduce buffer occupancy. Based on [15], [11] provides a simulation framework about the re-sequencing buffer occupancy and performs an analysis on the fundamental factors for packet re-ordering in CMT.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…Packet reordering is of course also studied in many additional networking contexts, such as the parallel download of multiple parts of a given file [23], or in ARQ (Automatic Repeat reQuest) protocols [24]. Recently, Leith et al [25] considered the problem of encoding packets with independent probabilistic delays such that the probability that a packet can be decoded within a given decoding deadline is maximized.…”
Section: Related Workmentioning
confidence: 99%