Fixed Local Anchor Scheme

for Supporting UPT Services in Wired Networks

Eun Shil Baet, Min Young C h u g $ , and Dan Keun Sung$

i Korea Telecom Research and Development Group, Taejon, Korea

$ Dept. of EE, Korea Advanced Institute of Science and Technology, Taejon, 305-701, Korea
besetnrl. kotel .eo.kr , dksungoee. kaist .ac.kr

Abstract - An intelligent network architecture with Fixed call delivery cost and location update cost. The paper is or-
Local Anchor (FLA) is proposed t o support Universal Per- ganized as follows. Section 2 briefly describes the features
sonal Telecommunication (UPT) services. The performance of UPT services. Section 3 proposes an IN architecture with
of the proposed IN architecture is compared with the architec- FLA. Section 4 derives both the call delivery cost and the
ture based on IS-41 considering UPT users personal mobility location update cost. Section 5 compares the performance
in terms of call delivery cost and location update cost. of the IN architecture with the architecture based on IS-41.
Finally, section 6 draws conclusions.
I . INTRODUCTION
Since Universal Personal Telecommunication (UPT) ser- O F U P T SERVICE
11. FEATURES
vice will enable users t o originate and receive calls at any ter-
minal through personal identification numbers [l],the UPT The UPT service was recommended by ITU-T as one of
service is becoming one of the most popular telecommuni- target services of IN Capability Sets (CS) 1 and 2 [ll-131.
cation services. UPT networks can fully support terminal Essential features, such as identity authentication of UPT
and personal mobilities. Terminal mobility can be gener- user, incall registration, outgoing UPT call and incall delivery
ally supported through wireless access t o a fixed base station, were defined for operations of U P T service set 1 [14].
and personal mobility can be generally supported through a
unique personal number, i.e, U P T number in wired and wire- UPT user identity authentication is required t o verify the
less networks. identity of UPT user.
Incall registration enables a UPT user t o register for in-
Since personal mobility management can be overlaid on the
coming calls from the users current terminal address.
networks already providing terminal mobility management,
Outgoing UPT call supports a UPT user t o initiate an
the personal mobility management can be logically separated
outgoing U P T call attempt from any terminal.
from the terminal mobility management [2]. Several termi-
Incall delivery provides connections to both UPT users
nal mobility management schemes have been studied t o re-
and non-UPT users utilizing terminal address of UPT
duce signaling messages related t o terminal mobility manage-
number regardless of location and type of terminals.
ment [3-61. Ho and Akyildiz [4] proposed a local anchoring
scheme which can reduce the signaling traffic load between a Incall registration enables a UPT user t o indicate where
Home Location Register (HLR) and Mobile Switching Cen- incoming U P T calls are connected. Thus the characteristics
ters (MSCs). of UPT users incall registration are closely related t o the
Several IN architecture supporting UPT services have been personal mobility of the UPT user. Incall registration may
studied [7-lo]. Fokestad [8] presented three models of the be cancelled in one of the following ways [14]:
distribution of UPT service logic in signaling networks and
The U P T user can initiate incall registration at another
evaluated performance in terms of mean call setup time.
Kwiatkowski [9] calculated network load required to access terminal.
The U P T user can explicitly make incall deregistration.
SCP and databases without considering the characteristic of
The U P T user can specify timer or counter values dereg-
UPT user mobility. Lauer [lo] proposed local, remote, and
istering incall registration.
home methods t o control the U P T service in wired networks
U P T service providers can specifically deregister the
and also compared these methods in terms of new service
U P T user t o terminate the registration.
deployment, service providers requirements, network perfor-
Terminal owners(UPT or non-UPT) may reset all incall
mance and so on.
registration on their terminal addresses.
In this paper an IN architecture with FLA is proposed in
order t o support UPT services t o wireline users. The per- For simplicity, the first two ways are here considered for
formance of the IN architecture is also evaluated in terms of incall deregistration.

0-7803-4788-9/98/$10.000 1998 IEEE. 812

 I
/I-- Fig. 2. Location of U P T User

TABLE I
S I X POSSIBLE COMBINATIONS O F LOCATION CHANGES

User's location User's location

in the current registration in the next registration
Home
Home Local
Fig. 1. IN Architecture with FLA Home Remote
Local Home
Local Local
WITH FIXED
111. IN ARCHITECTURE LOCAL ANCHOR Local Remote
IN functional entities required to support UPT services in-
clude Call Control Funct ion (CCF), Service Switching Func-
tion (SSF), Service Cor,trol Function (SCF), Service Data designated as his/her FLA. SSP sends a location registration
Function (SDF), and Specialized Resource Function (SRF). message t o the FLA whenever the user moves to a new RA
The SSF associated with the CCF provides functions required in one LSTP region. When the UPT user moves to another
for interactions between i,he CCF and the SCF. The SCF con- LSTP region, the user sends a location registration messages
trols CCF in the processing of UPT service requests. The to the SCP(H). Then SCP(H) transfers the registered user's
SDF contains UPT use1 and network data which the SCF service profiles t o the new FLA and sends a message to delete
accesses in real time for UPT services. The SRF cooperates the profiles in the previous FLA. For example, for an LSTP
with SCF to transfer information from UPT user. region with 10 SCP(V)s and 2 FLAs, we may designate one
SCP(V) as the FLA1, another SCP(V) as the FLA2. If a
Service Switching Point (SSP) has capabilities to detect
UPT user requests location registration in a new RA, when
UPT services and communicates with other physical entities
its UPT number be even, SSP sends a location registration
including SCF. In order to recognize UPT services and to con-
message to FLA1.
trol UPT calls, the SSP should include the functions of SSF
and CCF. Service Control Point (SCP) has the functions of In the architecture with a single FLA, the location of UPT
SCF and SDF. The SCF includes UPT Service Logic Program user can be represented as home, local and remote RAs, as
(SLP) to control UPT services. The UPT user service pro- shown in Fig. 2. Table I shows the six possible combinations
file which resides in SDI' contains all information related to of location changes, according to the current location and the
next location of UPT user. Location registration scenarios
UPT users such as user-llefined service information and user
and location registration cost are different in each case. Fig.
location information. Each UPT service profile is associated
with a single UPT number. 3 shows a location registration scenario when a UPT user
registered in a FLA reregisters at the FL.4's RA after n RA
Fig. 1shows an example of intelligent network architecture.
crossings. Fig. 4 shows an explicit incall deregistration sce-
It consists of N SSPs, N SCP(V) and an SCP(H). Each SSP is
nario in the case that a UPT user registered out of the FLA
connected to a corresponding SCP(V) through a direct link,
deregisters at a local RA after n RA crossings.
and any SSP can access the data in SCP(H) through signaling
networks. The SCP(H) stores user profiles, and each SCP(V) Iv. MATHEMATICAL ANALYSIS
stores replications of the user profiles of the subscribers cur-
rently residing in its associated SSP. A. Location registration cost
In the two level netuork architecture with SCP(V) and Let t R and t, be independent and identically distributed
SCP(H), neighboring SC'P(V)s connected to each Local Sig- (i.i.d.) random variables representing the location registra-
nal Transfer Point (LSTI') are grouped. All the Registration tion interarrival time and the RA residence time of UPT user,
Areas (RAs) covered by an LS'TP is called the LSTP region. respectively. tR is assumed to be exponentially distributed
For each UPT user, a spccific S@P(V)in each LSTP region is with rate XR. fm(t)is the probability density function oft,

813
 Initial Detection Point

Query
Result
4

Query

Result

Fig. 5. Imbedded hIarkov chain model

Update data

Result as

Fig. 3. Location registration scrnario in the FLA

<-> q&
Request Report BCSM Event
Prompt&Collect user Information
The equilibrium state probability of state i, pi can be ob-
tained by

where po = p.
The location information is updated when both registration
and deregistration occur concurrently with probability P T d r ,
or when only registration occurs with PdT,or when only dereg-

I T - 1 U date data
istration occurs with P,. It is assumed that RAs are square
shaped and each LSTP region consists of d x d RAs. UPT
users are assumed to equally reside in any RA and a UPT
user moves from an RA to one of the four neighboring RA's
with the same probability of 1/4.
Fig. 4. Deregistration scenario in the FLA
Let a k l ( n ) denote the probability that a U P T user regis-
tered at RA k moves to RA I after n RA crossings. Then
and f & ( s ) is the Laplace Transform of f m ( t ) . The mean of akl(n) is obtained as
t , is l/A,. The embedded Markov chain model in Fig. 5
represents the mobility and location registration patterns of
U P T users. State i is defined as the number of RA crossings (4)
after the registration. The state transition probability from
state i to state j , aij can be given by
where f(n, x,y) is the number of possible paths from RA k
1-p, j=i+l to RA 1 after n RA crossings [4].
.-={;: j = o
otherwise,
(1) PIA, PIL,P I R ,POA, POLand POR are the probabilities of
location changes, where the subscripts are denoted as:

where p is the probability that one or more location registra- I 1 0 : current user location insidejoutside the FLA's RA
tions occur between two RA crossings and can be expressed A / L / R : user location at FLA's/Local/Remote RAs.

81 4
These probabilities can be expressed as: TABLE I1
COST PARAMETERS

1 2 1 1 1 3 1 2 I 5 I
3 1 4 3 9
4 1 5 4 16

k#l

registration before their next registration. It is assumed that

V I
(9) users may request deregistrations at random points with the
EER I E R
S#l l f l same probability and that call arrivals follow a Poisson pro-
P O R ( n ) = 1 - P O A ( n ) - POL(n). (10) cess. Deregistration and call arrival process are assumed to be
mutually independent. The probabilities that a terminating
Signaling messages are sent for location registration and
call arrives when the called user is registered or deregistered
call delivery through signaling networks. The cost for send-
are denoted by PON or POFF,respectively, and these proba-
ing a signaling message through signaling networks may vary
bilities have the same value of 0.5.
depending on the location of SSPs, SCP(V)s, and SCP(H).
The call delivery cost CD is written as
The cost for sending a message through a selected type of
link is here assumed to be the same regardless of the ac- +
C D = {PTdrCsr (1 - P r d r ) ( P O N C s T + P O F F C s d r ) } X c ,
tual length of the link. The cost associated with each net- (14)
work element is also considered. C I A r d T , C I L T d T , C I R r d r , where C,, and C& are the call delivery costs when the user
COArdT, COLrdT, CORrdr C I A T I C O L r , GIRT, C O A T , COLT, is registered and deregistered, respectively.
C O R T , C I A d r , CILdr', CIl2dr, C O A d r and C O L d T , C O R d r are
the costs for location registration and deregistration accord- v. NUMERICALEXAMPLES
ing to the change of user locations. These costs are obtained The Registration to Mobility rakio ( R M R )is defined as the
using the cost Cv for updating S C P ( V ) ,the cost CH for up- ratio of the location registration rate to the mobility rate, i.e.,
dating SCP(H), the cost (:LO for sending a signaling message RMR = XR/X,. A high RMR implies that a large number of
from SSP to FLA and the cost CROfor sending a signaling location registrations are processed between the two consecu-
message from SSP to SCP(H). For example, when a UPT user tive movements. The Call to Registration ratio (CRR)is also
registered in an FLA registers at the FLA's RA after n RA defined as the ratio of the call arrival rate to the registration
crossings, the FLA's RA I S accessed three times as shown in rate, i.e., CRR = X , / X R .
Fig. 3. Thus the cost CIA^^^ is given by 3 x C v . To compare the cost of the FLA scheme with that of the
The location registration cost C L ( ~during ) a UPT user's IS-41 scheme [15], we obtain the relative cost. The size of
stay in state i, is obtained as
an LSTP region, d * d is set at 64, and the RMR is varied
CL(Z) = P T d r ( P I A ( 2 ) * C I A p d p + p I L ( 2 ) * C I L r d r + p I R ( Z ) * C I R r d r from 0.5 to 5 . Four sets of the values for cost parameters C V ,
+ P O A ( % ) * C O A p d p + P O L ( % )* C O L r d T + P O R ( Z ) * C O R r d r )

+ P v ( P I A ( Z ) * C I A ? f P I L ( 2 ) * C I L r + PIR(Z) * C I R r
C H , CLO and CRO,are used, as shown in Table 11. Fig. 6
+ P O A ( Z ) * C O A T t P O L ( % )* C O L r + F O R ( %*) C O R I . )
shows the relative location update cost for varying the value of
+Pdv(PIA(Z) * C I A d ? f P I L I ( % *) C I L d r + P I R ( Z ) * C I R d r RMR when the incall deregistration probability is 0.5. Since
+POA(z) * COAdr P O L ( % )* C O L d P + P O R ( Z ) * C O R d v ) 4 1 1 ) the information in the FLA is updated for registration within
an LSTP region, the location update cost becomes lower for
The average location registration cost per state transition is
lower mobility and for higher registration rate. In addition,
given by
the relative location update cost becomes lower as the set
co
number increases.
k=O
Fig. 7 illustrates the call delivery cost as a function of
incall deregistration probability. The relative search cost de-
Finally, the average location registration cost per unit time is
creases as the incall deregistration probability increases and
expressed as
the access cost t o SCP(H) increases.
c,: = A&.; (13) Fig. 8 shows the relative total cost for varying the value of
RMR when the CRR and incall deregistration probability are
B. Call delivery cost fixed. It is noted that the proposed architecture with FLA
Users may register their locations and deregister their pre- is more efficient for the lower mobility and for the higher
vious registration simultaneously, or may cancel the previous accessing cost to SCP(H).

815
 VI. CONCLUSIONS Recommendation Q.1211, Introduction t o Intelligent Network Ca-
pability set 1, Mar. 1993.
In this paper, an intelligent network using FL,4 was pro- Recommendation Q.1211, Introduction t o Intelligent Network Ca-
posed to support UPT services including personal mobility. pability set 2, 1994.
Recommendation F.851, Universal Personal Telecommunica-
When location updates occur within an LSTP region, only tion(UPT) - service description(service set l), Jan. 1994.
the information in FLA is needed t o be updated. SCP (H) is EIA/TIA: Cellular Radio-Telecommunications Intersystem Oper-
ations, Technical Report IS-4f Revision B: EIA/TI.L\, 1991.
informed only when a user leaves the LSTP region. although
the call delivery cost is rather high in the proposed archi-
tecture compared with in the IS-41 based one, the proposed
architecture is more efficient in the following conditions:
higher probability of cancelling the previous Ggistration
before the next registration.
lower mobility
higher probability of registration and deregistration
within a region.
higher deliver cost of signaling message to SCP(H).
As a further study, this study can be extended t o sup- ~
05 I 1.5 2 2.5 3 3.5 4 4.5 5
port both personal mobility and terminal mobility in the in- Registration to Mobility Ratio
tegrated network of wired and wireless networks.
Fig. 6. Relative location update cost for R M R ( P d , = 0.5)
APPENDIX
The location registration cost per unit time C I S Land the
call delivery cost in the IS-41 based network C I S Dare given
by :

Where CIS^^?, CIS^, C I S d r , CIS^^, and CIS^^^ are the costs in

the IS-41 based network, and the capital subscript I S denotes
IS-41. Incall deregistration probability

REFERENCES Fig. 7. Relative search cost for Pdr

ITU-T recommendation F.850, Principles of Universal Personal
Telecommunication (UPT), Mar. 1993.
Draft Recommendation 1.373, Network Capabilities t o Support
Universal Personal Telecommunication ( U P T ), July. 1992.
Ian FAkyildiz and Joseph S.M.Ho, On Location Management for
Personal Communications Networks, IEEE Commun. Magazine,
pp. 138-145, Sep. 1996.
I 23 i
I
I \
set 1 CRR=I 0
set 2 CRR=I 0
set 3 CRR=l 0
set4CRR=I 0
+

*
1
Joseph S.M.Ho and Ian F.Akyildiz, Local Anchor Scheme for
Reducing Signaling Costs in Personal Communications Network,
IEEE Trans. Networking, vo1.4, No.5, pp. 709-723, Oct. 1996.
R.Jain and Y.Lin, A Caching Strategy to Reduce Network Impacts
of PCS, IEEE J . Select. Areas Commun., vo1.12, No.8, pp. 1434-
1444, Oct. 1994.
R.Jain and Y.Lin, An Auxiliary User Location Strategy Employ-
ing Forwarding Pointers to Reduce Network Impacts of PCS, i n
Proc.ICC, pp. 740-744, 1995. ?
05 1 1.5 2 2.5 3 3.5 4 1.5 5
J.Audestad and B.Jacobsen, Universal Personal Telecommunica- Registrarton to Mobility Ratio
tion and Intelligent Network Architecture, i n Proc.ICIN 92 pp.
89-94, 1995. Fig. 8. Relative total cost for RMR(PdT = 0.5)
Arne Folkestad, Impact of U P T Service on Network Performance
and Call Set-Up Times:Distribution of Service Logic in SS7, i n
Proc.ISS, vo1.2, pp. 97-101, 1995.
M.Kwiatkowski, Performance Modeling of U P T networks, zn
Proc.ICUPC, pp. 543-547, 1995.
G.S.Lauer IN Architectures for Implementing Universal Personal
Telecommunications , IEEE Net work, pp. 6- 16, Mar ./ Api . 1994.
Recommendation 1.312/Q.1201 Principles of Intelligent Network
Architecture, Oct.1992.

816