Related papers: Exact Solution for One Type of Lindley's Equation …
An inverse-free neural network model with mixed delays is proposed for solving the absolute value equation (AVE) $Ax -|x| - b =0$, which includes an inverse-free neural network model with discrete delay as a special case. By using the…
We provide a Lax-Oleinik-type representation formula for solutions of time-dependent Hamilton-Jacobi equations, posed on a network with a rather general geometry, under standard assumptions on the Hamiltonians. It depends on a given initial…
This paper presents an analysis of the stochastic recursion $W_{i+1} = [V_iW_i+Y_i]^+$ that can be interpreted as an autoregressive process of order 1, reflected at 0. We start our exposition by a discussion of the model's stability…
We consider traffic flow dynamics for a network of signalized intersections, where the outflow from every link is constrained to be equal to a given capacity function if the queue length is positive, and equal to the minimum of cumulative…
This paper considers a wireless link with randomly arriving data that is queued and served over a time-varying channel. It is known that any algorithm that comes within $\epsilon$ of the minimum average power required for queue stability…
We study the rare event behavior of the workload process in a transitory queue, where the arrival epochs (or points) of a finite number of jobs are assumed to be the ordered statistics of independent and identically distributed (i.i.d.)…
Lewis and Mordecki have computed the Wiener-Hopf factorization of a L\'evy process whose restriction on $]0,+\infty[$ of their L\'evy measure has a rational Laplace transform. That allows to compute the distribution of $(X_t,\inf_{0\leq…
The infinite-server queueing models with homogeneous and non-homogeneous arrivals of customers and catastrophes are considered. The probability generating functions of joint distributions of numbers of busy servers and served customers, as…
We consider the single server queue with service in random order. For a large class of heavy-tailed service time distributions, we determine the asymptotic behavior of the waiting time distribution. For the special case of Poisson arrivals…
Emerging edge computing paradigms enable heterogeneous devices to collaborate on complex computation applications. However, for congestible links and computing units, delay-optimal forwarding and offloading for service chain tasks (e.g.,…
A simple analytical solution is proposed for the stationary loss system of two parallel queues with finite capacity $K$, in which new customers join the shortest queue, or one of the two with equal probability if their lengths are equal.…
Virtually all practical settings where preemptive scheduling is employed are susceptible to preemption overhead, and accounting for these overheads is necessary to make informed scheduling design decisions. However, preemption overhead is…
A simple numerical method for loading of a relativistic Maxwellian-type distribution is proposed based on inverse transform sampling. The relativistic Maxwellian energy distribution is introduced as an alternative to the Maxwell-J\"{u}ttner…
Recently multiserver queues with setup times have been extensively studied because they have applications in power-saving data centers. The most challenging model is the M/M/$c$/Setup queue where a server is turned off when it is idle and…
We find a class of exact solutions to the Lighthill Whitham Richards Payne (LWRP) traffic flow equations. Using two consecutive lagrangian transformations, a linearization is achieved. Next, depending on the initial density, we either apply…
Event-driven imagers and sensor arrays commonly employ asynchronous arbiter trees with a synchronous acknowledge to serialize requests. We present an analytical framework that models the root as an \(M/D/1\) queue with deterministic quantum…
In this paper we study linear parabolic equations on a finite oriented starshaped network; the equations are coupled by transmission conditions set at the inner node, which do not impose continuity on the unknown. We consider this problem…
An exact formula for the equilibrium M/U/1 waiting time density is now effectively known. What began as a numeric exploration became a symbolic banquet. Inverse Laplace transforms provided breadcrumbs in the trail; delay differential…
In this paper we analyze the transient behavior of the workload process in a L\'evy input queue. We are interested in the value of the workload process at a random epoch; this epoch is distributed as the sum of independent exponential…
We study the generalization of the G/G/1 queue obtained by relaxing the assumption of independence between inter-arrival times and service requirements. The analysis is carried out for the class of multivariate matrix exponential…