Flow equivalence and stochastic equivalence in G-networks

DOI10.1007/S10287-003-0008-ZMaRDI QIDQ2386631zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jean-Michel Fourneau, Erol Gelenbe

Publication date 25 August 2005

Published in Computational Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10287-003-0008-z

zbMATH Keywords

stationary solutionnegative customersqueueing networksflowsproduct formsignals and triggers

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Stochastic network models in operations research (90B15)

Recommendations

• G-networks with resets
• \(G\)-networks with multiple classes of signals and positive customers
• G-networks by triggered customer movement
• \(G\)-networks: A versatile approach for work removal in queueing networks
• scientific article; zbMATH DE number 1946756

Cited in

(9)

• Analysis of multi-resource loss system with state-dependent arrival and service rates
• G-networks and their applications to machine learning, energy packet networks and routing: Introduction to the special issue
• Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
• G-networks of unreliable nodes
• A single-server discrete-time queue with correlated positive and negative customer arrivals
• Equivalence of buddy networks with arbitrary number of stages
• G-networks with resets
• Modelling Gene Regulatory Networks
• Optimum energy for energy packet networks

This page was built for publication: Flow equivalence and stochastic equivalence in G-networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2386631)