Efficiently Providing Multiple Grades of Service with Protection Against Overloads in Shared Resources

Gagan L. Choudhury · Kin Kwong Leung · Ward Whitt

40 citations0/0 files storedAT&T Technical Journal

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Network Traffic and Congestion Control Wireless Communication Networks Research

Abstract

Multiservice telecommunications systems require different grades of service for different customers, including protection against overloads caused by other customers. One way to provide multiple grades of service, including overload protection, is by partial sharing using upper-limit (UL) bounds, which specify an upper limit on the number of requests a customer is allowed at any time, and guaranteed-minimum (GM) bounds, which guarantee that there will always be space for a minimum number of requests from that customer. These bounds achieve effective separation with sharing and can be efficiently enforced and analyzed. Analysis is made possible by a new algorithm for computing blocking probabilities based on numerical transform inversion.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 40 citations exist upstream.

References

1981Blocking in a Shared Resource Environment 1991Loss Networks 1985Blocking When Service Is Required From Several Facilities Simultaneously 1980Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions 1994Multidimensional Transform Inversion with Applications to the Transient M/G/1 Queue 1983On the Steady-State Distribution in a Service Facility Carrying Mixtures of Traffic with Different Peakedness Factors and Capacity Requirements 1994Erlang capacity and uniform approximations for shared unbuffered resources 1990On Arrivals That See Time Averages

Cited by

1994An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.