Академический Документы
Профессиональный Документы
Культура Документы
Switching Systems
Circuit switching
Jorma Kekalainen
76
Circuit-switched Networks
A circuit-switched network consists of a set of
switches connected by physical links.
A connection between two stations is a dedicated
path made of one or more links.
Each connection uses only one dedicated channel on
each link.
Each link is normally divided into n channels by using
FDM or TDM.
The end systems, such as computers or telephones,
are directly connected to a switch.
77
Page 1
Lecture notes
Circuit-switching
Before starting communication, the stations must make a
reservation for the resources
channels,
switch buffers,
switch processing time, and
switch input/output ports
Note
79
Page 2
Lecture notes
Three Phases
The actual communication in a circuit-switched network requires
three phases: connection setup, data transfer, and connection
teardown.
Setup Phase
Before the two parties (or multiple parties in a conference
call) can communicate, a dedicated circuit (combination of
channels in links) needs to be established.
The end systems are connected through dedicated lines to
the switches, so connection setup means creating dedicated
channels between the switches.
Data Transfer Phase
After the establishment of the dedicated circuit (channels),
the two parties can transfer data.
Teardown Phase
When one of the parties needs to disconnect, a signal is sent
to each switch to release the resources.
80
81
Page 3
Lecture notes
82
Note
In circuit switching, the resources need to
be reserved during the setup phase;
the resources remain dedicated for the
entire duration of data transfer until the
teardown phase.
83
Page 4
Lecture notes
84
85
Page 5
Lecture notes
Efficiency
Circuit-switched networks are not efficient because
resources are allocated during the entire duration of
the connection.
These resources are unavailable to other connections.
In a telephone network, people normally terminate
the communication when they have finished their
conversation.
However, in computer networks, a computer can be
connected to another computer even if there is no
activity for a long time.
In this case, allowing resources to be dedicated
means that other connections are deprived.
86
Delay
Although a circuit-switched network normally has low
efficiency, the delay in this type of network is
minimal.
During data transfer the data are not delayed at each
switch; the resources are allocated for the duration
of the connection.
There is no waiting time at each switch.
The total delay is due to the time needed to create
the connection, transfer data, and disconnect the
circuit.
87
Page 6
Lecture notes
Setup delay
The delay caused by the
setup is the sum of four
parts:
the propagation time of
the source computer
request (slope of the
first green bar),
the request signal
transfer time (height of
the first green bar),
the propagation time of
the acknowledgment from
the destination computer
(slope of the second
green bar), and
the signal transfer time
of the acknowledgment
(height of the second
green bar).
88
89
Page 7
Lecture notes
Note
90
Switching Systems
Routing and signaling in
circuit switched networks
91
Page 8
Lecture notes
92
Exchanges
Telco switching centers
Also known as end office
Trunks
Connections between
exchanges
Carry multiple voice
circuits using FDM or
synchronous TDM
93
Page 9
Lecture notes
94
PSTN connectivity
95
Page 10
Lecture notes
96
Routing
Routing in the network tries to determine the path from
a given source to a given destination
Often connections will need paths through more than one
switch
Static routing uses the same approach all the time
Dynamic routing allows for changes in routing depending
on traffic
Newer circuit-switched networks are dynamically routed
making routing more complex - almost like packet
switching
97
Page 11
Lecture notes
98
Alternate routing
Possible routes between two end offices are
predefined
Originating switch selects the best route for
each call
Routes listed in preference order
Different sets of routes may be used at
different times
Routing paths can be fixed (1 route) or
dynamic (multiple routes, choice based on
current and historical traffic)
99
Page 12
Lecture notes
Alternate routing
100
Adaptive routing
Traffic reporting and analysis with new paths
computed periodically, adapts to load, events
Need to use algorithms to determine paths
dynamically, based on load/congestion vectors
101
Page 13
Lecture notes
Signaling
In a telecommunication network signaling has
the following meaning: the information
exchange concerning the establishment and
control of a connection and the management
of the network.
So signaling means the use of signals for
controlling communications.
Signaling systems can be classified according
to their principal properties e.g.
In-Channel
Common-Channel
102
In channel signaling
Use same channel for signaling control and call
Requires no additional transmission facilities
Inband
Control signals have same electromagnetic properties
(frequency) as voice signal
Can go anywhere a voice signal can
Impossible to set up a call on a faulty speech path
Out of band
Page 14
Lecture notes
Exchange
Exchange
104
Page 15
Lecture notes
Subscriber signaling
PSTN
Switching in
exchanges
Subscriber signaling
(analog or ISDN=DSS1)
Transmission
(PDH, SDH)
Networkinternal
signaling
(SS7)
Databases in
the network
(HLR)
DSS1 - Digital Subscriber Signaling 1 is Access Signaling protocol used between the subscriber
terminal and the ISDN network. HLR - The Home Location Register is a database found within
106
cellular networks. It stores subscriber data relating to services and features in addition to location
area based information
Page 16
Lecture notes
1336 Hz
1477 Hz
1633 Hz
697 Hz
770 Hz
852 Hz
941 Hz
108
Page 17
Lecture notes
LE A
Off-hook
Dial tone
LE B
SS7
signalling
(ISUP)
User B
LE = local exchange
B number
Ringing
signal
Ringback
tone (or
busy tone)
Off-hook
(user B
answers)
Connection established
The ISDN User Part or ISUP is part of the Signaling System #7 which is
used to set up telephone calls in Public Switched Telephone Networks.
111
Page 18
Lecture notes
From LE A to LE B
From LE B to LE A
Call release:
REL (Release message)
RLC (Release complete message)
Direction depends
on releasing party
(user A or user B)
113
Page 19
Lecture notes
LE A
Transit exchange
Setup
LE B
User B
IAM
IAM
DSS1
signaling
assumed
Setup
Number analysis
Alert
ACM
ACM
Alert
Connect
ANM
ANM
Connect
Charging of call starts now
114
LE A
TE
LE B
User B
Dial tone
B number
Local exchange:
analyzes B number
115
Page 20
Lecture notes
LE A
TE
LE B
User B
116
LE A
Ringback
tone
TE
Address complete
message (ACM)
LE B
User B
Ringing signal
or
117
Page 21
Lecture notes
LE A
TE
LE B
User B
User B answers
Charging
starts now
LE A
TE
LE B
User B
119
Page 22
Lecture notes
LE A
Off-hook
B number
Setup
LE B
SS7
signalling
(ISUP)
DSS1 signaling
messages
Setup
Call proc
Tones
generated
in terminal
User B
Alert
Ringing
Conn
Off-hook
(user B
answers)
Alert
Conn
Connection established
The ISDN User Part or ISUP is part of the Signaling System #7 which is
used to set up telephone calls in Public Switched Telephone Networks.
120
Idea originated
in the 1970s
ISDN
terminal
interaction is
possible
PSTN
terminal
121
Page 23
Lecture notes
Basic
Rate
Access
ISDN
Primary
Rate
Access
ISDN
=>
122
Subscriber signaling
(analog or ISDN=DSS1)
Transmission
(PDH, SDH)
Networkinternal
signaling
(SS7)
Databases in
the network
(HLR)
123
Page 24
Lecture notes
CCIS
SS7
124
Exchange
Database
Page 25
Lecture notes
SP
STP
Signaling Point (signaling
termination in an exchange)
SP
Exchange
126
Signaling example
A typical scenario:
User A calls mobile user B. The call is routed to a specific
gateway exchange (GMSC) that must contact a database
(HLR) to find out under which exchange (MSC) the mobile
user is located. The call is then routed to this exchange.
Exch
User A
(calling
user)
Exch
Exch
User B
(called
user)
Database
The gateway MSC (G-MSC) is the MSC that determines which visited MSC the 127
subscriber who is being called is currently located. It also interfaces with the PSTN.
Page 26
Lecture notes
Switching systems
Packet switching
128
Use of packets
129
Page 27
Lecture notes
Advantages
Line efficiency
Single node to node link can be shared by many packets over
time
Packets queued and transmitted as fast as possible
130
Packet switching
Bandwidth guaranteed
Circuit capacity not
reduced by other
network traffic
Circuit costs
independent of amount
of data transmitted,
resulting in wasted
bandwidth
Bandwidth dynamically
allocated on as-needed
basis
May have concurrent
transmissions over
physical channel
May have delays and
congestion
More cost-effective
131
Page 28
Lecture notes
Network-layer
transport segment from
sending to receiving host
on sending side network
layer encapsulates
segments into datagrams
(=network-layer packets),
on receiving side, delivers
segments to transport
layer
network layer protocols in
every host and router
router examines header
fields in all IP datagrams
passing through it
application
transport
network
data link
physical
network
data link
physical
network
data link
physical
network
data link
physical
network
data link
physical
network
data link
physical
network
network
data link
data link
physical
physical
network
data link
physical
network
data link
physical
network
data link
physical
network
data link
physical
application
transport
network
data link
physical
132
133
Page 29
Lecture notes
Forwarding table
Every router has a forwarding table.
A router forwards a packet by examining the value of a field in
the arriving packets header, and then using this value to index
into the routers forwarding table.
The result from the forwarding table indicates to which of the
routers outgoing link interfaces the packet is to be forwarded.
Depending on the network-layer protocol, this value in the
packets header could be the destination address of the packet or
an indication of the connection to which the packet belongs.
The routing algorithm determines the values that are inserted
into the routers forwarding tables.
The routing algorithm may be centralized
an algorithm is executed on a central site and downloaded routing
information to each of the routers
or decentralized
a piece of the distributed routing algorithm is running in each router
135
Page 30
Lecture notes
Forwarding
136
Forwarding
137
Page 31
Lecture notes
Forwarding
138
Forwarding
139
Page 32
Lecture notes
Forwarding
140
routing algorithm
0100
0101
0111
1001
3
2
2
1
value in arriving
packets header
0111
1
3 2
141
Page 33
Lecture notes
Page 34
Lecture notes
Page 35
Lecture notes
Service
Model
Guarantees ?
Congestion
Bandwidth Loss Order Timing feedback
ATM
CBR
ATM
VBR
ATM
ABR
ATM
UBR
constant
rate
guaranteed
rate
guaranteed
minimum
none
no
no
no
yes
yes
yes
yes
yes
yes
no
yes
no
no (inferred
via loss)
no
congestion
no
congestion
yes
no
yes
no
no
Variable Bit Rate (VBR) service category is used for connections that transport traffic at
variable rates traffic that relies on accurate timing between the traffic source and
destination
146 of
Unspecified Bit Rate (UBR) service generally is used for applications that are very tolerant
delay and cell loss
Page 36
Lecture notes
Page 37
Lecture notes
151
Page 38
Lecture notes
Page 39