Ramachandra.V.Pujeri

Work place: Vice-Principal, KGiSL Institute of Technology, Saravanampatti, Coimbatore -641035, Tamil Nadu, INDIA

E-mail: sriramu.vp@gmail.com

Website:

Research Interests: Data Structures and Algorithms, Data Mining, Solid Modeling, Operating Systems, Software Engineering, Software Development Process

Biography

Dr. Ramachandra.V.Pujeri, Born in Bijapur, Karnataka state in India, in 1973, received the B E in Electronics and Communication Engineering from Karnataka University, Dharwad, ME in Computer Science and Engg from PSG College of Technology, Coimbatore, Ph.D in Information and Communication Engineering from Anna University, Chennai, MBA in Human Resource Management, from Pondicherry University, Pondicherry, in 1996, 2002, 2007 and 2008 respectively. He is active life member of ISTE, SSI, MIE, ACS and IEE. His has written three textbooks. He is having around 18 years of teaching experience in the various top ten engineering colleges in India. He is an active expert committee member of AICTE, NBA, DoEACC, NACC and various Universities in India. Currently, under him ten research scholars pursuing their Ph.D. His research interests lie in the areas of Computer Networking, Operating System, Software Engineering, Software Reliability, Modeling and Simulation, Quality of Services and Data Mining. Currently, he is working as Vice-Principal of KGiSL Institute of Technology, Coimbatore.

Author Articles
Effective Congestion Avoidance Scheme for Mobile Ad Hoc Networks

By S.Sheeja Ramachandra.V.Pujeri

DOI: https://doi.org/10.5815/ijcnis.2013.01.04, Pub. Date: 8 Jan. 2013

Mobile nodes are organized randomly without any access point in Mobile Ad hoc Networks (MANETs). Due to the mobility of nodes, the network congestion occurs. So many congestion control mechanisms were proposed to avoid the congestion avoidance or reducing the congestion status. In this research work, we proposed to develop the Effective Congestion Avoidance Scheme (ECAS), which consists of congestion monitoring, effective routing establishment and congestionless based routing. The overall congestion status is measured in congestion monitoring. In routing establishment, we propose the contention metric in the particular channel in terms of, queue length of packet, overall congestion standard, packet loss rate and packet dropping ratio to monitor the congestion status. Based on the congestion standard, the congestionless based routing is established to reduce the packet loss, high overhead, long delay in the network. By extensive simulation, the proposed scheme achieves better throughput, packet delivery ratio, low end-to-end delay and overhead than the existing schemes.

[...] Read more.
Performance of TCP Vegas, Bic and Reno Congestion Control Algorithms on Iridium Satellite Constellations

By M.Nirmala Ramachandra.V.Pujeri

DOI: https://doi.org/10.5815/ijcnis.2012.12.04, Pub. Date: 8 Nov. 2012

Satellite networking is different from wired or wireless networks. The behavior and the performance of TCP/IP in normal wireless network as well as in wired network are different from one another. The TCP/IP protocol was not designed to perform well over high-latency or noisy channels so its performance over satellite networks are totally different. Each satellite networks/constellations have different properties. The deployment height, motion, direction, link capacity – all differ from one satellite constellations to another. So, certainly the behavior of TCP/IP will considerably differ from one satellite constellations than another.
The Performance of three different TCP Congestion algorithms, Vegas, Reno and Bic are taken for evaluation on the simulated satellite network Iridium and the performance of the three algorithms under the satellites constellation is measured using suitable metrics.
It is observed that, irrespective of the high end to end delay, the behavior of TCP/IP under Satellite network is somewhat resembling a high latency wired network. TCP under satellite network is not like that of a mobile ADHOC network. The observation resulted that the overall performance of Vegas was good in Iridium constellations. These reasons should be explored for designing a better congestion control algorithm exclusively for Satellite Networks.

[...] Read more.
Constraint Based Periodicity Mining in Time Series Databases

By Ramachandra.V.Pujeri G.M.Karthik

DOI: https://doi.org/10.5815/ijcnis.2012.10.04, Pub. Date: 8 Sep. 2012

The search for the periodicity in time-series database has a number of application, is an interesting data mining problem. In real world dataset are mostly noisy and rarely a perfect periodicity, this problem is not trivial. Periodicity is very common practice in time series mining algorithms, since it is more likely trying to discover periodicity signal with no time limit. We propose an algorithm uses FP-tree for finding symbol, partial and full periodicity in time series. We designed the algorithm complexity as O (kN), where N is the length of input sequence and k is length of periodic pattern. We have shown our algorithm is fixed parameter tractable with respect to fixed symbol set size and fixed length of input sequences. Experiment results on both synthetic and real data from different domains have shown our algorithms' time efficient and noise-resilient feature. A comparison with some current algorithms demonstrates the applicability and effectiveness of the proposed algorithm.

[...] Read more.
Other Articles