A Heuristic Model for Estimating Component-Based Software System Reliability Using Ant Colony Optimization

نویسندگان

  • Kirti Tyagi
  • Ajay Kumar Garg
  • Arun Sharma
چکیده

Most software reliability models for component-based software systems (CBSSs) depend on either the system architecture or component reliability and glue code reliability. It is important to optimize the usage of paths to obtain more accurate estimates of CBSS reliability. By using bio-inspired optimization techniques that are currently being developed, we can find the value of the most-used path for any CBSS. This paper develops a new model for estimating CBSS reliability which accounts for path usage. The proposed model is proved to perform better than other models. This paper proposes a model for estimating CBSS reliability using a bio-inspired algorithm, ant colony optimization (ACO). This model introduces heuristic component dependency graphs (HCDGs), which help to estimate CBSS reliability. This paper also proposes using the reliability of components and assessing their impact on overall system reliability. The results of this paper show that HCDGs give better reliability estimates than other existing methods. A case study of a security management system is presented, along with its results. The proposed approach is fully dependent on CBSS characteristics and provides a good reliability estimation method for CBSSs, taking into consideration both component reliability and CBSS reliability.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem

The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...

متن کامل

A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

متن کامل

Multi-objective Reconfiguration of Distribution Network Using a Heuristic Modified Ant Colony Optimization Algorithm

In this paper, a multi-objective reconfiguration problem has been solved simultaneously by a modified ant colony optimization algorithm. Two objective functions, real power loss and energy not supplied index (ENS), were utilized. Multi-objective modified ant colony optimization algorithm has been generated by adding non-dominated sorting technique and changing the pheromone updating rule of ori...

متن کامل

Optimum Software Aging Prediction and Rejuvenation Model for Virtualized Environment

Advancement in electronics and hardware has resulted in multiple softwares running on the same hardware. The result is multiuser, multitasking, multithreaded and virtualized environments. However, reliability of such high performance computing system depends both on hardware and software. For hardware, aging can be dealt with replacement. But, software aging needs to be dealt with different tec...

متن کامل

Solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014