SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Approximation methods for networks of queues with priorities
5 references·4 citing·29 second hop
Approximation methods for networks of queues with priorities (1984)Approximation methods for networks of que…A Queueing Network Analysis of Computer Communication Networks with Window Flow Control (1979)A Queueing Network Analysis o…Priority Scheduling Disciplines in Queuing Network Models of Computer Systems. (1977)Priority Scheduling Disciplin…Interactive modeling of computer systems (1976)Interactive modeling of compu…Solution of Queuing Problems by a Recursive Technique (1975)Solution of Queuing Problems …Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)Open, Closed, and Mixed Netwo…High-level approach to modeling of observed system behavior (2007)High-level approach to modeli…A generalized analysis technique for queuing networks with mixed priority strategy and class switching (1998)A generalized analysis techni…A Universal Maximum Entropy Algorithm for General Multiple Class Open Networks with Mixed Service Disciplines (1989)A Universal Maximum Entropy A…A maximum entropy priority approximation for a stableG/G/1 queue (1989)A maximum entropy priority ap…The Operational Analysis of Queueing Network Models (1978)The Queueing Network Analyzer (1983)Networks of Waiting Lines (1957)Queueing Systems. Volume 1: Theory (1975)Theory, Volume 1, Queueing Systems (1975)Computation of Steady-State Probabilities for M/M/1 Priority Queues (1981)A First Course in Bulk Queues (1983)Information theoretic approximations for theM/G/1 retrial queue (1994)On the number of customers served in the M/G/1 retrial queue: first moments and maximum entropy approach (2002)Mean-Value Analysis of Closed Multichain Queuing Networks (1980)The MVA priority approximation (1984)The theory of queues with a single server (1952)Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain (1953)Approximate Analysis of Central Server Models (1975)Queueing models for a flexible machining station Part II: The method of Coxian phases (1985)Modeling and analysis of communication systems based on computational methods for Markov chains (1990)Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms (1975)Queueing network models of multiprogramming (1980)On Optimal Scheduling Algorithms for Time-Shared Systems (1981)The MVA Pre-empt resume priority approximation (1983)Performance models for unreliable flexible manufacturing systems (1984)Bound hierarchies for multiple-class queuing networks (1986)Entropy maximisation and open queueing networks with priorities and blocking (2003)Two-level iterative queuing modeling of software contention (2003)Blocking in a Shared Resource Environment (1981)An introduction to queueing theory (1993)Survey of closed queueing networks with blocking (1990)The stochastic rendezvous network model for performance of synchronous client-server-like distributed software (1995)Enhanced Modeling and Solution of Layered Queueing Networks (2008)
this work references cited by second hop

References

  • 1975Open, Closed, and Mixed Networks of Queues with Different Classes of Customers2,411 cited
  • 1979A Queueing Network Analysis of Computer Communication Networks with Window Flow Control312 cited
  • 1975Solution of Queuing Problems by a Recursive Technique99 cited
  • 1977Priority Scheduling Disciplines in Queuing Network Models of Computer Systems.60 cited
  • 1976Interactive modeling of computer systems40 cited

Cited by

  • 1989A maximum entropy priority approximation for a stableG/G/1 queue28 cited
  • 1989A Universal Maximum Entropy Algorithm for General Multiple Class Open Networks with Mixed Service Disciplines21 cited
  • 2007High-level approach to modeling of observed system behavior17 cited
  • 1998A generalized analysis technique for queuing networks with mixed priority strategy and class switching17 cited

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