On G / G / 1 Queues with Lifo - P Service Discipline

نویسندگان

  • J. George Shanthikumar
  • Ushio Sumita
چکیده

J. George Shanthikumar University of California Berkeley Ushio Sumita University of Rochester (Received September 25,1985: Revised March 27,1986) We consider a single server queueing system G/G/l having general interarrival times (not necessarily i.i.d), i.i.d. service times, and LIFO-P (preemptive last in first out, but not restricted to resumption) service disciplines. Furthermore a customer finding n other customers in system upon his arrival joins the system with probability pen) and immediately leaves the system with probability 1 pen), where 0 ::;'p(n)::;' 1. The relations among various ergodic probabilities of the number of customers in system are established via sample path arguments. Sufficient conditions are given for the customer average ergodic probability distribution to be geometric, thereby extending recent results of Fakinos (1981) and Yamazaki(1982, 1984).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representing Workloads in GI/G/1 Queues Through the Preemptive-Resume LIFO Queue Discipline

We give in this paper a detailed sample-average analysis of GI/G/1 queues with the preemptive-resume LIFO (last-in-first-out) queue discipline: We study the long-run “state” behavior of the system by averaging over arrival epochs, departure epochs, as well as time, and obtain relations that express the resulting averages in terms of basic characteristics within busy cycles. These relations, tog...

متن کامل

Some Time-Dependent Properties of Symmetric M/G/1 Queues

Consider an M/G/1 queue which is idle at time 0. The number of customers sampled at an independent exponential time is shown to have the same geometric distribution under the preemptive resume last in first out (LIFO) and the processor sharing (PS) disciplines. Hence, the marginal distribution of the queue length at any time is identical for both disciplines. We then give a detailed analysis of...

متن کامل

Limits and approximations for the M/G/1 LIFO waiting-time distribution

We provide additional descriptions of the steady-state waiting-time distribution in the M/G/1 queue with the last-in firstout (LIFO) service discipline. We establish heavy-traffic limits for both the cumulative distribution function (cdf) and the moments. We develop an approximation for the cdf that is asymptotically correct both as the traffic intensity p ~ 1 for each time t and as t ~ oo for ...

متن کامل

A Combined LIFO-Priority Scheme for Overload Control of E-commerce Web Servers

E-commerce Web-servers often face overload conditions during which revenue-generating requests may be dropped or abandoned due to an increase in the browsing requests. In this paper we present a simple, yet effective, mechanism for overload control of E-commerce Web-servers. We develop an E-commerce workload model that separates the browsing requests from revenue-generating transaction requests...

متن کامل

On the Behavior of Lifo Preemptive Resume Queues in Heavy Traffic

This paper studies heavy traffic behavior of a G/G/1 last-in-first-out (LIFO) preemptive resume queue, by extending the techniques developed in Limic (1999). The queue length process exhibits a perhaps unexpected heavy traffic behavior. The diffusion limit depends on the type of arrivals (and services) in a fairly intricate way, related to the Wiener-Hopf factorization for random walks.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009