Related papers: Exact Solution for One Type of Lindley's Equation …
In this article, we proposed an inverse Lindley distribution and studied its fundamental properties such as quantiles, mode, stochastic ordering and entropy measure. The proposed distribution is observed to be a heavy-tailed distribution…
We consider an SDE in R^m of the type dX(t)=a(X(t))dt+dU(t) with a L\'evy process U and study the problem for the distribution of a solution to be regular in various senses. We do not impose any specific conditions on the L\'evy measure of…
The scheduling problem in Hurdle (1973) was formulated in a general form that simultaneously concerned the vehicle dispatching, circulating, fleet sizing, and patron queueing. As a constrained variational problem, it remains not fully…
A M\"untz spectral collocation method is implemented for solving weakly singular Volterra integro-differential equations (VDIEs) with proportional delays. After constructing the numerical scheme to seek an approximate solution, we derive…
We analyze the so-called Shortest Queue First (SQF) queueing discipline whereby a unique server addresses queues in parallel by serving at any time that queue with the smallest workload. Considering a stationary system composed of two…
In this paper, we analyze how well a machine can solve a general problem in queueing theory. To answer this question, we use a deep learning model to predict the stationary queue-length distribution of an $M/G/1$ queue (Poisson arrivals,…
We analyze the time-dependent behavior of an $M/M/c$ priority queue having two customer classes, class-dependent service rates, and preemptive priority between classes. More particularly, we develop a method that determines the Laplace…
We find a further class of exact solutions to the Lighthill Whitham Richards Payne (LWRP) traffic flow equations. As before, using two consecutive Lagrangian transformations, a linearization is achieved. Next, depending on the initial…
In this paper, we consider the network latency estimation, which has been an important metric for network performance. However, a large scale of network latency estimation requires a lot of computing time. Therefore, we propose a new method…
The subject of this paper is the problem of estimating service time distribution of the $M/G/\infty$ queue from incomplete data on the queue. The goal is to estimate $G$ from observations of the queue--length process at the points of the…
This paper addresses the analysis of the queue-length process of single-server queues under overdispersion, i.e., queues fed by an arrival process for which the variance of the number of arrivals in a given time window exceeds the…
This paper considers a L\'evy-driven queue (i.e., a L\'evy process reflected at 0), and focuses on the distribution of $M(t)$, that is, the minimal value attained in an interval of length $t$ (where it is assumed that the queue is in…
In this paper we study a queue with L\'evy input, without imposing any a priori assumption on the jumps being one-sided. The focus is on computing the transforms of all sorts of quantities related to the transient workload, assuming the…
We use queueing networks to present a new approach to solving Laplacian systems. This marks a significant departure from the existing techniques, mostly based on graph-theoretic constructions and sampling. Our distributed solver works for a…
This article is the third in a series the aim of which is to use Lie group theory to obtain exact analytic solutions of Delay Ordinary Differential Systems (DODSs). Such a system consists of two equations involving one independent variable…
In the paper the method for estimation of throughput metrics like available bandwidth and end-t-end capacity is supposed. This method is based on measurement of network delay $D_i$ for packets of different sizes $W_i$. The simple expression…
Using a result of Blanchet and Wallwater (2015: Exact sampling of stationary and time-reversed queues. ACM TOMACS, 25, 26) for exactly simulating the maximum of a negative drift random walk queue endowed with independent and identically…
Network calculus is an elegant theory which uses envelopes to determine the worst-case performance bounds in a network. Statistical network calculus is the probabilistic version of network calculus, which strives to retain the simplicity of…
Bufferless and single-buffer queueing systems have recently been shown to be effective in coping with escalated Age of Information (AoI) figures arising in single-source status update systems with large buffers and FCFS scheduling. In this…
In this thesis, we propose and analyze a multi-server model that captures a performance trade-off between centralized and distributed processing. In our model, a fraction $p$ of an available resource is deployed in a centralized manner…