Sharp and simple bounds for the Erlang delay and loss formulae

Authors:
Arie Harel
Affiliations:
Zicklin School of Business, Baruch College, CUNY, New York, USA 10010-5585
Venue:
Queueing Systems: Theory and Applications
Year:
2010

Citing 5
Cited 2

Strong convexity results for queueing systems

Operations Research
Sharp bounds and simple approximations for the Erlang delay and loss formulas

Management Science
Convexity properties of the Erlang loss formula

Operations Research
Corrected asymptotics for a multi-server queue in the Halfin-Whitt regime

Queueing Systems: Theory and Applications
A simple algebraic approximation to the Erlang loss system

Operations Research Letters

Mixed convexity & optimization of the SVM QP problem for nonlinear polynomial kernel maps

Proceedings of the 15th WSEAS international conference on Computers
Convexity Results for the Erlang Delay and Loss Formulae When the Server Utilization Is Held Constant

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note describes an importance sampling (IS) algorithm to estimate buffer overflows of stable Jackson networks with a tree topology. Three new measures of service capacity and traffic in Jackson networks are introduced and the algorithm is defined ...