Optimal election winning search algorithm for distributed systems

Autor: Sunil Angadi, G. Karthik, Tripty Singh, Apurvanand Sahay
Rok vydání: 2017
Předmět:
Zdroj: 2017 2nd International Conference on Telecommunication and Networks (TEL-NET).
Popis: This paper presents the utilization of an Optimal Election Winning Search Algorithm (OEWSA) to optimally design the search algorithm for distributed systems. The effectiveness of the proposed Optimal Election Wining Search Algorithm (OEWSA) is compared to the Breadth First Search (BFS) and Depth First Search (DFS) search algorithms. The validity of the proposed algorithm is verified by the simulation results which are performed using Eclipse. Simulation results reveal that the OEWSA approach performs better in terms of delivery accuracy as applied to minimize power loss along with degree centrality, bandwidth and buffer length of the nodes of a distributed system with increased number of nodes and improves distribution system reliability.
Databáze: OpenAIRE