1994
DOI: 10.1109/90.365417
|View full text |Cite
|
Sign up to set email alerts
|

Erlang capacity and uniform approximations for shared unbuffered resources

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
72
0

Year Published

1995
1995
2014
2014

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 97 publications
(74 citation statements)
references
References 28 publications
1
72
0
Order By: Relevance
“…In this situation, the classical Kaufman (or Roberts) algorithm ( [10,11]) can be used to calculate the functions B s for small values of C k . For larger values of C k , approximations based on the uniform asymptotic approximation (UAA) in [12] are used, having in mind its efficiency in these situations.…”
Section: The Multiobjective Routing Modelmentioning
confidence: 99%
“…In this situation, the classical Kaufman (or Roberts) algorithm ( [10,11]) can be used to calculate the functions B s for small values of C k . For larger values of C k , approximations based on the uniform asymptotic approximation (UAA) in [12] are used, having in mind its efficiency in these situations.…”
Section: The Multiobjective Routing Modelmentioning
confidence: 99%
“…The "Erlang capacity" [19] of a network with J circuits is defined as the set of input rates {λ 1 , ..., λ J } for which some given QoS criteria can be met. The method of determining optimal admission-control policies that we used in Refs.…”
Section: Erlang Capacitiesmentioning
confidence: 99%
“…The desired projection can be written as ____________ 18 The notion of dominant circuit does not depend on offered load; in fact, the offered load on the dominant circuit may be zero. 19 When the blocking probability of the dominant circuit exceeds QoS + ε the projection is not used, even though the blocking probability of one or more of the other circuits may be located in the band of width 2ε.…”
Section: Preliminary Approachmentioning
confidence: 99%
“…The Kaufman (or Roberts) algorithm (Kaufman 1981;Roberts 1983) can be used to calculate the functions L s for small values of C k . For larger values of C k , the use of approximations based on the uniform asymptotic approximation (UAA) (Mitra and Morrison 1994) is recommended. This type of approximation was suggested by Mitra et al (1999) in the context of off-line single-objective multiservice routing optimisation models and was also used in the multiobjective dynamic alternative routing model (Martins et al 2006).…”
Section: Traffic Modelling Approachmentioning
confidence: 99%