Skipping and fetching: insights on non-conventional product-form solutions
From MaRDI portal
Publication:6546451
queuing theorygeneralized stochastic Petri netsproduct-form solutionsblocking policyfetching policyskip-over policy
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cites work
- scientific article; zbMATH DE number 3656855 (Why is no real title available?)
- scientific article; zbMATH DE number 1324228 (Why is no real title available?)
- scientific article; zbMATH DE number 1946756 (Why is no real title available?)
- scientific article; zbMATH DE number 763717 (Why is no real title available?)
- A survey of product form queueing networks with blocking and their equivalences
- Capacity analysis of sequential zone picking systems
- Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis
- Dynamic Scaling and Growth Behavior of Queuing Network Normalization Constants
- Networks of Waiting Lines
- On the solution of GSPN reward models
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Performance modeling and design of computer systems. Queueing theory in action
- Queuing Network Models with State-Dependent Routing
- Stationary states of crystal growth in three dimensions
- The Distribution of Queuing Network States at Input and Output Instants
This page was built for publication: Skipping and fetching: insights on non-conventional product-form solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546451)