# Measurement of Mobile Switching Centres Throughput in GSM Network Integrating Sliding Window Algorithm with a Single Server Finite Queuing Model

Authors: Dinaker Babu Bollini; Mannava Muniratnam Naidu; Mallikharjuna Rao Nuka
Journal: Journal of Computer Networks and Communications
 (2016)

---

## Abstract

The sliding window algorithm proposed for determining an optimal sliding window does not consider the waiting times of call setup requests of a mobile station in queue at a Mobile Switching Centre (MSC) in the Global System for Mobile (GSM) Communication Network. This study proposes a model integrating the sliding window algorithm with a single server finite queuing model, referred to as integrated model for measurement of realistic throughput of a MSC considering the waiting times of call setup requests. It assumes that a MSC can process one call setup request at a time. It is useful in determining an optimal sliding window size that maximizes the realistic throughput of a MSC. Though the model assumes that a MSC can process one call setup request at a time, its scope can be extended for measuring the realistic throughput of a MSC that can process multiple call setup requests at a time.


---

## Body

## 1. Introduction

A mobile subscriber is uniquely identified by Mobile Station International Subscriber Directory Number (MSISDN) in the Global System for Mobile (GSM) Communication Network. The GSM network provides services to its registered mobile subscribers using the Gateway Mobile Switching Centre (GMSC) of a service provider. The GMSC area is partitioned into several areas with a switching centre at each area referred to as Mobile Switching Centre (MSC) connected to GMSC. The profiles of mobile subscribers are stored persistently in Home Location Register (HLR) at GMSC. Each MSC maintains a Visitor Location Register (VLR), which stores the profiles of mobile subscribers temporarily [1]. A MSC provides call setup services in response to a call setup request from a mobile subscriber provided its profile is available in VLR.The mobile subscribers roam randomly in the GSM network area. It is observed that the policy of accessing HLR is fetching the profile of a mobile subscriber to VLR whenever it arrives at MSC service area and deleting the same whenever it leaves. This method increases the load on the network traffic, delays call setup time, and reduces the throughput of MSC [2]. Shah Newaz et al. [3] proposed a method of Fixed Block of Seven Days (FBSD) for determining the retention period of the profile of a mobile subscriber in VLR for improving the throughput of a MSC. Nuka and Naidu [4] proposed a sliding window of size seven days (SWSSD) algorithm which proved to be better than that of FBSD. This model partitions the sliding window into seven slots and maps onto seven days.At the end of each day beyond initial seven days, the model determines the intersection of mobile subscribers’ profiles over seven slots, slides the window by one slot right masking the front slot and opening new slot at the other end, and copies the intersection to newly opened slot.A simulation model is developed for evaluating the performance of FBSD and SWSSD algorithms. The analysis of simulation output proved that the SWSSD algorithm is better than the existing FBSD algorithm as it decreases the average call setup time by 6.28% and increases the throughput by 7.08%. Further, Nuka and Naidu [5] proposed a model for determining optimal sliding window size (OSWS) considering the average call setup time and throughput as criteria of optimization.However, the SWSSD algorithm [4] has not considered the waiting time of call setup requests in queue at a MSC when it is busy. This study proposes a model integrating SWSSD algorithm with a single server finite queuing model (SSFQM) referred to as an integrated model (IM) for realistic measurement of throughput of a MSC considering the waiting time of call setup requests in queue.The paper is divided into 8 sections inclusive of this section. In Section2, a brief review of related work is presented. Section 3 defines the problem. An outline of SWSSD is presented in Section 4. The SSFQM is presented in Section 5. Section 6 presents the integration of SWSSD algorithm with SSFQM. The process of measuring the realistic throughput of a MSC through simulation is presented in Section 7. The conclusions of the study are enumerated in Section 8.


## 2. Review of Related Work

GSM network system is portioned into three subsystems, namely, Base Station Subsystem (BSS), Network Switching Subsystem (NSS), and Operational Subsystem (OSS) as shown in Figure1. The BSS routes the call setup request of a mobile subscriber to NSS. A cell is an area of a GSM network in which the subscriber can connect to a Base Transceiver Station (BTS) through radio signals to transmit data. A set of cells in the jurisdiction of a BTS is known as a location area (LA). A set of BTSs are connected to a Base Station Controller (BSC). The NSS provides the call setup service in response to the request. The BSS and NSS utilize the services of OSS for providing their requisite services to mobile subscriber for materializing conversation among mobile subscribers. Obviously, it is typical that mobile subscribers roam randomly over location areas.Figure 1
GSM network architecture.The profiles of all the mobile subscribers registered with a service provider are maintained using a centralized database at GMSC referred to as HLR. Whenever a MSC receives call setup request from a mobile subscriber through the BSS, it processes it for providing call setup services. The availability of profile of mobile subscriber at the MSC is necessary for processing the call setup request. To meet this prerequisite, at each MSC a database, referred to as VLR, is maintained for storing temporarily the profiles of mobile subscribers which are currently in the service area of a MSC. One extreme policy is replicating the HLR as VLR at each MSC. This policy increases throughput of a MSC while increasing the cost of storage. Other extreme policy is fetching the profile whenever the mobile subscriber enters the location area and deleting the same on its exit. This policy decreases the throughput of MSC while increasing network traffic overhead. Hence, it is essential to undertake the problem for determining the retention period of the profiles of mobile subscribers in VLR in spite of leaving the service area of a MSC with the objective of maximizing the throughput of MSC while minimizing the sum of the costs of storage and network traffic overhead.The review of related work reported in [6–16] has not addressed this problem. This problem is addressed in [3] proposing a Fixed Block of Seven Days (FBSD) model for determining the retention period of the profile in VLR for improving the throughput of a MSC. Subsequently, Nuka and Naidu [4] proposed sliding window of size seven days algorithm that proved better than the above-said model [3]. Further, they extended the algorithm for determining optimal sliding window size [5] that maximizes throughput of MSC.However, the SWSSD algorithm [4, 5] has not considered the waiting time of call setup requests in queue at a MSC when it is busy. Therefore, it is motivated to propose a model integrating SWSSD algorithm with a single server finite queuing model (SSFQM) for measurement of realistic throughput of a MSC considering call setup request waiting in queue.


## 3. Problem Statement

A model proposed in [5] for determining an optimal sliding window size has not considered the waiting time of call setup requests in queue due to busy state of a MSC. It is essential to consider the waiting time of call setup requests for formulating a more realistic model. Hence, formulating a model for measuring the throughput of a MSC considering waiting time of call setup requests in queue due to busy state of a MSC is a prerequisite for determining an optimal sliding window size. Further, such a model can also be used for developing a cost model for determining an optimal number of identical channels for a MSC. Therefore, it is motivated to undertake the problem of measuring throughput of a MSC with a single channel integrating sliding window of size seven days algorithm with a single server finite queuing model.


## 4. Sliding Window of Size Seven Days Algorithm

The SWSSD algorithm has been proposed for determining the holding period of a record of a mobile subscriber profile in VLR, instead of deleting immediately when the mobile subscriber leaves the service area of a MSC, with an objective of maximizing throughput of the MSC and minimizing call setup time [4]. Here, the overall logic of the algorithm is briefly described.On a given day, the MSISDNs made call setup requests which comprise one set of the sliding windows. Initially, the days are denoted by numbers one to seven and their corresponding sets are set to null. A set is updated applying union operation between the current set and a MSISDN from which the call setup request is received, provided the relevant record of the MSISDN is fetched from HLR due to nonavailability of the same in VLR. At end of the seventh day, the intersection of seven sets is determined. The set in the first position of sliding window is deleted by shifting other six sets left by one position. This is equivalent to sliding the window to right by one position. The intersection is copied in the seventh position of sliding window. Consequently, the days are incremented by one. Thereafter, at the end of each day, the tasks of determining the intersection, sliding the window, copying the intersection, and incrementing days are repeated over days. The definitions of notation are given below:(1)
S
i
=
s
∣
s
i
s
a
n
M
S
I
S
D
N
t
h
a
t
m
a
k
e
s
a
t
l
e
a
s
t
o
n
e
c
a
l
l
s
e
t
u
p
r
e
q
u
e
s
t
o
n
i
t
h
d
a
y
f
o
r
1
≤
i
≤
7
,
f
p
=
d
a
y
o
f
f
i
r
s
t
p
o
s
i
t
i
o
n
o
f
w
i
n
d
o
w
,
s
p
=
d
a
y
o
f
s
e
v
e
n
t
h
p
o
s
i
t
i
o
n
o
f
w
i
n
d
o
w
,
I
=
⋂
i
=
f
p
i
=
s
p
S
i
.The pseudocodes for call setup process procedure and sliding window algorithm are presented in Algorithms 1 and 2, respectively.Algorithm 1:Call setup process.
C
A
L
L
S
E
T
U
P
(
M
S
I
S
D
N
,
i
)
(1)  i
f
M
S
I
S
D
N
∃
V
L
R
(2)   S
e
t
u
p
C
a
l
l
(3)  e
l
s
e
(4)    F
e
t
c
h
r
e
c
o
r
d
f
r
o
m
H
L
R
(5)    S
e
t
u
p
C
a
l
l
(6)    S
i
←
S
i
∪
M
S
I
S
D
NAlgorithm 2:Sliding window algorithm.
S
W
S
S
D
(
f
p
,
s
p
)
(1)  I
←
{
∅
}
(2)  f
o
r
i
=
f
p
t
o
s
p
d
o
(3)    I
←
I
∩
S
i
(4)  s
p
←
s
p
+
1
(5)  S
s
p
←
I
(6)  f
p
←
f
p
+
1The inputs to CALLSETUP( ) procedure are MSISDN that represents call setup request and the day of request. If the condition in line (1) returns true then setup the call. Otherwise, fetch the record from HLR setup call and update S
i.In line (1), I is set to null. The statements in lines (2) and (3) compute the intersection of seven sets over the days from f
p to s
p. Line (4) is for incrementing the day of seventh position by one. Line (5) is for copying intersection into seventh position. Line (6) is for incrementing the day of first position by one.A simulation model is developed for evaluating the performance of SWSSD algorithm [4]. The definition of notation and the pseudocode for simulating over a given number of days is shown in Algorithm 3.Algorithm 3
S
W
S
S
D
(
λ
,
a
,
b
,
T
)
λ = Parameter of Poison Distribution
a
=
1 and b
=
88243 are parameters of discrete uniform distribution
T = operating life of system in days
(
1)   S
i
←
∅
f
o
r
(
1
≤
i
≤
7
): set of MSISDNs for i
t
h day, initially null set
(2)   h
←
0: number of hits, initially zero
(3)   i
←
1
(4)   j
←
1
(5)   f
o
r
i
=
1
t
o
7
d
o
CR = Poison random variates that represents number of call setup requests fori
t
h day
(6)  C
R
←
G
e
n
e
r
a
t
e
_
P
o
i
s
o
n
_
R
a
n
d
o
m
_
V
a
r
i
a
n
t
(
λ
)
(7)  f
o
r
k
=
1
t
o
C
R
Generate a discrete uniform random variant “s” that represents an MSISDN
(8)   s
←
G
e
n
e
r
a
t
e
_
D
i
s
c
r
e
t
e
_
U
n
i
f
o
r
m
_
R
a
n
d
o
m
_
v
a
r
i
a
n
t
e
(
a
,
b
)
(9)   If profile of “s” is found in VLR
Setup call
h
←
h
+
1
(10)   Otherwise
(a) Fetch the profile of “s” to VLR from HLR
(b) Setup call
(c)S
i
←
S
i
∪
s
(11)   Compute I
←
⋂
i
=
1
7
S
i: Intersection of seven days
(12)   Slide the window right by one day
(13)   V
L
R
←
V
L
R
-
S
j: VLR is updated
(14)   j
←
j
+
1
(15)   S
i
←
I
(16)   W
h
i
l
e
i
≤
T
d
o
(17)   C
R
←
G
e
n
e
r
a
t
e
_
P
o
i
s
o
n
_
R
a
n
d
o
m
_
V
a
r
i
a
n
t
(
λ
)
18   f
o
r
k
=
1
t
o
C
R
(19)   s
←
G
e
n
e
r
a
t
e
_
D
i
s
c
r
e
t
e
_
U
n
i
f
o
r
m
_
R
a
n
d
o
m
_
v
a
r
i
a
n
t
e
(
a
,
b
)
(20)   If the profile of “s” is found in VLR
Setup call
h
←
h
+
1
(21)   Otherwise
(a) Fetch the profile of “s” to VLR from HLR
(b) Setup call
(c)S
i
←
S
i
∪
s
(22)   Compute I
←
⋂
k
=
j
i
S
k: Intersection of seven days from j
t
h day
(23)   i
←
i
+
1The metrics employed for evaluating the performance of the SWSSD algorithms are hit rate and throughput that shall be maximized.The hit rate is the probability of the relevant record availability in VLR for processing a call setup request. The numbers of hits and call setup requests over a period of time are measured for computing hit rate. It is assumed that call setup requests are received randomly from a finite set of MSISDNs. The availability of relevant record of an MSISDN in VLR for processing its call setup request is referred to as a hit whereas nonavailability is referred to as a miss.Throughput of a MSC is the number of call setups per unit time. The average call setup time for a call setup request is computed using(2)
A
v
e
r
a
g
e
C
a
l
l
S
e
t
u
p
T
i
m
e
A
C
S
T
=
C
1
H
+
C
2
M
H
+
M
,where C
1 is call setup time in case of hit, C
2 is call setup time in case of miss, H
i
s number of hits over a period of time, and Mis number of misses over a period of time.Obviously,C
2 is greater than C
1 as the relevant record is to be fetched from HLR in case of a miss. From the analysis of data pertaining to call setup times of Telephone Regulatory Authority of India (TRAI), C
1 and C
2 are assigned 3 and 7 seconds, respectively.The reciprocal of average call setup time is throughput and the same is computed using(3)
T
h
r
o
u
g
h
p
u
t
T
P
=
1
A
v
e
r
a
g
e
C
a
l
l
S
e
t
u
p
T
i
m
e
A
C
S
T
.A simulation model is developed for evaluating the performance of SWSSD algorithm. It is used to generate the performance measures of SWSSD algorithm over a period of 1001 days. It is evident from the results that there is a significant increase in performance metrics of the proposed SWSSD algorithm for one MSC service area comparing with Fixed Block of Seven Days (FBSD) algorithm [3]. Obviously, it is recommended to consider adopting the SWSSD algorithm for the entire GSM network for improving its throughput by 7.08%.


## 5. A Single Server Finite Queuing Model

An entity that approaches a service facility for want of service is referred to as customer whereas the service facility is referred to as server. The service on arrival of a customer is commenced immediately provided the server is idle. Otherwise the customer has to wait in the queue until its turn. The six elements of a queuing model are interarrival, service times of customers, number of servers, queue discipline, maximum queue size, and calling population size.The interarrival and service times of customers are probabilistic in nature following respective probabilistic distributions. The number of servers is either single or multiple. The identical multiple servers are arranged parallelly whereas the nonidentical multiple servers are arranged in tandem. The queue discipline specifies order in which the next customer is selected from the queue for providing service. The queue disciplines are First Come First Served (FCFS), Last Come First Served (LCFS), Selection in Random Order (SIRO), and order of priority. The maximum queue size is the maximum number of customers permitted to wait in queue. It is assumed as infinite whenever there is no restriction on queue size. The calling population size is assumed as infinite whenever it exceeds threshold.A queuing model is descriptive in nature which provides the change of the state of a queuing system due to occurrence of customer arrival and departure events. The state of a queuing system is represented by the status of server (busy or idle), number of customers in system, and queue. As the arrival and departure events occur randomly over time, the state of the queuing system changes randomly.The steady state performance measures of queuing system server utilization, mean number of customers in system/queue, and mean waiting time in system/queue can be computed. These measures are used in a cost model for deciding the number of servers and quality of service. All setup requests from mobile subscribers are customers whereas the MSC that can process one request at a time for providing call setup services is a server. Obviously, the number of mobile subscribers is finite. Hence, the queuing system under consideration is formulated as a single server finite queuing model.


## 6. Integration of Sliding Window Algorithm with a Single Server Finite Queuing Model

The sliding window algorithm ensures minimum average call setup time which is termed as average service time of queuing system. However, the sliding window algorithm does not consider the waiting of call setup request while a MSC is busy.The average waiting time in queue shall be added to average call setup time to determine the average time a call setup request spends at a MSC. For this purpose, sliding window algorithm is integrated with a single sever finite queuing model. Henceforth, it is referred to as an integrated model depicted in Figure2. Obviously, the integrated model is a single server finite queuing model. For processing a call setup request applies the SWSSD algorithm, which produces two deterministic call setup times D
h and D
m as a consequence of hit and miss, respectively. Therefore, the Kendall-Lee notation for representing the model is follows: (4)
M
/
D
/
1
:
F
C
F
S
/
∞
/
∞
.Figure 2
Integrated model.It is assumed that the customer (call setup request) arrival rate follows Poisson distribution with parameterλ denoted by M whereas D is a deterministic service time (call setup time) as defined below: (5)
D
=
D
h
,
i
f
r
e
c
o
r
d
i
s
a
v
a
i
l
a
b
l
e
i
n
V
L
R
h
i
t
D
m
,
o
t
h
e
r
w
i
s
e
m
i
s
s
.Obviously, an analytical solution cannot be found for computing average waiting time of call setup requests in queue and it is to be determined through simulation.


## 7. Simulation

The simulation of the integrated model generates an artificial history of system facilitating the measurement of throughput of a MSC. The entities considered for developing simulation model are mobile stations and Mobile Switching Centre. The mobile stations are represented by their unique identities, MSISDNs. The call setup requests from MSISDNs are the customers. The Mobile Switching Centre (MSC) is a server. A set of mobile stations registered with a service provider constitute the calling population source from which call setup requests are received.In GSM network, the profiles of MSISDNs comprising several attributes are stored in HLR at Gateway Mobile Switching Centre (GMSC). The profiles of MSISDNs in the service area of a MSC are stored in VLR. Whenever an MSISDN profile is not available in VLR for processing its call setup request, its profile is fetched from HLR. The deletion of the profile of an MSISDN from VLR depends on the sliding window algorithm.The metric employed evaluating the performance of a MSC using integrated model is throughput considering waiting time in queue would be more realistic. Equations (6) and (7) define the average waiting time in the system and throughput, respectively; (6)
A
W
T
S
=
W
q
+
D
N
o
.
o
f
c
a
l
l
s
e
t
u
p
r
e
q
u
e
s
t
s
,where AWTS is average waiting time in system, W
q is average waiting time in queue, D is a deterministic service time, and D
=
{
D
h, if record is available in VLR; D
m, otherwise}
.Obviously,D
m is greater than D
h as the relevant record is to be fetched from HLR in case of its nonavailability. From the analysis of data pertaining to call setup times of Telephone Regulatory Authority of India (TRAI), D
h and D
m are assigned 3 and 7 seconds, respectively.The reciprocal of average waiting time in system is throughput shown in(7)
T
h
r
o
u
g
h
p
u
t
T
P
=
1
A
v
e
r
a
g
e
w
a
i
t
i
n
g
t
i
m
e
i
n
s
y
s
t
e
m
.The simulation is performed using TN3270 emulator for IBM (zSeries) mainframe on windows platform with z/OS IBM mainframe operating system and DB2 database server. The notations and input parameters of simulation are shown in Table1.Table 1
Simulation parameters.
Symbol
Description
Value
N
Simulation run length in days
1001
M
Calling population size
88243
C
Ordered set of calling population
M
S
I
S
D
N
i
∈
∣
1
≤
i
≤
88243
λ
Parameter of Poisson distribution, that is, mean number of call setup requests per day
87
1/μ
Parameter of exponential distribution
0.02
D
h
Call setup time in case of record available in VLR
3
D
m
Call setup time in case of record unavailable in VLR
7
WS
Sliding window size in days
7The output of simulation for 88243 call setup requests over 1001 days is presented in Table2. A call setup request has three attributes, namely, calls per day, MSISDN requesting call setup, and interarrival (time between two successive call setup requests) shown in columns (2), (3), and (4), respectively. The number of call setup requests per day is a random variate from Poisson distribution with parameter λ = 87.Table 2
Simulation results.
Call setup request number(i
)
⁢Call setup request attribute values
⁢Service time attribute values
Arrival time
(
A
T
i
)
Service begins
(
S
B
i)
Serviceends
(
S
E
i
)
Waiting time in queue
(
W
T
Q
i
)
Waiting time in system
(
W
T
S
i
)
Day
(
D
i
)
MSISDN
Interarrivaltime
(
I
A
T
i
)
Hit(yes/no)
(
S
I
D
A
i
)
Call setup time
(
S
T
i
)
(
1
)
(
2
)
(
3
)
(
4
)
(
5
)
(
6
)
(
7
)
(
8
)
(
9
)
(
10
)
(
11
)
1
1
65
93
No
7
0
0
7
0
7
2
1
73
41
No
7
93
93
100
7
14
3
1
23
22
No
7
134
134
141
100
107
4
1
47
48
No
7
156
156
163
141
148
5
1
74
87
No
7
204
204
211
163
171
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
88242
1001
41
5
Yes
3
3298
3298
3301
3284
3287
88243
1001
17
29
No
7
3303
3303
3310
3301
3308A discrete uniform random variate represents the attribute MSISDN and its interarrival time is a random variate from an exponential distribution with parameter1
/
μ
=
0.02
.The SWSSD algorithm performs, whenever a subscriber arrives and makes a call setup request, the MSC checks its database to determine whether the record is available at its VLR. and If it is available, it returns “yes”; otherwise, it returns “no” shown in column (5). Accordingly, call setup service times are 3 and 7 for hit and miss, respectively, shown in column (6): (8)
A
T
i
=
0
f
o
r
i
=
1
A
T
i
-
1
+
I
A
T
i
f
o
r
i
>
1
,
(9)
S
B
i
=
m
a
x
A
T
i
,
S
B
i
-
1
,
(10)
S
E
i
=
S
B
i
+
S
T
i
,
(11)
W
T
Q
i
=
S
B
i
-
A
T
i
,
(12)
W
T
S
i
=
S
E
i
-
A
T
i
.The arrival time (A
T
i) with respect to each call setup request is computed using (8) shown in column (7). Service Beginning Time (S
B
i) and Service Ending Time (S
E
i) with respect to each call setup request are computed using (9) and (10), respectively, shown in column (8) and column (9).The waiting time in queue (W
T
Q
i) and waiting time in system (W
T
S
i) for each of the 88243 call setup requests over 1001 days are computed and represented graphically in Figures 3, 4, and 5, respectively; (13)
A
W
T
Q
=
∑
W
T
Q
i
N
,
(14)
A
W
T
S
=
∑
W
T
S
i
N
.Further, the numbers of hits are determined for each of the 143 blocks when the call setup requests are processed by employing sliding window of size seven days algorithm [4] for over a period of 1001 days. This model partitions the sliding window into seven blocks and maps onto seven days. The call setup request for each block of seven days is aggregated. The performance metrics such as hits, average call setup time, and throughput are computed for each block and the same is briefed in Table 3, when the call setup requests are processed by employing integrated model considering the waiting time in queue and service times are determined for each of the 143 blocks. Performance metrics such as average waiting time in queue, average waiting time in system, and realistic throughput are presented in Table 3 and the corresponding graphical representations are shown in Figures 6 and 7.Table 3
Aggregated simulation results for each block.
Period/blocks
Call setup requests
Hits
⁢Sliding window algorithm
⁢Integrated model
Average call setup time
Throughput
Average waiting time in queue(AWTQ)
Average waiting time in system(AWTS)
Throughput
1–7
621
318
4.951691
0.2019
31.8776
31.9178
0.03133
8–14
549
262
5.091075
0.1964
39.1165
39.1621
0.02553
15–21
631
239
5.484945
0.1823
32.0570
32.1030
0.03115
22–28
616
244
5.415584
0.1846
31.5487
31.5957
0.03165
⋮
⋮
⋮
⋮
⋮
⋮
⋮
⋮
988–994
638
241
5.489028
0.1821
33.5109
33.5501
0.02806
995–1001
629
206
5.689984
0.1757
31.9793
32.0445
0.03120Figure 3
Waiting time in queue over 1001 days.Figure 4
Waiting time in system over 1001 days.Figure 5
Throughput over 1001 days.Figure 6
Call setup time in system versus blocks at a MSC.Figure 7
Throughput versus blocks at a MSC.The performance metrics, average waiting time in queue (AWTQ) and average waiting time in system (AWTS) computed using (13) and (14), are 32.4552 and 32.5062, respectively. Accordingly, the throughput of a MSC is 0.03097 which is a reciprocal of AWTS, whereas the throughput of SWSSD algorithm without considering waiting in queue at a MSC is 0.18345.It is evident that the throughput of the proposed integrated model which considers waiting time in queue at a MSC is decreased by 83.12% for a single-channel MSC; it is a realistic measurement of throughput.


## 8. Conclusions

This study has proposed a realistic model for measuring throughput of a MSC integrating the sliding window algorithm with a single server finite queuing model. The sliding window algorithm minimizes the average call setup processing time and a single server finite queuing model determines the average call setup request waiting time in the queue. Hence, the reciprocal of the sum of average call setup processing time and average call setup request waiting time in the queue is more realistic average throughput of a MSC under consideration. This model facilitates determining an optimal sliding window size.However, the model assumes a MSC with a single channel for processing call setup requests. It is worth attempting to develop a model considering a MSC with multiple identical channels for processing concurrently multiple call setup requests for measuring still more realistic throughput of a MSC. Further, it facilitates formulating a cost model for determining an optimal number of channels with the criterion of maximizing throughput of a MSC. The study in this direction is under progress.



---

*Source: 2061347-2016-10-13.xml*