Blocking with retrials in a completely shared resource environment

DOI10.1016/0166-5316(92)90058-OzbMath0762.90026OpenAlexW2075668510MaRDI QIDQ4031482

Jay S. Kaufman

Publication date: 1 April 1993

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(92)90058-o

zbMATH Keywords

high speed networksarbitrary mean residency requirementsblocked requests to retrygeneralized Erlang model

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (5)

On providing blocking probability and throughput guarantees in a multi-service environment ⋮ Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: a heuristic solution ⋮ Three-level modeling of a speed-scaling supercomputer ⋮ Modeling Erlang's ideal grading with multirate BPP traffic ⋮ Properties of recurrent equations for the full-availability group with BPP traffic

This page was built for publication: Blocking with retrials in a completely shared resource environment