Given arbitrary source and target nodes s, t and an s–t-flow defined by its flow-values on each arc of a network, we consider the problem of finding a decomposition of this flow with a minimal number of s–t-paths. This problem is issued from the engineering of telecommunications networks for which the task of implementing a routing solution consists in integrating a set of end-to-end paths. We ...

Ramya M PG Scholar, Department of Computer Science, Klasalingam Institute of Technology,Krishnan koil Email: [email protected] Kowsalya K PG Scholar, Department of Computer Science, Klasalingam Institute of Technology,Krishnan koil Email: [email protected] Ramesh V Assistant Professor, Department of Computer Science, Klasalingam Institute of Technology, Krishnan koil Email: prof.ramesh...

We propose two flow control algorithms for networks with multiple paths between each source–destination pair. Both are distributed algorithms over the network to maximize aggregate source utility. Algorithm 1 is a first order Lagrangian method applied to a modified objective function that has the same optimal solution as the original objective function but has a better convergence property. Alg...

Data flow analysis techniques can be used to help assess threats to data confidentiality and integrity in security-critical program code. However, a fundamental weakness of static analysis techniques is that they overestimate the ways in which data may propagate at run time. Discounting large numbers of these falsepositive data flow paths wastes an information security evaluator’s time and effo...

The Flow Decomposition problem, which asks for the smallest set of weighted paths that “covers” a flow on a DAG, has recently been used as an important computational step in genetic assembly problems. We prove the problem is in FPT when parameterized by the number of paths, and we give a practical linear fpt algorithm. Combining this approach with algorithm engineering, we implement a Flow Deco...

Multipath routing can improve system performance of capacity-limited wireless networks through load balancing. However, even with a single source and destination, intra-flow and inter-flow interference can void any performance improvement. In this paper, we show that establishing non-interfering paths can, in theory, leverage this issue. In practice however, finding non-interfering paths can be...

A comparative study of routing techniques is carried out on complicated LEO constellations interconnecting high speed terrestrial networks. Shortest path routing as well as optimal routing (flow deviation) methods are applied for balanced and unbalanced traffic load and for uniform and non uniform distribution of the earth stations. The performance of flow deviation method is proved to be very ...

We introduce a new problem that combines the well known All Pairs Shortest Paths (APSP) problem and the All Pairs Bottleneck Paths (APBP) problem to compute the shortest paths for all pairs of vertices for all possible flow amounts. We call this new problem the All Pairs Shortest Paths for All Flows (APSP-AF) problem. We firstly solve the APSP-AF problem on directed graphs with unit edge costs ...