8,510 research outputs found
Network File Storage With Graceful Performance Degradation
A file storage scheme is proposed for networks containing heterogeneous clients. In the scheme, the
performance measured by file-retrieval delays degrades gracefully under increasingly serious faulty
circumstances. The scheme combines coding with storage for better performance. The problem
is NP-hard for general networks; and this paper focuses on tree networks with asymmetric edges
between adjacent nodes. A polynomial-time memory-allocation algorithm is presented, which
determines how much data to store on each node, with the objective of minimizing the total
amount of data stored in the network. Then a polynomial-time data-interleaving algorithm is used
to determine which data to store on each node for satisfying the quality-of-service requirements in
the scheme. By combining the memory-allocation algorithm with the data-interleaving algorithm,
an optimal solution to realize the file storage scheme in tree networks is established
Evaluation of cross-layer reliability mechanisms for satellite digital multimedia broadcast
This paper presents a study of some reliability mechanisms which may be put at work in the context of Satellite Digital Multimedia Broadcasting (SDMB) to mobile devices such as handheld phones. These mechanisms include error correcting codes, interleaving at the physical layer, erasure codes at
intermediate layers and error concealment on the video decoder. The evaluation is made on a realistic satellite channel and takes into account practical constraints such as the maximum zapping time and the user mobility at several speeds. The evaluation is done by simulating different scenarii with complete protocol stacks. The simulations indicate that, under the assumptions taken here, the scenario using highly compressed video protected by erasure codes at intermediate layers seems to be the best solution
on this kind of channel
A performance comparison between block interleaved and helically interleaved concatenated coding systems
The performance (bit-error rate vs. signal-to-noise ratio) of two different interleaving systems, block interleaving and the newer helical interleaving are compared. Both systems are studied with and without error forecasting. Without error forecasting, the two systems have identical performance. When error forecasting is used with shallow interleaving, helical interleaving gains, but less than 0.05 dB, over block interleaving. For higher interleaving depth, the systems have almost indistinguishable performance
Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3
Discussions about the choice of a tree hash mode of operation for a
standardization have recently been undertaken. It appears that a single tree
mode cannot address adequately all possible uses and specifications of a
system. In this paper, we review the tree modes which have been proposed, we
discuss their problems and propose remedies. We make the reasonable assumption
that communicating systems have different specifications and that software
applications are of different types (securing stored content or live-streamed
content). Finally, we propose new modes of operation that address the resource
usage problem for the three most representative categories of devices and we
analyse their asymptotic behavior
Quasi-orthogonal space-frequency coding in non-coherent cooperative broadband networks
© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.So far, complex valued orthogonal codes have been used differentially in cooperative broadband networks. These codes however achieve less than unitary code rate when utilized in cooperative networks with more than two relays. Therefore, the main challenge is how to construct unitary rate codes for non-coherent cooperative broadband networks with more than two relays while exploiting the achievable spatial and frequency diversity. In this paper, we extend full rate quasi-orthogonal codes to differential cooperative broadband networks where channel information is unavailable. From this, we propose a generalized differential distributed quasi-orthogonal space-frequency coding (DQSFC) protocol for cooperative broadband networks. Our proposed scheme is able to achieve full rate, and full spatial and frequency diversity in cooperative networks with any number of relays. Through pairwise error probability analysis we show that the diversity gain of our scheme can be improved by appropriate code construction and sub-carrier allocation. Based on this, we derive sufficient conditions for the proposed code structure at the source node and relay nodes to achieve full spatial and frequency diversity.Peer reviewe
- …