Roaming Management under SS7
It mainly addresses the interactions between the
PCS network and the PSTN
Signaling Exchange of control information Network to Network(NNI) Signaling System
Channel Associated Signaling System(CAS) Common Channel Signaling System#7(CCS#7)
In-band Signaling Control Information and user
information sent on a single line
Out-band Signaling - Control Information and user
information sent separately into logically or 5/4/12 physically separate paths
Common channel signaling (CCS)
Common channel signaling (CCS) is a signaling
method that provides control and management functions in the telephone network.
CCS consists of supervisory functions, addressing, and call information provisioning. A CCS channel conveys messages to initiate and terminate calls; determines the status of some part 5/4/12 network; of the
CCSS#7 is an advanced digital signaling and control system,
CCSS#7 / Signaling System No.7(SS7)
that is a set of telephony signaling protocols which are used to set up most of the worlds telephone calls (Also called as SS7)
SS7 being a high speed and high-performance packet-based
communication protocol, can communicate significant amounts of information when setting up a call, during a call and at the end of the call
Call management services provided by SS7 are Call forwarding( busy and no answer ) Call waiting Called name and number display Calling name and number display etc.
5/4/12
Signaling System No.7(SS7)
SS7 messages are exchanged over signaling links Signaling between a PCS network and the PSTN
are typically achieved by the SS7 network
SS7 network is made up of several signaling link
types( A,B,C,D,E) and three signaling nodes
Service Switching Point (SSP) Signal Transfer Point(STP)
5/4/12
Fig shows the
network elements that are involved in the interconnection between a PCS network and the PSTN. In the figure, the dashed lines represent the signaling links; the solid line represents a trunk.
5/4/12
A telephone switch interconnected by SS7
Service Switching Point (SSP)
links. The SSPs perform call processing on calls that originate, tandem, or terminate at that node. A local SSP in the PSTN can be a central office (CO) or end office (EO). An SSP in a PCS network is called a mobile switching center (MSC). In general, the SS7 messages that originate or terminate at an SSP is either circuit /call 5/4/12 routing related
Signal Transfer Point (STP)
A switch that relays SS7 messages between
network switches and databases.
Based on the address fields of the SS7 messages,
the STPs route the messages to the correct outgoing signaling links.
To meet the stringent reliability requirements,
STPs are provisioned in mated pairs
STPs maintain routing tables for the purposes of
directing messages to their intended destinations i.e. based on the address fields of the SS7 messages the STPs route the messages to the correct outgoing signaling links 5/4/12
Service Control Point (SCP).
In general SCPs provide access to databases i.e.
contains databases for providing enhanced services. An SCP accepts queries from an SSP and returns the requested information to the SSP In mobile applications, an SCP may contain an HLR or a VLR. The database(s) to which the SCP has access may/may not reside at the same location as SCP
5/4/12
Signaling System No.7(SS7)
In this network, the trunks (voice circuits)
connect SSPs to carry user data/voice information.
The signaling links connect SCPs to
STPs, and STPs to SSPs.
The SSPs and SCPs are connected
indirectly through STPs.
5/4/12
Registration
In this example, the MS moves from VLR1 to VLR2.
MS C1
MS C1
5/4/12
Registration
Step 1. The MS enters the area controlled by MSC2. MSC2 launches a registration query to its VLR through
STP2, assuming that VLR2 and MSC2 are not co-located
Step 2. VLR2 sends a registration message to the MS's HLR
(HLR4 in Figure 2.8). VLR2 may not know the actual address of HLR. Instead, VLR2 sends the message containing the MS identity, called the Mobile Identification Number (MIN), to an STP (STP3 in our example) that can translate the MIN into the HLR address.
5/4/12
Step 3.
STP3 by a tablelookup technique called global title translation (GTT). STP3 then forwards the registration message to HLR. Step 4. After the registration, HLR sends an acknowledgment back to VLR2. Since the address of VLR2 is known, the acknowledgment may be sent to VLR2 using a shortcut, without passing through STP3. Step 5. After step 3, HLR sends a deregistration message to VLR1 to cancel the obsolete record. 5/4/12
The MINtoHLR address translation is performed at
In steps 2, 3, 4, and 5, the messages may visit
several STPs before arriving at their destinations, and the registration process may generate considerable traffic in the SS7 network.
Thus, it is desirable to reduce the registration
traffic.
Two approaches have been proposed to reduce
the "cost" of deregistration at step 5 in Figure 2.8:
implicit deregistration periodic re-registration
5/4/12
Implicit deregistration
Obsolete VLR records are not deleted until
the database is full. If the database is full when an MS arrives, a record is deleted, freeing storage space to accommodate the newly arrived MS. A replacement policy is required to select a record for replacement (it is possible that a valid record is replaced, and the information is lost). Advantage: no deregistration messages are sent among the SS7 network elements. 5/4/12
Periodic re-registration
the MS periodically reregisters to the VLR. If the VLR does not receive the re-registration message
Pointer Forwarding Scheme
within a timeout period, the record is deleted. This approach only creates local message traffic between the MSC and the VLR. Furthermore, no SS7 signaling messages are generated if the VLR is co-located with the MSC.
To reduce the registration traffic at steps 2 and 3 a
pointer forwarding scheme was proposed, which consists of two operations: Move operation (registration). Find operation (call delivery). 5/4/12
Move operation (registration)
When an MS moves from one VLR to
another, a pointer is created from the old VLR to the new VLR. No registration to the HLR is required
Find operation (call delivery)
When the HLR attempts to locate the MS
for call delivery, the pointer chain is traced. After the find operation, the HLR points directly to the destination VLR
5/4/12
M SC
M SC
M SC
M SC
5/4/12
Depending on the memory capacities of the
VLRs, the pointers in the obsolete chain may or may not be deleted. To limit the pointer traversal time in the find operation, the registration procedure in Figure 2.8 may be performed for every k move operations. In other words, the number of pointers visited in the find operation will be limited by k. The pointer forwarding scheme should not be considered when the net cost of pointer creation and pointer traversal is higher than the cost of accessing the HLR. As performance studies indicate, the pointer forwarding scheme significantly reduces the 5/4/12 network traffic in many cases.
Call Delivery
Similar to the registration process, visits to several STPs and
a GTT may be required to access the HLR in call delivery.
Several STPs may be visited to obtain the routable address
from the VLR.
To reduce the call delivery traffic, a cache scheme was
proposed to maintain a cache in the originating SSPs.
Another possibility is to maintain the cache in the STP that
performs GTTs, that is, STP3 in Figure 2.11.
A cache entry consists of two fields: the MIN of an MS and
5/4/12
cache scheme
When the calling party originates a call to an MS, the SSP
first checks if the cache entry for the MS exists. There are three possibilities:
Case 1: The cache entry does not exist. The call
delivery procedure illustrated in Figure 2.10 is performed.
Case 2: The cache entry exists and is current. The
VLR is directly accessed as shown in Figure 2.11.
Case 3: The cache entry exists but is obsolete. The
procedure detects that the cache entry is obsolete if 5/4/12 the queried VLR's response is negative. The call
5/4/12
5/4/12
Discussion
Note that implicit deregistration and periodic re-
registration can be used with the cache scheme, but the obsolete cache information may not be detected until the MS is paged.
Since the cache information may be obsolete,
some heuristics are required to determine whether the cached information will be used to locate the MS. cache hit ratio, or the probability that case 2 is true. 5/4/12
One technique is to have the SSP estimate the
Another heuristic determines the obsoleteness of an
Discussion
entry based on the period that an MS resides in a VLR as indicated in the cache entry.
If the cache entry indicates that the MS has stayed in a
VLR for a period longer than a specified threshold, the entry is assumed to be obsolete.
The threshold can be adjusted in real time based on
cache hit statistics. If case 3 is more likely to occur than case 2, then the cache scheme should not be considered. Performance studies indicate that the cache scheme 5/4/12 significantly reduces the call delivery cost in many
