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

Boolean Product of Zero-one Matrices Application to Truth Values of Logical Connectives of Several Propositions

In this paper, the Boolean product of zero-one matrices are applied to obtain the truth values of several propositions with logical connectives. The propositional matrices are given in relation to the matrix algebric pro...

The Gamma Function and Its Analytical Applications

This paper explores the history and properties of the Gamma function with some analytical applications. Specifically, the Gamma function is employed to prove the legitimacy of the Standard Normal Distribution and for eva...

Rigidity and Shrinkability of Diagonalizable Matrices

We introduce the seemingly new concept of a rigid matrix based on the comparison of its sparsity to the sparsity of the natural powers of the matrix. Our results could be useful as a usage guide in the scheduling of vari...

Structure of Some Pregroups and Length Functions

The concept of Pregroups was introduced by Stallings in 1971. Subsequently the concept of Pregroups was developed by many other researchers. Stallings originally defined a set with a binary operation satisfying five axi...

Extensions of Locally Compact Abelian, Torsion-Free Groups by Compact Torsion Abelian Groups

Let X be a compact torsion abelian group. In this paper, we show that an extension of Fp by X splits where Fp is the p-adic number group and p a prime number. Also, we show that an extension of a torsion-free, non-divisi...

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