Browsing by Subject "Burstiness"

Now showing 1 - 3 of 3

Open Access
On erasure correction coding for streaming
(IEEE, 2012) Tekin, Ömer Faruk; Ho, T.; Yao, H.; Jaggi, S.
We consider packet erasure correction coding for a streaming system where specific information needs to be decoded by specific deadlines, in order to ensure uninterrupted playback at the receiver. In our previous work [1], we gave a capacity-achieving code construction for the case of a fixed number of erasures. In this work, we consider a sliding window erasure pattern where the number of erasures within windows of size above some threshold is upper bounded by a fraction of the window size, modeling a constraint on burstiness of the channel. We lower bound the rates achievable by our previous code construction as a fraction of the capacity region, which approaches to one as the window size threshold and the initial playout delay increase simultaneously.
Open Access
Performance analysis of two-level forward error correction for lostcell recovery in ATM networks
(IEEE, 1995-04) Oğuz, Nihat Cem; Ayanoğlu, E.
The major source of errors in B-ISDN/ATM systems is expected to be buffer overflow during congested conditions, resulting in ATM cell losses which degrade the quality of service. It has been shown by many authors that the performance of the end-to-end system can be made much less sensitive to cell loss by means of forward error correction. This paper discusses the use of a two-level forward error correction scheme for virtual channel and virtual path connections in ATM networks. The scheme exploits simple block coding and code interleaving simultaneously. The simple block, interleaved, and joint coding schemes are studied and analyzed by using a novel and accurate discrete-time analytical method which enables the burstiness of cell losses be captured precisely. Detailed performance calculations, which indicate that it is possible to reduce the cell loss rate by several orders of magnitude over a wide range of network load for various traffic conditions, are discussed, and compared with simulation results. The comparisons show that the method is very accurate for bursty traffic. The advantages of the three coding techniques are quantified for different traffic characteristics and scenarios © Copyright 2009 IEEE - All Rights Reserved.
Open Access
A simulation study of two-level forward error correction for lost packet recovery in B-ISDN/ATM
(IEEE, 1993) Oğuz, Nihat Cem; Ayanoğlu, E.
The major source of errors in B-ISDN/ATM systems is expected to be buffer overflow during congested conditions, resulting in lost packets. A single lost or errored ATM cell will cause retransmission of the entire packet data unit (PDU) that it belongs to. The performance of the end-to-end system can be made much less sensitive to cell loss by means of forward error correction. In this paper, we present the results of a simulation study for an ATM network where forward error correction is performed at both the cell level and the PDU level. The results indicate that (i) cell losses are highly correlated in time, and analytical models ignoring this fact will not yield accurate results, (ii) the correlation of cell losses is similar to burst errors in digital communication, and similar code interleaving techniques should be used, (iii) coding cells and PDUs separately provides this interleaving effect, and this joint code outperforms coding only at the cell level or only at the PDU level in almost all cases simulated.