352 research outputs found

    Simple approximations for the batch-arrival mx/g/1 queue

    Get PDF

    Simple Approximations for the Batch-Arrival Mx/G/1 Queue

    Full text link

    Power series approximations for two-class generalized processor sharing systems

    Get PDF
    We develop power series approximations for a discrete-time queueing system with two parallel queues and one processor. If both queues are nonempty, a customer of queue 1 is served with probability beta, and a customer of queue 2 is served with probability 1-beta. If one of the queues is empty, a customer of the other queue is served with probability 1. We first describe the generating function U(z (1),z (2)) of the stationary queue lengths in terms of a functional equation, and show how to solve this using the theory of boundary value problems. Then, we propose to use the same functional equation to obtain a power series for U(z (1),z (2)) in beta. The first coefficient of this power series corresponds to the priority case beta=0, which allows for an explicit solution. All higher coefficients are expressed in terms of the priority case. Accurate approximations for the mean stationary queue lengths are obtained from combining truncated power series and Pad, approximation

    A pseudoconservation law for a time-limited service polling system with structured batch poisson arrivals

    Get PDF
    AbstractWe consider a cyclic-service queueing system (polling system) with time-limited service, in which the length of a service period for each queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then proceeds to the next queue. The customer whose service is interrupted due to the timer expiration is attended according to the nonpreemptive service discipline. For the cyclic-service system with structured batch Poisson arrivals (Mx/G/1) and an exponential timer, we derive a pseudoconservation law and an exact mean waiting time formula for the symmetric system

    Numerical methods for queueing models

    Get PDF

    Algorithms and approximations for batch-arrival queues

    Get PDF

    Optimizing energy-performance trade-offs in solar-powered edge devices

    Get PDF
    Power modes can be used to save energy in electronic devices but a low power level typically degrades performance. This trade-off is addressed in the so-called EP-queue model, which is a queue depth dependent M/GI/1 queue augmented with power-down and power-up phases of operation. The ability to change service times by power settings allows us to leverage a Markov Decision Process (MDP), which approach we illustrate using a simple fully solar-powered case study with finite states representing levels of battery charge and solar intensity
    • …
    corecore