A discrete-time queueing model with abandonments

  • Authors:
  • Rein Nobel;Suzanne van der Ster

  • Affiliations:
  • Vrije Universiteit, Amsterdam, Netherlands;Vrije Universiteit, Amsterdam, Netherlands

  • Venue:
  • Proceedings of the 5th International Conference on Queueing Theory and Network Applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a multi-server queueing model with abandonments in discrete time. In every time slot a generally distributed number (batch) of customers arrives. The different numbers of arrivals in consecutive slots are mutually independent. Each customer requires a geometrically distributed service time. Customers arriving in a slot can start their service only at the beginning of the next slot. When upon arrival customers find all servers busy, they join a queue and wait for their service. When upon arrival customers find server(s) idle, then as many of the incoming customers (randomly chosen) start their service at the beginning of the next slot as there are idle servers, whereas the excess incoming customers, if any, join the queue. The customers in the queue are served in the order of arrival. Every time slot each customer waiting in the queue decides to abandon the system forever with a fixed (abandon) probability, i.e. independently from the other customers waiting in the queue, his position in the queue or the elapsed waiting time. Arrivals have precedence over departures. The steady-state behaviour of this system is studied.