Seok Ho Chang

Learn More
This paper considers a $nite-bu'er discrete-time GeoX =GY =1=K + B queue with multiple vacations that has a wide range of applications including high-speed digital telecommunication systems and various related areas. The main purpose of this paper is to present a performance analysis of this system. For this purpose, we $rst derive a set of linear equations(More)
This paper considers a class of stationary batch-arrival, bulk-service queues with generalized vacations. The system consists of a single server and a waiting room of infinite capacity. Arrivals of customers follow a batch Markovian arrival process. The server is unavailable for occasional intervals of time called vacations, and when it is available,(More)
We consider finiteand infinite-capacity queues with discrete-time batch Markovian arrival processes (D-BMAP) under the assumption of the Late Arrival System with Delayed Access as well as the Early Arrival System. Using simple arguments such as the balance equation, “rate in = rate out,” we derive relationships among the stationary queue lengths at arrival,(More)
  • 1