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

Optimal Control Model of Malaria Disease with Standard Incidence Rate

In this research article, an optimal control model of malaria disease with standard incidence rate is proposed. Maximum Principle was employed to derive the necessary conditions for the existence of optimal control. Nume...

Viscosity Approximation Methods in Reflexive Banach Spaces with a Sequence of Contractions

The aim of this paper is to study viscosity approximation methods in re exive Banach spaces. Let E be a re exive Banach space which admits a weakly sequentially continuous duality mapping j : E → E  , C a nonempty close...

Fixed Points for Some Multivalued Mappings in Gp- Metric Spaces

The aim of this work is to establish some new xed point theorems for multivalued mappings in Gp metric space.

Mathematical Model of Dengue Disease Transmission Dynamics with Control Measures

Dengue disease is a mosquito-borne infectious tropical disease caused by the dengue viruses of four serotypes, DEN 1 - DEN 4. It is transmitted between people by the bite of female adult Aedes mosquitoes. In the present...

Geodesically Complete Lie Algebroid

In this paper we introduce the notion of geodesically complete Lie algebroid. We give a Riemannian distance on the connected base manifold of a Riemannian Lie algebroid. We also prove that the distance is equivalent to n...

Download PDF file
  • EP ID EP322269
  • DOI 10.9734/JAMCS/2017/35358
  • Views 94
  • 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