A Multi-User-Class, Blocked-Calls-Cleared, Demand Access Model

DOI10.1109/TCOM.1978.1094081MaRDI QIDQ4145269zbMATH OpenOpenAlexFDO

Authors J. M. Aein

Publication date 1978

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcom.1978.1094081

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Communication theory (94A05)

Cited in

(5)

• Linear programming relaxations and marginal productivity index policies for the buffer sharing problem
• Computational algorithms for blocking probabilities in circuit-switched networks
• Modelling of cellular networks with traffic overflow
• Standard clock simulation and ordinal optimization applied to admission control in integrated communication networks
• Properties of recurrent equations for the full-availability group with BPP traffic

This page was built for publication: A Multi-User-Class, Blocked-Calls-Cleared, Demand Access Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4145269)