52,484 research outputs found
Monotonicity and error bounds for networks of Erlang loss queues
Networks of Erlang loss queues naturally arise when modelling finite communication systems without delays, among which, most notably are (i) classical circuit switch telephone networks (loss networks) and (ii) present-day wireless mobile networks. Performance measures of interest such as loss probabilities or throughputs can be obtained from the steady state distribution. However, while this steady state distribution has a closed product form expression in the first case (loss networks), it does not have one in the second case due to blocked (and lost) handovers. Product form approximations are therefore suggested. These approximations are obtained by a combined modification of both the state space (by a hypercubic expansion) and the transition rates (by extra redial rates). It will be shown that these product form approximations lead to (1) upper bounds for loss probabilities and \ud
(2) analytic error bounds for the accuracy of the approximation for various performance measures.\ud
The proofs of these results rely upon both monotonicity results and an analytic error bound method as based on Markov reward theory. This combination and its technicalities are of interest by themselves. The technical conditions are worked out and verified for two specific applications:\ud
(1)• pure loss networks as under (2)• GSM networks with fixed channel allocation as under.\ud
The results are of practical interest for computational simplifications and, particularly, to guarantee that blocking probabilities do not exceed a given threshold such as for network dimensioning
Convex Optimization Based Bit Allocation for Light Field Compression under Weighting and Consistency Constraints
Compared with conventional image and video, light field images introduce the
weight channel, as well as the visual consistency of rendered view, information
that has to be taken into account when compressing the pseudo-temporal-sequence
(PTS) created from light field images. In this paper, we propose a novel frame
level bit allocation framework for PTS coding. A joint model that measures
weighted distortion and visual consistency, combined with an iterative encoding
system, yields the optimal bit allocation for each frame by solving a convex
optimization problem. Experimental results show that the proposed framework is
effective in producing desired distortion distribution based on weights, and
achieves up to 24.7% BD-rate reduction comparing to the default rate control
algorithm.Comment: published in IEEE Data Compression Conference, 201
Monotonicity and error bounds for networks of Erlang loss queues
Networks of Erlang loss queues naturally arise when modelling finite communication systems without delays, among which, most notably\ud
(i) classical circuit switch telephone networks (loss networks) and\ud
(ii) present-day wireless mobile networks.\ud
\ud
Performance measures of interest such as loss probabilities or throughputs can be obtained from the steady state distribution. However, while this steady state distribution has a closed product form expression in the first case (loss networks), it has not in the second case due to blocked (and lost) handovers. Product form approximations are therefore suggested. These approximations are obtained by a combined modification of both the state space (by a hyper cubic expansion) and the transition rates (by extra redial rates). It will be shown that these product form approximations lead to\ud
\ud
- secure upper bounds for loss probabilities and\ud
- analytic error bounds for the accuracy of the approximation for various performance measures.\ud
\ud
The proofs of these results rely upon both monotonicity results and an analytic error bound method as based on Markov reward theory. This combination and its technicalities are of interest by themselves. The technical conditions are worked out and verified for two specific applications:\ud
\ud
- pure loss networks as under (i)\ud
- GSM-networks with fixed channel allocation as under (ii).\ud
\ud
The results are of practical interest for computational simplifications and, particularly, to guarantee blocking probabilities not to exceed a given threshold such as for network dimensioning.\u
Recommended from our members
Memory-Based High-Level Synthesis Optimizations Security Exploration on the Power Side-Channel
High-level synthesis (HLS) allows hardware designers to think algorithmically and not worry about low-level, cycle-by-cycle details. This provides the ability to quickly explore the architectural design space and tradeoffs between resource utilization and performance. Unfortunately, security evaluation is not a standard part of the HLS design flow. In this article, we aim to understand the effects of memory-based HLS optimizations on power side-channel leakage. We use Xilinx Vivado HLS to develop different cryptographic cores, implement them on a Spartan-6 FPGA, and collect power traces. We evaluate the designs with respect to resource utilization, performance, and information leakage through power consumption. We have two important observations and contributions. First, the choice of resource optimization directive results in different levels of side-channel vulnerabilities. Second, the partitioning optimization directive can greatly compromise the hardware cryptographic system through power side-channel leakage due to the deployment of memory control logic. We describe an evaluation procedure for power side-channel leakage and use it to make best-effort recommendations about how to design more secure architectures in the cryptographic domain
- …