scholarly journals IMPLEMENTING LOAD BALANCING BY MODIFIED WEIGHTED ROUND ROBIN-RETRIEVE PACKET ALGORITHM ON THE SOFTWARE-DEFINED NETWORKING

Author(s):  
ZAINAL ABIDIN ◽  
Tutuk Indriyani ◽  
Danang Haryo Sulaksono

Client’s request for traffic problems is so huge that causes the single server difficult in handling the traffic load. Therefore, the system of load balancing is required as it is a technique to equally distribute the traffic load on the two or more connection lines so that the traffic can run optimally. Thus, the load balancing is crucial to implement by using Modified Weighted Round Robin-Retrieve Packet on the Software-Defined Networking. Based on the parameter of average response-time in time limits 0.1, 0.2, and 0.3 seconds, the scores were 0.016-0.04, 0.02-0.04, and 0.014-0.032 seconds consecutively. Based on the parameter of data transaction per second in time limits 0.1; 0.2, and 0.3 seconds, the scores respectively were 49.614-111.306, 41.678-107.032, and 37.806-102.84 data transaction/second. 

2020 ◽  
Vol 4 (1) ◽  
pp. 9
Author(s):  
Muhammad Aldi Aditia Putra ◽  
Iskandar Fitri ◽  
Agus Iskandar

The increasing demand for information on the internet causes the traffic load on the web server to increase. Therefore it can cause the workload on a web server service to be overloaded (request), so that the server is down (overloaded). Based on previous research the application of load balancing can reduce the burden of traffic on the web server. This research method uses load balancing on servers with round robin algorithm and least connections as well as a single server as a comparison. The parameters measured are throughput, responses time, requests per second, CPU utilization. From the test results obtained Haproxy load balancing system, the least connection algorithm is superior to the round robin algorithm. Generated per-second request value of 2607,141 req / s and throughput of 9.25 MB / s for the least connection, while 2807,171 req / s and 9.30 MB / s for round robin.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 46646-46658 ◽  
Author(s):  
Sikandar Ejaz ◽  
Zeshan Iqbal ◽  
Peer Azmat Shah ◽  
Bilal Haider Bukhari ◽  
Armughan Ali ◽  
...  

The industrial revolution 4.0 demands the convenience of a human life facility. Not to forget also in the cleaning service. When we will dispose of trash, we do not need to look for the trash can, it is precisely the trash can that will approach us. This smartphone-based application uses the A * (A star) algorithm as the basis for its work, while for communication between smartphones with the trash can system using blue tooth. The smartphone sends its coordinate position through the Global Positioning System facility, then the trash can system will search for the sender's location. The experimental results show that the average stopping distance indoors without barrier is 7.03 meters with an average time response of 25.3 seconds, the average stopping distance in the room with a barrier of 7.2 meters with the average response time 3.6 seconds average, stopping distance outdoor without a barrier of 5.7 meters with an average response time of 258.3 seconds, and the average outdoor stopping distance with a barrier of 2.73 meters with a response an average time of 141.3 seconds.


Author(s):  
Veljko Aleksić ◽  
Olga Ristić

Determining and understanding the user experience in gamified educational environments is a contemporary challenge, especially when analyzing the flow experience (balance of challenge and skills, conscious actions, clear goals, clear feedback, sense of control, etc.). The reason for this lies in the assessment tools that most often created and implemented to separate the user from the experience of flow and/or cannot be applied en masse.The paper presents the results of a study in which flow experience was modeled based on data logs (e.g. number of mouse actions or average response time) in gamified educational environment on a sample of 31HE students. The results indicate the existence of correlations between data logs and flow experience dimensions.


Author(s):  
Chen Jin ◽  
Saba Sehrish ◽  
Wei-keng Liao ◽  
Alok Choudhary ◽  
Karen Schuchardt

Author(s):  
Shabana ◽  
Sallauddin Mohmmad ◽  
Mohammed Ali Shaik ◽  
K Mahender ◽  
Ranganath Kanakam ◽  
...  

Author(s):  
Osvaldo Adilson De Carvalho Junior ◽  
Sarita Mazzini Bruschi ◽  
Regina Helena Carlucci Santana ◽  
Marcos José Santana

The aim of this paper is to propose and evaluate GreenMACC (Green Metascheduler Architecture to Provide QoS in Cloud Computing), an extension of the MACC architecture (Metascheduler Architecture to provide QoS in Cloud Computing) which uses greenIT techniques to provide Quality of Service. The paper provides an evaluation of the performance of the policies in the four stages of scheduling focused on energy consumption and average response time. The results presented confirm the consistency of the proposal as it controls energy consumption and the quality of services requested by different users of a large-scale private cloud.


Sign in / Sign up

Export Citation Format

Share Document