Refined Asymptotic Approximations to Loss Probabilities and Their Sensitivities in Shared Unbuffered Resources

DOI10.1137/S0036139997326478MaRDI QIDQ4237248zbMATH OpenOpenAlexFDO

Authors K. Ramakrishnan, Debasis Mitra, John A. Morrison

Publication date 31 March 1999

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0036139997326478

zbMATH Keywords

loss probabilitiesmultirateuniform asymptotic approximationsimplied costsnetwork traffic engineering

Mathematics Subject Classification ID

Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Communication networks in operations research (90B18)

Recommendations

• Asymptotic shape of the Erlang capacity region of a multi-service shared resource
• Asymptotic Shape of the Erlang Capacity Region of a Critically Loaded Multiservice Shared Resource
• Asymptotic Solution to an Inverse Problem for a Shared Unbuffered Resource
• Asymptotic Shape of the Erlang Capacity Region of a Multiservice Shared Resource
• Asymptotic analysis of single resource loss systems in heavy traffic, with applications to integrated networks

Cited in

(5)

• Asymptotic Shape of the Erlang Capacity Region of a Multiservice Shared Resource
• Asymptotic shape of the Erlang capacity region of a multi-service shared resource
• Asymptotic Solution to an Inverse Problem for a Shared Unbuffered Resource
• Saturation in a Markovian parking process
• Change in network revenue due to changes in capacities of links

This page was built for publication: Refined Asymptotic Approximations to Loss Probabilities and Their Sensitivities in Shared Unbuffered Resources

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