The quickest path reliability problem

• Grant number: 24/02477-3
• Support Opportunities: Scholarships in Brazil - Scientific Initiation
• Start date: May 01, 2024
• End date: October 31, 2024
• Field of knowledge: Physical Sciences and Mathematics - Mathematics - Applied Mathematics
• Principal Investigator: Majid Forghani Elahabad
• Grantee: Nicolas Torres Matos
• Host Institution: Centro de Matemática, Computação e Cognição (CMCC). Universidade Federal do ABC (UFABC). Ministério da Educação (Brasil). Santo André , SP, Brazil

Abstract

Many real-world systems, such as power transmission and distribution systems, computers and communications, social networks, and so on can be modeled as multistate flow networks (MFNs), which makes the reliability assessment of such networks of great importance.There is a time constraint in many realistic flow networks that plays an essential role. Integrating the quickest path problem and the reliability of MFNs, the quickest path problem in MFNs, also known as the quickest path reliability problem, emerged in 2003 [11]. This problem aims to calculate the probability of successfully sending a minimum of $d$ data units from a source node to a destination node via a minimal path (MP) within a specified time frame of $T $ units. Several exact and approximative algorithms have been proposed in the literature to address this problem.This undergraduate research (scientific initiation) project aims first to study the MFNs and then focus on the quickest path reliability problem. The student has already started studying the book [26] and will continue studying some very recently published articles on the considered problem, including two articles by the project supervisor published in 2022 [4] and 2023 [5]. As the student has completed almost all undergraduate courses, we believe there is a high potential for obtaining new results and a publication. Furthermore, new issues have arisen during our meetings and discussions so far which are described in this proposal. The project also aims to investigate these challenges.