International Journal of Science, Engineering and TechnologyAuthors: Pushpandra Kumar
Abstract: In this article, the study of discrete time queueing models for computer communication networks and their applications to queueing models. It is expected that a discrete time model is "slotted". During a slot, a discrete time queue may accept and service a maximum of one packet each. The major reason of discrete time queueing systems have attracted interest of potential applications that take use of slotted time. Comparing how continuous time models are handled, we take into consideration several conclusions inside a single discrete-time framework. This method has two benefits: it parallels the treatment of continuous time models as much as feasible, and It streamlines the handling of several discrete-time models under a single structure. This enables us to compare and contrast the continuous and discrete time queues. Specifically, Our applications related to birth and death center on the discrete-time single server model with bernoulli arrivals and geometric service times. We give the reader a straightforward, meticulous analysis covering every one of the five scheduling guidelines examined inside the written works, focusing especially on the stationary distributions at the pre arrival, slot centers, and slot margins.
