• HOME
• PRODUCTS
• CS PROJECTS
• EC/EE PROJECTS
• ORDER A PROJECT
• SUGGEST A PROJECT
• SUBMIT STUDENT FORM
• ABOUT US
• CONTACT US
• Log In
  Username:
  
  
  Password:
  
  
  

• Products Section
• Modems
  • Gps modems
  • Gsm modems
• Rfid readers
  • Rfid readers
  • Rfid cards
• Jammers
  • Mobile jammers
• Sensors
  • Pir sensors
  • Gas sensors
  • Fingerprint sensor
  • Touch screen sensors
• Wireless modules
• Robotics
  • Motors
• Main Menu
• Home
• Products
• CS Projects
• EC/EE Projects
• Order Project
• Suggest Project
• About Us
• Contact Us

• Home >
• AP116

IMPLEMENTATION OF DYNAMIC LOAD BALANCING ON EXAMINATION RESULT BASED SERVER

Project Platform : JAVA

Languages Used : JAVA

Project Cost : 8000

Description

Note :- The project is designed to work on Single Computer

The approach considers the heterogeneity in the processing rates of the nodes as well as the randomness in the delays imposed by the communication medium. The optimal one-shot load balancing policy is developed and subsequently extended to develop an autonomous and distributed load-balancing policy that can dynamically reallocate incoming external loads at each node. This adaptive and dynamic load balancing policy is implemented and evaluated in a two-node distributed system. The performance of the proposed dynamic load-balancing policy is compared to that of static policies as well as existing dynamic load-balancing policies by considering the average completion time per task and the system processing rate in the presence of random arrivals of the external loads.

About the Project

A sender-initiated distributed DLB policy where Main Server node autonomously executes LB at every external load arrival at that node. The DLB policy utilizes the optimal one-shot LB strategy each time an LB episode is conducted, and it does not require synchronization among nodes. Every time an external load arrives at a node, only the Main Server node executes a locally optimal one-shot-LB action, which aims to minimize the average overall completion time. The action mainly consists of two algorithm processing 

1)    Least Weighted Connection Algorithm.

2)    Round Trip Time.

This requires the generalization of the regeneration-theory-based queuing model for the centralized one-shot LB. Furthermore, every LB action utilizes current system information that is updated during runtime. Therefore, the DLB policy adapts to the dynamic environment of the distributed system.

Advantages :-

• The scheduling decisions are made at runtime 

• LB Process  value get dynamically changed. 

• Server allotting process is dynamically predetermined 

• Download process with respect to client is very fast. 

• Lesser or zero number of clients in the queues. 

• Faster response time. 

• Less or no delay in processing the request of client.

Block Diagram :-

Hardware Interface Required

 Hard disk : 40 GB
 RAM : 512 MB
 Processor Speed : 3.00GHz
 Processor : Pentium IV Processor

Software Interface Required

 JDK 1.5
 Java Swing
 MS-Access