CIRCUIT & PACKET SWITCHING ( SWITCHING SYSTEMS)- EEE

552

BENG ELECTRICAL & ELECTRONICS

ENGINEERING
SECOND SEMESTER 2021
CIRCUIT & PACKET SWITCHING ( SWITCHING SYSTEMS)- EEE
552

CIRCUIT SWITCHING & PACKET

SWITCHING
SECOND SEMESTER 2021
RATIONALE
Information is now traveling faster and being shared by more people and business
organizations than ever before. Public telephone networks` unlimited dialing makes it
available for public use to interconnect millions and millions of communications devices every
day.
This course describes the fundamentals of Switching Systems for analog and digital telephone
technology and how the different types of analog and digital audio signals along with their
forms differ in various parts of the world.
The course describes a broad overview of the Switching Systems for voice, data, and
multimedia applications and the fundamentals of switching technologies and their terminology.
The basics of public telephone switching systems are provided along with the structure and
operation of local exchange carrier (LEC) systems. It is therefore important that skills in
designing these Switching Systems are taught to equip the undergraduates to enhance the
country’s human resources capacity in these areas of system design.
MAIN OBJECTIVE

To understand the working

principles of switching systems from
manual and electromechanical
systems to stored program
controlled systems.
 OUTCOMES
Explain the working principles of switching systems involved in telecommunication
switching. from manual and electromechanical systems to stored program controlled
systems.
Explain the difference between Circuit switching and packet switching and also their
application in telecommunication.
Should explain all the stages involved in completion of a call.
Analyze basic telecommunication traffic theory.
Design multi stage switching structures involving time and space switching stages.
Explain the working principles of ISDN, VPN, VOIP, IP switching.
COURSE OUTLINE
Overview of switching systems:
 Electronic switching and stored program control systems, Centralized SPC, Availability,
Distributed SPC, Enhanced services,
Digital switching: time switching, space switching, time and space switches,
Switching techniques: Circuit Switching, Message and Packet Switching.
Computer controlled switching systems:
Introduction, Call processing, signal exchange diagram, state transition diagram, hardware
configuration,
switching system software organization,
Software classification and interfacing,
COURSE OUTLINE
Traffic engineering:
 Traffic pattern, Grade of Service and blocking probability,
Modeling of switching systems: Markov Process, Birth-Death Process.
Telephone network organization:
Network management, Network services, various networking plans, types of networks,
Routing plan, International numbering plan, National numbering plan, Numbering plan
in Zambia,
Signaling: in channel signaling, common channel signaling.
Overview of ISDN, VPN, VOIP, IP switching
CIRCUIT SWITCHING & PACKET

SWITCHING
SWITCHED NETWORK

Physically separate path for each

pair of communicating end
systems
Using switches we can reduce the
number of paths.
SWITCHED NETWORK

Point to Point Networks Switched Networks

SIMPLE SWITCHED NETWORK

Stations
Switch nodes (N)
Nodes can be access points
Transmission links
Nodal degree
Number of links
Max. number of links: N(N-1)/2
SIMPLE SWITCHED NETWORK
NETWORK DESIGN

Example:
Design a network with 5 nodes 10 stations average
nodal degree of 2. How many links are required? What
will be the nodal degree for a full mesh?
NETWORK DESIGN

Example:
COMMUNICATION NETWORK

a collection of nodes and links

nodes may connect to other nodes only, or to stations and
other nodes.
Network is usually partially connected (not a full mesh)
some redundant connections are desirable
Switching technologies
circuit switching
packet switching
CIRCUIT SWITCHING

uses a dedicated path between two stations

 path is reserved for the single pair of end users
has three phases
circuit establish
data transfer
circuit disconnect
CIRCUIT SWITCHING

Inefficient
channel capacity dedicated for duration of
connection
if no data, capacity wasted
inefficient use of the path if there is bursty traffic
 set up (connection) takes time – setup time , once
connected, transfer is transparent
PUBLIC CIRCUIT SWITCHED NETWORK
CIRCUIT ESTABLISHMENT

KAPIRI

KABWE

CHIBOMBO
CIRCUIT SWITCHING INEFFICIENCY

Assume set-up time is 150 msec and the data length is 1000 bytes
transmitting at 64Kbps.
Only takes 125 msec to transmit the data!
Not efficient when data occurs in bursts separated by idle periods Here,
two techniques are described.
EVENT TIMING

Assume R=2.5Gbps
N=4 (intermediate nodes)
Message length
L=1000Kbit
Control Message length L= 10 bit
Data Transmission Delay = L/R (sec)
Control Message
Transmission Delay = L/R (sec)
CIRCUIT SWITCHING ELEMENTS

NI allows connecting to

digital or analog lines
CU sets up the switch fabric
(SF)
SF is the hardware that
actually causes switching
BLOCKING & NON-BLOCKING

Blocking or Non-blocking
 non-blocking network
 permits all stations to connect at once
 used for some data connections
 blocking network
 may be unable to connect stations because all paths are in use
 used on voice systems
non-blocking is cheaper, not everyone can make a call at the same time
SWITCH FABRIC USING CROSS-POINTS

This is a non-blocking Switch

SWITCHING TECHNOLOGIES

 Space Division Switching

Time Division Switching
SPACE DIVISION SWITCH - NON-BLOCKING

N x N cross-points
For 10^6 users, a crossbar would require 10^12 cross-points (N^2)
SPACE DIVISION SWITCH - NON-BLOCKING
MULTIPLE STAGE SPACE SWITCH
BLOCKED CALLS ARE POSSIBLE
3 STAGE SPACE DIVISION SWITCH
CLOS NETWORK

if k = 2n-1 or greater non-blocking switch

If k < 2n-1, blocking can occur
….. the higher k value the more cross-points are required
for the crossbar switch! (for each additional k we add n
more Cross-points!)
Example: suppose that 1000 users using 10 input per input
module. How many second stages are required in order to
have a non-blocking switch?
SOLUTION TO EXAMPLE

N=1000, n=10; The second stage will have k

There are N/n = 1000/10= 100 switches of size 100 x 100.
switches at the first and third If k = 2n-1=19, then the resulting
stages. switch will be non-blocking.
 At the first stage, there are 10 x k If k < 19, then blocking can occur.
and at the third stage
There are k switches in the
second stage
SOLUTION TO EXAMPLE

In the case of a full 1000 x 1000 So the first and third stages use
crossbar switch, no blocking occurs but
2x190x100=38,000 cross-points altogether
1,000,000 (a million) cross-points are
required. The second stage consists of k=19
crossbars each of size 100 x 100 because
 For n=10 and k=19, each switch at the N/n=1000/10 = 100.
first stage is a 10 x 19 crossbar which
requires 190 Cross-points and there are So the second stage uses 190,000 cross-
100 such switches. points.

Same for the third stage. Altogether, the Clos construction uses
228,000 cross-points
POWER CONSUMPTION IN MODULAR DESIGN
POWER CONSUMPTION IN MODULAR DESIGN-POWER EFFICIENT
ARCHITECTURE
POWER EFFICIENT ARCHITECTURE
TIME DIVISION SWITCHING

Modern digital systems use intelligent

control of space & time division elements
use digital time division techniques
 set up and maintain virtual circuits
 partition low speed bit stream into pieces
that share higher speed stream
 individual pieces manipulated by control
logic to flow from input to output
TIME DIVISION SWITCHING
BREAK!!!
PACKET SWITCHING
PACKET SWITCHING-ADVANTAGES

line efficiency
• single link shared by many packets over time
• packets queued and transmitted as fast as possible
data rate conversion
• stations connect to local nodes at their own speed
• nodes buffer data if required to equalize rates
packets accepted even when network is busy
 priorities can be used
DATA RATE CONVERSION
SWITCHING TECHNIQUES

The station breaks long message into packets

Packets are sent one at a time to the network
Packets can be handled in two ways
 datagram
 virtual circuit
DATAGRAM DIAGRAMS

No pre-planned route > fast (no circuit)

Each packet can pass through a separate path
Reassembly is required
 Packets may experience jitter (delay variation)
 Network can provide error control
More flexible (more primitive)
More reliable (if a node fails circuit fails)
PACKET SWITCHING :DATAGRAM APPROACH
VIRTUAL CIRCUIT DIAGRAM

 call setup phase is required

Fixed route (circuit switching)
Each packet has VC ID
No routing decisions at the intermediate nodes -
> fast delivery
PACKET SWITCHING: VIRTUAL APPROACH
EVENT TIME (WITH ACK)
EVENT TIMING
EVENT TIMING
EXAMPLE
EXAMPLE
CIRCUIT VS. PACKET SWITCHING

performance depends on various delays

 propagation delay
transmission time
node delay
transparency
 amount of overhead
X. 25
ITU-T standard for interface between host and packet
switched network
almost universal on packet switched networks and
packet switching in ISDN
defines three layers
Physical
Link
Packet
X. 25 PHYSICAL
interface between station node link
two ends are distinct
 Data Terminal Equipment DTE (user equipment)
 Data Circuit-terminating Equipment DCE(node)
physical layer specification is X.21 can substitute alternative
such as EIA-232.
X. 25 LINK

 Link Access Protocol Balanced (LAPB)

Subset of HDLC (described later)
Provides reliable transfer of data over link
 Sends a sequence of frames
X. 25- PACKET

provides a logical connections (virtual

circuit) between subscribers
all data in this connection form a single
stream between the end stations
established on demand
termed external virtual circuits
X. 25- USE VIRTUAL CIRCUITS
USER DATA & X. 25 PROTOCOL CONTROL INFORMATION- PACKET
ISSUES WITH X. 25

key features include:

call control packets, in-band signaling
multiplexing of virtual circuits at layer 3
layers 2 and 3 include flow and error control, hence, have
considerable overhead
no hop by hop error or flow control (rather than end-to-end) –
hop-by-hop ACK
not appropriate for modern fast digital systems requiring high
reliability
FRAME RELAY

designed to eliminate most X.25 overhead has large installed base

key differences:
call control carried in separate logical connection
multiplexing and switching at layer 2
no hop by hop error or flow control
Hence, end to end flow and error control (if used) are done by higher layer
a single user data frame is sent from source to destination and higher layer
ACK sent back
ADVANTAGES AND DISADVANTAGES
lost link by link error and flow control
increased reliability means less losses
streamlined communications process
lower delay
higher throughput
 frame relay can be used for access speeds up to
and over 2Mbps
PROTOCOL ARCHITECTURE
LAPF FUNCTIONALITY
LAPF (Link Access Procedure for Frame Mode Bearer Services) defined in Q.922
only core functionality used:
frame delimiting, alignment and transparency
frame mux and demux using addressing field
ensure frame is integral number of octets
ensure frame is neither too long nor short
detection of transmission errors
congestion control functions
form sub-layer of data link layer
data transfer between subscribers only
FRAME RELAY DATA LINK CONNECTIONS

logical connection between subscribers

data transferred over them not protected by
flow or error control
uses separate connection for call control
overall results in significantly less work in
network
User Data Transfer
 only have one frame type which carries user data
no control frames means
no in-band signaling
no sequence numbers
flag and FCS function as in HDLC
address field carries DLCI
DLCI (Data Link Connection Identifier) has local
significance only
SUMMARY

•circuit verses packet switching

•network approaches
• X.25
•frame relay
THE END