An M x /G/1 queueing system with second optional service (SOS)is studied under N policy and Bernoulli Vacation. The system remains idle until the queue size reaches or exceeds N ( ≥ 1). When the queue size reaches at leastN, the server may begin his setup operation with probability s or may start the service with probability (1-s). The server provides two phases of heterogeneous services, of wh...

the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract We consider an M [x] /G/1 queue with two types of service subject to random breakdowns having multiple server vacation, where the customers arrive to the system in batches of variable size. We assume that a single server p...

In the existing system, the problem of TCP in MANET’s environment is packet losses induced by network congestion. In case if congestion occurs it leads to the loss of data. In the proposed system, Blue algorithm is used for avoiding packet loss in TCP with wireless network based on checking size of queue. If the size of queue is maximum, gateway directly forwards the packet to destination throu...

The increasing power, lower cost and improved convenience of wireless networks is fueling the spread of IEEE 802.11 wireless access points (APs) in the residential and commercial environments. While there has been considerable study of wireless performance, little is publicly known about the queue sizes of wireless APs. This paper presents the QFind methodology for measuring wireless AP queue s...

Resequencing issue is a crucial issue in simultaneous processing systems where the order of customers (jobs, units) upon arrival has to be preserved upon departure. In this paper stationary characteristics of M/M/3/∞ queueing system with reordering buffer of infinite capacity are being analyzed. Noticing that customer in reordering buffer may form two separate queues, focus is given to the stud...

In this note we analyze the performance measures of a one server queue when arrivals are not independent. The analysis is based on the correlated Poisson distribution for customers arrival. Service may have any distribution. This type of queue is defined as MC/G/1. The formulas for the performance measures of the queue are derived without any approximation. Surprisingly, these formulas are very...

The sensitivity of the performance measures such as the mean and the standard deviation of the queue length and the blocking probability with respect to the moments of the service time are numerically investigated. The steady state distribution of M/G/c queue is approximated by that of the M/PH/c queue where the phase type (PH) distribution is fitted by matching the first three moments of the s...

Consider a single server queue in which the service station may breakdown according to a Poisson process with rates γ in busy time and γ’ in idle time respectively. After a breakdown, the service station will be repaired immediately and the repair time is assumed to have an exponential distribution with rate δ. Suppose the arrival time has an exponential distribution with rate λ, and the probab...