Performance Analysis for Queueing systems with close
down periods Subject to Catastrophe
B Thilaka1, B Poorani
2 *and S Udayabaskaran
3
1 Sri Venkateswara College of Engineering, Sriperumbudur
2 KCG College of Technology, Karapakkam
3Vel Tech Dr R.R &Dr S.R Technical University, Avadi
Email : 1: [email protected] , 2*: [email protected] and 3: [email protected]
Abstract—A single server queue with Poisson arrival and exponential service times subject to maintenance of the server, close down
period and catastrophes is considered, wherein catastrophes occur only when there are customers in the system and they wipe out the
entire system resulting in the system being rendered inactive for a random period of time. Explicit expressions for the transient
probabilities of the close down period, maintenance state and system size have been obtained. The corresponding steady state analysis
and performance measures are also obtained. The effects of various parameters on the system performance measures are studied using
numerical examples.
Keywords: Catastrophe, close down state, maintenance state, transient probabilities, steady state probabilities.
1.Introduction
The study of Queueing system has generated a lot of interest fundamentally due to the fact that Queueing systems have a wide range of
application in wireless networks, Telecommunication networks etc. A comprehensive over view of the fundamental techniques and classical
results in queueing theory are given in the monographs by Bertsekas and gallager (1987), Takagi (1991), Daigle (1992), Gelenbe and Pujolle
(1998), Chan (2000), Hayes and Ganesh Babu (2004), and Giambene (2005)Wireless communications is one of the fastest growing segments of
the communication industry. WiMAX evolved to satisfy the need of having a wireless internet access and other broadband services which work
well in those areas where it is difficult to establish wired infrastructure and economically not feasible.
The IEEE 802.16 standard is for the air interface between subscriber stations and a base station (BS). An amendment to the standard,
IEEE 802.16e, expands the IEEE 802.16 standard to allow for subscriber stations to move around. On account of the mobility of subscriber
stations, the idea of power saving is a very significant issue for the battery-powered mobile stations [MSs]. The IEEE 802.16 e standard defines
sleep mode and idle mode operations on MAC layer to save the energy of the MSs.Sleep Mode is the state in which the MS conducts pre-
negotiated periods of absence from the Serving Base Station air interface. Sleep Mode is intended to minimize MS power usage and minimize
the usage of the serving Base Station air interface resources. Idle mode benefits the MS by removing the requirement for handoff and other
normal operations and benefits the network and base station by eliminating air interface and network handoff traffic from essentially inactive
MSs while still providing a simple and tidy method for alternate the MS about pending DL traffic.
Several researchers have developed analytical models and obtained the performance of the sleep mode operations in the IEEE 802.16e system
(see Seo, Lee, Park, Lee, and Cho (2004); Xiao (2005); Zhang and Fujise( 2006); Dong, Zheng, Zhang, and Dai (2007);Zhang (2007);Lei and Nilsson
(2007); Turek, De Vuyst,Fiems, and Wittevronged (2008); Hwang, Kim, Son, and Choi (2009,2010); Baek, Son, and Choi (2011); Huo, Jin, and Wang
(2011)). Han and Choi (2006) modeled the BS as a continuous time finite-capacity queue with a Poisson arrival process and deterministic service times
and obtained expressions for the average packet delay and average energy consumption by the MS. Kim, Choi, and Kang (2008) have analyzed the
power consumption and average delay for both uplink and downlink traffic by focusing on sleep mode duration in the IEEE 802.16e. Han, Min, and
Jeang (2007) have used a simple train model for incoming traffic flow for the PSC I and PSC II in the IEEE 802.16e standard. Baek and Choi (2011)
have determined the average message delay and the average power consumption of an MS by using non-Markovianqueueing system. Krishna Kumar,
Anbarasu and Anantha Lakshmi (2013) have analyzed the transient analysis of a single server queueing system with the server under maintenance and
close down period according to the operating mechanism of the sleep mode of MS and the buffer content at the BS in the IEEE 802.16e standard.
An important aspect in the dynamics of communication networks is the study of dramatic but relatively infrequent events that result in abrupt
and often catastrophic changes in the network state. Such catastrophic events are commonly regarded to as phase transition. Dabrowski (2017) gives a
survey of research phase transition in communication networks and discuss characteristics of real-world communication networks that need to be
included in network models to improve their realism. When a catastrophe occurs, it invariably paralyses/ destroys the systems and the system needs to
start fresh. Examples of causal agents are computer viruses (Pastor-Satorras and Vespignani (2001); Moreno, Pastor-Satorras and Vespignani (2002);
Zou, Towsley, and Gong (2007)), events that cause site failure, which propagate through a network (Motter and Lai (2002); Moreno, Gomez, and
Pacheco (2002); Watts (2002); Zhao, park, and Lai (2004); Lee et al. (2005)), and increase in network-wide load and its congestive effects (Sole and
Valverde (2001); Arrowsmith et al., (2004); Ehentique, Gomes-Gardeness and Moreno (2005); Mukherjee and Manna (2005)).
International Journal of Pure and Applied MathematicsVolume 119 No. 7 2018, 39-57ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version)url: http://www.ijpam.euSpecial Issue ijpam.eu
39
This has motivated us to investigate and analyze the behavior of a single server Markovianqueueing system with the server under
maintenance and the close down period according to the operating mechanism of the sleep mode of MS and buffer context at the BS in the IEEE
802, subject to phase transition. This paper is organized as follows: The mathematical model is described and explicit expressions for the
transient probabilities of the system are focused in section 2 through the approach of integral equations; the Mean of the First-passage-time to
reach the Maintenance state is obtained in section 3. Steady state probabilities of the system are derived in section 4. Some key performance
measures under steady state conditions are listed out in section 5. Numerical examples are explained to illustrate the effect of system parameters
on the performance measures in section 6. Finally section 7, completes the article
2.Model description and analysis
Consider an M/M/1 queueing system with infinite waiting room capacity. The arrivals follow a Poisson process with arrival rate
while the service times are exponentially distributed with mean
1. Once the server completes the services of all customers in the system, the
system enters a close down state (sleep state) D. The close down period is assumed to be exponentially distributed with mean
1. If any new
customer arrives into the system during the close down period, the close down period is interrupted and the server resumes service. If no
customer arrives into the system for the entire duration of the close down period, then the system enters the preventive maintenance state M. The
server remains in the preventive maintenance state for a random duration which is exponentially distributed with mean
1. Any customer
arriving to the system during the preventive maintenance state will not be allowed to join the system and will be lost forever. Once the
maintenance of the server is completed, the server returns to its functioning state (active state), ready to serve new customers. Customers arrive
into the system as a Poisson process with rate , during the working state (on state), which consists of the idle period, busy period and close
down period. Catastrophes are assumed to arrive as a Poisson process with rate . Once a catastrophe strikes the system, all the customers are
wiped out from the system and the system enters the maintenance state.
Let )(tX denote the number of customers in the system at time t when the server is in active state. Let )(tJ denote the state of the
server at time t. Then ...2,1,0)( tX and
.int
,
,
)(
stateenancematheinisservertheifM
statesleeptheinisservertheifD
stateactiveinisservertheifA
tJ
The joint process 0),(),( ttJtX is Markov. The state space of the system is given by
,...,2,,1,,0,0,,0 AAAMD
For brevity, the states D,0 and M,0 are denoted by D and M respectively; and the states ,...2,1,0,, nAn are
simply denoted by 0,1,2,…
The state transition diagram is given below:
Let ...2,1,0,)(),( nntXPtnP denote the system size probabilities that there are n customers in the system at time t
when the server is in active state, MtXPtMP )(),( be the probability that theserver is in maintenance state (and that there is no
International Journal of Pure and Applied Mathematics Special Issue
40
customer arriving to the state) at time t, and DtXPtDP )(),( be the probability that the server is in close down period at time '' t .
Using Probability laws, we derive the following integral equations,
t
n
ut
t
ut dueunPdueuDPtMP0 1
)(
0
)( )1.2(),(),(),(
t
ut dueuPtDP0
))(( )2.2(),1(),(
)3.2(),(),0(0
)(
t
utt dueuMPetP
t
utut
t t
ut dueuPdueuPdueuDPtP0
))(())((
0 0
))(( )4.2(),2(),0(),(),1(
)5.2(2,),1(),1(),( ))((
0 0
))((
ndueunPdueunPtnP ut
t t
ut
Taking Laplace Transform of (2.1)… (2.5), we obtain
)6.2(),(),(),( *
1
** snPs
sDPs
sMPn
)7.2(),1(),( ** sPs
sDP
)8.2(),(1
),0( ** sMPss
sP
)9.2(),2(),0(),(),1( **** sPs
sPsDPs
sP
)10.2(...3,2,),1(),1(),( ***
nsnPs
snPs
snP
Let n
n
n ztPtCtVtzP )()()(),(0
be the p.g.f and )()( tXEtm be the mean number of customers in the system at
time t.
The Laplace transform of the generating function of ),( tzP
)11.2(),(),(),(),(0
**** n
n
usnPsMPsDPsuG
From equations (2.6)-(2.10), we have
)12.2(
)(
),1(),0(),(),0(),(),(),(
2
***2****
usu
suPsPsDPusPsMPsDPsuG
International Journal of Pure and Applied Mathematics Special Issue
41
The Zeros of
0)(2 usu
are
2
4)()(
2
4)()( 2
2
2
1
ssand
ss
The zeros satisfy the condition that 21 10
Invoking the analyticity of ),(* suG, we have
0),1(),0(),( ***2 suPsPsDPu
)13.2(),1(
),0(),(1
***
sPsPsDP
On substituting (2.13) in (2.12),
)14.2(),1(),0(),(),(),( *
1
1
1
**** sPusPsMPsDPsuG n
n
n
Comparing (2.11) and (2.14), we get
)15.2(....3,2,),1(),( *
1
1
*
nsPsnP
n
Using (2.15) in (2.9),
)16.2(),0(),(),1( **1* sPsDPsP
Inversion of equation (2.16) gives,
)17.2(t)P(0,t)P(D,©)2(
),1( 1)(
t
tIetP t
(.)nI is the modified Bessel modified function of order n (see Watson (1962)),
where we have used the formula (see Abramowitz and Stegun)
n,convolutiodenotes©andwhere
International Journal of Pure and Applied Mathematics Special Issue
42
t
tIssL n
nn
)2(
2
4)( 22
1
Using equation (2.7) & (2.8), equation (2.16) can be written as,
)18.2(11
),1(11*
ssP
1
1
11
))(())()(( n
n
sssssswhere
Equation (2.6), (2.7) & (2.8) can be written in terms of (2.18),
)19.2()(1
1
2
4)()(
),(*
2
* asH
s
ss
ssDP
)19.2()(1
1
),1(*
1
* bsH
ssP
)19.2()(1
11
),(*
1
1
11
* csH
ssssssMP
n
n
)19.2()(1
1
),(*
1
* dsH
ssnP
n
1
111*
))(())()(()(
n
n
sssssssHwhere
By taking inversion,
)20.2(e©)())((
©),( )u(-
0
(n)©1))((
0
1-)( aduuHut
utIeetDP
n
ut
t
ut
International Journal of Pure and Applied Mathematics Special Issue
43
)20.2(e©)())((
),1( u-
0
(n)©1))((
0
1- bduuHut
utIetP
n
ut
t
)20.2(e©)())((
e©))((
e©e©),(
u-
0
(n)©))((
0
u)-t(-)(1))((
0
1-u)-t(-u)-)(t(-)(
cduuHut
utIen
eut
utIeetMP
n
nut
n
n
utut
t
ut
)20.2(e©)())((
),( u-
0
(n)©))((
0
n- dduuHut
utIetnP
n
nut
t
)20.2())((
e©
))((e©e©e
))((©e)(
)(
0
-
0
1)(
0
1---)u(-1))((
0
1-u)-)(t(-
eduut
utIene
duut
utIedu
ut
utIetH
nu
n
nuu
t
u
t
uuut
t
At ,0 the results of Krishna Kumar et al., (2013) are obtained as a special case.
3. Mean of First-Passage-time to reach the Maintenance state
The first-passage-time problems for queueing systems have been widely studied because of its application (Keilson 1979). Let
E(L) denote the first-passage-time to reach the maintenance state M,
The Laplace transform of (2.19c) is Consider the equation (2.19a),
),1(),1(),( *
1
1** sPs
sPss
sMP
n
n
)1.3(1
),(0
11
1
1*
n
n
n
n ssssssMP
)2.3(
41
1
41
1
41
)),(()(
22
2
2
222
0
*
sds
sMsPdLE
,0If
International Journal of Pure and Applied Mathematics Special Issue
44
)4.3(2
4)()( 2
where
At ,0 the results of Krishna Kumar et al., (2013) are obtained as a special case.
4. Steady state analysis
We study the behaviour of the steady state probabilities of the system size, the close down state probability and maintenance
state probability of the server for our queueing system.
Theorem:
,0,0, andFor the steady state probabilities of the system size ...2,1,0: nPn ,the close down probability
PD and the probability PM of the server under maintenance state of the queueing system subject to catastrophe are obtained as
)1.4(
1
1
111
1
DP
)2.4(
1
1
111
1
1
MP
)3.4(
1
1
111
1
1
0
P
)4.4(...3,2,1
1 nPP n
n
)5.4(11
11
1
1
P
Proof:
,00, andFor
From equation (2.16),
),0(),(),1( **1* sPsDPsP
International Journal of Pure and Applied Mathematics Special Issue
45
Now using the Tauberion theorem (Widder 1946), we get
𝑃1 = lim𝑠→0
𝑠
𝜆
𝜇
2
4)()( 2 ss
𝑃∗ 𝐷, 𝑠 + 𝑃∗(0, 𝑠)
0
2
12
4)()(PPP D
01 PPP D
)7.4(1
11PPM
)8.4(1
110 PP
)9.4(,..3,2;1
1 nPP n
n
Nowusingthe normalization condition 12
10
n
nMD PPPPP , we find the unknown probability 1P as
1
1 11
11
P
Hence equations (4.6)-(4.9) determine the steady state probability PD of the close down state, the steady state probability PM of the
server under maintenance state and the steady state probabilities ...2,1,0: nPn of the system size under the influence of catastrophe.
At ,0 the results of Krishna Kumar et al., (2013) are obtained as a special case.
5. System performance measures
Now we study some important performance measures, namely mean of the system size, availability of the server, system throughput,
mean waiting time and mean cycle time of the system under steady state condition.
Theorem:
,00, andFor then the steady state probability generating function )(zP of the number of customers in the
system is given by
)1.5(
1)1(11
1
11)1(11
1
1)(
z
zzzz
zzP
The mean )(XE of the system size is obtained as,
)6.4(1PPD
International Journal of Pure and Applied Mathematics Special Issue
46
)2.5(
)1(
1
)1(
1
)1()1(
1
)(
XE
where is as given in (3.4)
IfQ denotes the number of customers in queue, then the steady state probability generating function )(z and mean )(QE are
determined as,
)3.5(
1
1
11
1
1
1
1
1
)()(
z
zEz Q
)4.5(
)1(
1
)1(
1
)1()1(
1
)(
2
QE
and
Proof:
Consider the generating function
n
n
nMD
n
n
n zPzPPPPzP
2
10
0
Substituting the equations (4.1)-(4.4), after some mathematical simplifications we get (5.1). The result (5.2) is derived directly from
(5.1) on differentiation with respect to z and substituting z=1.
Consider the generating function
1
1
0)(
n
n
nMD zPPPPz
Substituting the equations (4.1)-(4.4), after some mathematical simplifications we get (5.3). The result (5.4) is derived directly from
(5.3) on differentiation with respect to z and substituting z=1.
Corollary: The second moment )( 2XE and variance )(XVar of the system size, under steady state, are given as
International Journal of Pure and Applied Mathematics Special Issue
47
)5.5(
)1(
1
1)1(
1
)1(
)1(1
)(3
2
XE
And
)6.5(
)1(
1
)1(
1
)1()1(
1
)1(
1
1)1(
1
)1(
)1(1
)(
2
3
XVar
Remark: The mean number )(XE of customers in the system includes the maintenance time when there are no customers in the
system.
The steady state probabilities are
)7.5(
)1(
1
1)1(
1
)1(
1
)(1
n
nPbusyisserverP
)8.5(
)1(
1
1)1(
1
)1(
1
1)1(
1
1)(
MPavailableisserverP
DPParrivaluponyimmediatelservediscustomerP 0)(
International Journal of Pure and Applied Mathematics Special Issue
48
)9.5(
)1(
1
1)1(
1
)1(
1
1
MD PPPstateinorstatedowncloseorstateidleineitherisserverP 0) emaintenanc(
)10.5(
)1(
1
1)1(
1
)1(
1
111
n
nP
)( serviceforwaittohascustomerarrivinganPPw
)11.5(
)1(
1
1)1(
1
1)1(
1
)(1 0
DPP
The probability of at least k or more customers in the system is given as
)12.5(
)1(
1
1)1(
1
)1(
1
1)(
1
1
1
k
k
kn
n PPkXP
The conditional probabilities are:
International Journal of Pure and Applied Mathematics Special Issue
49
)13.5(
)1(
1
1)1(
1
)1(
1
1)/( 1
M
n
n
P
P
availableisseverbusyisserverP
)14.5(
)1(
1
1)1(
1
)1(
1
1
1)/( 0
M
D
P
PPavailableisseveridleisserverP
The conditional probabilities in equations (5.13) and (5.14) depend only on the parameter and, are independent of
the other system parameters.
The conditional expectation of the mean number of customers in the system when the server is available is
MP
XEavailableisserverXE
1
)()/(
)16.5(
1
1
11
1
1
1
2
The conditional probability generation function of the number of customers in the queue is defined as
)17.5(
1
1
11
1
1
1
11
1
)(
zz
z
M
n
n
nDQ
P
zPPP
availableisserverzEzR
1)/()( 1
1
0
International Journal of Pure and Applied Mathematics Special Issue
50
And its conditional expectation is
)18.5(
1
1
11
1
1
1
1
)()/(
2
MP
QEavailableisserverQE
At ,0 the results of Krishna Kumar et al., (2013) are obtained as a special case.
System Throughput and other Characteristics:
We now introduce the following notations: Let U be the system throughput, the rate at which customers exit the queue; eff , the
effective arrival rate when the server is available; )( sWE , the mean queueing /sojourn time in the system when the system is available;
)( qWE , the mean waiting time in the queue when the system is available; )(TE , the mean cycle time of the system and )(NE , the
expected number of customers served during the busy period. The following theorem summarizes the results:
Theorem:
,00, andFor Under steady state,
)19.5(
1
1
11
1
1
1
U
Proof:
The system throughput, U is the rate at which customers exit the queue whenever there are one or more customers in the system, with
the exit rate
DM PPPU 01
Using equations (4.1)-(4.3),we get (5.19)
The effective arrival rate eff (the total arrival rate when the server is available) is defined as
International Journal of Pure and Applied Mathematics Special Issue
51
1
1
11
1
11
1
1
0
n
nDeff PPP
Remark:
At ,0 the results of Krishna Kumar et al., (2013) are obtained as a special case.
Numerical illustrations
We use the performance characteristic and probability descriptors obtained previously to study numerical results and to perform
sensitivity analysis on 0P ,the steady state probability that no customers in the system; ,U the system throughput; ,MP the probability that the
server is under maintenance state; ,DP the probability that the server is under close down period; ,wP the steady state probability that an
arriving customer has to wait for service; ),(XE the expected number of customers in the system when we vary the values of the system
parameters. All the parametric values are chosen so as to satisfy the stability condition .00,0, and
2.1 0 foroffunctionaasPFigure 4.2 0 foroffunctionaasPFigure
In figures 1 and 2, we represent the behavior of the probability 0P as a function of and , respectively, for different values of .
We have plotted curves for various values of . Clearly, figures 1 and 2 show that 0P increases smoothly for increasing values of and
whereas it decreases with increasing values of .
2.3 foroffunctionaasUFigure 4.4 foroffunctionaasUFigure
International Journal of Pure and Applied Mathematics Special Issue
52
Figures 3 and 4 illustrate the impact of , and on the system throughputU . Here U is an increasing function of . Further, for a
fixed value of , the system throughputU increases values of increase as reflected in figure 3. Figure 4 reveals that U is decreasing slowly
for increasing values of but, for fixed value of , it is increasing for increasing values of as expected.
2.5 foroffunctionaasPFigure M 4.6 foroffunctionaasPFigure M
Figures 5 and 6 indicate the nature of variation of the probability MP . Specifically, from Figure 5, it is observed that MP is a
decreasing function of η whereas for ρ there can be seen to be two types of behaviour: the probability MP of the server under maintenance
state increases from ρ = 0.1 to ρ = 0.3 attaining the maximum at ρ = 0.3 for a fixed value of whereas the probability MP decreases as ρ
becomes high. A possible explanation for the phenomenon is as follows. The arrival rate being very small in the interval ρ = [0.1, 0.3], it results
in the close down period of the system ending with almost negligible arrival rate. Thus, the server goes immediately for the maintenance state
with high probability. In Figure 6, the curves show that the probability MP is an increasing function of whereas, for a fixed value of , it
decreases for increasing values of ρ except for the cases ρ = 0.1 to ρ = 0.3 as before.
2.7 foroffunctionaasPFigure D 4.8 foroffunctionaasPFigure D
In figures 7 and 8, we have plotted the close down probability DP as a function of and , respectively, for different offered loads
. Figures 7reveals that the probability DP increases smoothly for increasing values of whereas for fixed values of , it decreases
gradually for increasing values of except 1.0 . This is due to the fact that the close down period probability DP decreases and the
length of close down period has little influence for higher offered loads .However, for the case 1.0 the offered load is very small, so
that the close down probability becomes somewhat large. From Figure 8, it is clear that initially there is a steep decrease in the probability DP
International Journal of Pure and Applied Mathematics Special Issue
53
for increasing values of and further it decreases slowly for increasing values of except 1.0 as noted before.
2.9 foroffunctionaasPFigure w 4.10 foroffunctionaasPFigure w
The influence of the parameters and on the probability wP is displayed in figure 9 and 10. In figure 9, it appears that as
increases, the probability wP decreases slowly whereas it increases always for increasing values of . Figure 10 shows the behavior of the
probability wP against . The probability wP increases always with increasing values of both and
2)(.11 foroffunctionaasXEFigure 4)(.12 foroffunctionaasXEFigure
The effects of and on the mean number )(XE of customers in the systems are represented in Figures 11 and 12, respectively, for
various values of . Figure 11 shows that )(XE is an increasing function of both and , which is a quite natural. But in figure 12,
)(XE decreases for increasing values of , for a fixed value of , it is increasing for increasing value of , which is counterintuitive.
7. Conclusion:
In this article, we have investigated a single server queuing system with close down period and server under maintenance subject to
catastrophes. Explicit expressions for the transient probabilities of the system size, the server under maintenance state and the close down period
are obtained. Further the mean first-passage-time to reach the maintenance state has been derived. The results of Krishna Kumar et. al.,(2013)
have been deduced as a special case in all the above. Under the steady state condition, the corresponding probabilities and some interesting
performance measures, namely, mean of the system size, availability of the server, system throughput and mean waiting time of an arbitrary
customer in the system have been obtained. Finally, graphical illustrations have been presented and the effects of various parameters in the
system performance measures are studied.
International Journal of Pure and Applied Mathematics Special Issue
54
References
Abramowitz, M. Stegun, I.A. (1972). Handbook of Mathematical Functions. New York: Dover Publications
Arrowsmith, D. Mondragón, R. Pitts, J. Woolf, M. (2004). Phase Transitions in Packet Traffic on Regular Networks a comparison of
source types and topologies. Report 08, InstitutMittag-Leffler.
Baek, S. Choi, B.D. (2011).Performance of an Efficient sleep Mode Operation for IEEE 802.16m. Journal of Industrial and
Management Optimization, 7(3):623-639.
Baek, S. Son, J.J. Choi, B.D. (2011). Performance Analysis of Push –To-Talk over IEEE 802.16e with Sleep Mode and Ideal Mode.
Telecommunication Systems 47: 291-302
Bertsekas, D.Gallager,R. (1987). Data Networks, Englewood Cliffs: Prentice Hall.
Dabrowski C (2015). Catastrophic Event Phenomena in Communication Networks: A Survey, Computer Science Review, 18:10-45
Daigle, J.N (1992). Queueing Theory for Telecommunications. Boston, MA: Addision-Wesley.
Dong, G. Zheng, C.Zhang, H. Dai, J. (2007). Power Saving Class I Sleep Mode in IEEE 802.16e System. Advanced Communication
Technology 3: 1487-1491.
Ehentique P, J. Gomez-Gardenes . Moreno, Y. ( 2005). Dynamics of jamming transitions in complex networks.Europhysics Letters.
71(2):056105-1‒ 056105-4.
Gelenbe, E.Pujolle, G. (1998). Introduction to Queueing Networks.Chichester: Wiley.
Giambene, G. (2005). Queueing Theory and Telecommunications: Networks and Applications. New Delhi: Springer.
Han, K. Choi, S. (2006). Performance Analysis of Sleep Mode Operation in IEEE 802.16e Mobile Broadband Wireless Access
Systems.In Proceedings IEEE VTC 2006-Springer. 3: 1141-1145.
Han, Y.H. Min, S.G. Jeang, D. (2007). Performance comparison of Sleep Mode Operation in IEEE 802.16e Terminals.In Lecture Notes
in Computer Science. 4490: 441-448.
Hayes, J.F. Ganesh Babu, T.V.J. (2004).Modeling and Analysis of Telecommunication Networks.John Wiley and Sons.
Huo, Z. Jin, S. Wang, Z. (2011).Performance Analysis and Evaluation for Sleep- Mode With Uplink/downlink Traffic in IEEE 802.16e
Network. Journals of Networks. 6(8): 1145-1152.
Hwang, E. Hyun, Y. Kim, K.J. Son, J.J. Choi, B.D. (2009). Performance Analysis of Power Saving Mechanism employing Both Sleep
Mode and Idle Mode in IEEE 802.16e. IEICE Transactions on Communications. E92-B: 2809-2822.
Hwang, E. Kim, K.J. Son, J.J. Choi, B.D. (2010). The Power Saving Mechanism With Periodic Traffic Indications in the IEEE 802.16e/m. IEEE
Transactions on Vehicular Technology. 59: 319-334.
Kelison, J. (1979). Markov Chain Models-rarity and Exponentiality. New York: Springer.
Kim, M.G. Choi, J.Y. Kang, M. (2008).Trade-off Guidelines for Power Management Mechanism in the IEEE 802.16e MAC.Computer
Communication. 25: 2063-2070.
Krishna Kumar, B. Anbarasu, S. Anantha Lakshmi, S.R. (2013). Performance Analysis for Queueing Systms with Close down period
and Server under Maintenance.International Journal of Systems Science. 46(1): 88-110.
Lee, E. Goh, K. Kahng, B. Kim, D. (2005). Robustness of the avalanche dynamics in data packet transport on scale-free networks.
Physical Review E. 71: 056108-1−056108-4.
Lei, H. Nilsson, A.A. (2007). Queueing Analysis of Power Management in the IEEE 802.11 Based Wireless LANs. IEEE Transactions
on Wireless Communications. 6(4): 1286-1294.
Motter, A. Lai, Y. (2002).Cascade-based attacks on complex networks. Physical Review E. 66: 065102-1−065102-4.
Moreno, Y. Gomez, J. Pacheco, A. (2002). Instability of scale-free networks under node-breaking avalanches.Europhysics Letters.
58(4): 630–636
Moreno, Y. Pastor-Satorras, R. Vespignani, A. (2002). Epidemic outbreaks in complex heterogeneous networks. European Physical
Journal B. 26: 521–529.
Mukherjee, G. Manna, S. (2005). Phase transition in a directed traffic flow network. Physical Review E. 71:066108-1−066108-6.
International Journal of Pure and Applied Mathematics Special Issue
55
Pastor-Satorras, R. Vespignani, A. (2001).Epidemic dynamics and endemic states in complex networks. Physical Review E. 6: 066117-
1−066117-8.
Seo, J. Lee, S. Park, N. Lee, H. Cho, C. (2004). Performance Analysis of Sleep Mode Operation in IEEE 802.16e. In IEEE VTC 2004-
Fall. 2: 1169-1173.
Solé, R. Valverde, S. (2001). Information transfer and phase transitions in a model of internet traffic.Physica A Statistical Mechanics
and its Applications. 289: 595–605.
Takagi, H. (1991). Queueing Analysis: A Foundation of Performance Evaluation, Vol. I: Vacation and Priority Systems: Part I,
Amsterdam: North-Holland Publishing co.
Turek, K.D. De Vuyst, S. Fiems, D. Wittevronged, S. (2008). Performance Analysis of the IEEE 802.16eSleep Mode for Correlated
Downlink Traffic.Telecommunication Systems. 39: 145-156.
Wah Chun Chan. (2000).Performance Analysis of Telecommunications and Local area networks: New York. Kluwar Academic
Publishers.
Watson, G.N. (1962). A Treatise on the Theory of Bessel Functions, Cambridge: Cambridge University Press.
Watts, D. (2002). A simple model of global cascades on random networks.Proceedings of the National Academy of Sciences of the
United States of America. 99(9): 5766–5771.
Widder, D.V. (1946). The Laplace Transform, Princeton: Princeton University Press.
Xiao, Y. (2005). Energy Saving Mechanism in the IEEE 802.16e Wireless MAN.IEEE Communication Letters. 9(7): 595-597.
Zhang, Y. (2007). Performance Modeling of Energy Management Mechanism in IEEE 802.16e Mobile WiMAX. In WCNC 2007:
3207-3211.
Zhang, Y. Fujise, M. (2006).Energy Management in the IEEE 802.16e MAC.IEEE Communication Letters. 10(4): 311-313.
Zhao, L. Park, K. Lai, Y. (2004). Attack vulnerability of scale-free networks due to cascading breakdown. Physical Review E. 70:
035101-1–035101-4.
Zou, C. Towsley, D. Gong, W. (2007). Modeling and Simulation Study of the Propagation and Defense of Internet Email Worm.IEEE
Transactions on Dependable and Secure Computing. 4(2): 105–118.
International Journal of Pure and Applied Mathematics Special Issue
56
57
58
Top Related