In this paper, we investigate the bulk service queue with Bernoulli vacation schedule and restricted admissibility introduced and studied by Madan and Abu-Dayyeh, [Revista Investigacion Operacional, Vol.24, No.2, pp.113-123, 2003]. Madan and Abu-Dayyeh assume exponentially distributed service times while we allow these times to be generally distributed. We obtain various performance measures th...

In this paper we propose the general bulk service queueing model for FM/M(a,b)/1/MWV/Br. The batches are served according to FCFS discipline. In which arrival rate, vacation parameter, service rate for busy period, and for vacation period are all considered as trapezoidal fuzzy numbers. The basic idea is to convert all these fuzzy numbers into crisp values by applying Robust ranking Technique. ...

This paper investigates an attempt to establish a QoS class that supports long-lived, bulk-data TCP flows that require a minimum rate from the network. The approach is based on a model for TCP flows subject to token bucket marking at the network edge and preferential dropping in the core network. The service class adds admission control functionality and a model for multi-RED queue management t...

We propose a novel active queue management scheme tailored to the specific characteristics of third generation (3G) cellular networks. Such links are often the bottleneck for an endto-end connection and dedicated to one host. Taking advantage of these specific characteristics, we developed a queuing scheme that is simpler than popular Random Early Detection (RED) schemes. Despite its simplicity...

Abstract: In this paper, we consider a single-server infinite(finite-) buffer bulk-service queues. The interarrival and service times are respectively, arbitrarily and exponentially distributed. The customers are served by a single server in accessible or non-accessible batches of maximum size ‘ b ’ with a minimum threshold value ‘ ’. We provide a recursive method, using the supplementary varia...

In many practical situations one can observe that the leaving batch of customers may request for re-service. Avi Itzhak and Naor (1963) have analyzed an M/G/1 queueing model with repair of service station on request by a leaving customer. Rosenberg and Uri Yechiali (1993) analyzed a bulk arrival general service single server queue with single and multiple vacations under LIFO service regime. Hu...

Intelligent dispatching is crucial to obtaining low response times in large-scale systems. One common scalable paradigm the “power-of-d,” which dispatcher queries d servers at random and assigns job a server based only on state of queried servers. The bulk power-of-d policies studied literature assume that system homogeneous, meaning all have same speed; meanwhile, real-world systems often exhi...