PROCESSOR SHARING G-QUEUES WITH INERT CUSTOMERS AND CATASTROPHES: A MODEL FOR SERVER AGING AND REJUVENATION

DOI10.1017/S0269964817000092zbMath1443.68035MaRDI QIDQ4961784

Y. Ait El Majhoub, Jean-Michel Fourneau

Publication date: 25 October 2018

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

zbMATH Keywords

catastrophesagingrejuvenationG-networks with customers and signalsinert customersproduct-form steady-state distribution

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

A RANDOM ACCESS G-NETWORK: STABILITY, STABLE THROUGHPUT, AND QUEUEING ANALYSIS

Uses Software

• SPADES

Cites Work

• Unnamed Item
• Unnamed Item
• \(G\)-networks with multiple classes of signals and positive customers
• \(G\)-networks: A unifying model for neural and queueing networks
• Turning back time in Markovian process algebra.
• Transient solution of an M/M/1 queue with catastrophes
• Stability of Product Form G-Networks
• Product-form queueing networks with negative and positive customers
• G-networks by triggered customer movement
• Design and performance of cognitive packet networks
• BMAP/SM/1 queue with Markovian input of disasters and non-instantaneous recovery
• Multiple class G-networks with iterated deletions
• G-networks with resets
• Analysis and Synthesis of Computer Systems

This page was built for publication: PROCESSOR SHARING G-QUEUES WITH INERT CUSTOMERS AND CATASTROPHES: A MODEL FOR SERVER AGING AND REJUVENATION