Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Sojourn times in a processor sharing queue with multiple U. Ayestaa,b
 

Summary: Sojourn times in a processor sharing queue with multiple
vacations
U. Ayestaa,b
, O.J. Boxmac,d
, I.M. Verloopb,e
a
CNRS-LAAS, Toulouse, France
b
Universit de Toulouse; INP, LAAS, Toulouse, France
c
EURANDOM, Eindhoven, The Netherlands
d
Department of Mathematics and Computer Science,
Technische Universiteit Eindhoven, The Netherlands
e
CNRS-IRIT, Toulouse, France
Abstract
We study an M/G/1 processor sharing queue with multiple vacations. The server only takes
a vacation when the system has become empty. If he finds the system still empty upon return,
he takes another vacation, and so on. Successive vacations are identically distributed, with a

  

Source: Ayesta, Urtzi - Laboratoire d'Analyse et d'Architecture des Systèmes du CNRS

 

Collections: Engineering