Telecom Principles GOS
Telecom Principles GOS
Traffic Theory
Depends on the type of traffic in the network Circuit switched network with homogenous traffic with heterogeneous traffic Packet switched network with homogenous traffic with heterogeneous traffic Homogeneous type: Describe the classical telecommunication services based on voice transmission and switching Heterogeneous type: Includes integrated traffic streams from different sources (voice, audio, video, data) into a single network
2
Traffic Theory
Covers specific types of random processes in telecommunications Average connection duration Average number of users Busy time Service time Call arrival
3
Traffic Engineering
Required in telecommunications network planning to ensure that network costs are minimized without compromising the quality of service (QoS) delivered to the user of the network. It is based on probability theory and can be used to analyze mobile radio networks as well as other telecommunications networks. Mobile radio networks have traffic issues that do not arise in the fixed line PSTN. A mobile handset, moving in a cell, receives a signal with varying strength. This signal strength is subject to: slow fading, fast fading interference from other signals, thus resulting in degradation of the carrier-to- interference (C/I) ratio. A high C/I ratio results in quality communication. A good C/I ratio is achieved by using optimum power levels through the power control of most links. When carrier power is too high, excessive interference is created, degrading the C/I ratio for other traffic and reducing the traffic capacity of the radio subsystem. 4 When carrier power is too low, C/I is too low and QoS targets are not met.
Traffic Engineering
Traffic engineering balances the following factors based on given amount of traffic Grade of Service (GOS) Resources (e.g. trunk channels) Two types of systems implemented to provide voice communications Blocking Voice or data is blocked (by a busy signal) if network resource (e.g trunk channel) is not available. GOS = Blocking probability Delay System Voice or data is queued until network resource is available GOS = Queuing Probability and average time in queue
5
Erlangs - Example
For example, if a group of user made 30 calls in one hour, and each call had an average call duration of 5 minutes, then the number of Erlangs this represents is worked out as follows:
Minutes of traffic in the hour = number of calls x duration Minutes of traffic in the hour = 30 x 5 Minutes of traffic in the hour = 150 Hours of traffic in the hour = 150 / 60 Hours of traffic in the hour = 2.5 Traffic figure = 2.5 Erlangs
8
Traffic Capacity
Quality of services provides by different service providers Traffic congestion and blocking Probability of waiting before a call is connected Dominant coverage area C/I Dropped call rate Handover failure rate, Overall call success rate ... All these can be explained by the Quality of Service (QOS)
9
GOS
Are mechanisms for controlling the performance, reliability and usability of a telecommunications service. Is a measure of the call blocking in voice traffic, where resources allocation is deterministic (allocation and switching of channels) or The ability to make call during the busiest time Is typically given as the likelihood that a call is blocked or the likelihood of a call experiencing a delay greater than a certain queuing time. Is determined by the available number of channels and used to estimate the total number of users that a network can support. For example, if GOS = 0.05, one call in 20 will be blocked during the busiest hour because of insufficient
11
Cellular GOS
In general, GOS is measured by: looking at traffic carried, traffic offered calculating the traffic blocked and lost. The proportion of lost calls is the measure of GOS.
Traffic Intensity
Is a measure of the average occupancy of a resource during a specified period of time, normally a busy hour. The traffic intensity offered by each user is:
A = H Erlangs
where H is the average holding time of a call is the average number of call requested/hour If there are U users and an unspecified number of channels. The total offered traffic intensity is:
AT = UA Erlangs
Busy hours traffic: Calls/busy hours *Mean call hold time
13
VT = A * T
Erlangs-Hours
14
Offered Traffic
The offered traffic: Volume of traffic offered to a switch that are all processed is defined as: Offered traffic = carried traffic + overflow The carried traffic: The actual traffic carried by a switch. Overflow (blocked) traffic: Portion of the traffic not processed. Busy Hour Call Attempts (BHCA) Used to evaluate and plan capacity for telephone networks Is the number of telephone calls made at the peak hour The higher the BHCA, the higher the stress on the network processors. Not to be confused with Busy Hour Call Completion (BHCC), which truly measures the throughput capacity of the network.
15
Example I
A call established at 1am between a mobile and MSC. Assuming a continuous connection and data transfer rate at 30 kbit/s, determine the traffic intensity if the call is terminated at 1.50am. Solution: Traffic intensity = (1 call)*(50 mins)*(1 hour/60 min) = 0.833 Er Note, traffic intensity has nothing to do with the data rate, only the holding time is taken into account. Note: If the traffic intensity > 1 Erlang: The incoming call rate exceeds the outgoing calls, thus resulting in queuing delay which will grow without bound (if the traffic intensity stays the same). If the traffic intensity is < 1 Erlang, then the network can handle more average traffic.
16
Example II
Consider a PSTN which receives 240 calls/hr. Each call lasts an average of 5 minutes. What is the outgoing traffic intensity to the public network. Solution: A = *H = 240 calls/hr and H = 5 minutes A = (240 calls /hr) x (5 min/call) = 1200 min/hr Erlang cannot have any unit so A= 1200 min/hr * (1 hour/60 minutes) = 20 Erlangs So 20 hours of circuit talk time is required for every hour of elapsed time. An average of T1 voice circuits busy at any time is 20. (Or 20 hours of continuous use of 20 channels.)
17
18
system. This assumption is valid for systems that can overflow blocked calls onto another trunk (e.g a high usage trunk)
Traffic originated from an infinite numbers of sources Limited No. of trunk (or serving channels) Memory-less, channel requests at any time The probability of a user occupying a channel is based on exponential distribution Calls arrival rate at the network = Poisson process (the holding time or duration of the call has exponentially distribution)
20
Probability of Blocking PB
Equations for PB, depend on assumption that we make about what happens to calls that are blocked. Lost Calls Cleared Assume that blocked calls are cleared (lost from the system. This assumption is valid for systems that can overflow blocked calls onto another trunk (e.g a high usage trunk) Offered Traffic A = Carried Traffic AC /(1 - PB) Lost Calls Returning Assume that blocked calls are re-tried until they are successfully carried. This assumption is valid for PBXs and corporate tie lines. Offered Traffic A > or = Carried Traffic AC
21
Probability of Blocking PB
Lost Calls Cleared Also known as the Erlang-B formula given by:
Where
A is the traffic intensity C is the number of channels Expressed recursively in a form that is used to calculate tables of The Erlang B formula as
22
Probability of Blocking PB
The carried traffic is
* The start-up systems usually begins with a GOS of 0.02 2% of the blocking probability) rising up to 0.5 as the system grows. * If more subscribers are allowed in the system the blocking probability may reach unacceptable values.
23
Erlang B Table
24
Erlang B Chart
25
Example III
A single GSM service provider support 10 digital speech channels. Assume the probability of blocking is 1.0%. From the Erlang B chart find the traffic intensity. How many 3 minutes of calls does this represent? Solution: From the Erlang B Chart the traffic intensity = ~5 Erlangs Al = H = Al /H = 5/(3 mins/60) = 100 calls
26
Example IV
A telephone switching board at the UNN can handle 120 phones. Assuming the followings, determine the outgoing traffic intensity and the number of channels. - On average 5 calls/hour per phone, - Average call duration time = 4 minutes, - 60% of all calls made are external. - QoS = 0.9% Solution: AT = U..H *U = (120 call*5 calls/hour)*60% =360 call/hour H = 4 mins/call Therefore Al =360 * 4 * (1 hour/60 mins) = 24 Erlangs. Thus 24 hours of circuit talk time is required for every hour of elapsed time -No. of channels C from Erlang B chart = ~ 34
27
Example V
Consider a telephone switched board with 120 phones. Assuming the number of call is 3/hour/line, the average call duration is 4 minutes, and 55 % of all call are made external via a T-1 trunk (24 channels) to the PSTN. Determine carried traffic and channel usage. Solution: Offered traffic A = x H = (150 phones x 3 calls/hr x 58% ) x (4 mins./call) x (1 hour/60 mins.) = 17.4 Erlangs Blocking Probability PB , C = 24 and A = 17.4, therefore from the Erlang B Chart or formula PB = 0.03 Carried Traffic, Aca = A (1- PB )= 17.4 (1-.03)=16.9 Erlangs Channel usage = Aca / C = 16.9/24 = 0.7 or 70% Note: 16.9 Erlangs of traffic attempts to go across the T1 trunk and 0.5 Erlang is blocked.
28
Erlang C Formula
For systems that put the call on queue line if there is no available channels
29
Erlang C Chart
30