2012 Spring Congress on Engineering and Technology 2012
DOI: 10.1109/scet.2012.6341923
|View full text |Cite
|
Sign up to set email alerts
|

Performance Analysis in Distributed System of Dynamic Load Balancing Using Fuzzy Logic

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 7 publications
0
6
0
Order By: Relevance
“…In Figure 14, the comparison of throughput is illustrated for RRA and RA, where the respective data are gathered, filtered and compared from Saxena et al (2012), Kwork and Cheung (2004), Ahn et al (2007) and Ali and Derakhshi (2016). As illustrated in Figure 14, the performance of RA is aperiodic and tends to overshoot or undershoot with respect to the number of nodes.…”
Section: Analysis Of Algorithmic Performancesmentioning
confidence: 99%
See 1 more Smart Citation
“…In Figure 14, the comparison of throughput is illustrated for RRA and RA, where the respective data are gathered, filtered and compared from Saxena et al (2012), Kwork and Cheung (2004), Ahn et al (2007) and Ali and Derakhshi (2016). As illustrated in Figure 14, the performance of RA is aperiodic and tends to overshoot or undershoot with respect to the number of nodes.…”
Section: Analysis Of Algorithmic Performancesmentioning
confidence: 99%
“…Following the above statistics it can be stated that the average response time per node is not directly dependent on the number of nodes, instead it is highly dependent on the increasing communication overhead due to increasing node count in the system. In Figure 23, the comparative study of variations of normalised average response time (∆Tna) with respect to CRA and DRA is illustrated, where the respective data are gathered, filtered and compared from (Kwork and Cheung, 2004;Saxena et al, 2012;Cheung, 2001). In centralised approach which employs Random algorithm (CRA), the average response time per node decreases rapidly when the number of nodes is increased.…”
Section: Analysis Of Algorithmic Performancesmentioning
confidence: 99%
“…Gang [2] proposed a method to classify the user requested services to allocate the system resources, so as to achieve dynamic load balancing. Shailesh [3] used a fuzzy dynamic load balancing algorithm to achieve load balancing through task scheduling. Liu [6] proposed a distributed load balancing algorithm using a defined protocol sequence, and developed a model of queuing distributed asynchronous multi-server system.…”
Section: Related Workmentioning
confidence: 99%
“…Therefore, it is important that special attention should be given to restructure the system behaviors in accordance with the changes in user behaviors by balancing the system load. Existing system load balancing methods [1][2][3] are mainly based on resource allocation and task scheduling strategies, but not consider when and how to dynamically reconstruct the system behaviors for the real-time load equilibrium.…”
Section: Introductionmentioning
confidence: 99%
“…Qin [5] and Gong [6] have introduced feedback to dynamically adjust the weight of each resource. Zhang [7] and Saxena [8] have presented fuzzy control theory to grade server load to different levels. But in these algorithms, resource utilization between monitoring intervals is unknown.…”
Section: Related Workmentioning
confidence: 99%