Back close

Optimal election winning search algorithm for distributed systems

Publication Type : Conference Proceedings

Publisher : 2nd International Conference on Telecommunication and Networks (TELNET-2017)

Source : 2017 2nd International Conference on Telecommunication and Networks (TEL-NET), IEEE (2017)

Url : https://ieeexplore.ieee.org/abstract/document/8343576

Keywords : Bandwidth, BFS, Breadth First Search, buffer length, degree centrality, Depth First Search, Depth First Search algorithms, DFS search algorithms, distributed system, measurement, OEWSA, Optimal Election Winning Search Algorithm, optimisation, power loss, Reliability, routing, search problems, System reliability, Time complexity, tree searching, Voting

Campus : Bengaluru

School : School of Computing

Department : Computer Science

Year : 2017

Abstract : 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.

Cite this Research Publication : A. Sahay, Dr. Tripty Singh, Karthik, G., and Angadi, S., “Optimal election winning search algorithm for distributed systems”, 2017 2nd International Conference on Telecommunication and Networks (TEL-NET). IEEE, 2017.

Admissions Apply Now