About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
4th International ICST Conference on Performance Evaluation Methodologies and Tools

Research Article

Population effects in Multiclass Processor Sharing Queues

Download997 downloads
Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.4108/ICST.VALUETOOLS2009.7622,
        author={Abdelghani Ben  Tahar and Alain  Jean-Marie},
        title={Population effects in Multiclass Processor Sharing Queues},
        proceedings={4th International ICST Conference on Performance Evaluation Methodologies and Tools},
        publisher={ICST},
        proceedings_a={VALUETOOLS},
        year={2010},
        month={5},
        keywords={Fluid Limit Fluid model measure valued process multiclass networks Processor sharing},
        doi={10.4108/ICST.VALUETOOLS2009.7622}
    }
    
  • Abdelghani Ben Tahar
    Alain Jean-Marie
    Year: 2010
    Population effects in Multiclass Processor Sharing Queues
    VALUETOOLS
    ICST
    DOI: 10.4108/ICST.VALUETOOLS2009.7622
Abdelghani Ben Tahar1,*, Alain Jean-Marie2,*
  • 1: Laboratoire de Mathématiques Raphaël Salem, UMR 6085 CNRS-Université de Rouen, Avenue de l’Université, BP.12, F-76801 Saint-Étienne-du-Rouvray
  • 2: INRIA / LIRMM, UMR 5506 CNRS-Université Montpellier 2, 161 Rue Ada, F-34392 Montpellier
*Contact email: abdelghani.bentahar@univ-rouen.fr, ajm@lirmm.fr

Abstract

Consider a single server queueing system with several classes of customers, each having its own renewal input process and its own general service times distribution. Upon completing service, customers may leave, or reenter the queue, possibly as customers of a different class. The server is operating under the egalitarian or the discriminatory processor sharing discipline. In this paper, we consider the uid approximation of this multiclass processor sharing queue. We frst provide the results allowing to compute the trajectories for this model, under the egalitarian PS discipline. Asymptotic results for overloaded queues are also stated. Next, we show that a simple transformation allows to compute the solution for the discriminatory PS queue as well. Finally, we illustrate the different results through numerical experiments. We compare transient trajectories with simulations, and we discuss the fairness issue that may arise in overloaded PS queues.

Keywords
Fluid Limit Fluid model measure valued process multiclass networks Processor sharing
Published
2010-05-16
Publisher
ICST
Modified
2010-05-16
http://dx.doi.org/10.4108/ICST.VALUETOOLS2009.7622
Copyright © 2009–2025 ICST
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL