Chita Ranjan Tripathy

Performance modelling and analysis of mobile grid computing systems

Mobile grid computing has gained immense importance with academics, industry and the military. The performance issues such as load balancing, fault tolerance and reliability are quite important in mobile grid environments. In this paper, a decentralised load balancing model with fault tolerance for mobile grid computing system is proposed. Two algorithms are proposed: one for decentralised load balancing and the other for fault tolerance. The efficiency and time complexity of the proposed algorithms are found better compared to the existing works. The paper also proposes a method for modelling the reliability of mobile grid. Two terminal reliability of mobile grid computing system has been evaluated using the proposed model. The simulation results are presented.

A new adaptive median filtering technique for removal of impulse noise from images

This paper describes a new technique for the design of Adaptive Median Filtering Technique, aimed at removing the impulse noise (salt and pepper noise) from the image and reducing distortion in the image. The filter is designed to reconfigure itself and provide real-time noise reduction. This paper investigates a high-speed non-linear Adaptive median filter implementation. Then Adaptive Median Filter serves the dual purpose of removing the impulse noise from the image and reducing distortion in the image. Adaptive Median Filtering can achieve the filtering operation of an image corrupted with impulse noise up to 70%.

Survey of load balancing techniques for Grid

In recent days, due to the rapid technological advancements, the Grid computing has become an important area of research. Grid computing has emerged a new field, distinguished from conventional distributed computing. It focuses on large-scale resource sharing, innovative applications and in some cases, high-performance orientation. A Grid is a network of computational resources that may potentially span many continents. The Grid serves as a comprehensive and complete system for organizations by which the maximum utilization of resources is achieved. The load balancing is a process which involves the resource management and an effective load distribution among the resources. Therefore, it is considered to be very important in Grid systems. The proposed work presents an extensive survey of the existing load balancing techniques proposed so far. These techniques are applicable for various systems depending upon the needs of the computational Grid, the type of environment, resources, virtual organizations and job profile it is supposed to work with. Each of these models has its own merits and demerits which forms the subject matter of this survey. A detailed classification of various load balancing techniques based on different parameters has also been included in the survey. Presents an extensive survey of the existing load balancing techniques proposed so far.The load balancing techniques have been appropriately classified under different headings.An analysis of trends in publication of load balancing techniques for Grid has been described.

A heuristic algorithm for core selection in multicast routing

With the development of network multimedia technology, more and more real-time multimedia applications need to transmit information using multicast. The basis of multicast data transmission is to construct a multicast tree. The main problem concerning the construction of a shared multicast tree is selection of a root of the shared tree or the core point. In this paper, we propose a heuristic algorithm for core selection in multicast routing. The proposed algorithm selects core point by considering both delay and inter-destination delay variation. The simulation results show that the proposed algorithm performs better than the existing algorithms in terms of delay variation subject to the end-to-end delay bound. The mathematical time complexity and the execution time of the proposed algorithm are comparable to those of the existing algorithms.

An improved approach for load balancing among heterogeneous resources in computational grids

In recent days, due to the rapid technological advancements, the grid computing has become an important area of research in distributed systems. The load balancing is a very important and complex problem in grid computing. In this paper, we propose a dynamic-distributed load-balancing technique called the improved load balancing on enhanced GridSim with deadline control (IEGDC) for computational grids. Here, we provide a new mechanism of scheduling to enhance the utilization of the resources and to prevent the resource overloading. A selection method for scheduling by considering the state of resource bandwidth and capacity of various resources is presented. We simulate the proposed load-balancing strategy on the GridSim platform. The proposed mechanism on comparison is found to outperform the existing schemes in terms of response time, resubmitted time, finished and unfinished Gridlets. The simulation results are presented.

A Framework for QoS Provisioning in Differentiated Service Multicast Networks

A scalable QoS-aware multicast deployment in DiffServ networks has become an important area of research in recent years. Although multicasting and differentiated services are two complementary technologies, the integration of the two technologies is a non-trivial task due to architectural conflicts between them. A popular solution proposed is to extend the functionality of the DiffServ components to support multicasting. In this paper, we propose an algorithm to construct an efficient QoS-driven multicast tree, taking into account the available bandwidth per service class. We also present an efficient method to provide the limited available bandwidth for supporting heterogeneous users. The proposed mechanism is evaluated using simulated tests. The simulated results reveal that our algorithm can effectively minimize the bandwidth use and transmission cost.

On the design of an efficient load balancing mechanism on GridSim adapted to the computing environment of heterogeneity in both resources and networks

GridSim is a widely used grid simulation tool. Since it simulates a grid environment well, it has been widely used in studies of grids. Many researchers have proposed various load-balancing techniques in the grid, but all those cannot be used in GridSim due to the structural differences of the grid. In this study, the authors propose an enhanced load balancing method called enhanced GridSim with heterogeneity aware load balancing (EGHLB) for GridSim. The proposed algorithm EGHLB estimates system parameters such as load on the resource, the expected finish time of a Gridlet on resources on each Gridlet arrival and then balances the load by providing a new mechanism of scheduling which prevents the resource overloading and executes all the Gridlets on the heterogeneous resources within the assigned deadline. A selection method for efficient scheduling of Gridlets among heterogeneous resources is presented by taking into account the deadline, network heterogeneity, and resource heterogeneity. They simulate the proposed algorithm on the GridSim platform.

A heuristic algorithm for delay delay-variation bounded least cost multicast routing

Many multimedia communication applications require a source to transmit messages to multiple destinations subject to delay and delay-variation constraints. To support delay constrained multicast communications, computer networks have to guarantee an upper bound end-to-end delay from the source node to each of the destination nodes. On the other hand, if the same message fails to arrive at each destination node at the same time, there will probably arise inconsistency and unfairness problem among users. The problem to find a minimum cost multicast tree with delay and delay variation constraints has been proven to be NP-Complete. In this paper, we present a more efficient heuristic algorithm, namely, Economic Delay and Delay Variation Bounded Multicast Algorithm (EDVBMA), based on a novel heuristic function, to construct a least cost delay and delay variation bounded multicast tree. A noteworthy feature of this algorithm is that it has very high probability of finding the optimal solution in polynomial time with low computational complexity.