Search

In this paper, we analyze a two-queue random time-limited Markov-modulated polling model. In the first part of the paper, we investigate the fluid version: fluid arrives at the two queues as two independent flows with deterministic rate. There is a single server that serves both queues at constant speeds. The server spends an exponentially distributed amount of time in each queue. After the completion of such a visit time to one queue, the server instantly switches to the other queue, i.e., there is no switch-over time. For this model, we first derive the Laplace–Stieltjes transform (LST) of the stationary marginal fluid content/workload at each queue. Subsequently, we derive a functional equation for the LST of the two-dimensional workload distribution that leads to a Riemann–Hilbert boundary value problem (BVP). After taking a heavy-traffic limit, and restricting ourselves to the symmetric case, the BVP simplifies and can be solved explicitly. In the second part of the paper, allowing for more general (Lévy) input processes and server switching policies, we investigate the transient process limit of the joint workload in heavy traffic. Again solving a BVP, we determine the stationary distribution of the limiting process. We show that, in the symmetric case, this distribution coincides with our earlier solution of the BVP, implying that in this case the two limits (stationarity and heavy traffic) commute.

The system considered in this paper operates with a feedback that is characterized by a gain and a desired final state (DFS), which is the main parameter of interest in the present study. The system is, however, subjected intermittently to stochastic inputs according to a Markov process. Since the system operates in two modes | under the feedback to the DFS and under a stochastic input|the Interacting Multiple Model (IMM) estimator is used. Two approaches are considered: (i) the DFS is a discrete-valued random variable | one of a finite number of possible states | with an a priori probability mass function (pmf), and (ii) the DFS is a continuous-valued random variable with an a priori probability density function (pdf). For Approach (i), we use a multiple IMM estimator (MIMM) that features one IMM for each one of the possible DFS. The a posteriori probability of the model for each IMM, i.e., of each DFS, will be computed based on the likelihood function (LF) of the corresponding IMM. For Approach (ii), we design a single IMM to handle the unknown DFS to be estimated (mode M1), and the random inputs (mode M2). Simulation results explore several scenarios and investigate the degree of observability of this stochastic problem.

We consider exponential single server queues with state-dependent arrival and service rates that evolve under influences of external environments. The transitions of the queues are influenced by the environment’s state and the movements of the environment depend on the status of the queues (bidirectional interaction). The environment is constructed in a way to encompass various models from the recent Operations Research literature, where a queue is coupled with an inventory or with reliability issues. With a Markovian joint queueing-environment process, we prove separability for a large class of such interactive systems; that is, the steady state distribution is of product form and explicitly given. The queue and the environment processes decouple asymptotically and in steady state. For nonseparable systems, we develop ergodicity and exponential ergodicity criteria via Lyapunov functions. By examples we explain principles for bounding departure rates of served customers (throughputs) of nonseparable systems by throughputs of related separable systems as upper and lower bound.

We consider the optimal control of input-queued switches under a cost-weighted variant of MaxWeight scheduling, for which we establish theoretical properties that include showing the algorithm exhibits optimal heavy-traffic queue-length scaling. Our results are expected to be of theoretical interest more broadly than input-queued switches.

In this article, a coupled Two-relaxation-time Lattice Boltzmann-Volume penalization (TRT-LBM-VP) method is presented to simulate flows past obstacles. Two relaxation times are used in the collision operator, of which one is related to the fluid viscosity and the other one is related to the numerical stability and accuracy. The volume penalization method is introduced into the TRT-LBM by an external forcing term. In the procedure of the TRT-LBM-VP, the processes of interpolating velocities on the boundaries points and distributing the force density to the Eulerian points are unneeded. Performing the TRT-LBM-VP on a certain point, only the variables of this point are needed. As a consequence, the TRT-LBM-VP can be conducted parallelly. From the comparison between the result of the cylindrical Couette flow solved by the TRT-LBM-VP and that solved by the Single-relaxation-time LBM-VP (SRT-LBM-VP), the accuracy of the TRT-LBM-VP is higher than that of the SRT-LBM-VP. Flows past a single circular cylinder, a pair of cylinders in tandem and side-by-side arrangements, two counter-rotating cylinders and a NACA-0012 airfoil are chosen as numerical experiments to verify the present method further. Good agreements between the present results and those in the previous literatures are achieved.

The basic load balancing scenario involves a single dispatcher where tasks arrive that must immediately be forwarded to one of $N$ single-server queues. We discuss recent advances on scalable load balancing schemes which provide favorable delay performance when $N$ grows large, and yet only require minimal implementation overhead. Join-the-Shortest-Queue (JSQ) yields vanishing delays as $N$ grows large, as in a centralized queueing arrangement, but involves a prohibitive communication burden. In contrast, power-of-$d$ or JSQ($d$) schemes that assign an incoming task to a server with the shortest queue among $d$ servers selected uniformly at random require little communication, but lead to constant delays. In order to examine this fundamental trade-off between delay performance and implementation overhead, we consider JSQ($d(N)$) schemes where the diversity parameter $d(N)$ depends on $N$ and investigate what growth rate of $d(N)$ is required to asymptotically match the optimal JSQ performance on fluid and diffusion scale. Stochastic coupling techniques and stochastic-process limits play an instrumental role in establishing the asymptotic optimality. We demonstrate how this methodology carries over to infinite-server settings, finite buffers, multiple dispatchers, servers arranged on graph topologies, and token-based load balancing including the popular Join-the-Idle-Queue (JIQ) scheme. In this way we provide a broad overview of the many recent advances in the field. This survey extends the short review presented at ICM 2018 (arXiv:1712.08555)., To appear in SIAM Review. arXiv admin note: substantial text overlap with arXiv:1712.08555

A numerical cloud model with Lagrangian particles coupled to an Eulerian flow is adapted for distributed memory systems. Eulerian and Lagrangian calculations can be done in parallel on CPUs and GPUs, respectively. The fraction of time when CPUs and GPUs work simultaneously is maximized at around 80 % for an optimal ratio of CPU and GPU workloads. The optimal ratio of workloads is different for different systems because it depends on the relation between computing performance of CPUs and GPUs. GPU workload can be adjusted by changing the number of Lagrangian particles, which is limited by device memory. Lagrangian computations scale with the number of nodes better than Eulerian computations because the former do not require collective communications. This means that the ratio of CPU and GPU computation times also depends on the number of nodes. Therefore, for a fixed number of Lagrangian particles, there is an optimal number of nodes, for which the time CPUs and GPUs work simultaneously is maximized. Scaling efficiency up to this optimal number of nodes is close to 100 %. Simulations that use both CPUs and GPUs take between 10 and 120 times less time and use between 10 to 60 times less energy than simulations run on CPUs only. Simulations with Lagrangian microphysics take up to 8 times longer to finish than simulations with Eulerian bulk microphysics, but the difference decreases as more nodes are used. The presented method of adaptation for computing clusters can be used in any numerical model with Lagrangian particles coupled to an Eulerian fluid flow.

In this paper, we develop two finite difference weighted essentially non-oscillatory (WENO) schemes with unequal-sized sub-stencils for solving the Degasperis-Procesi (DP) and $\mu$-Degasperis-Procesi ($\mu$DP) equations, which contain nonlinear high order derivatives, and possibly peakon solutions or shock waves. By introducing auxiliary variable(s), we rewrite the DP equation as a hyperbolic-elliptic system, and the \mdp equation as a first order system. Then we choose a linear finite difference scheme with suitable order of accuracy for the auxiliary variable(s), and two finite difference WENO schemes with unequal-sized sub-stencils for the primal variable. One WENO scheme uses one large stencil and several smaller stencils, and the other WENO scheme is based on the multi-resolution framework which uses a series of unequal-sized hierarchical central stencils. Comparing with the classical WENO scheme which uses several small stencils of the same size to make up a big stencil, both WENO schemes with unequal-sized sub-stencils are simple in the choice of the stencil and enjoy the freedom of arbitrary positive linear weights. Another advantage is that the final reconstructed polynomial on the target cell is a polynomial of the same degree as the polynomial over the big stencil, while the classical finite difference WENO reconstruction can only be obtained for specific points inside the target interval. Numerical tests are provided to demonstrate the high order accuracy and non-oscillatory properties of the proposed schemes.

Our primary objective in this article is to compare the spectral densities of some cyclostationary time series. By using the limiting distributions of the discrete Fourier transform, a novel approach is introduced to determine whether the spectral densities of some uncorrelated cyclostationary time series are the same or not. Also, the ability of the proposed technique is examined by employing simulated and real datasets.

We investigate fluid scaling of single server queueing systems under the shortest job first with aging (SJFA) scheduling policy. We use the measure-valued Skorokhod map to characterize the fluid limit for SJFA queues with a general aging rule and establish convergence results to the fluid limit. We treat in detail examples of linear and exponential aging.

In the mobile edge computing environments, Quality of Service (QoS) prediction plays a crucial role in web service recommendation. Because of distinct features of mobile edge computing, i.e., the mobility of users and incomplete historical QoS data, traditional QoS prediction approaches may obtain less accurate results in the mobile edge computing environments. In this paper, we treat the historical QoS values at different time slots as a temporal sequence of QoS matrices. By incorporating the compressed matrices extracted from QoS matrices through truncated Singular Value Decomposition (SVD) with the classical ARIMA model, we extend the ARIMA model to predict multiple QoS values simultaneously and efficiently. Experimental results show that our proposed approach outperforms the other state-of-the-art approaches in accuracy and efficiency.

The multi-connectivity is a key enabler for ultra-reliable low-latency communications. To evaluate its performance and suitability to various use casessystem-level studies are essential, where the physical layer (PHY) plays an important role. Therefore, PHY modeling is required which is time-intensive and requires highly complex computations. For this purpose, the PHY performance is usually abstracted in terms of signal-to-interference-plus-noise ratio (SINR), also known as physical layer abstraction (PLA). However, due to fading, the symbols inside a packet could have different SINRs which require effective SINR mapping to compute an equivalent SINR. In the context of multi-connectivity, the received SINR depends on all connected links where each link experiences independent fading and on the used link combining technique. As a result, the computation of effective SINR also depends on the combining technique and fading experienced by individual links. To model PHY performance by considering all these effects, we develop PLA for multi-connectivity communications. This includes the computation of received symbols SINR for various link combining techniques and mapping them to effective SINR using enhanced exponential effective SINR mapping (eEESM). Furthermore, a new optimization method is introduced for eEESM to reduce its optimization complexity. Simulation results show that the proposed PLA accurately estimate the performance of different order of multi-connectivity communications under various fading conditions.

We propose a novel privacy-preserving QoS forecasting approach - Edge-Laplace QoS (QoS forecasting with Laplace noise in mobile Edge environments). Edge-Laplace QoS is able to accurately and efficiently forecast Quality of Service (QoS) of various Web Services, while effectively protecting user privacy in mobile edge environments. We employ an improved differential privacy method to add dynamic disguises to the original QoS data in the edge environment to protect user data privacy. A collaborative filtering method is adopted to retrieve similar users' accessing records based on geographic locations of their accessed servers for QoS forecasting. We conduct a set of experiments using several public network data sets. The results show that the efficiency of Edge-Laplace QoS is superior to traditional forecasting approaches. Edge-Laplace QoS is also validated to be more suitable for edge environments than traditional privacy-preserving approaches.

Backoff algorithms are used in many distributed systems where multiple devices contend for a shared resource. For the classic balls-into-bins problem, the number of singletons - those bins with a single ball - is important to the analysis of several backoff algorithms; however, existing analyses employ advanced probabilistic tools to obtain concentration bounds. Here, we show that standard Chernoff bounds can be used instead, and the simplicity of this approach is illustrated by re-analyzing some well-known backoff algorithms.

Existing Orthogonal Frequency-Division Multiplexing (OFDM) variants based on cyclic prefix (CP) allow for efficient time synchronization, but suffer from lower power efficiency compared to zero-padded (ZP)-OFDM. Because of its power efficiency, ZP-OFDM is considered as an appealing solution for the emerging low-power wireless systems. However, in the absence of CP, time synchronization in ZP-OFDM is a challenging task. In this paper, the non-data-aided (NDA) maximum-likelihood (ML) time synchronization for ZP-OFDM is analytically derived. We show that the optimal NDA-ML synchronization algorithm offers a high lock-in probability and can be efficiently implemented using Monte Carlo sampling (MCS) technique in combination with golden-section search method in one dimension. To obtain the optimal NDA-ML time synchronization algorithm, we first derive a closed-form expression for the joint probability density function (PDF) of the received ZP-OFDM samples in frequency-selective fading channels. The derived expression is valid for doubly-selective fading channels with mobile users as well. The performance of the proposed synchronization algorithm is evaluated under various practical settings through simulation experiments. It is shown that the proposed optimal NDA-ML synchronization algorithm and its MCS implementation substantially outperforms existing NDA time synchronization algorithms in terms of lock-in probability and mean-squared error (MSE).

A high fidelity flow simulation for complex geometries for high Reynolds number (Re) flow is still very challenging, requiring a more powerful HPC system. However, the development of HPC with traditional CPU architecture suffers bottlenecks due to its high power consumption and technical difficulties. Heterogeneous architecture computation is raised to be a promising solution to the challenges of HPC development. GPU accelerating technology has been utilized in low order scheme CFD solvers on the structured grid and high order scheme solvers on unstructured meshes. The high-order finite difference methods on structured grids possess many advantages, e.g., high efficiency, robustness, and low storage. However, the strong dependence among points for a high-order finite difference scheme still limits its application on the GPU platform. In the present work, we propose a set of hardware-aware technology to optimize data transfer efficiency between CPU and GPU, as well as communication efficiency among GPUs. An in-house multi-block structured CFD solver with high order finite difference methods on curvilinear coordinates is ported onto the GPU platform and obtains satisfying performance with a speedup maximum of around 2000x over a single CPU core. This work provides an efficient solution to apply GPU computing in CFD simulation with specific high order finite difference methods on current GPU heterogeneous computers. The test shows that significant accelerating effects can be achieved for different GPUs.

Atmospheric mass density (AMD) plays a vital role in the drag calculation for space objects in low Earth orbit (LEO). Many empirical AMD models have been developed and used for orbit prediction and...

A moisture advection scheme is an essential module of a numerical weather/climate model representing the horizontal transport of water vapor. The Piecewise Rational Method (PRM) scalar advection scheme in the Global/Regional Assimilation and Prediction System (GRAPES) solves the moisture flux advection equation based on PRM. Computation of the scalar advection involves boundary exchange, and computation of higher bandwidth requirements is complicated and time-consuming in GRAPES. Recently, Graphics Processing Units (GPUs) have been widely used to solve scientific and engineering computing problems owing to advancements in GPU hardware and related programming models such as CUDA/OpenCL and Open Accelerator (OpenACC). Herein, we present an accelerated PRM scalar advection scheme with Message Passing Interface (MPI) and OpenACC to fully exploit GPUs' power over a cluster with multiple Central Processing Units (CPUs) and GPUs, together with optimization of various parameters such as minimizing data transfer, memory coalescing, exposing more parallelism, and overlapping computation with data transfers. Results show that about 3.5 times speedup is obtained for the entire model running at medium resolution with double precision when comparing the scheme's elapsed time on a node with two GPUs (NVIDIA P100) and two 16-core CPUs (Intel Gold 6142). Further, results obtained from experiments of a higher resolution model with multiple GPUs show excellent scalability.

In this paper, an offloading algorithm based on Markov Decision Process (MDP) is proposed to solve the multi-objective offloading decision problem in Mobile Edge Computing (MEC) system. The feature of the algorithm is that MDP is used to make offloading decision. The number of tasks in the task queue, the number of accessible edge clouds and Signal-Noise-Ratio (SNR) of the wireless channel are taken into account in the state space of the MDP model. The offloading delay and energy consumption are considered to define the value function of the MDP model, i.e. the objective function. To maximize the value function, Value Iteration Algorithm is used to obtain the optimal offloading policy. According to the policy, tasks of mobile terminals (MTs) are offloaded to the edge cloud or central cloud, or executed locally. The simulation results show that the proposed algorithm can effectively reduce the offloading delay and energy consumption.

Automatic modulation categorization (AMC) is used in many applications such as cognitive radio, adaptive communication, electronic reconnaissance, and non-cooperative communications. Predicting the modulation class of an unknown radio signal without having any prior information of the signal parameters is challenging. This paper proposes a novel multiscale deep-learning-based approach for the automatic modulation classification using radio signals. The approach considered the fixed boundary range-based Empirical wavelet transform (FBREWT) based multiscale analysis technique to decompose the radio signal into sub-band signals or modes. The sub-band signals computed from the radio signal combined with the deep convolutional neural network (CNN) are used to classify modulation types. The approach is tested using the radio signals of different signal-to-noise ratio (SNR) values and four different channel types such as additive white Gaussian noise (AWGN) combination of Rayleigh fading and AWGN channels, the combination of Rician flat fading and AWGN channels, and combination of Nakagami-m fading and AWGN channels for AMC. The results show that the proposed FBREWT based deep-learning approach achieves an overall classification accuracy of 97% for AMC using the radio signals with 10dB SNR for the AWGN channel. Moreover, the proposed approach has obtained the accuracy’s as 94.56%, 95%, and 97.33% using radio signals with 10 dB SNR values for Rayleigh fading, Rician flat fading, and Nakagami-m fading channels combined through AWGN link. The comparison of the proposed multiscale deep learning-based approach with existing methods is shown for AMC.

Edge infrastructures, including edge computing servers, are increasingly powered by renewable energy and smart grid combined. Two-way energy trading allows the surplus or shortfall of renewable energy to be traded between a server and the smart grid, but is non-trivial due to randomly varying computation demands and renewables. This paper proposes a new online policy, namely, distributed online resource allocation and load management (DORL), which enables such an edge server and its serving devices to minimize their energy cost and energy consumption, respectively, in a fully distributed manner. The key idea is that we employ the stochastic dual-subgradient method to interpret the battery of the server as a virtual queue. Based on the virtual queue and task queues, the CPU frequencies of the devices and the edge server, the offloading transmit rates of the devices (to the server) and the energy trading decisions of the server (with the smart grid) are decoupled over time and among devices, and optimized on an ongoing basis. Furthermore, we prove that the DORL yields a feasible and asymptotically optimal solution with a cost-backlog tradeoff of [\eta, 1\eta]. Simulations show that the DORL reduces the system cost by nearly 50%, as compared to existing benchmarks.

In this brief, a new discrete-time implementation is proposed for the super-twisting control with a semi-implicit Euler method. In contrast to the conventional realization methods, the proposed implementation scheme exploits two signum functions in the super-twisting algorithm (STA) such that the numerical chattering is totally avoided and the control precision is enhanced in terms of smallest control errors in the steady state. It has an advantage that the control accuracy is insensitive to the gain overestimation of STA, which benefits the gain tuning of the STA in practice. These superiorities of the proposed scheme are demonstrated through simulations and comparisons with other state of the art relevant to STA realization methods.

Power packet dispatching system has been proposed for smart power management in the form of discretized packet. In this paper, we discuss the routing optimization of power packets on the network of power routers. We propose a cost metric for the power packet delivery by circuit analysis of the router network. Using the metric, we formulate the optimization problem as a general shortest path problem from a source node to a load node. The result of numerical simulations shows that the proposed algorithm can allocate distributed power sources to load demands and identify the optimal path for the power delivery., This paper was submitted to Nonlinear Theory and Its Applications, IEICE on May 21, 2021

This article presents Maximum Visibility Approach (MVA), a new time series forecasting method based on the Complex Network theory. MVA initially maps time series data into a complex network using the visibility graph method. Then, based on the similarity measures between the nodes in the network, MVA calculates the one-step-ahead forecasts. MVA does not use all past terms in the forecasting process, but only the most significant observations, which are indicated as a result of the autocorrelation function. This method was applied to five different groups of data, most of them showing trend characteristics, seasonal variations and/or non-stationary behavior. We calculated error measures to evaluate the performance of MVA. The results of statistical tests and error measures revealed that MVA has a good performance compared to the accuracy obtained by the benchmarks considered in this work. In all cases, MVA surpassed other forecasting methods in Literature, which confirms that this work will contribute to the field of time series forecasting not only in the theoretical aspect, but also in practice.

The footprint noise is a type of coherent noise that arises from the acquisition geometry. The footprint noise is commonly seen in 3-D seismic volumes and greatly affects the amplitude-based processing and interpretation steps in the seismic exploration workflow. Thus, removal of the footprint noise is necessary for warranting a reliable interpretation output of seismic data processing. However, because footprint noise is usually weak and also spatially coherent, it is inevitable to cause damages to useful signals during its removal steps. Here, we propose a dictionary learning (DL)-based method to effectively remove the footprint noise. We design an algorithm framework to effectively learn the dictionary atoms of the signal waveforms and separate the features of the footprint noise from the learned atoms. Considering the special features of the footprint noise in the dictionary atoms, we propose a statistics-guided way to separate the dictionary atoms into footprint-affected and footprint-free atoms. Then, the footprint-affected atoms are processed via a 2-D median filtering step. The combination between the untouched footprint-free atoms and filtered footprint-affected atoms result in a better dictionary of the signal waveforms and the footprint atoms. We use residual DL to encode the input data by a linear combination of signal atoms and footprint atoms. Removal of footprint atoms and their corresponding sparse coefficients leads to a successful footprint removal. We use both 3-D synthetic and field data examples to demonstrate the effectiveness of the proposed method.

In a wireless communication system, the transmitted signal is exposed to various surfaces where it bounces and results in several delayed versions of the same signal at the receiver end. The delayed signals are in the form of electromagnetic waves that are diffracted and reflected from the various object surfaces. These result in co-channel interferences for wireless systems. MIMO has proven to be a striking solution for the new generation of wireless systems. MIMO-OFDM system with QPSK modulation is considered as the wireless system for studying the performance of interference cancellation techniques. The BER performance is studied in channels such as Rayleigh and Rician Fading Channels. The effects of interference are reduced to a certain extent by the inclusion of CDMA (spread spectrum technique) as Technique 1. The effects of interference on this system have been further reduced using the LMS filter as Technique 2. Hence, to show better performance in MIMO-OFDM systems, it is recommended to employ both CDMA and LMS filters to decrease the effects of co-channel interference. It is observed that the parameter BER reduces as the SNR increases for both these channels. Doi: 10.28991/esj-2021-01313 Full Text: PDF

Robotics and Automation Design , Simulation, Validation, Optimization for Throughput rate maximization

This paper proposes a general analytical approach to derive the outage probability of hybrid automatic repeat request with incremental redundancy (HARQ-IR) over correlated fading channels in closed-form. Unlike prior analyses, the consideration of channel correlation is one of the key reasons making the outage analysis involved. Using conditional Mellin transform, the outage probability of HARQ-IR over correlated Rayleigh fading channels is exactly expressed as a mixture of outage probabilities of HARQ-IR over independent Nakagami fading channels, where the weights are negative multinomial probabilities. Its straightforward application is to conduct asymptotic outage analysis to gain more insights, in which the asymptotic outage probability is obtained in a concise form. The asymptotic outage probability possesses some special properties which ease optimal power allocation and rate selection of HARQ-IR. Finally, numerical results are presented for validations and discussions.

This short note discusses open problems and partial solutions related to Sheldon M Ross's second conjecture about the classical single server queue subject to a randomly time-varying rate arrival rate., Comment: This preprint has not undergone peer review or any post-submission improvements or corrections. The Version of Record of this article is published in Queueing Systems 2022, and is available online at https://doi.org/10.1007/s11134-022-09824-0

A novel implementation of the self-consistent field (SCF) procedure specifically designed for high-performance execution on multiple graphics processing units (GPUs) is presented. The algorithm offloads to GPUs the three major computational stages of the SCF, namely, the calculation of one-electron integrals, the calculation and digestion of electron repulsion integrals, and the diagonalization of the Fock matrix, including SCF acceleration via DIIS. Performance results for a variety of test molecules and basis sets show remarkable speedups with respect to the state-of-the-art parallel GAMESS CPU code and relative to other widely used GPU codes for both single and multi-GPU execution. The new code outperforms all existing multi-GPU implementations when using eight V100 GPUs, with speedups relative to Terachem ranging from 1.2× to 3.3× and speedups of up to 28× over QUICK on one GPU and 15× using eight GPUs. Strong scaling calculations show nearly ideal scalability up to 8 GPUs while retaining high parallel efficiency for up to 18 GPUs.

Phase Modulation Orthogonal Frequency Division Multiplexing (PM-OFDM) and Code Division Multiple Access (CDMA) have distinctive advantages. On one hand, PM-OFDM is an attractive technique to combat multipath fading and reduce high PAPR in conventional OFDM. On the other hand, CDMA has the ability to serve multiple users at the same time and/or frequency. In this article, a new PM-OFDM-CDMA system that combines PM-OFDM and CDMA is proposed. The idea behind the proposed technique is to combine the advantages of these techniques in order to enhance the performance of the 5G system by serving multiple users simultaneously. The performance of the proposed system is analysed in terms of BER under different channel conditions. A Minimum Mean Square Equaliser (MMSE) scheme is used in order to avoid the effect of multipath effect and noise simultaneously. From the simulation results, we conclude that the proposed system has good performance that can improve 5G wireless communication networks, especially for battery-powered mobile devices. This amounts to the constant envelope of the proposed waveform which generates constant instantaneous power and therefore reduced PAPR.

Communications systems concerted over wireless channels depend on the environment. Communications system can be more reliable and efficient by properly analyzing wireless channels. Today's most important features are a high data rate and reliable performance to exploiting viable networks during this new information age. The channel is not time-invariant in wireless communication, so the received signal exhibits amplitude, phase, and angle variations due to multipath fading. Increasing data rates and reducing bandwidth make Orthogonal Frequency Division Multiplexing (OFDM) an important component of wireless communication systems. The OFDM technique uses many carriers very efficiently. With this scheme, interference is robustly reduced, and fading scenarios are easily accommodated. Analyzing digital modulation schemes requires evaluating link performance with fading channels. The paper compares channel performance over varying fading environments using a variety of modulation schemes. We study the BER and SNR properties of the AWGN, Rician fading and Rayleigh fading channels modulated with BPSK, QPSK, and M-ary QAM.

Orthogonal frequency division multiplexing (OFDM) is a popular multicarrier technique in communication system owing to its robustness against multipath fading and less complexity. Deep learning (DL...

Small-angle neutron scattering (SANS) is widely used in structural analysis of complex liquid dispersions. An essential feature of SANS experiments for such systems is hydrogen/deuterium isotopic s...

Unslotted ALOHA protocol has been adopted as a channel access mechanism in commercial low-power wide-area networks (LPWANs), such as Sigfox and long-range (LoRa) alliance. This work examines the throughput and random access (RA) delay distribution of unslotted ALOHA systems by considering exponential random backoff (ERB) or uniform random backoff (URB) algorithm. We further characterize the operating region of the systems as unsaturated stable, bistable, and saturated regions in terms of the new packet arrival and retransmission rates. To run the system stably with the maximum throughput, we propose a Bayesian online backoff algorithm that estimates the number of backlogged devices. Its performance is compared with other algorithms, such as particle filter (PF)-based algorithm, binary exponential backoff (BEB) algorithm, and the algorithm of exploiting exact backlog size information. Through extensive simulations, it is demonstrated that the performance of the proposed algorithm is very close to the upper bound and robust to time-varying traffic condition.

To save energy consumption of Ethernet switches, IEEE has standardized a new energy-efficient operation for Ethernet links with a low-power state and transition mechanisms between the high-power state for transporting traffic and the low-power state.In this paper, we propose a queueing model with the Markov Modulated Compound Poisson Process that is able to characterize backbone packet traffic. We derive a closed-form solution for the stationary distribution of the proposed queueing model. We show that our model can capture an entire system where the transition times are constant.

The Internet is nowadays suffering dramatically serious attacks, with the distributed denial of service (DDoS) attacks being the representative and dominant ones. It is seen that, to stabilize the buffer queue length around a given target under DDoS attacks in the relevant routes is vitally important and helpful to mitigate the attacks and to improve the quality of service (QoS) for normal users. In the current paper, a stochastic queue dynamic model with L e ´ vy jump noise, which is affected by the continuous Brownian motion and the discontinuous Poisson process, is worked out to develop a novel and accurate mathematical framework for the stability of a route queue that deals with constant-rate DDoS attacks. This article proposes a security defensive mechanism in the network for solving the network collapse that can possibly be caused by DDoS attacks, otherwise. Particularly, based on the formulation of a stochastic queue dynamic with L e ´ vy jump noise, the mechanism that characterizes the behavior of the queue at routers is presented for stabilizing the queue length under constant-rate DDoS attacks. By applying the stochastic control theory into analyzing the performance of queue dynamic under constant-rate DDoS attacks, some explicit conditions are established under which the instantaneous queue length converges to any given target in a route. Simulation results demonstrate the satisfaction of the proposed defense mechanism with sharp contrast to the state of the art active queue management (AQM) schemes.

In this work, we leverage the clustered $\beta$ -Ginibre point process (GPP) and the queueing theory to analyse the delay performance in a large-scale repulsive fog radio access network (F-RAN) with computation offloading, which plays a key role on the delay performance. In particular, the average delay defined as the mean value of delay for executing the computing tasks and the task completion probability (TCP) defined as the probability of the delay for executing the computing task being smaller than a target delay, are derived in analytical forms and validated by Monte Carlo simulations. Based on these results, the optimal rate threshold, which affects the task offloading probability and the transmission delay, and the optimal cloud offloading probability to minimize the average delay and maximize the TCP are jointly analysed numerically. Moreover, an approximated result of the average delay is provided to reduce its computational complexity. The results show that the repulsion in the F-RAN significantly decreases the average delay and increases the TCP, but equipped with the optimal rate threshold and the cloud offloading probability, the effects of repulsion on the average delay and the TCP become trivial. Furthermore, with the optimal cloud offloading probability and rate threshold, the average delay and the TCP can be significantly reduced and improved in the hybrid processing mode compared with those in the local processing mode, respectively. The optimal rate thresholds lie in the range of 3 to 13 Mbps under our simulation environment, which can reduce a maximum of 60% of the average delay and increase a minimum of 0.17 of the TCP.

This article is devoted to the analysis of a queuing system formed by two flows with density functions of the gamma distribution law in order to derive a solution for the average delay of requests in the queue, which is the main characteristic for any queuing system. According to this characteristic, for example, packet delays in packet-switched networks are estimated when they are modeled using the queuing system. In queuing theory, studies of G/G/1 systems are especially relevant because there is no solution in the final form for the general case. Therefore, in the study of such systems, various particular distribution laws are used as an arbitrary distribution law for G. In the study of G/G/1 systems, an important role is played by the method of spectral decomposition of the solution of the Lindley integral equation, and most of the results in the theory of queuing were obtained using this method. The article presents the derivation of the calculation formula for the average delay of requests in the queue in the system under consideration, also based on the spectral decomposition method.

In this paper, we investigate the consensus problem for discrete linear multi-agent systems (MASs) with Markovian packet dropouts. Both identical and nonidentical packet dropouts are studied. For the discrete-time MASs under identical packet dropouts, we present the expectation of the total sojourn time of packet dropouts and successful message transmission, the switching number from packet dropouts to successful message transmission, and the awaken number of packet dropouts and successful message transmission. Based on these expectations, a linear consensus controller is designed through analyzing the transient properties of the Markov process such that the MASs can reach consensus almost surely for any initial distribution of packet dropouts. When it comes to the nonidentical packet dropouts where all the packets are independent and stochastic, a Markovian-lossy-channel based switching model (MLCBS model) is proposed. Based on the MLCBS model, we also propose an easy-to-implement linear consensus controller such that the MASs with nonidentical packet dropouts can achieve consensus almost surely. Finally, the theoretical results are illustrated by simulation examples.

MapReduce includes three phases of map, shuffle, and reduce. Since the map phase is CPU-intensive and the shuffle phase is I/O-intensive, these phases can be conducted in parallel. This paper studies a joint scheduling optimization of overlapping map and shuffle phases to minimize the average job makespan. New concepts of the strong pair and the weak pair are introduced. Two jobs are defined as a strong pair if the shuffle and map workloads of one job equal the map and shuffle workloads of the other job, respectively. Two jobs are defined as a weak pair if their total map workloads equal their total shuffle workloads. We prove that if the entire set of jobs can be decomposed to strong pairs of jobs, then the optimal schedule can pairwisely execute jobs that can form a strong pair. Following the above intuition, several offline and online scheduling policies are proposed. Extensions are made based on weak pairs. Real data-driven experiments validate the efficiency and effectiveness of the proposed policies.

We investigate the impact of fading correlation on the performance of the doubly dirty fading multiple access channel (MAC) with non-causally known side information at transmitters. Using Copula theory, we derive closed-form expressions for the outage probability and the coverage region under arbitrary dependence conditions. We show that a positive dependence structure between the fading channel coefficients is beneficial for the system performance, as it improves the outage probability and extends the coverage region compared to the case of independent fading. Conversely, a negative dependence structure has a detrimental effect on both performance metrics.

Although queueing models in the mathematical field of queueing theory are mainly studied in the steady-state regime and practical applications are interested mostly in queues in transient situations subject to burst arrivals and congestion, their use is still justified as a first step towards a more complex and thorough analysis. In these practical applications, parameters such as the traffic intensity, which is the ratio between the arrival rate and service rate, are unknown and need to be estimated statistically. In this study, a Markovian arrival and deterministic single-server queueing system, known in Kendall notation as an M ∕ D ∕ 1 queueing model, is considered. This is one of the simplest queueing models with deterministic service time and may be seen as an approximation of a variety of applications in the performance evaluation of production management, telecommunications networks, and other areas. The main goal of this manuscript is to propose a methodology to determine the sample size for an M ∕ D ∕ 1 queueing system under the Bayesian setup by observing the number of customer arrivals during the service time of a customer. To verify the efficiency and efficacy of the proposed approach, an extensive set of numerical results is presented and discussed.

We study a G/GI/1 single-server queuing model with i.i.d. service times that are independent of a stationary process of inter-arrival times. We show that the distribution of the waiting time converges to a stationary law as time tends to infinity provided that inter-arrival times satisfy a Gartner-Ellis type condition. A convergence rate is given and a law of large numbers established. These results provide tools for the statistical analysis of such systems, transcending the standard case with independent inter-arrival times.

In this paper, we consider the Israeli queue which consists of a main queue with at most N groups and an infinite capacity retrial orbit. The retrial customers may become non-persistent before receiving service. This model was considered before and the decay rate function of the stationary distribution was obtained. To strengthen the result, we characterize the exact tail asymptotics by calculating the coefficient before the decay rate function.

In this paper, we study the asymptotic behavior of the tail probability of the number of customers in the steady-state $M/G/1$ retrial queue with Bernoulli schedule, under the assumption that the service time distribution has a regularly varying tail. Detailed tail asymptotic properties are obtained for the (conditional and unconditional) probability of the number of customers in the (priority) queue, orbit and system, respectively., 18 pages; revised version: 20 pages

International audience; In this work, we give a complete characterization of the epsilon-stable region in dynamic downlink random cellular networks. The epsilon-stable region is the set of arrival rates such that the proportion of unstable queues in the network is not larger than epsilon. We derive upper and lower bounds as well as an approximation of the critical arrival rate, which delimits the epsilon-stable region. The developed model is based on stochastic geometry and queuing theory to handle the interaction between the transmit success probability and the queuing state evolution. Extensive numerical simulations are provided to confirm the tightness of the approximation.

In this {\color{red}{paper}} we discuss about the $ap-$Henstock-Kurzweil integrable functions on a topological vector spaces. Basic results of $ap-$Henstock-Kurzweil integrable functions are discussed here. We discuss the equivalence of the $ap-$Henstock-Kurzweil integral on a topological vector spaces and the vector valued $ap-$Henstock-Kurzweil integral. Finally, several convergence theorems are studied.

Multi-antenna coded caching combines a global caching gain, proportional to the total cache size in the network, with an additional spatial multiplexing gain that stems from multiple transmitting antennas. However, classic centralized coded caching schemes are not suitable for dynamic networks as they require prior knowledge of the number of users to indicate what data should be cached at each user during the placement phase. On the other hand, fully decentralized schemes provide comparable gains to their centralized counterparts only when the number of users is very large. In this paper, we propose a novel multi-antenna coded caching scheme for dynamic networks, where instead of defining individual cache contents, we associate users with a limited set of predefined caching profiles. Then, during the delivery phase, we aim at achieving a combined caching and spatial multiplexing gain, comparable to a large extent with the ideal case of fully centralized schemes. The resulting scheme imposes small subpacketization and beamforming overheads, is robust under dynamic network conditions, and incurs small finite-SNR performance loss compared with centralized schemes.

Chained Training Scheme (CTS) and Chained training scheme with Revised Sequence (CRS) were proposed to train artificial neural networks (ANNs) to design doubly reinforced concrete (RC) beams. CRS a...