Routing in Telephone Network

Advanced Data communication and
Networking
Routing in Telephone
Network
By: Amanuel
Tadele
Routing in Telephone Network

Outline:
Whats routing?
Classification of routing
Routing in telephone Networks
Hierarchical Routing
Dynamic Non-Hierarchical Routing (DNHR)
Trunk Status Map Routing (TSMR)
Whats routing?
is the process of selecting best paths in a
network.
Or interconnecting devices(PCs,
telephones.) using best possible path
available
Routing is performed for many kinds of
networks, including the telephone network
(circuit switching), electronic data networks
(such as the Internet), and transportation
networks
Routing is a critical function in the global
switched telephone network.
Classification of Routing
Routing
Telephone
Hierarchical
DNHR
Packet
Static
Dynamic
TSMR
RTNR
Dynamic
More

Routing in Mechanical Switching Era
Town B
Town A
Town C

After
introduction of automatic switching the need

for any form of routing did not arise until the 1930s
essentially point-to-point direct links (trunk groups)
were set up to connect calls between different
places; there was no routing involved
The need for routing arose for two primary reasons
1. point-to-point links lead to the problem, i.e., if there are
N nodes in a network, we need N(N 1)/2 directly
connected links
2. it was recognized that some trunk groups were less
utilized compared to others; thus, if there were any way
to take advantage of this by routing calls through less
utilized trunk groups, capacity expansion could be
avoided.

Parameters to consider when thinking about routing
during 1930s
1. During these days switches did not have ability to
compute and store routing tables thus routing was to be
performed in an age when neither information storage
nor information exchange was possible
2. looping must be avoided at all times
3. the call setup was accomplished through progressive call
control (PCC) by forwarding setup signaling from one
switch to the next; this is to be done in an informationless settingthat is, nodes did not have any ability to
exchange any status information. Thus, a call control
cannot get back to a switch from where it started; there
was no way to look backward.

Consider this example
C
loop
How to Avoid this Loop?

Differentiate Exchanges by setting them to different
Hierarchy
Exchanges are put at different Hierarchy
the trunkgroups in hierarchical routing networks are
classified into two groups: high-usage (HU)
trunkgroups and final trunkgroups
HU groups since they are not necessary but are
installed because of the high volume of traffic
between those end nodes connecting such
trunkgroups.
A final trunkgroup means that there is no other
trunkgroup to overflow to if a call does not find a
circuit on a final trunkgroup
Rules of Hierarchical routing are
1. A switch in a higher level must have the switching
function of the lower level in a nested manner.
This is known as the multiple switching function
rule.
2. Calls must be routed through the direct switch
hierarchy, both at the originating switch and the
destination switch. This is known as the two-ladder
limit rule.
3. For a call from one area to another, a HU
trunkgroup from a switch in the originating area to
a switch at the next higher level in the destination
area is a preferred selection over the final
trunkgroup to the switch at a level directly above
10
Routing in Telephone
Network
it. This is known
as the
ordered routing rule.
Consider example
C
1.
2.
3.
4.
Nodes A & B are on the Same last

Hierarchy and Named as Central
office(CO) or End office
Trunk Group A-B,A-D &,B-C are HU
groups
Trunk Group C-D is Final Trunk Group
A call from C to D can only take Trunk
Group C-D as it cannot go to lower level
for routing
Loop is avoided in this system by the rule It is not allowed to go down

toward its immediate lower-level switch for routing
11
So far we have seen two level Hierarch but in real
Network there are five of them
12
In Geographical Perspective
13
Limitation of Hierarchical Routing

hierarchical routing avoided the looping problem by
clever use of nodes at different levels along with a
set of rules, it also led to situations in which some
trunkgroups could not be used for routing even
though capacity was available
C
A Call from C to D can only take the

route C-D Cannot overflow through
C-B-D or C-A-D even though
Bandwidth is available on the trunk
groups C-B, B-d, C-A and A-D
This is inefficient use of resource
14
Road to Dynamic Routing

Due to different time zones in the US, there were
times when certain trunkgroups were idle or had
very little utilization, but again, due to hierarchical
routing, these trunkgroups could not be used.
In the 1970s, some important developments took
place in parallel: the first was the ability to use
stored program control (SPC) in a switch and
channel interoffice signaling (CCIS) which enable
call setup and tear-down through out-of-band
signaling.
Two link Call is decided to be Good enough to
Deliver GoS requirement set by FCC
15

Three important drivers that led to all dynamic
routing methods to limit calls to a maximum of two
links are:
1. An issue was how to handle the looping problem. It is
easy to see that the looping problem can be easily
handled with a maximum of two links for a call:
a call can be going directly from the ingress switch to the
egress switch on a direct link;
if this link is busy, the call can try another route going from
the ingress switch to an intermediate switch. The
intermediate switch on receiving the call knows that the call
needs to be sent directly to the egress switch, not another
intermediate switch, due to the limit on the number of links.
2. keep the complexity down, for example, if the looping

problem could be addressed easily without introducing
software complexity.
3. Introducing more than two links ,gain was not significant,
16
in Telephone
Network
i.e., the Routing
blocking
would
go down from 1% to about

Two New introductions due to Dynamic routing are
Originating Call Control(OCC) and Crank back
In OCC Call setup is controlled by originating switch
and not progressively forwarded to next hop
the functionality of returning a call to the
originating switch and trying another route is called
Crankback
with Dynamic routing we have an option to use OCC
and Crank back which were not available in
Hierarchical routing schemes
17
PCC vs. OCC with crankback

Call from 1 to 2 using PCC
4
Li
ne
bu
sy
Li
n
bu
sy
Blocked
Success
Line busy
18
PCC vs. OCC with crankback

Call from 1 to 2 using OCC with Crankback
4
Li
n
Crankback
bu
sy
Success
Line busy
19
Dynamic Nonhierarchical Routing(DNHR)

is the first implemented dynamic routing scheme. It
was first deployed in AT&Ts long-distance
telephone network in 1984 and was retired in 1991.
DNHR is a time-dependent routing. This means that
the set of routes available (and their order) at
different times of the day is different.
24-hour time period spanning a 7-day week was
divided into 15 load set periods: 10 for the
weekdays and 5 for weekends. The different
number of load set periods was determined based
on understanding traffic patterns.
All Nodes Belong to the same Level( Class less)
20

For each load set period, based on traffic projection,
a set of routes is computed ahead of time. Typically,
traffic projection and routing computation were
computed off-line 1 week in advance and the
routing table is then uploaded to each switch in the
network.
These are referred to as engineered paths
To alleviate Real time Burst traffic new paths are
prepared in real-time basis. these additional paths
are referred to as real-time paths.
If the blocking between a pair of switching nodes goes beyond
an acceptable threshold, a new estimation of traffic over
every 5-min window is invoked.
Based on this data new paths are computed and then loaded
into the network switches.
21
22
Trunk Status Map Routing(TSMR)

is an Extension of the DNHR uses centralized Trunk
Status Map to provide Real time routing decision in
DNHR network
Gets update from SPC switches about number of
Idle trunks every T seconds
These updates are sent only when the number of
Idle trunks in the trunk group has changed.
In return TSM periodically sends to SPC switches
ordered routing sequence to be used
These routes are determined in real time by TSMR
strategy and much more Dynamic than DNHR
23

There are four alternative approaches for TSMR
1. Route each call on the least loaded path(Path having
more number of idle circuits)
2. Route Call first on Direct Path if it exists and available, or
else selecte least loaded path
3. Route Each call first on Path assigned by Unified algorith
(UA) if available or else select least Loaded path
4. Compute the UA routing sequence that maximizes
carried traffic for short term estimates of the network
loads and then apply method 3 using the new routing
sequence
Method 1 and 2 are poor as they favor Least loaded

and Direct link
Method 3 has good performance and optimum for
use.
Method 4 has
Routing
in Telephone
Network3 but more complex to24
better
than
If we use DNHR call routing sequence from A to D is A-DA-CDA-B-D this leaves no trunk for call A to C or C to D
But TSMR routing sequence will be A-DA-B-DA-C-D. so Next
arriving call from A-C or C-D will not be blocked
TSMR tends to leave leaves Capacity in a Network uniformly
Distributed
25

Average Blocking DNHR vs. TSMR on average
business day
26
Thank You
27

Routing in Telephone Network

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Routing in Telephone Network

Uploaded by

Copyright:

Available Formats

Advanced Data communication and