See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/269328393

Modeling and analysis on congestion control in the Internet of Things

Conference Paper · June 2014

DOI: 10.1109/ICC.2014.6883357

CITATIONS READS

12 287

7 authors, including:

Jun Huang Qiang Duan

Chongqing University of Posts and Telecommunications Pennsylvania State University
113 PUBLICATIONS   857 CITATIONS    102 PUBLICATIONS   921 CITATIONS   

SEE PROFILE SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Optimization in Wireless Networks View project

Network-as-a-Service and Network Virtualization for Unification of Networking and Cloud Computing View project

All content following this page was uploaded by Qiang Duan on 06 March 2017.

The user has requested enhancement of the downloaded file.

 IEEE ICC 2014 - Ad-hoc and Sensor Networking Symposium

Modeling and Analysis on Congestion Control in

the Internet of Things
Jun Huang∗ , Donggai Du† , Qiang Duan‡ , Yi Sun† , Ying Yin† , Tiantian Zhou∗ , and Yanguang Zhang∗
∗ School
of Communication and Information Engineering,
Chongqing University of Posts and Telecommunications, Chongqing, China 400065
Email: xiaoniuadmin@gmail.com
† School of Computer Science

Chongqing University of Posts and Telecommunications, Chongqing, China 400065

Email: 627151925@qq.com
‡ Information Science and Technology Department

The Pennsylvania State University, Abington, Pennsylvania 19001

Email: qduan@psu.edu

Abstract—The large amount of data collected in the Internet
of Things (IoT) need to be transmitted to servers for processing
in order to provide various services. Due to the limited amount of
resources in IoT, including network bandwidth, node processing
abilities, and server capacities, congestion control in IoT plays a
crucial role for meeting service performance requirements. In this
paper, we propose a model for congestion control in IoT with an
improved Random Early Discard (IRED) algorithm. We employ
queueing theory to analyze the performance of the proposed
control mechanism. We also conduct extensive simulations to
evaluate performance of the proposed control and compare
it with regular RED algorithm. Our analysis and simulation
results show that the proposed control achieves comparable delay
performance and better throughput performance compared to
standard RED. The simple control mechanism of IRED makes
it more suitable to be implemented in IoT.
I. I NTRODUCTION
the IoT for service provisioning. On the other hand, parts
of IoT, especially in sensor networks and wireless access
networks, often have limited network bandwidth and energy
[3], [4]. Servers in the processing platform also only have finite
capacities. Therefore, congestion control plays an important
role in IoT for satisfying service performance requirements.
Modeling and analyzing congestion control for service
access in IoT are challenging issues for accommodating the
increasingly diverse range of traffic that must be confronted by
the users. Previous work mainly aimed at reliability and cost
of IoT service, without consideration for IoT service access.
The management of IoT service access is vital to obtain a full
understanding of system performance. In this paper, we focus
on the modeling and analysis of IoT service control and make
the following contributions.

Last years have witnessed the dawn of a new era of Internet
of Things (IoT). IoT is a new networking paradigm that is
envisioned to interconnect trillions of smart devices or things
providing and consuming information on the network [1].
In IoT physical things/devices are equipped with different
kinds of sensors and actuators and connected to the Internet
via heterogeneous access networks enabled by technologies
such as embedded sensing and actuating, radio frequency
identification (RFID), wireless sensor networks, real-time and
semantic web services, etc [2]. Thanks to these underlying
technologies, IoT is opening tremendous opportunities for a
large number of novel applications.
With the vast number of things/objects and sensors/actuators
connected to the Internet, a huge amount of data can be
collected through IoT from the physical world. These data
must be transmitted to servers for processing in order to offer
various IoT services. In order to process the huge amount
of data, a data processing platform should be built over the
Internet. Such platform is usually enabled by the service
technologies that acts as the “brain” of IoT, which refines
the raw data to form IoT services provided to users. A large
amount of data are collected, transmitted, and processed in
• We present a hierarchical system framework, by which
we model the congestion control process in IoT.
• We propose an improved Random Early Drop (IRED)
algorithm based on the model. Our algorithm employs
the instantaneous queue length to calculate drop rate of
the system, which guarantees the real time response of
IoT services.
• We employ queueing theory to develop an analysis tech-
nique for evaluating performance of the proposed control.
We then obtain the performance metrics such as average
queue length, average delay and total loss probability.
• We conduct comparison between IRED and standard
RED through simulations, which indicate that IRED can
achieve better throughput performance without sacrificing
delay performance. The simple control mechanism of
IRED makes it more suitable to be implemented in IoT.
The rest of this paper is organized as follows: Section II
briefly reviews the related works. In section III, the hierarchi-
cal system framework for IoT, the congestion control model
and a new congestion control algorithm are given in detail.
Section IV analyzes the performance of IoT service. Section
V shows simulation results and compares the performance of

978-1-4799-2003-7/14/$31.00 ©2014 IEEE 434

 IEEE ICC 2014 - Ad-hoc and Sensor Networking Symposium
the proposed algorithm against the standard algorithm. Section
VI draws the conclusion and discusses the possible direction
for our future work.
II. R ELATED W ORK
The IoT provides users with the increasingly a wide variety
of services. When network load exceeds the IoT service
capacity, the performance of IoT service will degrade signif-
icantly. Queue management schemes for congestion control
are necessary for IoT service provisioning in order to satisfy
specified Quality of Service (QoS) constraints. Authors in [5]
developed an approach to modeling the reliability and cost
of service composition in the IoT based on Markov Decision
Process with a cost structure. However, this work did not
take into account the real-time constraint, which may have
a great impact on performance of IoT service provisioning.
Although Duan et al. [6] presented a QoS framework for IoT
by analyzing the QoS requirements in each layer, they did
not provide any insight about the system performance when
analyzing the QoS of each layer via theoretical derivation and
simulation.
Research efforts on queue management have also been
made to avoid congestion last decades. Random Early Drop
(RED) as the most popular and widely used active queue
management was first proposed by Floyd and Jacobson [7]
which is anticipated to continue in foreseeable future as the de-
facto standard of network congestion control. RED calculates
drop rate by using the average queue length and packets will
be dropped probabilistically depending on threshold settings
in the queue. There is a large number of research working
related to the subject. For example, [8]–[10] have focused on
the parameter settings to improve the service performance.
In order to enhance the robustness of the RED algorithms,
researchers develop some algorithms based on RED such as
Adaptive RED [11], Blue [12], and Weighted RED [13].
The aforementioned works on RED algorithms are mostly
dedicated to RED parameters adjustment for performance
improvement. The research presented in this paper proposes an
improved RED algorithm in order to catch the real-time feature
of IoT applications. Also, we model the IoT service access and
develop an analysis technique based upon queueing theory,
which allows us to obtain an insight of system performance.
Our modeling and performance analysis on IoT service access
are provided in detail in Section III and IV.
III. M ODELING FOR C ONGESTION C ONTROL IN I OT
In this section, we present a system framework for IoT
service provisioning, then develop a model for IoT traffic
congestion control based on the framework. We also propose
an improved RED algorithm for congestion control in IoT.
A. System Overview
As the service computing technologies bridge the gap
between end users and IoT, there should be a data processing
platform that processes the raw data collected in IoT. An
illustrative system framework is shown in Fig.1, which consists
435
Service Layer
Data Processing Layer
Service
Server
Object/Thing
Sensing layer
Wireless Link
Fig. 1. An illustrative system framework for IoT
of three layers: sensing layer, data processing layer and service
layer.
The sensing layer is mainly to sample data from the physical
world. Nodes in the sensing layer are typically things or
objects. This layer briefly processes the large amount of
heterogeneous data and then delivers useful data to the data
processing layer. Acting as the “brain” of IoT, the data pro-
cessing layer processes, computes and stores the information
resource which is delivered via Internet, mobile communica-
tions network, and wireless network from the sensing layer.
This layer are referred to data aggregation, event processing,
data fusion, real-time, distributional processing. The service
layer provides common upper-level interfaces while hiding the
detail data process of the lower-level, which simplifies the
process of unifying different types of resources [14]. Through
service computing technologies, the information resources are
eventually encapsulate or abstracted as a set of IoT services
provided to end users.
In order to provide IoT services to users, the huge amount of
data collected at the sensing layer, after briefly processed, need
to be transmitted to the processing layer for further analyzed
according to the service requirements. For many IoT services
with real-time and reliability expectation, delay and packet
loss during such data transmission have significant impact
on service performance. On the other hand, network links in
IoT often have limited transmission bandwidth and servers
in the processing layer also have finite capacities. Therefore,
congestion control with active queue management is important
in IoT for meeting the performance requirements of service
provisioning.
B. System Model
The distributed congestion control model based on the
hierarchical system framework is shown in Fig. 2. In this
congestion control model, there are two thresholds for the
queue, which are minimum threshold (thmin ) and maximum
threshold (thmax ). No packet will be dropped when the instan-
taneous queue length is smaller than the minimum threshold.
If the instantaneous queue length is greater than the maximum
threshold, the packets will be dropped with probability maxp .
When queue length is between the minimum and maximum
thresholds, packets will be dropped with a probability that
 IEEE ICC 2014 - Ad-hoc and Sensor Networking Symposium

threshold threshold Algorithm 1: IRED

arrival process (thmax ) (thmin ) Input: maxp , f lag, count, thmin , k, thmax , K.
Output: count.
1 for each packet p arrival do
2 calculate the instantaneous queue length k;
3 if k < thmin then
4 add this packet into queue;
feedback to arrival process 5 k + +;
6 f lag + +;
Fig. 2. A model of congestion control for IoT service access 7 end
8 if thmin ≤ k ≤ thmax then
9 calculate the packet loss probability;
increases nonlinearly as a function of the instantaneous queue pb = maxp (k − thmin )2 /(thmax − thmin )2 ;
length. All arriving packets will be dropped when the instan- pa = pb /(1 − pb f lag)2 ;
taneous queue length is greater than the buffer size. 10 drop the arriving packet p with probability pa ;
Furthermore, the arrival rate will be reduced if there are 11 if the packet p is dropped then
packets dropped. This can be considered as implicit feed- 12 f lag = 0;
back from queue to the arrival process to reduce the arriving 13 count + +;
packets. Besides First-in first-out (FIFO) service discipline 14 else
is adopted to serve packets in our system model. However, 15 add this packet p into queue;
the loss function in our congestion control algorithm Improve 16 k + +;
RED is given by 17 f lag + +;
18 end
⎧ 19 end
⎪
⎨ 0, 0 ≤ k < thmin
(k−thmin ) 2 20 if thmax ≤ k ≤ K then
fIRED = (thmax −thmin )2
maxp , thmin ≤ k < thmax drop the packet p with probability maxp ;
⎪
⎩ max ,
21
p thmax ≤ k < K 22 if the packet p is dropped then
(1) 23 f lag = 0;
In contrast to standard RED, we use the instantaneous queue 24 count + +;
size to calculate drop rate, because it is more real-time for 25 else
congestion control. Using instantaneous queue length helps 26 add the packet p into the queue;
the improved RED to avoid two cases, one where the queue is 27 k + +;
full but the average queue size is smaller than the minimum 28 f lag + +;
threshold and one where the queue is also full but average 29 end
queue size is between the two thresholds and the packet 30 end
marking probability is too small to cause the packet to be 31 if K < k then
dropped. Also our loss function is determined by the square 32 drop the arriving packet p;
of instantaneous queue length rather than a linearly function. 33 count + +;
34 end
C. An improved RED Algorithm
35 end
The proposed improved RED algorithm (IRED) is given 36 return count;
in Algorithm 1. The algorithm is executed for each arrival
packet. Firstly, the instantaneous queue length is calculated,
and will be compared with the minimum threshold and the
maximum threshold of the queue. If the current queue length length is larger than the maximum buffer size, the arrival
is less than the minimum threshold, add this packet into packets will be dropped at once and the number of the lost
the queue and increase the queue length by one; else if the packet plus one. Finally, the total number of the lost packets
current queue length is between the minimum threshold and is returned.
the maximum threshold, the system will calculates the packet
IV. A NALYSIS ON I OT C ONGESTION C ONTROL
loss probability and decide whether to drop the arrival packet
P ERFORMANCE
with this probability. If the packet is dropped, the number of
the lost packet will be increased by one and the mark packets In this section, we employ queuing theory to analyze
are set to zero; otherwise queue length will be increased by the performance of IRED-based IoT service access control.
one. The packet will be dropped with the probability maxp if The analysis allows us to obtain some performance metrics,
the queue length is between the maximum threshold and the including the average queue length, average delay and total
maximum buffer size. However, if the instantaneous queue loss probability, which are key factors in the performance

436
 IEEE ICC 2014 - Ad-hoc and Sensor Networking Symposium

O O O O O O (1  f1 (k )) O (1  f1 (k )) O (1  max p ) O (1  max p ) K
 −1
thmax
ρk
0 1 n thmin thmax K1 K M= (1−maxp )(k−thmax ) (1−f (i)) .
k=thmax +1 thmin
n(k−n) n!
P 2P nP nP nP nP nP nP nP nP

After solving the steady state distribution probability pk , we

Fig. 3. State transition diagram of congestion control for IoT service access then can evaluate other performance metrics of the system.
The average queue length of IoT service is given by

evaluation [15]. In the service model, we suppose that there K


are n sub-services with the same service capacity to meet the L= kpk (4)
service requests at most, and the minimum threshold is larger k=0

than n. When the number of packets is larger than n, the The average delay can be obtained from Little’s law as
arriving packets will wait for the service in the buffer based
L
on the congestion control algorithm. When the buffer is full, W = (5)
the system will drop the arriving packets at once. When the S
system gets into the steady state, the state transition diagram where S is the mean throughput which is given by S =
of congestion control with IRED is shown in Fig. 3. 
n−1 
K
pk kμ + pk nμ.
In order to find the steady state probability distribution, k=1 n
we assume the exponential distribution for arrival rate and The total loss probability is the sum of each loss probability
exponential service rate. The symbols of arrival rate is set to in the queue, which is given by
λ, similarly, the service rate is set to μ. Then the quantitative
expressions are given as below. D = D1 + D2 + D3 (6)
−1
thmax 
K−1
⎧ where D1 = pk f1 (k), D2 = pk maxp and
⎪
⎪ λp0 = μp1 , k=0 k=thmin k=thmax
⎪
⎪ D 3 = pK .
⎪
⎪ λp k−1 + (k + 1)μp k+1 = (λ + kμ)p k , 0<k≤n
⎪
⎪
⎪
⎪ λp k−1 + nμp k+1 = (λ + nμ)p k , n ≤ k < th min V. S IMULATION R ESULTS
⎨
λ(1 − f1 (k))pk−1 + nμpk+1 =
In this section, simulation results are given to illustrate
⎪
⎪ (λ(1 − f1 (k)) + nμ)pk , thmin ≤ k < thmax
⎪
⎪ the performance of the congestion control algorithm. Our
⎪
⎪ λ(1 − max p )p k−1 + nμp k+1 =
⎪
⎪ experiments are performed in the OMNet++ simulator with
⎪
⎪ (λ(1 − maxp )) + nμ)pk , thmax ≤ k < K
⎩ IDE toolkit, which is an object-oriented C++ component-based
λ(1 − maxp )pK+1 = nμpK , k=K
(2) modular and discrete event network simulation framework
(k−thmin )2 primarily for building network simulators [16]. Within the
where f1 (k) = (th −th )2 maxp .
max min OMNet++ IDE, each service request is treated as an event.
Let ρ = λ/μ, then
⎧ A. Simulation Setup
⎪
⎪ρp0 , k=1
⎪
⎪ In our simulation, λ and μ are denoted as the arrival rate and
⎪
⎪ ρ k
⎪
⎪ k! p0 , 1<k≤n service rate, and they are given according to the arrival packets
⎪
⎨ ρk p ,
n(k−n) n! 0
n < k ≤ thmin per second. Network topology can be described in a file. We
pk =  k−1 ρk set the thresholds of minimum queue length thmin = 10 and
⎪
⎪ i=thmin (1 − f (i)) n(k−n) n! p0 , thmin < k ≤ thmax
⎪
⎪ maximum queue length thmax = 30, buffer size K = 40, and
⎪
⎪ (1 − max ) (k−thmax )
⎪
⎪ p
maxp = 0.1. All these parameter settings are derived from
⎪
⎩thmax −1 (1 − f (i)) ρk p , th
i=thmin n(k−n) n! 0 max < k ≤ K [17].
K (3)
From i=0 pk = 1, we can get B. Results
In our simulation experiments, we considered congestion
1
p0 = control on traffic for accessing 5 servers and set service rate
G+H +W +M
of each server as μ = 0.02. The minimum threshold and
where maximum threshold are set as 10 and 30 respectively, and the
n
 ρk total buffer size is 40. We measured the average queue length,
G= ,
k! average packet delay for service access, and packet loss rate
k=0
under various arrival rates. The obtained results are plotted in
th
 min
ρk Figs. 4-6 respectively.
H= , Fig. 4 gives the average queue length with various arrival
k=n+1
n(k−n) n!
traffic load under congestion control of regular RED and
th
 k−1
improved RED. The figure shows that the average queue length
max
ρk
W = (1 − f (i)) , for both cases increase with traffic load. The average queue
k=thmin +1 thmin
n(k−n) n! length varies in the range of 0 to 24, which is because the

437
 IEEE ICC 2014 - Ad-hoc and Sensor Networking Symposium

500

25 RED RED
IRED IRED
400
20
Average Queue Length

300

Packets Dropped
15

200
10

100
5

0 0

0.6 0.8 1.0 1.2 1.4 1.6 1.8 0.6 0.8 1.0 1.2 1.4 1.6 1.8
Traffice Load Traffic Load

Fig. 4. Average queue length vs. arrival rate Fig. 6. Packet loss vs. arrival rate

40

500 RED 39 RED

IRED IRED
38
400
Average Queue Length

37
Average Delay

36
300

35

200
34

33
100
32

0 31
0.6 0.8 1.0 1.2 1.4 1.6 1.8 35 36 37 38 39 40
Traffic Load th2-th1

Fig. 5. Average delay vs. arrival rate

Fig. 7. Average queue length vs. difference between thresholds

maximum threshold is set as 30 in the queue. With increasing
in load, both average queue curves first raise significantly and
then tend to approach flat even under relatively heavy traffic
load. Fig. 5 shows the average packet delay under various
traffic load with RED and IRED control. We noticed that both
delay curves increase with traffic load by following a similar
patten as Fig. 4. These two figures indicate that both queue
length and average delay are upper limited even under heavy
traffic control due to the effect of congestion control.
Comparing queue length and average delay performance of
RED and IRED shown in Figs. 4 and 5, we can see that RED
and IRED achieve very close average queue length as RED and
slight better packet delay performance under most traffic load.
This shows that our proposed IRED can achieve comparable
delay performance as standard RED with a simplified control
mechanism (simpler algorithm for evaluating packet drop
probability) that is easier to be implemented in IoT.
Fig. 6 gives the number of dropped packets for RED and
IRED under various traffic load. The figure shows that for
both IRED and RED the number of dropped packets increase
significantly with the arrival rate. Comparison between the
two curves in the figure indicates that IRED has a lower
packet drop rate than RED under relatively heavy traffic load.
This implies a better throughput performance achieved by the
proposed IRED congestion control.
Then we varied the maximum and minimum thresholds
and tested the impact of threshold difference on average
queue length, average delay, and packet drop performance. The
obtained results are given in Figs. 7, 8 and 9. From Figs. 7 and
8 we can see that both average queue length and average delay
increase obviously with increase in maximum threshold. Fig. 9
shows that the number of dropped packets decrease when the
gap between the maximum and minimum thresholds. This is
because a large maximum threshold makes it more likely to
accept an arrival packet into the queue; therefore, reduce the
number of dropped packet and increase the average queue
length and packet delay.
In summary, The above reported simulation results indicate
that the proposed IRED congestion control can achieve a
better throughput performance than the regular RED without

438
 IEEE ICC 2014 - Ad-hoc and Sensor Networking Symposium

780 congestion control algorithms at the sensor side in the model.

RED
770 IRED ACKNOWLEDGEMENT
760 This work is supported by NSFC (Grant No. 61309031,
750 61272400), Program for Innovation Team Building at In-
Average Delay

740
stitutions of Higher Education in Chongqing (Grant No.
KJTD201310), Natural Science Foundation of Chongqing,
730
(Grant No. cstc2013jcyjA40026), Scientific and Technological
720 Research Program of Chongqing Municipal Education Com-
710 mission (Grant No. KJ130523), and CQUPT Research Fund
700
for Young Scholars (Grant No. A2012-79).
690 R EFERENCES
35 36 37 38 39 40 [1] L. Atzori, A. Iera, and G. Morabito, “The internet of things: A survey,”
th2-th1 Computer Networks, vol. 54, no. 15, pp. 2787 – 2805, Oct. 2010.
[2] X. Cao, J. Chen, Y. Zhang, and Y. Sun, “Development of an integrated
wireless sensor network micro-environmental monitoring system,” Isa
Fig. 8. Average delay vs. difference between thresholds
Transactions, vol. 47, pp. 247–255, 2008.
[3] J. Chen, S. He, Y. Sun, and P. Thulasiraman, “Optimal flow control
360 for utility-lifetime tradeoff in wireless sensor networks,” Computer
RED Networks, vol. 53, pp. 3031–3041, 2009.
340 [4] J. Chen, W. Xu, S. He, Y. Sun, P. Thulasiraman, and X. Shen,
IRED
“Utility-based asynchronous flow control algorithm for wireless sensor
320 networks,” IEEE Journal on Selected Areas in Communications, vol. 28,
pp. 1116–1126, 2010.
300 [5] L. Li, Z. Jin, G. Li, L. Zheng, and Q. Wei, “Modeling and analyzing
Packets Dropped

the reliability and cost of service composition in the iot: A probabilistic

280
260
240
220
200
35 36 37 38 39 40
th2-th1
Fig. 9. Packet loss vs. difference between thresholds
sacrificing average delay performance. The simple control
mechanism of the proposed IRED makes its more suitable
to be implemented in IoT where network node processing
capacity is often limited.
VI. C ONCLUSION
In this paper, we have investigated the problem of conges-
tion control in IoT for improving service performance. We
have presented a model of congestion control in IoT and
proposed an improved RED control algorithm. We employed
queueing analysis technique for analyzing the performance of
the proposed congestion control system. We also conducted
extensive simulations to evaluate performance of IRED and
compared it with regular RED. Analysis and simulation results
indicate that the proposed congestion control achieves com-
parable delay performance and better throughput performance
compared to standard RED. The easier implementation control
mechanism of IRED makes it more suitable to be implemented
in IoT. Possible future works include simulation based packet
arrival from multiple sources and consideration of the potential
approach,” in 2012 IEEE 19th International Conference on, Web Services
(ICWS), June 2012, pp. 584–591.
[6] R. Duan, X. Chen, and T. Xing, “A qos architecture for iot,” in 2011
International Conference on and 4th International Conference on Cyber,
Physical and Social Computing, Internet of Things (iThings/CPSCom),
Oct. 2011, pp. 717–720.
[7] S. Floyd and V. Jacobson, “Random early detection gateways for
congestion avoidance,” IEEE/ACM Transactions on, Networking, vol. 1,
no. 4, pp. 397–413, Aug 1993.
[8] V. Firoiu and M. Borden, “A study of active queue management for
congestion control,” in Nineteenth Annual Joint Conference of the
IEEE Computer and Communications Societies. Proceedings. IEEE,
INFOCOM 2000, Mar 2000, pp. 1435–1444 vol.3.
[9] T. Ye and S. Kalyanaraman, “Adaptive tuning of red using on-line sim-
ulation,” in Global Telecommunications Conference 2002. GLOBECOM
’02. IEEE, Nov 2002, pp. 2210–2214 vol.3.
[10] W. chang Feng, D. Kandlur, D. Saha, and K. Shin, “A self-configuring
red gateway,” in Eighteenth Annual Joint Conference of the IEEE Com-
puter and Communications Societies. Proceedings. IEEE, INFOCOM
’99., Mar 1999, pp. 1320–1328 vol.3.
[11] D. Lapsley and S. Low, “Random early marking for internet congestion
control,” in Global Telecommunications Conference 1999. GLOBECOM
’99, Dec 1999, pp. 1747–1752 vol.3.
[12] W.-C. Feng, K. G. Shin, D. D. Kandlur, and D. Saha, “The BLUE active
queue management algorithms,” IEEE/ACM Transaction on Networking,
vol. 10, no. 4, pp. 513–528, Aug 2002.
[13] J. Lee, G. Elmasry, K. Whittaker, and S. Lescrinier, “WRED per-
formance analysis and design for tactical satellite communication,”
in MILITARY COMMUNICATIONS CONFERENCE, 2012 - MILCOM
2012, Oct 2012, pp. 1–6.
[14] J. Huang, Y. Liu, R. Yu, Q. Duan, and Y. Tanaka, “Modeling and
algorithms for qos-aware service composition in virtualization-based
cloud computing,” IEICE Transactions, vol. E96-B, no. Jan, pp. 10–19,
June 2013.
[15] H. Yousefi’zadeh, A. Habibi, X. Li, H. Jafarkhani, and C. Bauer, “A
statistical study of loss-delay tradeoff for red queues,” Communications,
IEEE Transactions on, vol. 60, no. 7, pp. 1966–1974, July. 2012.
[16] S. Buzura, V. Dadarlat, A. Peculea, B. Iancu, and E. Cebuc, “Simulations
framework for network congestion avoidance algorithms using the
omnet++ ide,” in Roedunet International Conference (RoEduNet), 2013
11th, Jan 2013, pp. 1–8.
[17] T. Bonald, M. May, and J.-C. Bolot, “Evaluation of RED performance,”
in proc. of the IEEE INFOCOM 2000, Mar 2000, pp. 1415 – 1424.

View publication stats

439