We study the Processor-Sharing queueing model with a hyper-exponential service time distribution and Poisson batch arrival process. In the case of the hyperexponential service time distribution we find an analytical expression for the expected conditional response time function and obtain an alternative proof of its concavity with respect to the service time.

The author considers a batch arrival queueing system in which two types of customers (namely positive and negative) arrive. The arrival of a negative customer to a queueing system removes one positive customer who is in service if any. A cycle starts whenever the system empties and the server is turned off and stays idle in the system. The idle period ends as soon as a batch of positive custome...

We introduce open stochastic fluid networks that can be regarded as continuous analogs or fluid limits of open networks of infinite-server queues. Random exogenous input may come to any of the queues. At each queue, a cdf-valued stochastic process governs the proportion of the input processed by a given time after arrival. The routing may be deterministic (a specified sequence of successive que...

Rapid growth of Internet spawns many group oriented multicast applications like Internet pay TV, news dissemination and stock quote system. The fortes of these applications are the support of dynamic, scalable group membership and group members are geographically divergent. As members of the group move in and out, an imperative cryptographic rekeying model should be applied to preserve the conf...

With Bursty Task Arrivals Chin LU and Sau-Ming LAU Computer Science Department The Chinese University of Hong Kong Shatin, Hong Kong Email: fclu, [email protected] AbstractUsually heuristic-based load balancing algorithms cannot provide satisfactory performance with bursty task arrivals because they assume stable arrival patterns. In this paper, we present an adaptive load balancing algorithm,w...

Supply chain scheduling is a new emerging area of research. We study batch arrival scheduling problems at the manufacturer in a multi-level customer-centric supply chain, where promised job due dates are considered constraints which must be satisfied. We analyze the tradeoff between inventory holding costs and batch delivery costs. We show that the problems are closely related to batch scheduli...

We analyze an infinite-server queueing model with synchronized arrivals and departures driven by the point process {Tn} according to the following rules. At time Tn, a single customer (or a batch of size βn) arrives to the system. The service requirement of the ith customer in the nth batch is σi,n. All customers enter service immediately upon arrival but each customer leaves the system at the ...

The Quality of Service (QoS) of real time applications is aaected in a rather direct manner by the timely delivery of application-level data units which are typically mapped into several ATM cells. As a consequence, it would be reasonable to associate a common deadline with all the cells in one data unit (batch) and develop a scheduling policy that aims to maximise the number of data unit that ...

In this paper we analyze a tollbooth tandem queueing problem with an infinite number of servers. A customer starts service immediately upon arrival but cannot leave the system before all customers who arrived before himlher have left, i.e. customers depart the system in the same order as they arrive. Distributions of the total number of customers in the system, the number of departure-delayed c...

Vacation queueing models have wide range of application in several areas including computer-communication, and manufacturing systems. A finite-butTer single-server queue with renewal input and multiple exponential vacations has been analysed by Karaesmen and Gupta (1996). In this paper we extend the analysis to cover the batch arrivals. i.e. we consider a batch alTiva! single-server queue with ...