IEEE Transactions on Communications · 1993 · 160 citations · 20 references
ComputingComputer ScienceComputer NetworksMathematical EconomicsQueuing TheoryCommunication NetworksHeavy-traffic ApproximationsNetwork Performance AnalysisNetwork TopologyQueueing TheoryRoutingApproximation SchemesBandwidthDiscrete Approximation SchemesHeavy Traffic TheoryLight Traffic ApproximationLoss Network ModelsNetwork Cost FunctionsNetwork Traffic Modeling
A class of loss networks in which each connection specifies a route and a bandwidth requirement is considered. If sufficient bandwidth is not available in one of the links along the route, the connection is blocked and lost. Three schemes are considered for approximating blocking probabilities in the network. For a specific star topology, two of these schemes give blocking probabilities that are very close to the exact values under light, moderate, and heavy traffic. The approximations are shown to be asymptotically correct in a natural limiting regime. The implied costs and their relation to revenue sensitivity are also determined for the approximation schemes. The approximate revenue sensitivities are again very close to the exact values for the specific star topology.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
20
Blocking in a Shared Resource Environment
J.S. Kaufman · IRE Transactions on Communications Systems · 1981 · 997 citations