Ravi Rastogi

Load Balancing of Nodes in Cloud Using Ant Colony Optimization

In this paper, we proposed an algorithm for load distribution of workloads among nodes of a cloud by the use of Ant Colony Optimization (ACO). This is a modified approach of ant colony optimization that has been applied from the perspective of cloud or grid network systems with the main aim of load balancing of nodes. This modified algorithm has an edge over the original approach in which each ant build their own individual result set and it is later on built into a complete solution. However, in our approach the ants continuously update a single result set rather than updating their own result set. Further, as we know that a cloud is the collection of many nodes, which can support various types of application that is used by the clients on a basis of pay per use. Therefore, the system, which is incurring a cost for the user should function smoothly and should have algorithms that can continue the proper system functioning even at peak usage hours.

3-Disjoint Paths Fault-tolerant Omega Multi-stage Interconnection Network with Reachable Sets and Coloring Scheme

In this paper, we have proposed a new 16 x 16 3-Disjoint Paths Fault-tolerant Omega Multi-stage Interconnection Network (3-DON) using the concept of reachable sets and coloring scheme. A 3-Disjoint network can concurrently send packets from the source node to increase the arrival ratio or tolerate a maximum of 2 faults in the network by re-routing the packet through another path We have used red blue, green and yellow color for the coloring the nodes. The New 3-DON is better in comparison to existing non Fault-tolerant Omega Multi-stage Interconnection Network in every aspect of performance except the cost.

3-Disjoint Paths Fault-tolerant Multi-stage Interconnection Networks

In this paper, we have compared the existing 3-Disjoint Paths Fault-tolerant Omega Multi-stage Interconnection Network (3-DON) with newly proposed 3-Disjoint Fault-tolerant Gamma Interconnection Network (3-DGMIN) using the concept of reachable sets and coloring scheme. A 3-Disjoint network can concurrently send packets from the source node to increase the arrival ratio or tolerate a maximum of 2 faults in the network by re-routing the packet through another path. We have used red blue, green and yellow color for the coloring the nodes. The 3-DON is better than existing Omega Multi-stage Interconnection Network (OMIN) for every performance parameter except the cost. Moreover, the new 3-DGMIN is also better than existing Gamma Multi-stage Interconnection Network (GIN) for every performance parameter. Further, the experimental results show that the 3-DGMIN outperforms 3-DON when compared for the throughput.

Security Analysis and Implementation of 3-Level Security System Using Image Based Authentication

Increasing security has always been an issue since Internet and Web Development came into existence, text based passwords is not enough to counter such problems, which is also an anachronistic approach now. Therefore, this demands the need for something more secure along with being more user-friendly. Therefore, we have tried to increase the security by involving a 3-level security approach, involving text based password at Level 1, Image Based Authentication at Level 2, and automated generated one-time password (received through an automated email to the authentic user) at Level 3. And an assiduous effort has been done for thwarting Shoulder attack, Tempest attack, and Brute-force attack at client side, through the use of unique image set in the IBA System.

Cost-based Job grouping and Scheduling Algorithm for Grid computing Environments

The integration of remote and diverse resources and the increasing computational needs of Grand challenges problems combined with faster growth of the internet and communication technologies leads to the development of global computational grids. Grid computing is a prevailing technology, which unites underutilized resources in order to support sharing of resources and services distributed across numerous administrative region. An efficient and effective scheduling system is essentially required in order to achieve the promising capacity of grids. The main goal of scheduling is to maximize the resource utilization and minimize processing time and cost of the jobs. In this research, the objective is to prioritize the jobs based on execution cost and then allocate over the resources with minimum cost by merging it with conventional job grouping strategy to provide solution for better and more efficient job scheduling which is beneficial to both user and resource broker. The proposed scheduling approach in grid computing employs a dynamic cost-based job scheduling algorithm for making efficient mapping of job to available resources in grid. It also improves communication to computation ratio (CCR) and utilization of available resources by grouping the user jobs before resource allocation. General Terms Algorithm, GridSim.

Limitations of Function Point Analysis in Multimedia Software/Application Estimation

Till date the Function Point Analysis (FPA) was and it is mostly accepted size estimation method for the software sizing community and it is still in use. In developing the software system, software projects cost plays very important role before it is developed in the context of size and effort. Allan J. Albrecht in 1979 developed the FPA, which, with some variations has been well accepted by the academicians and practitioner (Gencel and Demirors in ACM Trans Softw Eng Methodol 17(3):15.1–15.36, 2008) [1]. For any software development project, estimation of its size, completion time, effort required, and finally the cost estimation are critically important. Estimation assists in fixing exact targets for project completion. In software industry, the main concern for the software developers is the size estimation and its measurement. The old estimation technique—line of code—cannot solve the purpose of size estimating requirements for multilanguage programming skill capabilities and its ongoing size growing in the application development process. However, by introducing the FP, we can resolve these difficulties to some degree. Gencel and Demirors proposed an estimation method to analyze software effort based on function point in order to obtain effort required in completion of the software project. They concluded that the proposed estimation method helps to estimate software effort more precisely without bearing in mind the languages or developing environment. Project manager can have the track on the project progress, control the cost, and ensure the quality accurately using given function point (Zheng et al. in estimation of software projects effort based on function point, IEEE, 2009) [2]. But, the use of multimedia technology has provided a different path for delivering instruction. A two-way multimedia training is a process, rather than a technology, because of that interested users are being benefited and have new learning capabilities. Multimedia software developer should use suitable methods for designing the package which will not only enhance its capabilities but will also be user-friendly. However, FPA has its own limitations, and it may not estimate the size of multimedia software projects. The characteristics and specifications of multimedia software applications do not fall under FPA specifications. The use of FPA for multimedia software estimation may lead to wrong estimates and incomplete tasks which will end up into annoying all the stakeholders of the project. This research paper is an attempt to find out the constraint of function point analysis based on highlighting the critical issues (Ferchichi et al. in design system engineering of software products implementation of a software estimation model, IMACS-2006, Beijing, China, 2006) [3].

Performance Parameters for Load Balancing Algorithm in Grid Computing

Grid computing is a new parallel and distributed computing paradigm that provides resources for large scientific computing applications. This paper describe the new analysis of parameters for load balancing in Grid that is responsible for performance of load balancing in Grid Computing. At end of paper we show a table of comparison of various load balancing algorithms based on different parameters.

Case Tool: Fast Interconnections with New 3-Disjoint Paths MIN Simulation Module

Multi-stage interconnection networks (MIN) can be designed to achieve fault tolerance and collision solving by providing a set of disjoint paths. In this paper, we are discussing the new simulator added to the tool designed for developing fault tolerant MINs. The designed tool is one of its own kind and will help the user in developing 2 and 3-disjoint path networks. The java technology has been used to design the tool and have been tested on different software platform.