A study on single and bulk service queueing models with network applications

Abstract

Queues are ubiquitous part of daily life and the common examples are help desks call centers manufacturing assembly lines wireless communication networks etc Mathematical analysis of queues suggests ways to shorten the waiting time and the waiting line which are the basic characteristics of a queueing system The study of queues deals with quantifying the phenomenon of waiting lines using representative measures of performance such as average queue length average waiting time in queue and average facility utilization newlineIn this research work three different queueing models have been proposed and analysed in detail A bulk service queue in which atleast one server will be available for service is also analysed in detail The application of queueing theory in MANETs is studied and a route finding algorithm EPAODV is also proposed that transmits the packets to the destination quickly by increasing throughput data delivery ratio and also decreasing the end delay when compared with the existing algorithms newline newline