Dynamic Selection of the Best Server Out of Multiple Servers Available Using Bully Algorithm in Any Geographical Area

Autor: Kartikeya Shukla, Bhaswati Sahoo
Rok vydání: 2020
Předmět:
Zdroj: Advances in Electrical Control and Signal Systems ISBN: 9789811552618
DOI: 10.1007/978-981-15-5262-5_66
Popis: This paper is about selecting the best server out of many servers available for a website. In the present scenario, the number of users is increasing day by day on the Internet and the services provided by this website are facing heavy traffic. Services like downloading and uploading fail due to many reasons like geographical location, heavy traffic or server not responding. Sometime even the best server might fail to provide the service. This can be reduced by implementing bully algorithm of the distributed algorithm. This paper provides an idea and extended use of this algorithm in various scenarios. This algorithm deals with a large number of servers that are working and providing the best server (depending upon the priority and working of the server) out of multiple servers, which is similar to electing a leader in an election. This algorithm can be programmed and computed individually on each server. It can save time and even reduce the work load on each server. It can further be implemented in routers, printers and other distributed computing devices. The algorithm can be considered successful and is ready to be implemented on the system.
Databáze: OpenAIRE