Article

On queues with service and interarrival times depending on waiting times

Queueing Systems (Impact Factor: 0.6). 08/2007; 56(3):121-132. DOI: 10.1007/s11134-007-9011-3
Source: DBLP

ABSTRACT We consider an extension of the standard G/G/1 queue, described by the equation
W= Dmaxmax{0,B-A+YW}W\stackrel{ \mathcal {D}}{=}\max\mathrm{max}\,\{0,B-A+YW\}
, where ℙ[Y=1]=p and ℙ[Y=−1]=1−p. For p=1 this model reduces to the classical Lindley equation for the waiting time in the G/G/1 queue, whereas for p=0 it describes the waiting time of the server in an alternating service model. For all other values of p, this model describes a FCFS queue in which the service times and interarrival times depend linearly and randomly on the
waiting times. We derive the distribution of W when A is generally distributed and B follows a phase-type distribution, and when A is exponentially distributed and B deterministic.

1 Bookmark
 · 
78 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: In a number of service systems, there can be substantial latitude to vary service rates. However, although speeding up service rate during periods of congestion may address a present congestion issue, it may actually exacerbate the problem by increasing the need for rework. We introduce a state-dependent queuing network where service times and return probabilities depend on the “overloaded” and “underloaded” state of the system. We use a fluid model to examine how different definitions of “overload” affect the long-term behavior of the system and provide insight into the impact of using speedup. We identify scenarios where speedup can be helpful to temporarily alleviate congestion and increase access to service. For such scenarios, we provide approximations for the likelihood of speedup to service. We also identify scenarios where speedup should never be used; moreover, in such a situation, an interesting bi-stability arises, such that the system shifts randomly between two equilibria states. Hence, our analysis sheds light on the potential benefits and pitfalls of using speedup when the subsequent returns may be unavoidable.
    Operations Research 04/2014; 62(2). · 1.50 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: The paper studies a general multiserver queue in which the service time of an arriving customer and the next interarrival period may depend on both the current waiting time and the server assigned to the arriving customer. Stability of the system is proved under general assumptions on the predetermined distributions describing the model. The proof exploits a combination of the Markov property of the workload process with a regenerative property of the process. The key idea leading to stability is a characterization of the limit behavior of the forward renewal process generated by regenerations. Extensions of the basic model are also studied. This model generalizes a number of the known state-dependent systems and describes some new systems as particular cases.
    Journal of Mathematical Sciences 07/2014; 200(4):462-472.
  • [Show abstract] [Hide abstract]
    ABSTRACT: We consider a two-station cascade network, where the first station has Poisson input and the second station has renewal input, with i.i.d. service times at both stations. The following partial interaction exists between stations: whenever the second station becomes empty while customers are awaiting service at the first one, one customer can jump to the second station to be served there immediately. However, the first station cannot assist the second one in the opposite case. For this system, we establish necessary and sufficient stability conditions of the basic workload process, using a regenerative method. An extension of the basic model, including a multiserver first station, a different service time distribution for customers jumping from station 1 to station 2, and an arbitrary threshold d 1≥1 on the queue-size at station 1 allowing jumps to station 2, are also treated.
    Annals of Operations Research 01/2013; 202(1). · 1.10 Impact Factor

Full-text (2 Sources)

Download
10 Downloads
Available from
May 20, 2014