Index assignment for multiple description repair in distributed storage systems

in ICC 2014 (2014)

Distributed storage systems have been receiving increasing attention lately due to the developments in cloud and grid computing. Furthermore, a major part of the stored information comprises of multimedia ... [more ▼]

Distributed storage systems have been receiving increasing attention lately due to the developments in cloud and grid computing. Furthermore, a major part of the stored information comprises of multimedia, whose content can be communicated even with a lossy (non-perfect) reconstruction. In this context, Multiple Description Lattice Quantizers (MDLQ) can be employed to encode such sources for distributed storage and store them across distributed nodes. Their inherent properties yield that having access to all nodes gives perfect reconstruction of the source, while the reconstruction quality decreases gracefully with fewer available nodes. If a set of nodes fails, lossy repair techniques could be applied to reconstruct the failed nodes from the available ones. This problem has mostly been studied with the lossless (perfect) reconstruction assumption. In this work, a general model, Multiple Description Lattice Quantizer with Repairs (MDLQR), is introduced that encompasses the lossy repair problem for distributed storage applications. New performance measures and repair techniques are introduced for MDLQR, and a non-trivial identity is derived, which is related to other results in the literature. This enables us to find the optimal encoder for a certain repair technique used in the MDLQR. Furthermore, simulation results are used to evaluate the performance of the different repair techniques. © 2014 IEEE. [less ▲]

Secondary User Scheduling Under Throughput Guarantees for the Primary Network

in IEEE Vehicular Technology Conference (VTC), Fall 2013 (2013, September 02)

This work addresses scheduling in a cognitive radio scenario where a minimum throughput for the downlink primary network (PN) is guaranteed to each user with an associated violation probability ... [more ▼]

This work addresses scheduling in a cognitive radio scenario where a minimum throughput for the downlink primary network (PN) is guaranteed to each user with an associated violation probability (probability of not obtaining the guaranteed throughput). The primary network is surrounded by multiple downlink secondary networks, each aiming to maximize its network throughput. Scheduling in PN is performed independent of the secondary networks. Some information about the PN is available at the central scheduler that is responsible for scheduling the secondary networks. The contribution of this work is to apply a novel scheduler to the PN which is more robust to QoS degradations resulting from the secondary networks than other state of the art schedulers. This is validated by numerical simulations of the cognitive radio network. [less ▲]

Maximizing Minimum Throughput Guarantees: The Small Violation Probability Region

in IEEE Wireless Communications Letters (2013)

Providing minimum throughput guarantees is one of the goals for radio resource allocation schemes. It is difficult to provide these guarantees without defining violation probability due to limited power ... [more ▼]

Providing minimum throughput guarantees is one of the goals for radio resource allocation schemes. It is difficult to provide these guarantees without defining violation probability due to limited power budget and rapidly changing conditions of the wireless channel. For every practical scheduling scheme, there is a feasibility region defined by the minimum guaranteed throughput and the corresponding probability that the users fail to get the guaranteed throughput (violation probability). In this work, we focus on minimizing the violation probability specifically in the small probability region. We compare our results with major schedulers available in literature and show that our scheme outperforms them in the small violation probability region. [less ▲]