Hershey, Pennsylvania
New York, New YorkBeijing, China
On Solving the Multi-Objective Software Package Upgradability Problem

On Solving the Multi-Objective Software Package Upgradability Problem

Noureddine Aribi (Lab. LITIO, University of Oran 1, Oran, Algeria) and Yahia Lebbah (Lab. LITIO, University of Oran 1, Oran, Algeria)
Copyright: © 2018 |Pages: 21
DOI: 10.4018/IJOSSP.2018040102
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Free and open source software (FOSS) distributions are increasingly based on the abstraction of packages to manage and accommodate new features before and after the deployment stage. However, due to inter-package dependencies, package upgrade entails challenging shortcomings of deployment and management of complex software systems, inhibiting their ability to cope with frequent upgrade failures. Moreover, the upgrade process may be achieved according to some criteria (maximize the stability, minimize outdated packages, etc.). This problem is actually a multi-objective optimization problem. Throughout the article, the authors propose a Leximax approach based on mixed integer linear programming (MILP) to tackle the upgradability problem, while ensuring efficiency and fairness requirements between the objective functions. Experiments performed on real-world instances, from the MANCOOSI project, show that the authors' approach efficiently finds solutions of consistently high quality.
Article Preview
Top

2. Preliminaries

Before discussing our approach, we provide some necessary background.

Complete Article List

Search this Journal:
Reset
Volume 16: 1 Issue (2025): Forthcoming, Available for Pre-Order
Volume 15: 1 Issue (2024)
Volume 14: 1 Issue (2023)
Volume 13: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 1 Issue (2015)
Volume 5: 3 Issues (2014)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing