J. Amudhavel ¹, P. Dhavachelvan ², R. Baskaran ³

Affiliations
1 Department of CSE, SMVEC, Mannadipet Commune, Madagadipet, Puducherry - 605107 Pondicherry, IN
2 Department of CSE, Pondicherry University, Kalapet, Puducherry - 605014, Pondicherry, IN
3 Department of CSE, Anna University, Sardar Patel Road, Guindy, Chennai - 600025

Abstract

Background/Objectives: To analyze the behaviors of Leaf Cutter Ants and develop Bio-inspired intelligent communication mechanism for Research in Computing. Findings: In this research, the decision making realizations of the foraging ants are methodologically ascertained, collected and imported. Researchers have come across streaks of emergent patterns pertaining to foraging. It can be estimated in brevity that colonial ants possess or are guided by some feedback loops - positive or negative, coupled with individual responses arbitrated by social behavior of foraging ants and justifiable integrations of effacing local information during the phase of food collection after scrutiny and analysis of colony conditions. Applications/Improvements: The behavioral demeanor of ants relies largely on community building and prosperity, rather than individual optimization. The ants can sense and act differently when they understand that they are being scrutinized. Moreover, the intriguing art of surviving amongst weird environs of harmful parasites merely with the aid of Streptomyces can also be artificially implemented for the benefit of humankind in its entirety.

Keywords

Bio Inspired, Communication, Computing, Intelligence, Leaf Cutter Ant

Full Text

   

J. Amudhavel ¹, U. Prabu ¹, P. Inbavalli ¹, N. Moganarangan ², V. Ravishankar ³, R. Baskaran ⁴, P. Dhavachelvan ⁵

Affiliations
1 Department of CSE, SMVEC, Pondicherry - 605107, Tamil Nadu, IN
2 Department of CSE, RGCET, Pondicherry - 607403, Tamil Nadu, IN
3 Department of CSE, Bharathiar University, Coimbatore - 641046, Tamil Nadu, IN
4 Department of CSE, Anna University, Chennai - 600025, Tamil Nadu, IN
5 Department of CSE, Pondicherry University, Pondicherry - 605014, Tamil Nadu, IN

Abstract

Background/Objectives: To analyze the functions and merits of web service composition and provide services to many number of users at a time. Methods/Statistical Analysis: The standard-based approach whichused to connects the web service to create the business processes which are of higher level. There are various approaches for composing the web services.Web service integrates various web applications by using languages namely WSDL, XML, WSFL etc. Findings: In this research, Web Service Composition (WSC) aims to organize numerous services to fulfill the user needs. It is one of the flexible way of integration of applications and resource sharing. The algorithm used by web service composition are Evolutionary algorithm, Ant Colony Optimization, Genetic algorithm, Particle Swarm algorithm, Branch and Bound for Execution Plan Selection (BB4EPS) algorithm, Join-Idle-Queue (JIQ) algorithm and Two-phase algorithm. Through the web service leads to provide services to more than single user. Applications/Improvements: When solving the web service composition problem, composing a sequence of web services is converted into finding a chain of actions. Automated planning technique uses two steps for web service composition dynamically. In this approach, WSC problem is taken as input and translated into WSC planning problem. Web service composition explore their functions through the online process and business needs.

Keywords

Web Service Composition- Approaches

Full Text

   

D Sathian ¹, R. Ilamathi ², R. Praveen Kumar ¹, J. Amudhavel ³, P. Dhavachelvan ⁴

Affiliations
1 Department of CSE, Pondicherry University, Kalapet, Puducherry - 605014, Pondicherry, IN
2 Department of CSE,SMVEC, Mannadipet Commune, Madagadipet, Pondicherry - 605107,, IN
3 Department of CSE,Mannadipet Commune, Madagadipet, Puducherry - 605107, IN
4 Pondicherry University, Pondicherry – 605014, Tamil Nadu, IN

Abstract

Background/Objectives: To analyze, find and interpret the current challenges in Distributed File Systems for research. Method/Statistical Analysis: With the immense growth of network applications a large amount of data existence is managed and stored. To process a huge amount data that is to be stored, a backend framework is required and for that DFS provides a central store for those data. As the amount of data being increased, the issue of proving efficient and easy to use solution arises and this issue is overcome using distributed file systems. Findings: In this research, an overview about various evolution of file system and how distributed file system is being used effectively in wide variety of network applications. DFS aims at sharing data and storing resources which is physically distributed on computers with a common file system. The main issues concerning the design of DFS such as fault tolerance, architecture, synchronization, consistency and replication and few others are also discussed in detail. It alsogives a comprehensive taxonomy of DFS in detail. Applications/Improvements: The encouraging results observed from this work serve as the motivation to apply future implementation of DFS within the context of current developments in distributed computing.

Keywords

Challenges, Distributed File System, Fault Tolerance, Scalability, Transparency

Full Text