Socket-based RR scheduling scheme for tightly coupled clusters providing single-name images

Baek, Seung-Min; Rim, Hwakyung; Kim, Sung-Chun

doi:10.1016/j.sysarc.2003.08.010

Cited by 6 publications

(6 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…DNS-based approaches are implemented by informing different IP addresses whenever clients request the domain name service [3]. Since the IP address selecting in RR or LC manner is not efficient, the better algorithm to solve the inefficiency would be WRR.…”

Section: Dns-based Approachesmentioning

confidence: 99%

“…The architectures of the cluster system may be classified as DNS (Domain Name Server)-based system and dispatcher based system [3]. DNS-based system authorizes DNS server to route a request to a Web cluster in a permitted time interval and imposes fixed logic-nameto-IP mapping outside its time interval.…”

Section: Introductionmentioning

confidence: 99%

“…However, the DNS-based system has a downside of controlling only partial of incoming requests in the system. And it is proved that DNS cashing brings in a skewed load on a clustered server by an average of 40% of the total load [3]. An alternative approach to DNS-based architecture aims to achieve full control on client requests and masks the request routing among the Web servers.…”

Section: Introductionmentioning

confidence: 99%

“…This study focuses on finding a load balancing method to improve its performance efficiency. Numbers of load balancing techniques for the Web server have already been proposed [3]. Some of them solved the problem by adding more hardware to the system, such as Round-Robin DNS [4], others solved the problem by applying software to the controller.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Web Clustered System for Achieving Higher Performances through Load Balancing Mechanism

Rhee¹

2013

AJIBM

View full text Add to dashboard Cite

In this paper, we study a methodology of distributing client requests in the LVS cluster system. The basic WLC algorithm is studied intensively. A load distributing algorithm which assigns its weight into each real server is devised by considering the state of the network resources on real servers. Network simulation is executed to estimate balanced usage of the resource using web load generating software. In order to analyze the dynamics of server performance due to the workload, we model a system software to evaluate the level of load balancing in the LVS, and perform actual experiments using web agenda. It is shown that the correction potentiality of the suggested algorithm is somewhat better than the WLC algorithm in terms of balanced resources usage.

show abstract

Section: Dns-based Approachesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Web Clustered System for Achieving Higher Performances through Load Balancing Mechanism

Rhee¹

2013

AJIBM

View full text Add to dashboard Cite

show abstract

“…In recent decades, scholars at home and abroad theoretical research polling system to achieve fruitful results. Researchers have roundly analyzed three kinds of basic services strategy of polling system such as gated, exhaustive and limited services [14][15][16][17][18][19]. The research polling system is also widely used in industry control, communication networks, production management and economic development, forecasting and other fields.…”

Section: Introductionmentioning

confidence: 99%

A Routing Priority Scheduling Algorithm for MAC Layer in Wireless Sensor Networks

Bao¹,

Zhao²,

Zhao³

2011

IJMECS

View full text Add to dashboard Cite

Based on the ideas of conflict-free transmission, priority to guarantee transmission quality for communication between the different clusters , this article proposes a scheduling Algorithm fit for the MAC scheme of WSNs, which has made it possible for the polling service capable of differentiating services of the cluster head node of two priority levels. The high-priority service of the cluster head is responsible for routing between the different clusters, via exhaustive service policy, while the low-priority services of the cluster head node, for communication within the cluster through limited service policy with good fairness. The theoretical model of this scheme is established through Markov chain and probability generating function. Mathematical analysis is made on the mean queue length, the mean inquiry cyclic time and the mean delay time. It turns out that the findings from theoretical analysis correspond well with those from simulated experiments.

show abstract

A Dynamic Dispatcher-Based Scheduling Algorithm on Load Balancing for Web Server Cluster

Bao

Zhao

2010

Web Information Systems and Mining

View full text Add to dashboard Cite

Socket-based RR scheduling scheme for tightly coupled clusters providing single-name images

Cited by 6 publications

References 9 publications

A Web Clustered System for Achieving Higher Performances through Load Balancing Mechanism

A Web Clustered System for Achieving Higher Performances through Load Balancing Mechanism

A Routing Priority Scheduling Algorithm for MAC Layer in Wireless Sensor Networks

A Dynamic Dispatcher-Based Scheduling Algorithm on Load Balancing for Web Server Cluster

Contact Info

Product

Resources

About