LEaL ANALYSIS OF THE SINGLE - SERVLR QUEUE WITH UNIFORMLY

  • DEPA RTMENT

Abstract

This 2aper studies the single-server queueing system in which no customer has to wait for a duration longer than a constant K. Using analytical method together with the property that the queueing process 'starts anew' probabilistically whenever an arriving customer initiates a busy period, we obtain various transient and stationary solutions for the system. 

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics