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...

Recurrent Neural Network Based Modeling of Gene Regulatory Network Using Bat Algorithm

Correct inference of genetic regulations inside a cell is one of the greatest challenges in post genomic era for the biologist and researchers. Several intelligent techniques and models were already proposed to identify...

Support Theorem for Random Evolution Equations in Hlderian Norm

In this paper, we purpose to prove the support theorem of the random evolution equation dX(t) = σ(X(t),Z(t))dWt + b(X(t), Y (t))dt (E) where X = {X(t), t ∈ [0; 1]} is the solution of (E) considered as which a random-vari...

Simulation of Minimum Path Estimation in Software Defined Networking Using Mininet Emulator

Software-Defined Networking (SDN) has become a significant topic of discussion among the network service providers, operators, and equipment vendors where control planes are separated from the data plane in networking de...

A Note on the Fuglede and Fuglede-Putnam’s Theorems

In this paper, we investigate the extension of Fuglede and Fuglede-Putnam’s Theorems to two bounded linear operators.

Download PDF file
  • EP ID EP322269
  • DOI 10.9734/JAMCS/2017/35358
  • Views 95
  • 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://www.europub.co.uk/articles/-A-322269