SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A unifying approach to product-forms in networks with finite capacity constraints
7 references·1 citing·30 second hop
A unifying approach to product-forms in networks with finite capacity constraints (2010)A unifying approach to product-forms in n…Reversed processes, product forms and a non-product form (2004)Reversed processes, product f…Turning back time in Markovian process algebra (2003)Turning back time in Markovia…Queueing networks with blocking (2003)Queueing networks with blocki…Product-form queueing networks with negative and positive customers (1991)Product-form queueing network…Survey of closed queueing networks with blocking (1990)Survey of closed queueing net…Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis (1979)Closed Exponential Networks o…Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)Open, Closed, and Mixed Netwo…Ergodicity bounds for the Markovian queue with time-varying transition intensities, batch arrivals and one queue skipping policy (2020)Ergodicity bounds for the Mar…The Output of a Queuing System (1956)Jobshop-Like Queueing Systems (1963)Compositional reversed Markov processes, with applications to G-networks (2004)Jobshop-Like Queueing Systems (2004)A fluid model for layered queueing networks (2012)Closed Queuing Systems with Exponential Servers (1967)Integral Representations and Asymptotic Expansions for Closed Markovian Queueing Networks: Normal Usage (1982)Product forms for queueing networks with state-dependent multiple job transitions (1991)On Decomposition Methods for Tandem Queueing Networks with Blocking (1993)Introduction to Queueing Networks (1987)An Introduction to Queueing Networks (1990)G-networks by triggered customer movement (1993)G-Networks with Signals and Batch Removal (1993)G-networks: A versatile approach for work removal in queueing networks (2000)An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking (1987)MEM for arbitrary queueing networks with multiple general servers and repetitive-service blocking (1989)The case for modeling correlation in manufacturing systems (2001)Process optimization via neural network metamodeling (2002)A Proof for the Queuing Formula: L = λ W (1961)Fundamentals of Queueing Theory. (1977)Simulation Modeling and Analysis. (1983)Entropy maximisation and queueing network models (1994)A review on queueing network models with finite capacity queues for software architectures performance prediction (2003)Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline (1968)A unifying approach to product-forms in networks with finite capacity constraints (2010)An initiative for a classified bibliography on G-networks (2010)Product-Forms in Multi-Way Synchronizations (2013)Mean-Value Analysis of Closed Multichain Queuing Networks (1980)Blocking in a Shared Resource Environment (1981)An introduction to queueing theory (1993)
this work references cited by second hop

References

  • 1975Open, Closed, and Mixed Networks of Queues with Different Classes of Customers2,411 cited
  • 1991Product-form queueing networks with negative and positive customers512 cited
  • 1990Survey of closed queueing networks with blocking192 cited
  • 1979Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis132 cited
  • 2003Turning back time in Markovian process algebra121 cited
  • 2003Queueing networks with blocking68 cited
  • 2004Reversed processes, product forms and a non-product form37 cited

Cited by

  • 2020Ergodicity bounds for the Markovian queue with time-varying transition intensities, batch arrivals and one queue skipping policy15 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work