- 2079 Chaitra · 3+5 marks
Decision tree formulas; 20 servers, 10 E
Short answer
The decision tree uses: infinite sources – Erlang B (cleared), Poisson (held), Erlang C (delayed); finite sources – Engset (cleared), binomial (held), finite queue (delayed). With 20 servers, total 10 E and 3‑min calls: total calls/h = (10×60)/3 = 200 calls/h; per server = 10/20 = 0.5 E, calls per server = (0.5×60)/3 = 10 calls/h.
What are the formulas used in telecommunication traffic engineering decision tree? A group of 20 servers carry a traffic of 10 erlangs. If the average duration of a call is three minutes, calculate the number of calls put through by a single server and the group as a whole in a one-hour period.
Formulas in the traffic engineering decision tree
The choice of formula depends on (1) whether the number of sources is infinite or finite, and (2) how blocked calls are treated: cleared (LCC), held (LCH) or delayed (LCD).
Traffic sources
+-------------+-------------+
Infinite Finite
+-------+-------+ +-------+-------+
LCC LCH LCD LCC LCH LCD
Erlang B Poisson Erlang C Engset Binomial Finite
queue
| Sources | Blocked calls | Formula |
|---|---|---|
| Infinite | Cleared | Erlang B: |
| Infinite | Held | Poisson: |
| Infinite | Delayed | Erlang C (probability of delay) |
| Finite | Cleared | Engset |
| Finite | Held | Binomial |
| Finite | Delayed | Finite-queue model |
Numerical
Given: N = 20 servers, A = 10 E, h = 3 min, T = 60 min. Using , so .
Group as a whole:
Single server (traffic shared equally):
Check: .
Answer: each server handles 10 calls/hour; the group handles 200 calls/hour.
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Calls handled by 30 servers carrying 15 E · Telecommunications, chapter 6 · asked 3×
- Calls handled by 25 servers carrying 5 E · Telecommunications, chapter 6 · asked 3×
- Decision tree; infinite source blocking formulas · Telecommunications, chapter 6 · asked 2×
- Decision tree; finite source blocking formulas · Telecommunications, chapter 6 · asked 2×
- Traffic intensity, GOS and call duration probability · Telecommunications, chapter 6
- Traffic numerical: 800 calls, 50 lost · Telecommunications, chapter 6 · asked 6×
- AVL tree for 10, 20, 30, 35, 50, ... · Data Structure and Algorithm, chapter 6
- Decision tree for plant improvement alternatives · Engineering Economics, chapter 6 · asked 2×
- AVL tree for 10 20 30 50 45 40 8 5 3 · Data Structure and Algorithm, chapter 6
- Explain decision tree analysis · Engineering Economics, chapter 6 · asked 5×