SlideShare ist ein Scribd-Unternehmen logo
1 von 9
Downloaden Sie, um offline zu lesen
International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 2014
DOI : 10.5121/ijcnc.2014.6401 01
WEB OBJECT SIZE SATISFYING MEAN WAITING
TIME IN MULTIPLE ACCESS ENVIRONMENT
Y. –J. Lee
Department of Technology Education, Korea National University of Education,
Cheongju, South Korea
ABSTRACT
This paper addresses web object size which is one of important performance measures and affects to
service time in multiple access environment. Since packets arrive according to Poission distribution and
web service time has arbitrary distribution, M/G/1 model can be used to describe the behavior of the web
server system. In the time division multiplexing (TDM), we can use M/D/1 with vacations model, because
service time is constant and server may have a vacation. We derive the mean web object size satisfying the
constraint such that mean waiting time by round-robin scheduling in multiple access environment is equal
to the mean queueing delay of M/D/1 with vacations model in TDM and M/H2/1 model, respectively.
Performance evaluation shows that the mean web object size increases as the link utilization increases at
the given maximum segment size (MSS), but converges on the lower bound when the number of embedded
objects included in a web page is beyond the threshold. Our results can be applied to the economic design
and maintenance of web service.
KEYWORDS
M/D/1 with vacations, M/H2/1, mean waiting time, multiple web access
1. INTRODUCTION
Simultaneous access of multiple users to a server in the web environment increases the mean
waiting delay of an end-user. Therefore, the quality of service (QoS) degradation problem of the
end-user arises. In order to develop a technology for solving this problem, we first should find the
mean waiting delay of the end-user accurately.
Generally, the user's request to the web server per unit time follows the Poisson distribution and
the web service time follows the general distribution instead of the Exponential distribution.
M/G/1 model [1] is known to be suitable to describe a web service. In particular, because web
services are influenced by the size of the web objects, Shi et al [2] presented the result that as a
statistical distribution to describe the web service, Weibull distribution and Exponential
distribution are suitable. Meanwhile, Khayari et. al [3] and Riska et. al [4] have presented an
algorithm to fit the empirical distribution to the Hyper-exponential distribution. When the web
service is given by the Hyper-exponential distribution in the steady state, the research [5] to
obtain the number of concurrent users satisfying the average queueing delay was conducted.
However, more empirical researches for web services distribution related to the Internet are still
needed. Additionally, M/G/1 with vacations model [6, 7, 8, 9] as a modification of M/G/1 model
has proposed.
In the time division multiplexing (TDM), time quantum assigned to each user is slotted so that the
data transmission takes place just only at the starting point of the slot. Therefore, if the system is
empty at the beginning of the slot, the server goes to the vacation state during that time slot. To
International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 2014
2
apply the TDM scheme to the queueing system can be described as an M/D/1 with vacations
model in which the service distribution is given by the constant.
On the other hand, when several users simultaneously request a web object of the packets in the
web server, and the round-robin scheduling for the web service is used, we can determine the
mean waiting time. When the system is in the steady state, we can infer that the mean waiting
time is equal to the mean queueing delay by the M/D/1 with vacations model in the TDM
approximately.
The objective of this study is to find the web object size satisfying that the mean waiting time for
multiple web access environments is equal to the mean queueing delay for M/D/1 with vacations
model in TDM and the mean queueing delay for M/H2/1 model, respectively. We first find the
number of simultaneous users satisfying that M/H2/1 queueing delay is equal to the queueing
delay in TDM. And then we obtain the web object size. The reason to obtain the web object size
satisfying delay constraint of end-user is why the controlling of that is the most economic way in
the design and operation of the web service.
The rest of this paper is structured as follows. In the next section, we discuss the M/D/1 with
vacations model based on Modiano [8] and Bose [6] in TDM and the M/H2/1 queueing model. In
section 3, we first describe the model to find the mean waiting time by round-robin scheduling in
the multiple web access environment. We then determine the web object size satisfying the
constraint that the mean waiting time equal to the mean queueing delay for M/D/1 with vacations
model in TDM and M/H2/1 model, respectively. In section 4, we present and analyze the
performance evaluation results. Finally, in section 5, we discuss the conclusions and future
research.
2. QUEUEING DELAY FOR M/D/1 WITH VACATIONS MODEL AND M/H2/1
MODEL
2.1. Queueing Delay for M/D/1 with vacation Model
We consider a single-server queueing system where object requests arrive according to a Poission
process with rate λ, but service times have a general distribution (M/G/1). By Pollaczek-Khinchin
formula, the expected mean queueing delay is given by (1) [1, 10].
)1(2
)( 2
ρ
λ
−
=
SE
W (1)
where ρ=λ/µ= λE(S). S is the random variable representing the service time and identically
distributed, mutually independent, and independent of the inter-arrival times.
If the service times are identical for all requests (M/D/1), that is E(S2
) = 1/µ2
, equation (1)
becomes (2).
)1(2 ρµ
ρ
−
=W (2)
Now, we consider M/G/1 queueing model with vacations [9]. In this model, when the queue is
empty, the server's vacation time is represented as IID random variable, and independent with
service times and arrival times. When the system is empty after the vacation, the server can take
another vacation. In this model, the arrival distribution at any time t, should be the same as the
length of the queue [7], R is given by (3)
International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 2014
3
)(2
)()1(
2
)( 22
VE
VESE
R
ρλ −
+= (3)
Where, E(V) and E(V2
) are the primary and secondary moment of vacation time, respectively.
From (1), the mean queuing delay of M/G/1 with vacations model is derived as (4).
)(2
)(
)1(2
)(
1
22
VE
VESER
W +
−
=
−
=
ρ
λ
ρ
(4)
Now, consider the time division multiplexing (TDM) system such as Figure 1.
Figure 1. TDM system
Figure 1 shows that the m fixed-length packets with each λ/m arrival rate are multiplexed and
arrive into the system according to the Poisson distribution. Total traffic is λ, the service rate (µ)
is equal to 1/m, and the load on the entire system is ρ = λ. Thus, equation (2) with µ=1/m and ρ = λ
gives the mean queuing delay per packet as (5). This delay represents time in the frequency
division multiplexing (FDM) [10]. Equation (5) can be also obtained by setting E(S) = E(S2
) = 1/µ
= m, and E(V) = m, E(V2
) = 1/µ2
=m2
in (4).
)1(2 ρ
ρ
−
=
m
WFDM
(5)
In the TDM, where m traffic streams are time division multiplexed in a scheme, whereby the time
axis is divided in m-slot frames with one slot dedicated to each traffic stream (Figure 1). Thus the
mean queueing delay in TDM is given by (6) [10].
)1(22 λ−
=+=
mm
WW FDMTDM
(6)
2.2. Queueing Delay for M/H2/1 Model
Generally, web objects are composed of two types: static and dynamic. A static object is one
home page first requested. Dynamic objects (N) are embedded in a home page, and requested
after parsing the homepage. We set the static object request rate as λ1 and the dynamic object
request rate as λ2 respectively. Figure 2 visualizes this case.
Figure 2 represents the Hyper-exponential distribution [11], which chooses the ith
negative
exponential distribution with the rate λi and mean 1/λi. That is, the density function is given by
0)(
2
1
≥= ∑=
−
SepSf
i
S
ii
iλ
λ (7)
The j th
moment is given by
International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 2014
4
∑=
=
2
1
!)(
i
j
i
ij p
jSE
λ
(8)
Figure 2. Graphical representation of web object requests
E(S) and E(S2
) are the first and the second moment of the web object service time, respectively.
They are obtained by (9).
2
2 2
)(
)1(
2
)(
λλ N
SE
N
SE =
+
= (9)
By substituting E(S) and E(S2
) in (1), we obtain the mean queueuing delay for M/H2/1 model in
(10).
NN
N
WH
)1(
1
−
+
=
λ
(10)
3. MEAN WAITING TIME FOR MULTIPLE USERS
We first find out the number of simultaneous users satisfying that M/H2/1 queueing delay(WH) is
equal to the queueing delay in TDM(WTDM). From (6) and (10),
NN
N
mWW TDMH
)1(
)1)(1(2
−
+−
=→=
λ
λ (11)
Now, we consider the mean waiting time when m concurrent users require access to a web object
on a web server.
Web object is divided into multiple packets with a maximum segment size (MSS) by TCP in a
transport layer. Let the web object size to be θ, and MSS to be mss, the relation between the
number of packets (n) and the web object size is given by (12).




=
mss
n
θ (12)
When multiple clients (m) request the same object, each user's expected service time (E(S)) is the
same. However, exact finish time can vary due to the queueing delay; Clients must wait for the
completion of the service.
International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 2014
5
We assume the asynchronous time division multiplexing based on packets for web service. When
a client requests an object from the server, n packets are included in the object. E(S) means total
response time that each client expects. Now, we assume that a packet based round robin
scheduling policy is used in the multiple web access. This situation can be depicted in Figure 3.
Figure 3. Scheduling for multiple web service
In Figure 3, τij represents jth
packet service time of the ith
user. In order to simplify the modeling,
we let τij = τ(∀ i, j), and then we can derive the mean waiting time as (13) [12].
[ ]
2
)12)(1(
)1)(1()(
1
1
τ
ττ
−−
=
−−+−= ∑=
nm
nmmim
m
W
m
i
R
(13)
Now, by assuming that the service time for single packet (τ) is equal to one time slot in the steady
state of the system, we can infer that Figure 1 and Figure 3 will be approximated.
Therefore, we can obtain the number of packets (n) satisfying that mean waiting time by (13) is
equal to the mean queueing delay for M/D/1 with vacations model in the TDM by (6) as (14).
Here, m represents the number of users (m) obtained by (11).
)1)(1(2
)1)(1(
)1(22
)12)(1(
−−
+−−
=→
−
=
−−
→=
m
mm
n
mnm
WW TDMR
λ
λ
λ (14)
In M/H2/1 model, τ= E(S)/n= 2/[n(N+1)λ] when every τ is same. Thus, the number of packets (n)
satisfying that mean waiting time by (13) is equal to the mean queueing delay for M/H2/1 by (10)
is given by (15).
2
)1()1)(1(2
)1)(1(
)1(2
)1(
2
2
)12)(1(
+−−−
−−
=→
−
=
+
×
−−
→=
NNNm
NNm
n
m
Nn
nm
WW HR
λ
λ (15)
From (12), (14) and (15), we can obtain the web object size (θ) satisfying that mean waiting time
for multiple web access environment is equal to the mean queueing delay for M/D/1 with
vacations model and M/H2/1 model, respectively.
International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 2014
6







=×
+−−−
−−
=
×
−−
+−−
=
HR
TDMR
WWformss
NNNm
NNm
WWfor
mss
m
mm
2
)1()1)(1(2
)1)(1(
)1)(1(2
)1)(1(
λ
λ
θ (16)
In (16), for WR = WTDM, m ≥ 2 and λ ≤ 1. For WR = WH , m >1+(N+1)2
/ 2N(N-1).
4. PERFORMANCE EVALUATION
We first compute the number of users (m) varying N by using (11). Figure 4 represents the
number of users when mss = 1460 B for various ρ and N.
In Figure 4, when ρ and N are both small, the number of users is very large, but as N increases,
converges to 1. That is, the imbedded number of objects included in a web page can affect the
simultaneous access number of users. The reason is why the number of users and the number of
embedded objects in a page should be balanced in order to satisfy the given mean queueing delay.
Although it is not presented in the figure, as ρ increases, the number of simultaneous access users
decreases to 1, so we cannot find out the web object size because a denominator has infinite value
in (16).
Figure 4. The number of users (m ) when mss=1460 varying N
Now, we compute the mean web object size (θ) satisfying WR=WTDM and WR=WH respectively for
varying N given ρ and mss. Table 1 shows the mean object size when ρ=0.01. Given mss=1460 B,
mean object size is 1482 B for WR=WTDM and 742 B for WR=WH. When mss=536 B, mean object
size is 544 B for WR=WTDM and 273 B for WR=WH. Therefore, the mean object size when WR=WH
is smaller than when WR=WTDM regardless of mss.
Table 2 and Table 3 show the mean object size when ρ=0.05, ρ=0.1 and ρ=0.2, respectively. In
Table 2 and Table 3, we find also that the mean object size when WR=WH is smaller than when
WR=WTDM regardless of mss. That is, when the web service time has Hyper-exponential
distribution, smaller object web size is required.
International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 2014
7
Table 1. Mean object size (θ) satisfying WR=WTDM and WR=WH for varying N when ρ=0.01
N
WR=WTDM WR=WH WR=WTDM WR=WH
mss=1460 mss= 536
2
3
4
5
6
7
8
9
1470
1473
1476
1480
1483
1487
1491
1495
736
738
739
741
743
745
747
749
540
541
542
543
545
546
547
549
270
271
271
272
273
274
274
275
mean 1482 742 544 273
We define the ratio of the mean object size satisfying WR=WTDM over the mean object size
satisfying WR=WH as (17).
HR
TDMR
WW
WW
r
=
=
=
θ
θ
(17)
Figure 5 depicts the ratio (r) by (17) for varying ρ. The size of mss can not affect the ratio, but ρ
can affect it. The ratio is about 2 when ρ=0.01, however is decreased into 1 when ρ=0.2.
Table 2. Mean object size (θ) satisfying WR=WTDM and WR=WH for varying N when ρ=0.05
N
WR=WTDM WR=WH WR=WTDM WR=WH
mss=1460 mss=536
2
3
4
5
6
7
8
9
1512
1529
1550
1568
1594
1608
1626
1652
761
771
784
795
813
819
830
848
555
561
569
576
585
590
597
607
279
283
288
292
298
301
305
311
mean 1580 803 580 295
Table 3. Mean object size (θ) satisfying WR=WTDM and WR=WH for varying N when ρ=0.1
N
WR=WTDM WR=WH WR=WTDM WR=WH
mss=1460 mss=536
2
3
4
5
6
7
8
9
1572
1615
1657
1703
1744
1811
1947
1947
799
831
858
890
917
979
1143
1118
577
593
608
625
640
665
715
715
293
305
315
327
337
359
420
411
mean 1750 942 642 346
International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 2014
8
Figure 5. The ratio of mean object size satisfying WR=WTDM over the mean object size satisfying WR=WH
for varying ρ
5. CONCLUSIONS
Mean object size in the multiple access environments is one of essential parameters to design and
maintain the web service. To control the web object size is easy and very cheap maintenance
method in order to satisfy the delay requirement of end-users. In this paper, we present an
analytical model to estimate the web object size satisfying that the mean waiting time for multiple
web service is equal to the mean queueing delay for the M/D/1 with vacations model in TDM
system and the mean queueing delay for M/H2/1 model, respectively. We first find out the
number of users access web server simultaneously, and then derive the web object size models.
Performance evaluations show that mean object size satisfying the M/D/1 with vacations model in
TDM system is larger than that satisfying M/H2/1 model, however the mean object size becomes
the nearly same the utilization factor increases. Future works include more exact model applicable
to the wire and wireless integrated network.
REFERENCES
[1] S. Ross, Introduction to probability model, Academic press, NewYork, 2010, p. 538, USA.
[2] W. Shi, E. Collins, and V. Karamcheti, “Modeling Object Characteristics of Dynamic Web
Content,” Journal of Parallel and Distributed Computing, Elsevier Science, pp. 963-980, 1998.
[3] R. Khayari, R. Sadre and B. R. Haverkort, “Fitting world-wide web request traces with the EM-
algorithm, Performance Evaluation,” Vol. 52, pp. 175-191, 2003.
[4] A. Riska, V. Diev and E. Smirni, “Efficient fitting of long-tailed data sets into hyper-exponential
distributions,” Proc. of IEEE Global Telecommunications Conference (GLOBECOM 2002), Vol.
3, pp. 2513-2517, 2002.
[5] Y. Lee, “Mean waiting delay for web service perceived by end-user in multiple access
environment,” Natural Science , vol. 2, Natural Science Institute of KNUE, pp. 55-58, 2012.
[6] S. K. Bose, “M/G/1 with vacations,” http:// www.iitg.ernet.in/skbose/qbook/Slide_Set_7.PDF, pp.
1-7, 2002.
[7] N. Tian and Z. G. Zhang, Vacation Queueing Model, Springer Science and Business Media, pp.
10-11, 2006.
[8] E. Modiano, “Communication systems engineering,” MIT OpenCourseWare, http://ocw.mit.edu,
pp. 1-19, 2009.
[9] S. W. Fuhrmann, “Technical Note—A Note on the M/G/1 Queue with Server Vacations,”
Operations Research, Vol. 32, No. 6, pp. 1368-1373, 1984.
[10] D. Bertsekas and R. Gallager, Data Networks, Prentice Hall, New Jersey, pp. 186-195, 2007.
International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 2014
9
[11] M. S. Obaidat and N. A. Boudriga, Fundamentals of Performance Evaluation of Computer and
Tele-communication Systems, Wiely, pp. 156-157, 2010.
[12] Y. Lee, “Mean waiting time of an end-user in the multiple web access environment,” Proc. of the
Sixth International Conference on Communication Theory, Reliability, and Quality of Service
(CTRQ-2013), pp. 1-4, 2013.

Weitere ähnliche Inhalte

Was ist angesagt?

PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDMOD...
PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDMOD...PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDMOD...
PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDMOD...ijgca
 
17 21 jan17 9dec16 13655 27902-1-ed(edit)
17 21 jan17 9dec16 13655 27902-1-ed(edit)17 21 jan17 9dec16 13655 27902-1-ed(edit)
17 21 jan17 9dec16 13655 27902-1-ed(edit)IAESIJEECS
 
Enforcing end to-end proportional fairness with bounded buffer overflow proba...
Enforcing end to-end proportional fairness with bounded buffer overflow proba...Enforcing end to-end proportional fairness with bounded buffer overflow proba...
Enforcing end to-end proportional fairness with bounded buffer overflow proba...ijwmn
 
Transmission Time and Throughput analysis of EEE LEACH, LEACH and Direct Tran...
Transmission Time and Throughput analysis of EEE LEACH, LEACH and Direct Tran...Transmission Time and Throughput analysis of EEE LEACH, LEACH and Direct Tran...
Transmission Time and Throughput analysis of EEE LEACH, LEACH and Direct Tran...acijjournal
 
MODELLING TRAFFIC IN IMS NETWORK NODES
MODELLING TRAFFIC IN IMS NETWORK NODESMODELLING TRAFFIC IN IMS NETWORK NODES
MODELLING TRAFFIC IN IMS NETWORK NODESijdpsjournal
 
Conditional%20 shortest%20path%20routing%20in%20delay%20tolerant%20networks[1]
Conditional%20 shortest%20path%20routing%20in%20delay%20tolerant%20networks[1]Conditional%20 shortest%20path%20routing%20in%20delay%20tolerant%20networks[1]
Conditional%20 shortest%20path%20routing%20in%20delay%20tolerant%20networks[1]ingenioustech
 
Supporting efficient and scalable multicasting
Supporting efficient and scalable multicastingSupporting efficient and scalable multicasting
Supporting efficient and scalable multicastingingenioustech
 
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2RDETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
 
ESTIMATION OF MEDIUM ACCESS CONTROL LAYER PACKET DELAY DISTRIBUTION FOR IEEE ...
ESTIMATION OF MEDIUM ACCESS CONTROL LAYER PACKET DELAY DISTRIBUTION FOR IEEE ...ESTIMATION OF MEDIUM ACCESS CONTROL LAYER PACKET DELAY DISTRIBUTION FOR IEEE ...
ESTIMATION OF MEDIUM ACCESS CONTROL LAYER PACKET DELAY DISTRIBUTION FOR IEEE ...ijwmn
 
Design and implementation of low latency weighted round robin (ll wrr) schedu...
Design and implementation of low latency weighted round robin (ll wrr) schedu...Design and implementation of low latency weighted round robin (ll wrr) schedu...
Design and implementation of low latency weighted round robin (ll wrr) schedu...ijwmn
 
Routing in « Delay Tolerant Networks » (DTN) Improved Routing With Prophet an...
Routing in « Delay Tolerant Networks » (DTN) Improved Routing With Prophet an...Routing in « Delay Tolerant Networks » (DTN) Improved Routing With Prophet an...
Routing in « Delay Tolerant Networks » (DTN) Improved Routing With Prophet an...CSCJournals
 
Optimized Fuzzy Routing for MANET
Optimized Fuzzy Routing for MANETOptimized Fuzzy Routing for MANET
Optimized Fuzzy Routing for MANETiosrjce
 
Towards Seamless TCP Congestion Avoidance in Multiprotocol Environments
Towards Seamless TCP Congestion Avoidance in Multiprotocol EnvironmentsTowards Seamless TCP Congestion Avoidance in Multiprotocol Environments
Towards Seamless TCP Congestion Avoidance in Multiprotocol EnvironmentsIDES Editor
 
Fuzzy Controller Based Stable Routes with Lifetime Prediction in MANETs
Fuzzy Controller Based Stable Routes with Lifetime Prediction in MANETsFuzzy Controller Based Stable Routes with Lifetime Prediction in MANETs
Fuzzy Controller Based Stable Routes with Lifetime Prediction in MANETsCSCJournals
 
Congestion Control through Load Balancing Technique for Mobile Networks: A Cl...
Congestion Control through Load Balancing Technique for Mobile Networks: A Cl...Congestion Control through Load Balancing Technique for Mobile Networks: A Cl...
Congestion Control through Load Balancing Technique for Mobile Networks: A Cl...IDES Editor
 

Was ist angesagt? (17)

PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDMOD...
PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDMOD...PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDMOD...
PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDMOD...
 
17 21 jan17 9dec16 13655 27902-1-ed(edit)
17 21 jan17 9dec16 13655 27902-1-ed(edit)17 21 jan17 9dec16 13655 27902-1-ed(edit)
17 21 jan17 9dec16 13655 27902-1-ed(edit)
 
A Batch-Arrival Queue with Multiple Servers and Fuzzy Parameters: Parametric ...
A Batch-Arrival Queue with Multiple Servers and Fuzzy Parameters: Parametric ...A Batch-Arrival Queue with Multiple Servers and Fuzzy Parameters: Parametric ...
A Batch-Arrival Queue with Multiple Servers and Fuzzy Parameters: Parametric ...
 
Enforcing end to-end proportional fairness with bounded buffer overflow proba...
Enforcing end to-end proportional fairness with bounded buffer overflow proba...Enforcing end to-end proportional fairness with bounded buffer overflow proba...
Enforcing end to-end proportional fairness with bounded buffer overflow proba...
 
Transmission Time and Throughput analysis of EEE LEACH, LEACH and Direct Tran...
Transmission Time and Throughput analysis of EEE LEACH, LEACH and Direct Tran...Transmission Time and Throughput analysis of EEE LEACH, LEACH and Direct Tran...
Transmission Time and Throughput analysis of EEE LEACH, LEACH and Direct Tran...
 
MODELLING TRAFFIC IN IMS NETWORK NODES
MODELLING TRAFFIC IN IMS NETWORK NODESMODELLING TRAFFIC IN IMS NETWORK NODES
MODELLING TRAFFIC IN IMS NETWORK NODES
 
Conditional%20 shortest%20path%20routing%20in%20delay%20tolerant%20networks[1]
Conditional%20 shortest%20path%20routing%20in%20delay%20tolerant%20networks[1]Conditional%20 shortest%20path%20routing%20in%20delay%20tolerant%20networks[1]
Conditional%20 shortest%20path%20routing%20in%20delay%20tolerant%20networks[1]
 
Supporting efficient and scalable multicasting
Supporting efficient and scalable multicastingSupporting efficient and scalable multicasting
Supporting efficient and scalable multicasting
 
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2RDETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2R
 
ESTIMATION OF MEDIUM ACCESS CONTROL LAYER PACKET DELAY DISTRIBUTION FOR IEEE ...
ESTIMATION OF MEDIUM ACCESS CONTROL LAYER PACKET DELAY DISTRIBUTION FOR IEEE ...ESTIMATION OF MEDIUM ACCESS CONTROL LAYER PACKET DELAY DISTRIBUTION FOR IEEE ...
ESTIMATION OF MEDIUM ACCESS CONTROL LAYER PACKET DELAY DISTRIBUTION FOR IEEE ...
 
Design and implementation of low latency weighted round robin (ll wrr) schedu...
Design and implementation of low latency weighted round robin (ll wrr) schedu...Design and implementation of low latency weighted round robin (ll wrr) schedu...
Design and implementation of low latency weighted round robin (ll wrr) schedu...
 
Routing in « Delay Tolerant Networks » (DTN) Improved Routing With Prophet an...
Routing in « Delay Tolerant Networks » (DTN) Improved Routing With Prophet an...Routing in « Delay Tolerant Networks » (DTN) Improved Routing With Prophet an...
Routing in « Delay Tolerant Networks » (DTN) Improved Routing With Prophet an...
 
F0313539
F0313539F0313539
F0313539
 
Optimized Fuzzy Routing for MANET
Optimized Fuzzy Routing for MANETOptimized Fuzzy Routing for MANET
Optimized Fuzzy Routing for MANET
 
Towards Seamless TCP Congestion Avoidance in Multiprotocol Environments
Towards Seamless TCP Congestion Avoidance in Multiprotocol EnvironmentsTowards Seamless TCP Congestion Avoidance in Multiprotocol Environments
Towards Seamless TCP Congestion Avoidance in Multiprotocol Environments
 
Fuzzy Controller Based Stable Routes with Lifetime Prediction in MANETs
Fuzzy Controller Based Stable Routes with Lifetime Prediction in MANETsFuzzy Controller Based Stable Routes with Lifetime Prediction in MANETs
Fuzzy Controller Based Stable Routes with Lifetime Prediction in MANETs
 
Congestion Control through Load Balancing Technique for Mobile Networks: A Cl...
Congestion Control through Load Balancing Technique for Mobile Networks: A Cl...Congestion Control through Load Balancing Technique for Mobile Networks: A Cl...
Congestion Control through Load Balancing Technique for Mobile Networks: A Cl...
 

Andere mochten auch

Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...
Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...
Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...IJCNCJournal
 
A JOINT TIMING OFFSET AND CHANNEL ESTIMATION USING FRACTIONAL FOURIER TRANSFO...
A JOINT TIMING OFFSET AND CHANNEL ESTIMATION USING FRACTIONAL FOURIER TRANSFO...A JOINT TIMING OFFSET AND CHANNEL ESTIMATION USING FRACTIONAL FOURIER TRANSFO...
A JOINT TIMING OFFSET AND CHANNEL ESTIMATION USING FRACTIONAL FOURIER TRANSFO...IJCNCJournal
 
Visualize network anomaly detection by using k means clustering algorithm
Visualize network anomaly detection by using k means clustering algorithmVisualize network anomaly detection by using k means clustering algorithm
Visualize network anomaly detection by using k means clustering algorithmIJCNCJournal
 
A novel energy aware node clustering
A novel energy aware node clusteringA novel energy aware node clustering
A novel energy aware node clusteringIJCNCJournal
 
COMPARATIVE ANALYSIS OF DIFFERENT ENCRYPTION TECHNIQUES IN MOBILE AD HOC NETW...
COMPARATIVE ANALYSIS OF DIFFERENT ENCRYPTION TECHNIQUES IN MOBILE AD HOC NETW...COMPARATIVE ANALYSIS OF DIFFERENT ENCRYPTION TECHNIQUES IN MOBILE AD HOC NETW...
COMPARATIVE ANALYSIS OF DIFFERENT ENCRYPTION TECHNIQUES IN MOBILE AD HOC NETW...IJCNCJournal
 
PERFORMANCE OF TCP CONGESTION CONTROL IN UAV NETWORKS OF VARIOUS RADIO PROPAG...
PERFORMANCE OF TCP CONGESTION CONTROL IN UAV NETWORKS OF VARIOUS RADIO PROPAG...PERFORMANCE OF TCP CONGESTION CONTROL IN UAV NETWORKS OF VARIOUS RADIO PROPAG...
PERFORMANCE OF TCP CONGESTION CONTROL IN UAV NETWORKS OF VARIOUS RADIO PROPAG...IJCNCJournal
 
Clock synchronization estimation of non deterministic delays in wireless mess...
Clock synchronization estimation of non deterministic delays in wireless mess...Clock synchronization estimation of non deterministic delays in wireless mess...
Clock synchronization estimation of non deterministic delays in wireless mess...IJCNCJournal
 
Embedding bus and ring into hex cell
Embedding bus and ring into hex cellEmbedding bus and ring into hex cell
Embedding bus and ring into hex cellIJCNCJournal
 
A novel signature based traffic classification engine to reduce false alarms ...
A novel signature based traffic classification engine to reduce false alarms ...A novel signature based traffic classification engine to reduce false alarms ...
A novel signature based traffic classification engine to reduce false alarms ...IJCNCJournal
 

Andere mochten auch (9)

Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...
Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...
Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...
 
A JOINT TIMING OFFSET AND CHANNEL ESTIMATION USING FRACTIONAL FOURIER TRANSFO...
A JOINT TIMING OFFSET AND CHANNEL ESTIMATION USING FRACTIONAL FOURIER TRANSFO...A JOINT TIMING OFFSET AND CHANNEL ESTIMATION USING FRACTIONAL FOURIER TRANSFO...
A JOINT TIMING OFFSET AND CHANNEL ESTIMATION USING FRACTIONAL FOURIER TRANSFO...
 
Visualize network anomaly detection by using k means clustering algorithm
Visualize network anomaly detection by using k means clustering algorithmVisualize network anomaly detection by using k means clustering algorithm
Visualize network anomaly detection by using k means clustering algorithm
 
A novel energy aware node clustering
A novel energy aware node clusteringA novel energy aware node clustering
A novel energy aware node clustering
 
COMPARATIVE ANALYSIS OF DIFFERENT ENCRYPTION TECHNIQUES IN MOBILE AD HOC NETW...
COMPARATIVE ANALYSIS OF DIFFERENT ENCRYPTION TECHNIQUES IN MOBILE AD HOC NETW...COMPARATIVE ANALYSIS OF DIFFERENT ENCRYPTION TECHNIQUES IN MOBILE AD HOC NETW...
COMPARATIVE ANALYSIS OF DIFFERENT ENCRYPTION TECHNIQUES IN MOBILE AD HOC NETW...
 
PERFORMANCE OF TCP CONGESTION CONTROL IN UAV NETWORKS OF VARIOUS RADIO PROPAG...
PERFORMANCE OF TCP CONGESTION CONTROL IN UAV NETWORKS OF VARIOUS RADIO PROPAG...PERFORMANCE OF TCP CONGESTION CONTROL IN UAV NETWORKS OF VARIOUS RADIO PROPAG...
PERFORMANCE OF TCP CONGESTION CONTROL IN UAV NETWORKS OF VARIOUS RADIO PROPAG...
 
Clock synchronization estimation of non deterministic delays in wireless mess...
Clock synchronization estimation of non deterministic delays in wireless mess...Clock synchronization estimation of non deterministic delays in wireless mess...
Clock synchronization estimation of non deterministic delays in wireless mess...
 
Embedding bus and ring into hex cell
Embedding bus and ring into hex cellEmbedding bus and ring into hex cell
Embedding bus and ring into hex cell
 
A novel signature based traffic classification engine to reduce false alarms ...
A novel signature based traffic classification engine to reduce false alarms ...A novel signature based traffic classification engine to reduce false alarms ...
A novel signature based traffic classification engine to reduce false alarms ...
 

Ähnlich wie Web Object Size Satisfying Mean Waiting Time Constraints

PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDMOD...
PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDMOD...PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDMOD...
PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDMOD...ijgca
 
A downlink scheduler supporting real time services in LTE cellular networks
A downlink scheduler supporting real time services in LTE cellular networksA downlink scheduler supporting real time services in LTE cellular networks
A downlink scheduler supporting real time services in LTE cellular networksUniversity of Piraeus
 
PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDM O...
PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDM O...PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDM O...
PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDM O...ijgca
 
Performance measures for internet server by using m mm queueing model
Performance measures for internet server by using m mm queueing modelPerformance measures for internet server by using m mm queueing model
Performance measures for internet server by using m mm queueing modeleSAT Publishing House
 
Performance measures for internet server by using m m m queueing model
Performance measures for internet server by using m m m queueing modelPerformance measures for internet server by using m m m queueing model
Performance measures for internet server by using m m m queueing modeleSAT Journals
 
Manets: Increasing N-Messages Delivery Probability Using Two-Hop Relay with E...
Manets: Increasing N-Messages Delivery Probability Using Two-Hop Relay with E...Manets: Increasing N-Messages Delivery Probability Using Two-Hop Relay with E...
Manets: Increasing N-Messages Delivery Probability Using Two-Hop Relay with E...ijceronline
 
Packet Loss Rate Differentiation in slotted Optical Packet Switching OCDM/WDM
Packet Loss Rate Differentiation in slotted Optical Packet Switching OCDM/WDMPacket Loss Rate Differentiation in slotted Optical Packet Switching OCDM/WDM
Packet Loss Rate Differentiation in slotted Optical Packet Switching OCDM/WDMTELKOMNIKA JOURNAL
 
AN OPEN JACKSON NETWORK MODEL FOR HETEROGENEOUS INFRASTRUCTURE AS A SERVICE O...
AN OPEN JACKSON NETWORK MODEL FOR HETEROGENEOUS INFRASTRUCTURE AS A SERVICE O...AN OPEN JACKSON NETWORK MODEL FOR HETEROGENEOUS INFRASTRUCTURE AS A SERVICE O...
AN OPEN JACKSON NETWORK MODEL FOR HETEROGENEOUS INFRASTRUCTURE AS A SERVICE O...IJCNCJournal
 
RESPONSE SURFACE METHODOLOGY FOR PERFORMANCE ANALYSIS AND MODELING OF MANET R...
RESPONSE SURFACE METHODOLOGY FOR PERFORMANCE ANALYSIS AND MODELING OF MANET R...RESPONSE SURFACE METHODOLOGY FOR PERFORMANCE ANALYSIS AND MODELING OF MANET R...
RESPONSE SURFACE METHODOLOGY FOR PERFORMANCE ANALYSIS AND MODELING OF MANET R...IJCNCJournal
 
Gigliotti_Pinho_MST_Accepted_Manuscript
Gigliotti_Pinho_MST_Accepted_ManuscriptGigliotti_Pinho_MST_Accepted_Manuscript
Gigliotti_Pinho_MST_Accepted_ManuscriptLuigi Gigliotti
 
Mobile elements scheduling for periodic sensor applications
Mobile elements scheduling for periodic sensor applicationsMobile elements scheduling for periodic sensor applications
Mobile elements scheduling for periodic sensor applicationsijwmn
 
MECC scheduling algorithm in vehicular environment for uplink transmission in...
MECC scheduling algorithm in vehicular environment for uplink transmission in...MECC scheduling algorithm in vehicular environment for uplink transmission in...
MECC scheduling algorithm in vehicular environment for uplink transmission in...IJECEIAES
 
Review and comparison of tasks scheduling in cloud computing
Review and comparison of tasks scheduling in cloud computingReview and comparison of tasks scheduling in cloud computing
Review and comparison of tasks scheduling in cloud computingijfcstjournal
 
Application of selective algorithm for effective resource provisioning in clo...
Application of selective algorithm for effective resource provisioning in clo...Application of selective algorithm for effective resource provisioning in clo...
Application of selective algorithm for effective resource provisioning in clo...ijccsa
 
Data collection scheme for wireless sensor network with mobile collector
Data collection scheme for wireless sensor network with mobile collectorData collection scheme for wireless sensor network with mobile collector
Data collection scheme for wireless sensor network with mobile collectorijwmn
 
LOAD BALANCING ALGORITHM TO IMPROVE RESPONSE TIME ON CLOUD COMPUTING
LOAD BALANCING ALGORITHM TO IMPROVE RESPONSE TIME ON CLOUD COMPUTINGLOAD BALANCING ALGORITHM TO IMPROVE RESPONSE TIME ON CLOUD COMPUTING
LOAD BALANCING ALGORITHM TO IMPROVE RESPONSE TIME ON CLOUD COMPUTINGijccsa
 

Ähnlich wie Web Object Size Satisfying Mean Waiting Time Constraints (20)

PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDMOD...
PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDMOD...PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDMOD...
PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDMOD...
 
A downlink scheduler supporting real time services in LTE cellular networks
A downlink scheduler supporting real time services in LTE cellular networksA downlink scheduler supporting real time services in LTE cellular networks
A downlink scheduler supporting real time services in LTE cellular networks
 
PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDM O...
PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDM O...PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDM O...
PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDM O...
 
Bulk transfer scheduling and path reservations in research networks
Bulk transfer scheduling and path reservations in research networksBulk transfer scheduling and path reservations in research networks
Bulk transfer scheduling and path reservations in research networks
 
Performance measures for internet server by using m mm queueing model
Performance measures for internet server by using m mm queueing modelPerformance measures for internet server by using m mm queueing model
Performance measures for internet server by using m mm queueing model
 
Performance measures for internet server by using m m m queueing model
Performance measures for internet server by using m m m queueing modelPerformance measures for internet server by using m m m queueing model
Performance measures for internet server by using m m m queueing model
 
Manets: Increasing N-Messages Delivery Probability Using Two-Hop Relay with E...
Manets: Increasing N-Messages Delivery Probability Using Two-Hop Relay with E...Manets: Increasing N-Messages Delivery Probability Using Two-Hop Relay with E...
Manets: Increasing N-Messages Delivery Probability Using Two-Hop Relay with E...
 
Packet Loss Rate Differentiation in slotted Optical Packet Switching OCDM/WDM
Packet Loss Rate Differentiation in slotted Optical Packet Switching OCDM/WDMPacket Loss Rate Differentiation in slotted Optical Packet Switching OCDM/WDM
Packet Loss Rate Differentiation in slotted Optical Packet Switching OCDM/WDM
 
D0431013019
D0431013019D0431013019
D0431013019
 
AN OPEN JACKSON NETWORK MODEL FOR HETEROGENEOUS INFRASTRUCTURE AS A SERVICE O...
AN OPEN JACKSON NETWORK MODEL FOR HETEROGENEOUS INFRASTRUCTURE AS A SERVICE O...AN OPEN JACKSON NETWORK MODEL FOR HETEROGENEOUS INFRASTRUCTURE AS A SERVICE O...
AN OPEN JACKSON NETWORK MODEL FOR HETEROGENEOUS INFRASTRUCTURE AS A SERVICE O...
 
ACES_Journal_February_2012_Paper_07
ACES_Journal_February_2012_Paper_07ACES_Journal_February_2012_Paper_07
ACES_Journal_February_2012_Paper_07
 
RESPONSE SURFACE METHODOLOGY FOR PERFORMANCE ANALYSIS AND MODELING OF MANET R...
RESPONSE SURFACE METHODOLOGY FOR PERFORMANCE ANALYSIS AND MODELING OF MANET R...RESPONSE SURFACE METHODOLOGY FOR PERFORMANCE ANALYSIS AND MODELING OF MANET R...
RESPONSE SURFACE METHODOLOGY FOR PERFORMANCE ANALYSIS AND MODELING OF MANET R...
 
Gigliotti_Pinho_MST_Accepted_Manuscript
Gigliotti_Pinho_MST_Accepted_ManuscriptGigliotti_Pinho_MST_Accepted_Manuscript
Gigliotti_Pinho_MST_Accepted_Manuscript
 
Mobile elements scheduling for periodic sensor applications
Mobile elements scheduling for periodic sensor applicationsMobile elements scheduling for periodic sensor applications
Mobile elements scheduling for periodic sensor applications
 
MECC scheduling algorithm in vehicular environment for uplink transmission in...
MECC scheduling algorithm in vehicular environment for uplink transmission in...MECC scheduling algorithm in vehicular environment for uplink transmission in...
MECC scheduling algorithm in vehicular environment for uplink transmission in...
 
Review and comparison of tasks scheduling in cloud computing
Review and comparison of tasks scheduling in cloud computingReview and comparison of tasks scheduling in cloud computing
Review and comparison of tasks scheduling in cloud computing
 
Multi-Channel Scheduling for HPON's
Multi-Channel Scheduling for HPON'sMulti-Channel Scheduling for HPON's
Multi-Channel Scheduling for HPON's
 
Application of selective algorithm for effective resource provisioning in clo...
Application of selective algorithm for effective resource provisioning in clo...Application of selective algorithm for effective resource provisioning in clo...
Application of selective algorithm for effective resource provisioning in clo...
 
Data collection scheme for wireless sensor network with mobile collector
Data collection scheme for wireless sensor network with mobile collectorData collection scheme for wireless sensor network with mobile collector
Data collection scheme for wireless sensor network with mobile collector
 
LOAD BALANCING ALGORITHM TO IMPROVE RESPONSE TIME ON CLOUD COMPUTING
LOAD BALANCING ALGORITHM TO IMPROVE RESPONSE TIME ON CLOUD COMPUTINGLOAD BALANCING ALGORITHM TO IMPROVE RESPONSE TIME ON CLOUD COMPUTING
LOAD BALANCING ALGORITHM TO IMPROVE RESPONSE TIME ON CLOUD COMPUTING
 

Mehr von IJCNCJournal

Advanced Privacy Scheme to Improve Road Safety in Smart Transportation Systems
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsAdvanced Privacy Scheme to Improve Road Safety in Smart Transportation Systems
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
 
April 2024 - Top 10 Read Articles in Computer Networks & Communications
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsApril 2024 - Top 10 Read Articles in Computer Networks & Communications
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
 
DEF: Deep Ensemble Neural Network Classifier for Android Malware Detection
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionDEF: Deep Ensemble Neural Network Classifier for Android Malware Detection
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
 
High Performance NMF Based Intrusion Detection System for Big Data IOT Traffic
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficHigh Performance NMF Based Intrusion Detection System for Big Data IOT Traffic
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
 
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
 
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...A Topology Control Algorithm Taking into Account Energy and Quality of Transm...
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
 
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
 
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation Systems
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsAdvanced Privacy Scheme to Improve Road Safety in Smart Transportation Systems
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
 
DEF: Deep Ensemble Neural Network Classifier for Android Malware Detection
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionDEF: Deep Ensemble Neural Network Classifier for Android Malware Detection
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
 
High Performance NMF based Intrusion Detection System for Big Data IoT Traffic
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficHigh Performance NMF based Intrusion Detection System for Big Data IoT Traffic
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficIJCNCJournal
 
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
 
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
 
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
 
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...IJCNCJournal
 
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
 
Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...
Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...
Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...IJCNCJournal
 
March 2024 - Top 10 Read Articles in Computer Networks & Communications
March 2024 - Top 10 Read Articles in Computer Networks & CommunicationsMarch 2024 - Top 10 Read Articles in Computer Networks & Communications
March 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
 
Adaptive Multi-Criteria-Based Load Balancing Technique for Resource Allocatio...
Adaptive Multi-Criteria-Based Load Balancing Technique for Resource Allocatio...Adaptive Multi-Criteria-Based Load Balancing Technique for Resource Allocatio...
Adaptive Multi-Criteria-Based Load Balancing Technique for Resource Allocatio...IJCNCJournal
 
Comparative Study of Orchestration using gRPC API and REST API in Server Crea...
Comparative Study of Orchestration using gRPC API and REST API in Server Crea...Comparative Study of Orchestration using gRPC API and REST API in Server Crea...
Comparative Study of Orchestration using gRPC API and REST API in Server Crea...IJCNCJournal
 
Sensing Time Improvement Using Two Stage Detectors for Cognitive Radio System
Sensing Time Improvement Using Two Stage Detectors for Cognitive Radio SystemSensing Time Improvement Using Two Stage Detectors for Cognitive Radio System
Sensing Time Improvement Using Two Stage Detectors for Cognitive Radio SystemIJCNCJournal
 

Mehr von IJCNCJournal (20)

Advanced Privacy Scheme to Improve Road Safety in Smart Transportation Systems
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsAdvanced Privacy Scheme to Improve Road Safety in Smart Transportation Systems
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation Systems
 
April 2024 - Top 10 Read Articles in Computer Networks & Communications
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsApril 2024 - Top 10 Read Articles in Computer Networks & Communications
April 2024 - Top 10 Read Articles in Computer Networks & Communications
 
DEF: Deep Ensemble Neural Network Classifier for Android Malware Detection
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionDEF: Deep Ensemble Neural Network Classifier for Android Malware Detection
DEF: Deep Ensemble Neural Network Classifier for Android Malware Detection
 
High Performance NMF Based Intrusion Detection System for Big Data IOT Traffic
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficHigh Performance NMF Based Intrusion Detection System for Big Data IOT Traffic
High Performance NMF Based Intrusion Detection System for Big Data IOT Traffic
 
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...
 
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...A Topology Control Algorithm Taking into Account Energy and Quality of Transm...
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...
 
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...
 
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation Systems
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsAdvanced Privacy Scheme to Improve Road Safety in Smart Transportation Systems
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation Systems
 
DEF: Deep Ensemble Neural Network Classifier for Android Malware Detection
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionDEF: Deep Ensemble Neural Network Classifier for Android Malware Detection
DEF: Deep Ensemble Neural Network Classifier for Android Malware Detection
 
High Performance NMF based Intrusion Detection System for Big Data IoT Traffic
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficHigh Performance NMF based Intrusion Detection System for Big Data IoT Traffic
High Performance NMF based Intrusion Detection System for Big Data IoT Traffic
 
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...
 
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...
 
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...
 
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...
 
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...
 
Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...
Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...
Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...
 
March 2024 - Top 10 Read Articles in Computer Networks & Communications
March 2024 - Top 10 Read Articles in Computer Networks & CommunicationsMarch 2024 - Top 10 Read Articles in Computer Networks & Communications
March 2024 - Top 10 Read Articles in Computer Networks & Communications
 
Adaptive Multi-Criteria-Based Load Balancing Technique for Resource Allocatio...
Adaptive Multi-Criteria-Based Load Balancing Technique for Resource Allocatio...Adaptive Multi-Criteria-Based Load Balancing Technique for Resource Allocatio...
Adaptive Multi-Criteria-Based Load Balancing Technique for Resource Allocatio...
 
Comparative Study of Orchestration using gRPC API and REST API in Server Crea...
Comparative Study of Orchestration using gRPC API and REST API in Server Crea...Comparative Study of Orchestration using gRPC API and REST API in Server Crea...
Comparative Study of Orchestration using gRPC API and REST API in Server Crea...
 
Sensing Time Improvement Using Two Stage Detectors for Cognitive Radio System
Sensing Time Improvement Using Two Stage Detectors for Cognitive Radio SystemSensing Time Improvement Using Two Stage Detectors for Cognitive Radio System
Sensing Time Improvement Using Two Stage Detectors for Cognitive Radio System
 

Kürzlich hochgeladen

The Codex of Business Writing Software for Real-World Solutions 2.pptx
The Codex of Business Writing Software for Real-World Solutions 2.pptxThe Codex of Business Writing Software for Real-World Solutions 2.pptx
The Codex of Business Writing Software for Real-World Solutions 2.pptxMalak Abu Hammad
 
Factors to Consider When Choosing Accounts Payable Services Providers.pptx
Factors to Consider When Choosing Accounts Payable Services Providers.pptxFactors to Consider When Choosing Accounts Payable Services Providers.pptx
Factors to Consider When Choosing Accounts Payable Services Providers.pptxKatpro Technologies
 
Real Time Object Detection Using Open CV
Real Time Object Detection Using Open CVReal Time Object Detection Using Open CV
Real Time Object Detection Using Open CVKhem
 
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptxHampshireHUG
 
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...Drew Madelung
 
Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...
Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...
Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...apidays
 
08448380779 Call Girls In Civil Lines Women Seeking Men
08448380779 Call Girls In Civil Lines Women Seeking Men08448380779 Call Girls In Civil Lines Women Seeking Men
08448380779 Call Girls In Civil Lines Women Seeking MenDelhi Call girls
 
Tata AIG General Insurance Company - Insurer Innovation Award 2024
Tata AIG General Insurance Company - Insurer Innovation Award 2024Tata AIG General Insurance Company - Insurer Innovation Award 2024
Tata AIG General Insurance Company - Insurer Innovation Award 2024The Digital Insurer
 
2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...Martijn de Jong
 
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerHow to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerThousandEyes
 
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfThe Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfEnterprise Knowledge
 
Presentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreterPresentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreternaman860154
 
Automating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps ScriptAutomating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps Scriptwesley chun
 
A Call to Action for Generative AI in 2024
A Call to Action for Generative AI in 2024A Call to Action for Generative AI in 2024
A Call to Action for Generative AI in 2024Results
 
IAC 2024 - IA Fast Track to Search Focused AI Solutions
IAC 2024 - IA Fast Track to Search Focused AI SolutionsIAC 2024 - IA Fast Track to Search Focused AI Solutions
IAC 2024 - IA Fast Track to Search Focused AI SolutionsEnterprise Knowledge
 
CNv6 Instructor Chapter 6 Quality of Service
CNv6 Instructor Chapter 6 Quality of ServiceCNv6 Instructor Chapter 6 Quality of Service
CNv6 Instructor Chapter 6 Quality of Servicegiselly40
 
Artificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and MythsArtificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and MythsJoaquim Jorge
 
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking MenDelhi Call girls
 
A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)Gabriella Davis
 
Understanding Discord NSFW Servers A Guide for Responsible Users.pdf
Understanding Discord NSFW Servers A Guide for Responsible Users.pdfUnderstanding Discord NSFW Servers A Guide for Responsible Users.pdf
Understanding Discord NSFW Servers A Guide for Responsible Users.pdfUK Journal
 

Kürzlich hochgeladen (20)

The Codex of Business Writing Software for Real-World Solutions 2.pptx
The Codex of Business Writing Software for Real-World Solutions 2.pptxThe Codex of Business Writing Software for Real-World Solutions 2.pptx
The Codex of Business Writing Software for Real-World Solutions 2.pptx
 
Factors to Consider When Choosing Accounts Payable Services Providers.pptx
Factors to Consider When Choosing Accounts Payable Services Providers.pptxFactors to Consider When Choosing Accounts Payable Services Providers.pptx
Factors to Consider When Choosing Accounts Payable Services Providers.pptx
 
Real Time Object Detection Using Open CV
Real Time Object Detection Using Open CVReal Time Object Detection Using Open CV
Real Time Object Detection Using Open CV
 
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
 
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
 
Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...
Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...
Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...
 
08448380779 Call Girls In Civil Lines Women Seeking Men
08448380779 Call Girls In Civil Lines Women Seeking Men08448380779 Call Girls In Civil Lines Women Seeking Men
08448380779 Call Girls In Civil Lines Women Seeking Men
 
Tata AIG General Insurance Company - Insurer Innovation Award 2024
Tata AIG General Insurance Company - Insurer Innovation Award 2024Tata AIG General Insurance Company - Insurer Innovation Award 2024
Tata AIG General Insurance Company - Insurer Innovation Award 2024
 
2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...
 
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerHow to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected Worker
 
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfThe Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
 
Presentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreterPresentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreter
 
Automating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps ScriptAutomating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps Script
 
A Call to Action for Generative AI in 2024
A Call to Action for Generative AI in 2024A Call to Action for Generative AI in 2024
A Call to Action for Generative AI in 2024
 
IAC 2024 - IA Fast Track to Search Focused AI Solutions
IAC 2024 - IA Fast Track to Search Focused AI SolutionsIAC 2024 - IA Fast Track to Search Focused AI Solutions
IAC 2024 - IA Fast Track to Search Focused AI Solutions
 
CNv6 Instructor Chapter 6 Quality of Service
CNv6 Instructor Chapter 6 Quality of ServiceCNv6 Instructor Chapter 6 Quality of Service
CNv6 Instructor Chapter 6 Quality of Service
 
Artificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and MythsArtificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and Myths
 
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
 
A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)
 
Understanding Discord NSFW Servers A Guide for Responsible Users.pdf
Understanding Discord NSFW Servers A Guide for Responsible Users.pdfUnderstanding Discord NSFW Servers A Guide for Responsible Users.pdf
Understanding Discord NSFW Servers A Guide for Responsible Users.pdf
 

Web Object Size Satisfying Mean Waiting Time Constraints

  • 1. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 2014 DOI : 10.5121/ijcnc.2014.6401 01 WEB OBJECT SIZE SATISFYING MEAN WAITING TIME IN MULTIPLE ACCESS ENVIRONMENT Y. –J. Lee Department of Technology Education, Korea National University of Education, Cheongju, South Korea ABSTRACT This paper addresses web object size which is one of important performance measures and affects to service time in multiple access environment. Since packets arrive according to Poission distribution and web service time has arbitrary distribution, M/G/1 model can be used to describe the behavior of the web server system. In the time division multiplexing (TDM), we can use M/D/1 with vacations model, because service time is constant and server may have a vacation. We derive the mean web object size satisfying the constraint such that mean waiting time by round-robin scheduling in multiple access environment is equal to the mean queueing delay of M/D/1 with vacations model in TDM and M/H2/1 model, respectively. Performance evaluation shows that the mean web object size increases as the link utilization increases at the given maximum segment size (MSS), but converges on the lower bound when the number of embedded objects included in a web page is beyond the threshold. Our results can be applied to the economic design and maintenance of web service. KEYWORDS M/D/1 with vacations, M/H2/1, mean waiting time, multiple web access 1. INTRODUCTION Simultaneous access of multiple users to a server in the web environment increases the mean waiting delay of an end-user. Therefore, the quality of service (QoS) degradation problem of the end-user arises. In order to develop a technology for solving this problem, we first should find the mean waiting delay of the end-user accurately. Generally, the user's request to the web server per unit time follows the Poisson distribution and the web service time follows the general distribution instead of the Exponential distribution. M/G/1 model [1] is known to be suitable to describe a web service. In particular, because web services are influenced by the size of the web objects, Shi et al [2] presented the result that as a statistical distribution to describe the web service, Weibull distribution and Exponential distribution are suitable. Meanwhile, Khayari et. al [3] and Riska et. al [4] have presented an algorithm to fit the empirical distribution to the Hyper-exponential distribution. When the web service is given by the Hyper-exponential distribution in the steady state, the research [5] to obtain the number of concurrent users satisfying the average queueing delay was conducted. However, more empirical researches for web services distribution related to the Internet are still needed. Additionally, M/G/1 with vacations model [6, 7, 8, 9] as a modification of M/G/1 model has proposed. In the time division multiplexing (TDM), time quantum assigned to each user is slotted so that the data transmission takes place just only at the starting point of the slot. Therefore, if the system is empty at the beginning of the slot, the server goes to the vacation state during that time slot. To
  • 2. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 2014 2 apply the TDM scheme to the queueing system can be described as an M/D/1 with vacations model in which the service distribution is given by the constant. On the other hand, when several users simultaneously request a web object of the packets in the web server, and the round-robin scheduling for the web service is used, we can determine the mean waiting time. When the system is in the steady state, we can infer that the mean waiting time is equal to the mean queueing delay by the M/D/1 with vacations model in the TDM approximately. The objective of this study is to find the web object size satisfying that the mean waiting time for multiple web access environments is equal to the mean queueing delay for M/D/1 with vacations model in TDM and the mean queueing delay for M/H2/1 model, respectively. We first find the number of simultaneous users satisfying that M/H2/1 queueing delay is equal to the queueing delay in TDM. And then we obtain the web object size. The reason to obtain the web object size satisfying delay constraint of end-user is why the controlling of that is the most economic way in the design and operation of the web service. The rest of this paper is structured as follows. In the next section, we discuss the M/D/1 with vacations model based on Modiano [8] and Bose [6] in TDM and the M/H2/1 queueing model. In section 3, we first describe the model to find the mean waiting time by round-robin scheduling in the multiple web access environment. We then determine the web object size satisfying the constraint that the mean waiting time equal to the mean queueing delay for M/D/1 with vacations model in TDM and M/H2/1 model, respectively. In section 4, we present and analyze the performance evaluation results. Finally, in section 5, we discuss the conclusions and future research. 2. QUEUEING DELAY FOR M/D/1 WITH VACATIONS MODEL AND M/H2/1 MODEL 2.1. Queueing Delay for M/D/1 with vacation Model We consider a single-server queueing system where object requests arrive according to a Poission process with rate λ, but service times have a general distribution (M/G/1). By Pollaczek-Khinchin formula, the expected mean queueing delay is given by (1) [1, 10]. )1(2 )( 2 ρ λ − = SE W (1) where ρ=λ/µ= λE(S). S is the random variable representing the service time and identically distributed, mutually independent, and independent of the inter-arrival times. If the service times are identical for all requests (M/D/1), that is E(S2 ) = 1/µ2 , equation (1) becomes (2). )1(2 ρµ ρ − =W (2) Now, we consider M/G/1 queueing model with vacations [9]. In this model, when the queue is empty, the server's vacation time is represented as IID random variable, and independent with service times and arrival times. When the system is empty after the vacation, the server can take another vacation. In this model, the arrival distribution at any time t, should be the same as the length of the queue [7], R is given by (3)
  • 3. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 2014 3 )(2 )()1( 2 )( 22 VE VESE R ρλ − += (3) Where, E(V) and E(V2 ) are the primary and secondary moment of vacation time, respectively. From (1), the mean queuing delay of M/G/1 with vacations model is derived as (4). )(2 )( )1(2 )( 1 22 VE VESER W + − = − = ρ λ ρ (4) Now, consider the time division multiplexing (TDM) system such as Figure 1. Figure 1. TDM system Figure 1 shows that the m fixed-length packets with each λ/m arrival rate are multiplexed and arrive into the system according to the Poisson distribution. Total traffic is λ, the service rate (µ) is equal to 1/m, and the load on the entire system is ρ = λ. Thus, equation (2) with µ=1/m and ρ = λ gives the mean queuing delay per packet as (5). This delay represents time in the frequency division multiplexing (FDM) [10]. Equation (5) can be also obtained by setting E(S) = E(S2 ) = 1/µ = m, and E(V) = m, E(V2 ) = 1/µ2 =m2 in (4). )1(2 ρ ρ − = m WFDM (5) In the TDM, where m traffic streams are time division multiplexed in a scheme, whereby the time axis is divided in m-slot frames with one slot dedicated to each traffic stream (Figure 1). Thus the mean queueing delay in TDM is given by (6) [10]. )1(22 λ− =+= mm WW FDMTDM (6) 2.2. Queueing Delay for M/H2/1 Model Generally, web objects are composed of two types: static and dynamic. A static object is one home page first requested. Dynamic objects (N) are embedded in a home page, and requested after parsing the homepage. We set the static object request rate as λ1 and the dynamic object request rate as λ2 respectively. Figure 2 visualizes this case. Figure 2 represents the Hyper-exponential distribution [11], which chooses the ith negative exponential distribution with the rate λi and mean 1/λi. That is, the density function is given by 0)( 2 1 ≥= ∑= − SepSf i S ii iλ λ (7) The j th moment is given by
  • 4. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 2014 4 ∑= = 2 1 !)( i j i ij p jSE λ (8) Figure 2. Graphical representation of web object requests E(S) and E(S2 ) are the first and the second moment of the web object service time, respectively. They are obtained by (9). 2 2 2 )( )1( 2 )( λλ N SE N SE = + = (9) By substituting E(S) and E(S2 ) in (1), we obtain the mean queueuing delay for M/H2/1 model in (10). NN N WH )1( 1 − + = λ (10) 3. MEAN WAITING TIME FOR MULTIPLE USERS We first find out the number of simultaneous users satisfying that M/H2/1 queueing delay(WH) is equal to the queueing delay in TDM(WTDM). From (6) and (10), NN N mWW TDMH )1( )1)(1(2 − +− =→= λ λ (11) Now, we consider the mean waiting time when m concurrent users require access to a web object on a web server. Web object is divided into multiple packets with a maximum segment size (MSS) by TCP in a transport layer. Let the web object size to be θ, and MSS to be mss, the relation between the number of packets (n) and the web object size is given by (12).     = mss n θ (12) When multiple clients (m) request the same object, each user's expected service time (E(S)) is the same. However, exact finish time can vary due to the queueing delay; Clients must wait for the completion of the service.
  • 5. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 2014 5 We assume the asynchronous time division multiplexing based on packets for web service. When a client requests an object from the server, n packets are included in the object. E(S) means total response time that each client expects. Now, we assume that a packet based round robin scheduling policy is used in the multiple web access. This situation can be depicted in Figure 3. Figure 3. Scheduling for multiple web service In Figure 3, τij represents jth packet service time of the ith user. In order to simplify the modeling, we let τij = τ(∀ i, j), and then we can derive the mean waiting time as (13) [12]. [ ] 2 )12)(1( )1)(1()( 1 1 τ ττ −− = −−+−= ∑= nm nmmim m W m i R (13) Now, by assuming that the service time for single packet (τ) is equal to one time slot in the steady state of the system, we can infer that Figure 1 and Figure 3 will be approximated. Therefore, we can obtain the number of packets (n) satisfying that mean waiting time by (13) is equal to the mean queueing delay for M/D/1 with vacations model in the TDM by (6) as (14). Here, m represents the number of users (m) obtained by (11). )1)(1(2 )1)(1( )1(22 )12)(1( −− +−− =→ − = −− →= m mm n mnm WW TDMR λ λ λ (14) In M/H2/1 model, τ= E(S)/n= 2/[n(N+1)λ] when every τ is same. Thus, the number of packets (n) satisfying that mean waiting time by (13) is equal to the mean queueing delay for M/H2/1 by (10) is given by (15). 2 )1()1)(1(2 )1)(1( )1(2 )1( 2 2 )12)(1( +−−− −− =→ − = + × −− →= NNNm NNm n m Nn nm WW HR λ λ (15) From (12), (14) and (15), we can obtain the web object size (θ) satisfying that mean waiting time for multiple web access environment is equal to the mean queueing delay for M/D/1 with vacations model and M/H2/1 model, respectively.
  • 6. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 2014 6        =× +−−− −− = × −− +−− = HR TDMR WWformss NNNm NNm WWfor mss m mm 2 )1()1)(1(2 )1)(1( )1)(1(2 )1)(1( λ λ θ (16) In (16), for WR = WTDM, m ≥ 2 and λ ≤ 1. For WR = WH , m >1+(N+1)2 / 2N(N-1). 4. PERFORMANCE EVALUATION We first compute the number of users (m) varying N by using (11). Figure 4 represents the number of users when mss = 1460 B for various ρ and N. In Figure 4, when ρ and N are both small, the number of users is very large, but as N increases, converges to 1. That is, the imbedded number of objects included in a web page can affect the simultaneous access number of users. The reason is why the number of users and the number of embedded objects in a page should be balanced in order to satisfy the given mean queueing delay. Although it is not presented in the figure, as ρ increases, the number of simultaneous access users decreases to 1, so we cannot find out the web object size because a denominator has infinite value in (16). Figure 4. The number of users (m ) when mss=1460 varying N Now, we compute the mean web object size (θ) satisfying WR=WTDM and WR=WH respectively for varying N given ρ and mss. Table 1 shows the mean object size when ρ=0.01. Given mss=1460 B, mean object size is 1482 B for WR=WTDM and 742 B for WR=WH. When mss=536 B, mean object size is 544 B for WR=WTDM and 273 B for WR=WH. Therefore, the mean object size when WR=WH is smaller than when WR=WTDM regardless of mss. Table 2 and Table 3 show the mean object size when ρ=0.05, ρ=0.1 and ρ=0.2, respectively. In Table 2 and Table 3, we find also that the mean object size when WR=WH is smaller than when WR=WTDM regardless of mss. That is, when the web service time has Hyper-exponential distribution, smaller object web size is required.
  • 7. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 2014 7 Table 1. Mean object size (θ) satisfying WR=WTDM and WR=WH for varying N when ρ=0.01 N WR=WTDM WR=WH WR=WTDM WR=WH mss=1460 mss= 536 2 3 4 5 6 7 8 9 1470 1473 1476 1480 1483 1487 1491 1495 736 738 739 741 743 745 747 749 540 541 542 543 545 546 547 549 270 271 271 272 273 274 274 275 mean 1482 742 544 273 We define the ratio of the mean object size satisfying WR=WTDM over the mean object size satisfying WR=WH as (17). HR TDMR WW WW r = = = θ θ (17) Figure 5 depicts the ratio (r) by (17) for varying ρ. The size of mss can not affect the ratio, but ρ can affect it. The ratio is about 2 when ρ=0.01, however is decreased into 1 when ρ=0.2. Table 2. Mean object size (θ) satisfying WR=WTDM and WR=WH for varying N when ρ=0.05 N WR=WTDM WR=WH WR=WTDM WR=WH mss=1460 mss=536 2 3 4 5 6 7 8 9 1512 1529 1550 1568 1594 1608 1626 1652 761 771 784 795 813 819 830 848 555 561 569 576 585 590 597 607 279 283 288 292 298 301 305 311 mean 1580 803 580 295 Table 3. Mean object size (θ) satisfying WR=WTDM and WR=WH for varying N when ρ=0.1 N WR=WTDM WR=WH WR=WTDM WR=WH mss=1460 mss=536 2 3 4 5 6 7 8 9 1572 1615 1657 1703 1744 1811 1947 1947 799 831 858 890 917 979 1143 1118 577 593 608 625 640 665 715 715 293 305 315 327 337 359 420 411 mean 1750 942 642 346
  • 8. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 2014 8 Figure 5. The ratio of mean object size satisfying WR=WTDM over the mean object size satisfying WR=WH for varying ρ 5. CONCLUSIONS Mean object size in the multiple access environments is one of essential parameters to design and maintain the web service. To control the web object size is easy and very cheap maintenance method in order to satisfy the delay requirement of end-users. In this paper, we present an analytical model to estimate the web object size satisfying that the mean waiting time for multiple web service is equal to the mean queueing delay for the M/D/1 with vacations model in TDM system and the mean queueing delay for M/H2/1 model, respectively. We first find out the number of users access web server simultaneously, and then derive the web object size models. Performance evaluations show that mean object size satisfying the M/D/1 with vacations model in TDM system is larger than that satisfying M/H2/1 model, however the mean object size becomes the nearly same the utilization factor increases. Future works include more exact model applicable to the wire and wireless integrated network. REFERENCES [1] S. Ross, Introduction to probability model, Academic press, NewYork, 2010, p. 538, USA. [2] W. Shi, E. Collins, and V. Karamcheti, “Modeling Object Characteristics of Dynamic Web Content,” Journal of Parallel and Distributed Computing, Elsevier Science, pp. 963-980, 1998. [3] R. Khayari, R. Sadre and B. R. Haverkort, “Fitting world-wide web request traces with the EM- algorithm, Performance Evaluation,” Vol. 52, pp. 175-191, 2003. [4] A. Riska, V. Diev and E. Smirni, “Efficient fitting of long-tailed data sets into hyper-exponential distributions,” Proc. of IEEE Global Telecommunications Conference (GLOBECOM 2002), Vol. 3, pp. 2513-2517, 2002. [5] Y. Lee, “Mean waiting delay for web service perceived by end-user in multiple access environment,” Natural Science , vol. 2, Natural Science Institute of KNUE, pp. 55-58, 2012. [6] S. K. Bose, “M/G/1 with vacations,” http:// www.iitg.ernet.in/skbose/qbook/Slide_Set_7.PDF, pp. 1-7, 2002. [7] N. Tian and Z. G. Zhang, Vacation Queueing Model, Springer Science and Business Media, pp. 10-11, 2006. [8] E. Modiano, “Communication systems engineering,” MIT OpenCourseWare, http://ocw.mit.edu, pp. 1-19, 2009. [9] S. W. Fuhrmann, “Technical Note—A Note on the M/G/1 Queue with Server Vacations,” Operations Research, Vol. 32, No. 6, pp. 1368-1373, 1984. [10] D. Bertsekas and R. Gallager, Data Networks, Prentice Hall, New Jersey, pp. 186-195, 2007.
  • 9. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 2014 9 [11] M. S. Obaidat and N. A. Boudriga, Fundamentals of Performance Evaluation of Computer and Tele-communication Systems, Wiely, pp. 156-157, 2010. [12] Y. Lee, “Mean waiting time of an end-user in the multiple web access environment,” Proc. of the Sixth International Conference on Communication Theory, Reliability, and Quality of Service (CTRQ-2013), pp. 1-4, 2013.