G-NETWORKS OF UNRELIABLE NODES
From MaRDI portal
Publication:5358085
DOI10.1017/S026996481600005XzbMath1370.60156MaRDI QIDQ5358085
Publication date: 19 September 2017
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (2)
OPTIMAL ENERGY DISTRIBUTION WITH ENERGY PACKET NETWORKS ⋮ FINDING NONSTATIONARY STATE PROBABILITIES OF OPEN MARKOV NETWORKS WITH MULTIPLE CLASSES OF CUSTOMERS AND VARIOUS FEATURES
Uses Software
Cites Work
- \(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.
- Flow equivalence and stochastic equivalence in G-networks
- Product-form queueing networks with negative and positive customers
- G-networks by triggered customer movement
- Design and performance of cognitive packet networks
- Multiple class G-networks with iterated deletions
- G-networks with resets
- Availability Formulas and Performance Measures for Separable Degradable Networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: G-NETWORKS OF UNRELIABLE NODES
