Scribd
Upload
55 views5 pages

Circuit Switching Model: Analog Telephone Network

The document summarizes the circuit switching model used in telephone networks. It discusses: - Circuit switching reserves bandwidth end-to-end for each call and does not allow other calls to use the reserved circuit. - Calls have three phases: setup to request bandwidth, holding with no delay except propagation, and termination to release bandwidth. - Switches can be either analog spatial switches or digital temporal switches that use time-division multiplexing. - Telephone traffic can be modeled as an M/M/N/N queue, where N is the switch size, to analyze blocking probability and dimension switches.

Uploaded by

Esteban Zapata
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
55 views5 pages

Circuit Switching Model: Analog Telephone Network

The document summarizes the circuit switching model used in telephone networks. It discusses: - Circuit switching reserves bandwidth end-to-end for each call and does not allow other calls to use the reserved circuit. - Calls have three phases: setup to request bandwidth, holding with no delay except propagation, and termination to release bandwidth. - Switches can be either analog spatial switches or digital temporal switches that use time-division multiplexing. - Telephone traffic can be modeled as an M/M/N/N queue, where N is the switch size, to analyze blocking probability and dimension switches.

Uploaded by

Esteban Zapata
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

CIRCUIT SWITCHING MODEL

The PSTN (Public Switching Telephone Network) is a circuit switching network, which
is characterized by the following features:
End-to-end circuit (bandwidth) is reserved for each call
Circuit switching is based on reserved bandwidth
Other calls cannot use circuit
Calls consist of three phases:
- Set-up phase: signaling messages request and reserve bandwidth
access signaling: dual tone multifrequency (DTMF)
interoffice signaling: common channel signaling (SS7)
- Call is held: no delay except propagation; no processing in network
- Call termination (release) phase: signaling releases bandwidth
Two types of switches:
- Analog telephone network uses spatial switches
- Current digital telephone network uses temporal switches
Call blocking protects network from overload but telephone network can
become overloaded by congestion
- problem: call requests propagate through switches, tying up links
if unsuccessful, intermediate links will be cleared eventually but
wasted in meantime
increases probability that other calls will be blocked
those unsuccessful calls result in more waste
failed calls will be retried, increasing the offered load
congestion tends to increase itself: carried traffic is reduced while
offered load increases
- some control mechanisms
selective alternate routing and dynamic routing to less congested
network areas
call requests likely to fail are blocked early at first switch
code blocking: calls to congested area are blocked
Analog Telephone Network
In the old analog telephone network, a circuit is physical path for electrical analog 4kHz signal.
analog space-division switching
Initially, only one switch was used
NxN matrix (ie, N2 crosspoints)

In 1953, Charles Clos formalized a type of multistage switching networks (Clos


networks):
- multistage interconnection network (usually 3 stages) of crossbar
modules
- each call entering an ingress crossbar switch can be routed through any
of the available middle stage crossbar switches, to the relevant egress
crossbar switch

If k n, the Clos network is rearrangeably nonblocking, meaning that an


unused input on an ingress switch can always be connected to an unused
output on an egress switch, but for this to take place, existing calls may
have to be rearranged by assigning them to different centre stage
switches in the Clos network.
If k 2n - 1, the Clos network is strict-sense nonblocking, meaning that
an unused input on an ingress switch can always be connected to an
unused output on an egress switch, without having to re-arrange existing
calls.
N

kN 2 2
n

Number of crosspoints:

Digital Telephone Network


In current telephone networks, the voice signal is digitized and transmitted using timedivision multiplexing:
Digital switches transfer periodic time slots on input port x to output port y
Reserved bandwidth is time slot instead of physical circuit
Basic building block is time slot interchange (TSI)
modern digital switches are built from stages of time (T) and space (S) switches
eg, AT&T No. 5 ESS is example of TST
Telephone Traffic
Assumptions:

NxN telephone switch can be modeled as N independent servers

Sources are identical and independent of each other and state of system
Requests arrive in a single combined stream
In small time interval , probability of arriving request is proportional to
- Pr(arrival of request in ) =
- Pr(no request in ) = 1 -
- as becomes very small, arrival stream is Poisson()
Holding times (service times) are exponential()
Traffic intensity (offered load) = (average arrival rate) * (average holding time)
- Erlang is the basic unit of telephone traffic
- 1 erl = 1 call/hour held for 1 hour each
- Question: How many erlangs can a circuit carry?
- offered traffic = x average holding time;
- carried traffic = offered traffic - lost traffic
Blocking happens when no path is available upon arrival, ie, server is free

Question: Which queueing model can be used to analyze telephone traffic?


M/M/N/N, where N is the dimension of the switch.
Remember M/M/N/N results:
Traffic intensity:

k
Steady state probability:

k k!
i
N
i0 i!

N N!
i
N
i 0 i!
Blocking probability:
Average number of users: N (1 B )
B N

Usually, the problem faced by a teletraffic engineer is to dimension the switch (find N),
that satisfies a specified blocking probability.
This task can be accomplished in different manners: Tables, graphics, recursive.
Recursive formula:
aE s 1 (a )
E s (a )
,
E 0 (a ) 1
s aE s 1 (a )
The traffic load carried by a trunk is called the trunk efficiency or occupancy, and its
given by:

a (1 B )
s

In telephone practice, the traffic statistics for the busiest hour, averaged over a year, are
used for design, and overloaded conditions are taken into consideration.
Example: Design of a trunk group between two PBXs with B0.01.
In general, a telephone is either a calling party or a called party. The calling rate is
defined by the traffic load per telephoned used as a calling party. In the example, a
telephone is used once an hour for 6 minutes.
Traffic load is: = 6/60 = 0.1erl
Assuming 50% of the traffic corresponds to call origination, the calling rate becomes
0.05 erl.
Well consider two designs:
a. One-way trunk group:

b. Two-way trunk group:

Case a:
Traffic load from A to B: aA=0.05*1000/2= 25 erl
N
B

0
1,00
0

1
0,96
2

N
B

17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
0,376 0,343 0,311 0,280 0,250 0,221 0,194 0,168 0,144 0,121 0,101 0,083 0,067 0,053 0,041 0,031
N
B

2
0,92
3

3
0,88
5

4
0,84
7

5
0,80
9

33
0,023

6
0,77
1

7
0,73
4

8
0,69
6

9
0,65
9

10
0,62
2

34
0,016

11
0,58
6

35
0,012

12
0,55
0

13
0,51
4

14
0,47
9

15
0,44
4

36
0,008

Hence, the required number of trunks is NA=36. In a similar manner, from B to A, the
traffic load is aB=25 erl, and the number of trunks is NB=36. Thus, the total number of
trunks required is NA+NB= 72. In this case, the trunk efficiency is:

25 * (1 0.008)
68.9%
36

Case b:
Total traffic load is: aA+aB =0.05*1000= 50 erl
In this case: E63(50)=0.01089

16
0,409

E64(50)=0.08439
And hence, the required number of trunks is 64. The trunk efficiency is:
50 * (1 0.0084)

77.5%
64

You might also like