Blocking probabilities in large circuit-switched networks
From MaRDI portal
Publication:3730764
DOI10.2307/1427309zbMATH Open0597.60092OpenAlexW2170219906MaRDI QIDQ3730764FDOQ3730764
Authors: Frank Kelly 
Publication date: 1986
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1427309
Recommendations
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Cited In (75)
- A new perspective on the normalization of invariant measures for loss networks on other product form systems.
- Insensitivity of blocking probabilities in a circuit-switching network
- Optimal Control and Trunk Reservation in Loss Networks
- Blocking probabilities for large multirate erlang loss systems
- Revisiting stochastic loss networks: structures and approximations
- A stochastic fluid model for an ad hoc mobile network
- Title not available (Why is that?)
- Approximation in Large-Scale Circuit-Switched Networks
- Bandwidth sharing networks with multiscale traffic
- Planning the resource of information transmission for connection lines of multiservice hierarchical access networks
- Blocking a transition in a free choice net and what it tells about its throughput.
- Improved approximations for the Erlang loss model
- Networks of interacting stochastic fluid models with infinite and finite buffers
- On a bi-dimensional dynamic alternative routing method
- Maximum weight matching with hysteresis in overloaded queues with setups
- Blocking Probability in Link-Frame Systems from the Viewpoint of Overflow Processes
- A stochastic analysis of a network with two levels of service
- Asymptotic Behaviour of an Integrated Video-Data Network
- Teletraffic engineering for product-form circuit-switched networks
- Exact computation of time and call blocking probabilities in large, multi-traffic, multi-resource loss systems
- Fast simulation of blocking probabilities in loss networks
- Fast simulation of the customer blocking probability in queueing networks with multicast access
- Efficient Simulation via Coupling
- Optimization via trunk reservation in single resource loss systems under heavy traffic
- Analysis of loss systems with overlapping resource requirements
- Erlang's fixed-point approximation for performance analysis of HetNets
- 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
- Analysis of loss networks with routing
- Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking
- Asymptotic analysis of a loss model with trunk reservation. I: Trunks reserved for fast traffic
- Blocking Probabilities for an Underloaded or Overloaded Link with Trunk Reservation
- Optimal trunk reservation for an overloaded link
- Large loss networks
- Loss circuit switched communication network -- performance analysis and dynamic routing
- Stochastic networks with multiple stable points
- Estimation of blocking probabilities in cellular networks with dynamic channel assignment
- A new stage in mathematical teletraffic theory
- Models of circuit-switching networks with distributed control
- Proportional fairness and its relationship with multi-class queueing networks
- The Linking Probability of Deep Spider-Web Networks
- State-dependent routing on symmetric loss networks with trunk reservations. II: Asymptotics, optimal design
- Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints
- Diffusion approximation of star-shaped symmetric networks with losses
- The computation algorithm of capacity indices of the telecommunication networks with repeated transmissions
- A Stochastic Model of the Production of Multiple Proteins in Cells
- Computation and optimization methods for multiresource queues
- Mathematical theory of queueing networks
- Blocking Probability in a Switching Center With Arbitrary Routing Policy
- Monte Carlo Summation Applied to Product-Form Loss Networks
- Circuit-switching networks with FIFO plus justifying blockout service on infinite graphs
- Blocking probabilites for a single link with trunk reservation
- Routing Optimization in Optical Burst Switching Networks: a Multi-path Routing Approach
- Computational algorithms for blocking probabilities in circuit-switched networks
- ASYMPTOTIC EVALUATION OF BLOCKING PROBABILITIES IN A HIERARCHICAL CELLULAR MOBILE NETWORK
- A degenerate central limit theorem for single resource loss systems
- Threshold phenomena in the transient behaviour of Markovian models of communication networks and databases
- Sequential dynamics of high order polynomial automata networks: An application to the Erlang fixed-point equations
- Qualitative properties of the Erlang blocking model with heterogeneous user requirements
- A critically loaded multiclass Erlang loss system
- A Note on Insensitivity in Stochastic Networks
- Individual blocking probabilities in the loss system \(G_ 1+\cdot \cdot \cdot +G_ N/M/1/0\)
- Quasi-reversible multiclass queues with order independent departure rates
- Title not available (Why is that?)
- Binomial-Poisson entropic inequalities and the M/M/∞queue
- Asymptotic Analysis of a Loss Model with Trunk Reservation II: Trunks Reserved for Slow Traffic
- Title not available (Why is that?)
- BOUNDS FOR CALL COMPLETION PROBABILITIES IN LARGE-SCALE MOBILE COMMUNICATION NETWORKS(<Special Issue>Network Design, Control and Optimization)
- On the accuracy of the OPC approximation for a symmetric overflow loss model
- Fixed Point Approximations for Retrial Networks
- Multiple Solutions for Blocking Probabilities in Asymmetric Networks
- Allocation schemes of resources with downgrading
- MULTI-CLASS RESOURCE SHARING WITH BATCH ARRIVALS
- MAXIMUM BLOCKING PROBABILITY IN GI/GI/cc SYSTEMS WITH BURSTY ARRIVALS
- A dynamic scheduling communication protocol and its analysis for hypercube networks
This page was built for publication: Blocking probabilities in large circuit-switched networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3730764)
