Comparison of Security Algorithms in a Distributed Monitoring Environment
Kaushik Sanganabhatla
Kaushik Sanganabhatla, M.Tech Computer Science & Engineering, University College of Engineering, Osmania University Campus, Hyderabad, India.
Manuscript received on May 17, 2012. | Revised Manuscript received on June 22, 2012. | Manuscript published on June 30, 2012. | PP: 352-355 | Volume-1 Issue-5, June 2012. | Retrieval Number: E0538061512/2012©BEIESP

Open Access | Ethics and Policies | Cite
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

Abstract: In a Real time wireless environment like WIFI, we send the data in the form of packets from one location to other. While sending the data to destination safely, we maintain some security algorithms for the confidentiality of the data. We use the knowledge of many pre- existing algorithm mechanisms for the smooth flow of the data packets in a timely & secured manner. Here, the main objective is to compare the various security algorithms in ganglia distributed monitoring system. The research stimulates that comparing the constant algorithms (1-point/minimal & 10-point/maximal) with the variable (optimal) algorithms. From these it can be concluded that the CPU memory usage is less in optimal algorithm in terms of against high load, bytes- in, bytes-out characteristics.
Keywords: 1-point or minimal, 10point or maximal, optimal algorithms and ganglia.