scientific article; zbMATH DE number 3950178
From MaRDI portal
Publication:3720271
zbMATH Open0591.90035MaRDI QIDQ3720271FDOQ3720271
Authors: Ward Whitt 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
- Modeling the blocking phenomenon of service facilities
- Servers in tandem with communication and manufacturing blocking
- Blocking of dynamic multicast connections
- Blocking of finite source inputs which require simultaneous servers with general think and holding times
- scientific article; zbMATH DE number 3982232
- Two service units with interference in the access to servers
- On providing blocking probability and throughput guarantees in a multi-service environment
- Blocking, reordering, and the throughput of a series of servers
approximation schemesblocking probabilityindependent Poisson processessimultaneous resource possessionblocking systemseveral classes of customersmultiserver service facilities
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cited In (37)
- Mean-field limits for large-scale random-access networks
- Revisiting stochastic loss networks: structures and approximations
- A theory of auto-scaling for resource reservation in cloud services
- Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
- Improved approximations for the Erlang loss model
- Blocking with retrials in a completely shared resource environment
- Finite source blocking systems with multi-level active and idle periods
- Optimization via trunk reservation in single resource loss systems under heavy traffic
- Asymptotic independence of servers' activity in queueing systems with limited resource pooling
- Open problems in queueing theory inspired by datacenter computing
- Weak stochastic ordering for multidimensional Markov chains
- Insensitive traffic models for communication networks
- A new method for analysing the equilibrium and time-dependent behaviour of Markovian models
- Product form approximations for highly linear loss networks with trunk reservation
- Multiserver Queueing System with Constant Service Time and Simultaneous Service of a Customer by Random Number of Servers
- Large loss networks
- Loss circuit switched communication network -- performance analysis and dynamic routing
- Efficient blocking probability computation of complex traffic flows for network dimensioning
- A MUTUAL OVERFLOW SYSTEM WITH SIMULTANEOUS OCCUPATION OF RESOURCES
- Functional central limit theorems for a large network in which customers join the shortest of several queues
- Stationary waiting time in parallel queues with synchronization
- Large graph limit for an SIR process in random network with heterogeneous connectivity
- State-dependent routing on symmetric loss networks with trunk reservations. II: Asymptotics, optimal design
- Computation and optimization methods for multiresource queues
- Effective bandwidths at multi-class queues
- Large deviations at equilibrium for a large star-shaped loss network.
- Large Deviations Principle for Occupancy Problems with Colored Balls
- Title not available (Why is that?)
- Computational algorithms for blocking probabilities in circuit-switched networks
- Stability criterion of a multiserver model with simultaneous service
- Chaos hypothesis for a system interacting through shared resources
- A Markov model for the spread of viruses in an open population
- Stability of a two-pool \(N\)-model with preemptive-resume priority
- Two service units with interference in the access to servers
- A critically loaded multiclass Erlang loss system
- Sharp estimates and a central limit theorem for the invariant law for a large star-shaped loss network.
- Blocking of finite source inputs which require simultaneous servers with general think and holding times
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3720271)
