Multiple class G-networks with list-oriented deletions

We study a new dynamic of generalized networks (G-networks) of queues. We consider networks with multiple classes of customers and signals, and three types of service disciplines: first-in-first-out (FIFO), last-in-first-out with pre-emptive resume priority (LIFO/PR) and processor sharing (PS). More...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 126; no. 2; pp. 250 - 272
Main Authors Fourneau, J.-M., Kloul, L., Verchère, D.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 16.10.2000
Elsevier
Elsevier Sequoia S.A
SeriesEuropean Journal of Operational Research
Subjects
Computer Science
G-networks
Multiple classes
Network topologies
Operations research
Probabilistic deleting
Probability
Product-form solution
Service disciplines
Service stations list
Studies
Service stations list
Multiple classes
Probabilistic deleting
G-networks
Product-form solution
Service disciplines
Online AccessGet full text

Cover

More Information
Summary:We study a new dynamic of generalized networks (G-networks) of queues. We consider networks with multiple classes of customers and signals, and three types of service disciplines: first-in-first-out (FIFO), last-in-first-out with pre-emptive resume priority (LIFO/PR) and processor sharing (PS). Moreover, we consider a probabilistic deleting mechanism based on iterated deletions of customers according to an arbitrary list of service stations. We prove that these networks have a steady-state product-form solution and we investigate the existence of a solution to the traffic equation of such networks.
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(99)00477-4