Diffusion Approximations for a Multiclass Markovian Service System with "Guaranteed" and "Best-Effort" Service Levels

نویسندگان

  • Constantinos Maglaras
  • Assaf J. Zeevi
چکیده

This paper considers a Markovian model of a service system motivated by communication and information services. The system has finite processing capacity and offers multiple grades of service. The highest priority users receive a “guaranteed” processing rate, while lower priority users share residual capacity according to their priority level and therefore may experience service degradation (hence the term “best effort”). This paper focuses on performance analysis for this class of systems. We consider the Halfin-Whitt heavy-traffic regime, where the arrival rate and system processing capacity both grow large in a way that the traffic intensity approaches one. We first derive a multidimensional diffusion approximation for the system dynamics and subsequently obtain a more tractable diffusion limit based on an intuitive “perturbation approach.” This method enables us to compute various closed form approximations to steady-state as well as transient congestion-related performance measures. Numerical examples illustrate the accuracy of these approximations.

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

ثبت نام

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

منابع مشابه

Diffusion Approximations for a Markovian Multi-Class Service System with “Guaranteed” and “Best-Effort” Service Levels

This paper considers a Markovian model of a service system motivated by communication and information services. The system has finite processing capacity and offers multiple grades of service. The highest priority users receive a “guaranteed” processing rate, while lower priority users share residual capacity according to their priority level and therefore may experience service degradation; he...

متن کامل

Diffusion Approximations for Systems with Shared Resources Offering Guaranteed and Best Effort Service

This paper considers a Markovian model motivated by communication and information services, where a service provider is assumed to operate a finite set of processing resources and offer guaranteed-rate and best-effort type of service to a market of heterogeneous users. The capacity available to best-effort users is stochastically modulated by the number of guaranteed-rate users in the system. C...

متن کامل

Pricing and Design of Differentiated Services: Approximate Analysis and Structural Insights

We consider a Markovian service system that offers two grades of service to a market of heterogenous users: a “guaranteed” (G) service rate to high priority users, and “best-effort” (BE) type service, in which residual capacity not allocated to G-users is shared by the low priority users. Users, in turn, are sensitive to both price and congestion-related effects. The service provider’s objectiv...

متن کامل

ANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS

This paper presents the analysis of a renewal input  finite buffer queue wherein the customers can decide either to  join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed  by an underlying $m$-state Markov chain. Employing the supplementary  variable and imbedded Markov chain techniques,   the steady-state system length distributions at pre...

متن کامل

A Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy

This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Math. Oper. Res.

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2004