235 research outputs found
Enhancing multi-source content delivery in content-centric networks with fountain coding
Fountain coding has been considered as especially suitable for lossy environments, such as wireless networks, as it provides redundancy while reducing coordination overheads between sender(s) and receiver(s). As such it presents beneficial properties for multi-source and/or multicast communication. In this paper we investigate enhancing/increasing multi-source content delivery efficiency in the context of Content-Centric Networking (CCN) with the usage of fountain codes. In particular, we examine whether the combination of fountain coding with the in-network caching capabilities of CCN can further improve performance. We also present an enhancement of CCN's Interest forwarding mechanism that aims at minimizing duplicate transmissions that may occur in a multi-source transmission scenario, where all available content providers and caches with matching (cached) content transmit data packets simultaneously. Our simulations indicate that the use of fountain coding in CCN is a valid approach that further increases network performance compared to traditional schemes
Fountain coding with decoder side information
In this contribution, we consider the application of Digital Fountain (DF) codes to the problem of data transmission when side information is available at the decoder. The side information is modelled as a "virtual" channel output when original information sequence is the input. For two cases of the system model, which model both the virtual and the actual transmission channel either as a binary erasure channel or as a binary input additive white Gaussian noise (BIAWGN) channel, we propose methods of enhancing the design of standard non-systematic DF codes by optimizing their output degree distribution based oil the side information assumption. In addition, a systematic Raptor design has been employed as a possible solution to the problem
Rateless Codes with Progressive Recovery for Layered Multimedia Delivery
This paper proposes a novel approach, based on unequal error protection, to
enhance rateless codes with progressive recovery for layered multimedia
delivery. With a parallel encoding structure, the proposed Progressive Rateless
codes (PRC) assign unequal redundancy to each layer in accordance with their
importance. Each output symbol contains information from all layers, and thus
the stream layers can be recovered progressively at the expected received
ratios of output symbols. Furthermore, the dependency between layers is
naturally considered. The performance of the PRC is evaluated and compared with
some related UEP approaches. Results show that our PRC approach provides better
recovery performance with lower overhead both theoretically and numerically
Two remarks to noiseless coding
An inequality concerning Kullback's I-divergence is applied to obtain a necessary condition for the possibility of encoding symbols of the alphabet of a discrete memoryless source of entropy H by sequences of symbols of another alphabet of size D in such a way that the average code length be close to the optimum H/log D. The same idea is applied to the problem of maximizing entropy per second for unequal symbol lenghts, too
- …