Multiple class G-networks with jumps back to zero

Author

Fourneau, J.M. ; Kloul, L. ; Quessette, F.

Author_Institution

PRiSM, Univ. de Versailles Saint-Quentin, Versailles, France

fYear

1995

fDate

18-20 Jan 1995

Firstpage

28

Lastpage

32

Abstract

We consider multiple class G-networks of processor sharing queues with negative customers which destroy all the customers in a queue. We prove that these networks have a product form solution for steady-state distribution. These networks may have some applications in reliability or performability as the negative customers may clearly model breakdown of computer or communication systems. We also show that under simple assumptions these networks always have a stationary distribution

Keywords

performance evaluation; processor scheduling; queueing theory; multiple class G-networks; performability; processor sharing queues; product form solution; reliability; stationary distribution; steady-state distribution; Communication systems; Computer network reliability; Computer networks; Electric breakdown; Neural networks; Neurons; Protocols; Routing; Steady-state; Telecommunication network reliability;

fLanguage

English

Publisher

ieee

Conference_Titel

Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1995. MASCOTS '95., Proceedings of the Third International Workshop on

Conference_Location

Durham, NC

Print_ISBN

0-8186-6902-0

Type

conf

DOI

10.1109/MASCOT.1995.378652

Filename

378652