Blocking probabilities in large circuit-switched networks

From MaRDI portal
Revision as of 10:18, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3730764

DOI10.2307/1427309zbMath0597.60092OpenAlexW2170219906MaRDI QIDQ3730764

F. P. 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




Related Items (54)

Planning the resource of information transmission for connection lines of multiservice hierarchical access networksMaximum weight matching with hysteresis in overloaded queues with setupsLarge loss networksMULTI-CLASS RESOURCE SHARING WITH BATCH ARRIVALSA new stage in mathematical teletraffic theoryA Stochastic Model of the Production of Multiple Proteins in CellsQuasi-reversible multiclass queues with order independent departure ratesBandwidth sharing networks with priority scalingProduct form approximations for highly linear loss networks with trunk reservationA new method for analysing the equilibrium and time-dependent behaviour of Markovian modelsCircuit-switching networks with FIFO plus justifying blockout service on infinite graphsOptimization via trunk reservation in single resource loss systems under heavy trafficComputation and optimization methods for multiresource queuesOptimal trunk reservation for an overloaded linkRevisiting Stochastic Loss Networks: Structures and ApproximationsA degenerate central limit theorem for single resource loss systemsErlang's fixed-point approximation for performance analysis of HetNetsMathematical theory of queueing networksQualitative properties of the Erlang blocking model with heterogeneous user requirementsA DYNAMIC SCHEDULING COMMUNICATION PROTOCOL AND ITS ANALYSIS FOR HYPERCUBE NETWORKSDiffusion approximation of star-shaped symmetric networks with lossesAsymptotic analysis of a loss model with trunk reservation. I: Trunks reserved for fast trafficStochastic networks with multiple stable pointsState-dependent routing on symmetric loss networks with trunk reservations. II: Asymptotics, optimal designComputational algorithms for blocking probabilities in circuit-switched networksAnalysis of loss systems with overlapping resource requirementsThe computation algorithm of capacity indices of the telecommunication networks with repeated transmissionsBinomial-Poisson entropic inequalities and the M/M/queueOn a bi-dimensional dynamic alternative routing methodImproved approximations for the Erlang loss modelA stochastic fluid model for an ad hoc mobile networkAsymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraintsA Note on Insensitivity in Stochastic NetworksA stochastic analysis of a network with two levels of serviceNetworks of interacting stochastic fluid models with infinite and finite buffersAnalysis of loss networks with routingMultiple Solutions for Blocking Probabilities in Asymmetric NetworksLoss circuit switched communication network -- performance analysis and dynamic routingAsymptotic Analysis of a Loss Model with Trunk Reservation II: Trunks Reserved for Slow TrafficFast simulation of blocking probabilities in loss networksEfficient Simulation via CouplingFixed Point Approximations for Retrial NetworksAllocation schemes of resources with downgradingThreshold phenomena in the transient behaviour of Markovian models of communication networks and databasesRouting Optimization in Optical Burst Switching Networks: a Multi-path Routing ApproachSequential dynamics of high order polynomial automata networks: An application to the Erlang fixed-point equationsOn the Accuracy of the OPC Approximation for a Symmetric Overflow Loss ModelApproximation in Large-Scale Circuit-Switched NetworksOptimal Control and Trunk Reservation in Loss NetworksAsymptotic Behaviour of an Integrated Video-Data NetworkMonte Carlo Summation Applied to Product-Form Loss NetworksProportional fairness and its relationship with multi-class queueing networksA new perspective on the normalization of invariant measures for loss networks on other product form systems.A critically loaded multiclass Erlang loss system







This page was built for publication: Blocking probabilities in large circuit-switched networks