نتایج جستجو برای: Controllable queue
تعداد نتایج: 27141 فیلتر نتایج به سال:
We consider a queueing system controlled by decisions based on partial state information. The motivation for this work stems from road traffic, in which drivers may, or may not, be subscribed to a smartphone application for dynamic route planning. Our model consists of two queues with independent exponential service times, serving two types of jobs. Arrivals occur according to a Poisson process...
This paper presents a sensitivity investigation of the expected busy period for a controllable M/G/1 queueing system by means of a factorial design statistical analysis. We studies the effect of four important factors (parameters) that influence the expected busy period of an M/G/1 system, in which the server operates -policy in his idle period. A 2 4 factorial experimental design is used ...
In this paper we develop fundamental convexity properties of unfinished work and packet waiting time in a work conserving */*/1 queue. The queue input consists of an uncontrollable background process and a rate-controllable input stream. We show that any moment of unfinished work is a convex function of the controllable input rate. The convexity properties are then extended to address the probl...
The optimal tradeoff between average service cost rate, average utility rate, and averagedelay is addressed for a state dependent M/M/1 queueing model, with controllable queue lengthdependent service rates and arrival rates. For a model with a constant arrival rate λ for all queuelengths, we obtain an asymptotic characterization of the minimum average delay, when theaverage serv...
We consider a single intersection of two two-way streets with controllable traffic lights on each corner. We construct a model that describes the evolution of the queue lengths in each lane as a function of time, and we discuss how (sub)optimal traffic light switching schemes for this system can be determined.
existence of capacity drop phenomenon, as the difference between pre-queue and queue discharge flow rates, has been one of the controversial concepts of traffic engineering. several researches have focused on capacity drop existence and also its estimation issues. this paper aims to estimate capacity drop based not only on a comparison between breakdown and queue discharge flow rates, but also ...
Motivated by various applications in logistics, road traffic and production management, we investigate two versions of a tandem queueing model in which the service rate of the first queue can be controlled. The objective is to keep the mean number of jobs in the second queue as low as possible, without compromising the total system delay (i.e. avoiding starvation of the second queue). The balan...
Burst contention is a major problem in the Optical Burst Switching (OBS) networks. Due to inadequate contention resolution techniques, the burst loss is prominent in OBS. In order to resolve contention fiber delay lines, wavelength converters, deflection routing, burst segmentation, and retransmission are used. Each one has its own limitations. In this paper, a new hybrid scheme is proposed whi...
We study convex optimization problems with side constraints in a multiclass M/G/1 queue with controllable service rates. In the simplest problem of optimizing linear costs with fixed service rate, the cμ rule is known to be optimal. A natural question to ask is whether such simple policies exist for more complex control objectives. In this paper, combining the achievable region approach in queu...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید