ECE 539 Lecture 2- Comm Network
ECE 539 Lecture 2- Comm Network
ECE 539
Lecture # 2
' Public Switched Telecommunications
Network (PSTN) Connectivity
* E BOOK : Text:
¢ Michael G. Solomon, David Kim“Fundamentals of Communications and
Networking”, 3rd Edition,2021.
« R. Srikant, Lei Ying,“Communication Networks , An Optimization, Control,
and Stochastic Networks Perspective ”, , 1%t Edition, 2013.
Remember
Telecommunication is communication at a distance by technological means,
particularly through electrical signals or electromagnetic waves.
Seven Layer ISO/0SI Communications model
Transmit
Data
Battery é
i
Subsc:ber loog
I Subscriber
feed bridge | ’ P subset
\
,e D >
234 447
Exchange Exchange
m/ Called subscriber
Exchange Exchange
Direct route
b " . S
Time
Residential subscribers
————— Business subscribers
10
One-Way and Two-Way Circuits
—Z| Sxenanoe | one-way operation
Ca)
-
= el |
- -] Esxchange two-way operation
-~ | +| B
[ -]
fee- |
oy
A hybrid scheme,
oy v
Excharae | a combination of one-way
and two-way operation
e
one-way trunk operation(Figure a).
The upper trunk group is assigned for the direction from A to B; the lower trunk
group is assigned for the opposite direction, from exchange B to exchange A.
Figure c illustrates a typical hybrid arrangement. The upper trunk group carries
traffic from exchange A to exchange B exclusively. The lowest trunk group carries
traffic in the opposite direction. The small, middle trunk group contains two-way
circuits(double seizure). 1"
Network Topologies
The IEEE defines topology as “the interconnection pattern of
nodes on a network.” A telecommunications network consists of a
group of interconnected nodes or switching centers.
SNS
Ring
e
Fully Connected
—— Line
-l
Different Network topologies
12
Network 1opologies
Mesh topology
If every switch in a network is connected to all other switches (or
nodes) in the network, then it is called as “pattern” of a full-mesh
network. The figure has 6 nodes. A full-mesh network is very
survivable because of a plethora of possible alternative routes.
Line Topology
This rare topology works by connecting every host to the host
located to the right of it. It is very expensive (due to its cabling
requirements) and due to the fact that it is much more practical to
connect the hosts on either end to form a ring topology, which is
much cheaper and more efficient.
Ring Topology
in which each node connects to exactly two other nodes, forming a single continuous pathway for
signals through each node.
Rings can be unidirectional, with all traffic travelling either clockwise or anticlockwise around the
ring, or bidirectional. unidirectional ring networks may be disrupted by the failure of a single link.
A node failure or cable break might isolate every node attached to the ring. In response, some ring
networks add a "counter-rotating ring" (C-Ring) to form a redundant topology: in the event of a
break, data are wrapped back onto the complementary ring before reaching the end of the cable,
maintaining a path to every node along the resulting C-Ring. 13
Network Topologies
Star network
It is probably the least survivable. However, it is one of the most economic nodal
patterns both to install and to administer. every host is connected to a central hub. In its
simplest form, one central hub acts as a conduit to transmit messages.
Tree Topology
The root node then communicates with a number of smaller nodes, and those in turn
communicate with an even greater number of smaller nodes. A host that is a branch
off from the main tree is called a leaf. If a leaf fails, its connection is isolated and the
rest of the LAN can continue forwards.
14
Network Topologies
18
Common Definitions
~Load: Traffic intensity across the entire
system.
~ Request Rate (4): Average number of call
requests per unit time
~ Traffic intensity for each user
A, = AH
~ Total offered traffic intensity for U users
A=UA,
~For C channels, traffic intensity per channel
UA,
A, =
C
19
Grade of Services
Types of Trunked System
Blocked Calls Cleared Blocked Calls Delayed
- No queuing of call request » Queue is provided to hold
- When no channel is available, the call
the requesting user is blocked . \When no channel is
and is free to try again available, the requesting
~Erlang B is used for yser is blocked but it is
calculating the GoS waiting for a specific time
- GoS = Pr{blocking} in a queue
20
Trunked Channels )
3 L1} (k3 20 34 40
26
~3System B: C = 57 channels
From Erlang-B table, A= 46.82
U=A/A, =468 users
Total # subscribers = Uy = 98* 468 =45864
~System C: C = 100 channels
From Erlang-B table, A= 87.97
U=A/A,, =879 users
Total # subscribers = U- = 49* 879 =43071
27
~Assume that all three trunked systems are
operated at maximum capacity, Compute
% market penetration of each provider.
System A: Ja_x100
——
2000000
System B: —=£__
2000000
*100
System C: —Z£ _ *100
2000000
30