D. I. George Amalarethinam

Work place: Jamal Mohamed College (Autonomous), Tiruchirappalli, India

E-mail: di_george@jmc.edu

Website:

Research Interests: Computer Networks, Systems Architecture, Operating Systems, Computer systems and computational processes

Biography

D I George Amalarethinam received his MCA, MPhil & PhD in Computer Science from Bharathidasan University in 1988, 1996 & 2007 respectively. He is working as an Associate Professor & Director of MCA in Jamal Mohammed College, Tiruchirappalli. He has 25 years of teaching and 15 years of research experience. He has published several papers in International and National Journals and Conferences. He is a Life Member of Indian Institute of Public Administration, New Delhi, Senior Member, International Association of Computer Science and Information Technology, Singapore and Editorial Board Member for many International Journals. His areas of interest are Parallel Processing, Operating Systems and Computer Networks.

Author Articles
Activity Recognition with Multi-tapeFuzzy Finite Automata

By H. Karamath Ali D. I. George Amalarethinam

DOI: https://doi.org/10.5815/ijmecs.2013.05.07, Pub. Date: 8 May 2013

Recognizing the activities performed by the user in an unobtrusive manner is one of the important requisites of pervasive computing. Users perform a number of activities during their day to day life. Tracking and deciding what a user is doing at a given time involves a number of challenges. The lack of a precise pattern in doing an activity at different times is one among them. The number, order, and duration of the different steps involved in an activity vary significantly, even when the activity is done by the same user at different times. To overcome these challenges, a number of simultaneous inputs have to be handled with provisions for handling variations in number, order and duration of these inputs. This paper explains how multi-tape fuzzy finite state automata can be used to effectively recognize human activities. The method explained is found to give good results when tested using publicly available activity datasets collected in a smart home environment.

[...] Read more.
Extended Queue Management Backward Congestion Control Algorithms for Web Transfers in Wireless Environment

By V.Sinthu Janita Prakash D. I. George Amalarethinam E. George Dharma Prakash Raj

DOI: https://doi.org/10.5815/ijcnis.2012.11.05, Pub. Date: 8 Oct. 2012

Wireless links are characterized by high error rates and intermittent connectivity. TCP congestion control has been developed on the assumption that network congestion is the only cause for packet loss. Upon detecting a packet loss, TCP drops its transmit window resulting in an unnecessary reduction of end-to-end throughput which results in suboptimal performance.The sender has to be made aware by some feedback mechanism that some of the losses reported are not due to congestion. The Active Queue Management algorithms (AQM) are used to reduce congestion, and in this paper, we have analysed four AQM algorithms, Random Early Deduction (RED), Wireless Explicit Congestion Notification (WECN), Queue Management Backward Congestion Control Algorithm (QMBCCA) and its enhanced version Extended Queue Management Backward Congestion Control Algorithm (EQMBCCA). WECN, QMBCCA & EQMBCCA algorithms make use of feedback mechanisms. WECN gives feedback using the CE bit. QMBCCA and EQMBCCA make use of ISQ notifications and also the CE bit whenever the average queue size crosses minimum threshold value. EQMBCCA reduces the reverse ISQ traffic by introducing a configurable intermediate threshold value IntThres. The comparison is made in terms of Delay, HTTP packet loss percentage and fairness for FTP flows in a wireless environment. It is found that the performance of EQMBCCA is almost equal to that of QMBCCA and better than RED and WECN.

[...] Read more.
Other Articles