Asymptotic Solution to an Inverse Problem for a Shared Unbuffered Resource

DOI10.1137/S0036139901388799MaRDI QIDQ3149857zbMATH OpenFDO

Authors K. Ramakrishnan, John A. Morrison

Publication date 29 September 2002

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

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

zbMATH Keywords

asymptoticscarried loadsinverse problemmultiservicetraffic intensitiesunbuffered resources

Mathematics Subject Classification ID

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

Recommendations

• Refined Asymptotic Approximations to Loss Probabilities and Their Sensitivities in Shared Unbuffered Resources
• Inverse problems in queueing theory and internet probing
• A note on large-buffer asymptotics for generalized processor sharing with Gaussian inputs
• The Capacity Region of the L -User Gaussian Inverse Compute-and-Forward Problem
• Sharing resources at nonuniform access rates
• Inverse problems in models of resource distribution
• Asynchronous distributed solution of large scale nonlinear inversion problems
• Asymptotically optimal parallel resource assignment with interference
• Asymptotic fluid optimality and efficiency of the tracking policy for bandwidth-sharing networks

Cited in

(3)

• Refined Asymptotic Approximations to Loss Probabilities and Their Sensitivities in Shared Unbuffered Resources
• Asymptotic Shape of the Erlang Capacity Region of a Multiservice Shared Resource
• 1.79-approximation algorithms for continuous review single-sourcing lost-sales and dual-sourcing inventory models

This page was built for publication: Asymptotic Solution to an Inverse Problem for a Shared Unbuffered Resource

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