On Stability of Widest Path in Network Routing

Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 23, Issue 6

Abstract

The problem of widest path (WP) is a well-established topic in network routing and digital compositing. This paper contemplates one facet of the robustness of optimal solutions to the widest path; i.e., stability analysis of the WP problem. The study here deals with infimum and supremum perturbations which determine multiplicative changes each individual arc can tolerate conserving the optimality of a given WP. It is additionally illustrated how to determine these marginal values for all arcs, and an algorithm for computing all such values is proposed.

Authors and Affiliations

Ahmad Hosseini, Bita Kabir Baiki

Keywords

Related Articles

Characterization of Time to Failure in Prognostics: Brief Tutorial Guide to Prognostics Professionals

As a random variable, the survival time or Time to Failure (TTF) of a certain component or system can be fully characterized by its probability density function (pdf) fT (t) or its Cumulative Distribution Function (CDF)...

Convergence Analysis of a Non-overlapping DDM for Optimal Absorbing Boundary Control Problems Governed by Wave Equations

A non-overlapping domain decomposition method (DDM) is described to solve optimal boundary control problems governed by wave equations with absorbing boundary condition. The whole domain is divided into non-overlapping s...

Comparison of State-Estimation Algorithms for a Noise-Injected Lithium-ion Battery System

This paper deals with one of the most prominent problems in industrial prognostics, namely the estimation of the Remaining Useful Life (RUL) of the most popular industrial battery, viz., the lithium-ion battery. The pape...

A Recommendation for Classical and Robust Factor Analysis

Considering the factor analysis methods (classical or robust), the data input (data or scaled data), and the running matrix (covariance or correlation) all together, there are 8 combinations. The objective of the study i...

SEIRS Model for Pediatrics with Lower Respiratory Tract Infection

The ability of the immune system to detect and eliminate most pathogens is essential for the survival of lower respiratory tract infection in 2016 by Olubadeji [1]. Lower respiratory tract infection (LRTI) constituted th...

Download PDF file
  • EP ID EP322269
  • DOI 10.9734/JAMCS/2017/35358
  • Views 75
  • Downloads 0

How To Cite

Ahmad Hosseini, Bita Kabir Baiki (2017). On Stability of Widest Path in Network Routing. Journal of Advances in Mathematics and Computer Science, 23(6), 1-10. https://europub.co.uk/articles/-A-322269