2002
DOI: 10.1002/0471208051
|View full text |Cite
|
Sign up to set email alerts
|

Reference Manual for Telecommunications Engineering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2003
2003
2023
2023

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 23 publications
(11 citation statements)
references
References 0 publications
0
11
0
Order By: Relevance
“…In the proposed algorithms the computational procedures contains the well-known Erlang's B-formula as well as expressions within that formula which has even been tabulated [20]. Thus, complexity of the proposed algorithms to calculate QoS metrics of investigated multiparametric CAC based on guard channels are almost congruous to that of Erlang's Bformula.…”
Section: <0> <1>mentioning
confidence: 99%
“…In the proposed algorithms the computational procedures contains the well-known Erlang's B-formula as well as expressions within that formula which has even been tabulated [20]. Thus, complexity of the proposed algorithms to calculate QoS metrics of investigated multiparametric CAC based on guard channels are almost congruous to that of Erlang's Bformula.…”
Section: <0> <1>mentioning
confidence: 99%
“…This is an exact equation for a parallel system [1,15]. In most availability analyses of communication networks, unavailability quantities or expressions are used based on simplifying assumptions, transforming an exact availability model with intractable complexities to a feasible unavailability model with an acceptable numerical accuracy [1].…”
Section: Availabilitymentioning
confidence: 99%
“…Formula (3) (Erlang-B formula), if programmed as shown will lead to overflow problems. A recursive computation is used in [5].…”
Section: Computational Aspectsmentioning
confidence: 99%
“…Nevertheless, both the numerator and the denominator above can become very large for large values of and , leading to overflow. A much better recursion is the following [6]: (5) with . We have used this formula (5) for values of as large as 1000 and have not encountered difficulties.…”
Section: Computational Aspectsmentioning
confidence: 99%