Transient handover blocking probabilities in road covering cellular mobile networks

This paper investigates handover and fresh call blocking probabilities for subscribers moving along a road in a traffic jam passing through consecutive cells of a wireless network. It is observed and theoretically motivated that the handover blocking probabilities show a sharp peak in the initial part of a traffic jam roughly at the moment when the traffic jam starts covering a new cell. The theoretical motivation relates handover blocking probabilities to blocking probabilities in the M/D/C/C queue with time-varying arrival rates. We provide a numerically efficient recursion for these blocking probabilities. \u

Efficient estimation of blocking probabilities in non-stationary loss networks

This paper considers estimation of blocking probabilities in a nonstationary loss network. Invoking the so called MOL (Modified Offered Load) approximation, the problem is transformed into one requiring the solution of blocking probabilities in a sequence of stationary loss networks with time varying loads. To estimate the blocking probabilities Monte Carlo simulation is used and to increase the efficiency of the simulation, we develop a likelihood ratio method that enables samples drawn at a one time point to be used at later time points. This reduces the need to draw new samples every time independently as a new time point is considered, thus giving substantial savings in the computational effort of evaluating time dependent blocking probabilities. The accuracy of the method is analyzed by using Taylor series approximations of the variance indicating the direct dependence of the accuracy on the rate of change of the actual load. Finally, three practical applications of the method are provided along with numerical examples to demonstrate the efficiency of the method

On-the-fly adaptivity for nonlinear twoscale simulations using artificial neural networks and reduced order modeling

A multi-fidelity surrogate model for highly nonlinear multiscale problems is proposed. It is based on the introduction of two different surrogate models and an adaptive on-the-fly switching. The two concurrent surrogates are built incrementally starting from a moderate set of evaluations of the full order model. Therefore, a reduced order model (ROM) is generated. Using a hybrid ROM-preconditioned FE solver, additional effective stress-strain data is simulated while the number of samples is kept to a moderate level by using a dedicated and physics-guided sampling technique. Machine learning (ML) is subsequently used to build the second surrogate by means of artificial neural networks (ANN). Different ANN architectures are explored and the features used as inputs of the ANN are fine tuned in order to improve the overall quality of the ML model. Additional ANN surrogates for the stress errors are generated. Therefore, conservative design guidelines for error surrogates are presented by adapting the loss functions of the ANN training in pure regression or pure classification settings. The error surrogates can be used as quality indicators in order to adaptively select the appropriate -- i.e. efficient yet accurate -- surrogate. Two strategies for the on-the-fly switching are investigated and a practicable and robust algorithm is proposed that eliminates relevant technical difficulties attributed to model switching. The provided algorithms and ANN design guidelines can easily be adopted for different problem settings and, thereby, they enable generalization of the used machine learning techniques for a wide range of applications. The resulting hybrid surrogate is employed in challenging multilevel FE simulations for a three-phase composite with pseudo-plastic micro-constituents. Numerical examples highlight the performance of the proposed approach

Linear/Quadratic Programming-Based Optimal Power Flow using Linear Power Flow and Absolute Loss Approximations

This paper presents novel methods to approximate the nonlinear AC optimal power flow (OPF) into tractable linear/quadratic programming (LP/QP) based OPF problems that can be used for power system planning and operation. We derive a linear power flow approximation and consider a convex reformulation of the power losses in the form of absolute value functions. We show four ways how to incorporate this approximation into LP/QP based OPF problems. In a comprehensive case study the usefulness of our OPF methods is analyzed and compared with an existing OPF relaxation and approximation method. As a result, the errors on voltage magnitudes and angles are reasonable, while obtaining near-optimal results for typical scenarios. We find that our methods reduce significantly the computational complexity compared to the nonlinear AC-OPF making them a good choice for planning purposes

Low latency via redundancy

Low latency is critical for interactive networked applications. But while we know how to scale systems to increase capacity, reducing latency --- especially the tail of the latency distribution --- can be much more difficult. In this paper, we argue that the use of redundancy is an effective way to convert extra capacity into reduced latency. By initiating redundant operations across diverse resources and using the first result which completes, redundancy improves a system's latency even under exceptional conditions. We study the tradeoff with added system utilization, characterizing the situations in which replicating all tasks reduces mean latency. We then demonstrate empirically that replicating all operations can result in significant mean and tail latency reduction in real-world systems including DNS queries, database servers, and packet forwarding within networks

The Intensity Matching Approach: A Tractable Stochastic Geometry Approximation to System-Level Analysis of Cellular Networks

The intensity matching approach for tractable performance evaluation and optimization of cellular networks is introduced. It assumes that the base stations are modeled as points of a Poisson point process and leverages stochastic geometry for system-level analysis. Its rationale relies on observing that system-level performance is determined by the intensity measure of transformations of the underlaying spatial Poisson point process. By approximating the original system model with a simplified one, whose performance is determined by a mathematically convenient intensity measure, tractable yet accurate integral expressions for computing area spectral efficiency and potential throughput are provided. The considered system model accounts for many practical aspects that, for tractability, are typically neglected, e.g., line-of-sight and non-line-of-sight propagation, antenna radiation patterns, traffic load, practical cell associations, general fading channels. The proposed approach, more importantly, is conveniently formulated for unveiling the impact of several system parameters, e.g., the density of base stations and blockages. The effectiveness of this novel and general methodology is validated with the aid of empirical data for the locations of base stations and for the footprints of buildings in dense urban environments.Comment: Submitted for Journal Publicatio