Traffic Engineering: Holding Time and Traffic Intensity

AdventurousRhythm avatar
AdventurousRhythm
·
·
Download

Start Quiz

Study Flashcards

29 Questions

The probability of finding the trunk ______ is equal to the proportion of time for which the trunk is busy.

busy

Traffic intensity is measured in ______.

erlangs

A single trunk (CCS) cannot carry more than one ______, i.e., 𝐴 ≤ 1 for one trunk.

call

The ______ Hour is the hour that has the most number of calls.

Busy

The Busy Hour depends on various factors such as ______, weather and international events.

stock market

Traffic intensity = (25+15+18+12)/______ = 1.2 E.

60

The average number of calls in progress during a time T with holding time h is called ______ intensity.

traffic

The duration of a call is called its ______ time because it holds the trunk for that time.

holding

The probability of a call lasting at least t sec is given by 𝑃 𝑡 =𝑒 𝑛 𝑇 − 𝑡 ℎ where t/h is the average ______ time.

holding

1 ______ represents that circuit occupied for 1-hour, i.e., circuit occupied for entire observation.

Erlang

The maximum capacity of single server is ______ E.

1

The number of calls in progress at different intervals of time for a day is represented by ______.

μ

The waiting time is dependent on the following factors: 1) Number of ______ 2) Number of servers

sources

The service depends on two factors: 1) Waiting ______ are selected in first-in first serviced FCFS or FIFO

calls

Under heavy traffic, ______ occurs

blocking

Probability of waiting (the probability of finding all lines occupied) is equal to ______ > 0 = 𝐶(𝑁, 𝐴) N-1

PW

B = ______ probability for a LCC system

Blocking

For single server systems (N = 1), the probability of delay = ρ, i.e. ______ utilization or traffic carried by the server

output

Assume that call arrivals are ______ and service time is negative exponential distribution.

poissionian

The average delay of a call is 𝜇𝑘 = ቊ ______ 𝜇, 𝑘 = 0,1, …, 𝑁.

k

The probability of delay P > t is equal to P(> 0) e^(- ______ t/T_h)

N-A

When n = ∞, the above equation reduces to ______’s Delay formula.

Erlang’s

The average waiting time for all arrivals is W_t_avg = ______ N, A h / (N-A)

C

When n = N, the above equation reduces to ______’s – B formula.

Erlang’s

The probability of ______ is given by the formula 𝑃(𝑘) = 𝜆0 𝜆1 …..𝜆𝑘−1 𝑃(0).

waiting

The average delay of only those arrivals that get delayed is T_W = h / ______ - A

N

The average service time is given by h = 1 / ______ of the negative exponential service time distribution

lambda

The probability of delay P(delay) = P(> 0) = ______ = 0.9

rho

The average waiting time W_t_avg is given by ______ N, A h / (N-A) for a message switching network

C

Test your understanding of traffic engineering concepts, including the statistical distribution of holding time and traffic intensity. Calculate probabilities and average occupancy with given formulas. Assess your knowledge of negative exponential distribution and its applications.

Make Your Own Quizzes and Flashcards

Convert your notes into interactive study material.

Get started for free
Use Quizgecko on...
Browser
Browser