Multiflow Feasibility: An Annotated Tableau

Naves, Guyslain; Sebő, András

doi:10.1007/978-3-540-76796-1_12

Cited by 19 publications

(16 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To apply it to the undirected case, we can make use of a standard reduction from undirected graphs to directed graphs for link-disjoint paths, replacing every undirected link with five directed links [16], see Figure 4.…”

Section: A Undirected Graphs Are Tractablementioning

confidence: 99%

Charting the Algorithmic Complexity of Waypoint Routing

Amiri¹,

Foerster

Jacob

et al. 2018

SIGCOMM Comput. Commun. Rev.

View full text Add to dashboard Cite

Modern computer networks support interesting new routing models in which traffic flows from a source s to a destination t can be flexibly steered through a sequence of waypoints, such as (hardware) middleboxes or (virtualized) network functions (VNFs), to create innovative network services like service chains or segment routing. While the benefits and technological challenges of providing such routing models have been articulated and studied intensively over the last years, much less is known about the underlying algorithmic traffic routing problems. This paper shows that the waypoint routing problem features a deep combinatorial structure, and we establish interesting connections to several classic graph theoretical problems. We find that the difficulty of the waypoint routing problem depends on the specific setting, and chart a comprehensive landscape of the computational complexity. In particular, we derive several NPhardness results, but we also demonstrate that exact polynomialtime algorithms exist for a wide range of practically relevant scenarios.

show abstract

Section: A Undirected Graphs Are Tractablementioning

confidence: 99%

Charting the Algorithmic Complexity of Waypoint Routing

Amiri¹,

Foerster

Jacob

et al. 2018

SIGCOMM Comput. Commun. Rev.

View full text Add to dashboard Cite

show abstract

“…Besides simple graph classes such as trees, we are not aware of algorithms for a super-constant number of link-disjoint paths on directed graphs, which are also applicable to bidirected graphs. We refer to [32] for an annotated tableau. In contrast, we in this paper optimally solve OBWRP on cactus graphs with constant capacity.…”

Section: Related Workmentioning

confidence: 99%

A Walk in the Clouds: Routing Through VNFs on Bidirected Networks

Foerster

Parham

Schmid

2018

Algorithmic Aspects of Cloud Computing

View full text Add to dashboard Cite

The virtualization of network functions enables innovative new network services which can be deployed quickly and at low cost on (distributed) cloud computing infrastructure. This paper initiates the algorithmic study of the fundamental underlying problem of how to efficiently route traffic through a given set of Virtualized Network Functions (VNFs). We are given a link-capacitated network G = (V, E), a sourcedestination pair (s, t) ∈ V 2 and a set of waypoints W ⊂ V (the VNFs). In particular, we consider the practically relevant but rarely studied case of bidirected networks. The objective is to find a (shortest) route from s to t such that all waypoints are visited. We show that the problem features interesting connections to classic combinatorial problems, present different algorithms, and derive hardness results.

show abstract

“…This would prove that P = NP as F-EDP is also NP-complete. 31 So, assume that such an approximation algorithm A exists. Given an instance of the F-EDP problem, we construct an SDN network consisting of F flows, each with a rate of 1, whose origin and destination coincide with the designated vertices ((o( f ), d( f )).…”

Section: Proof the F-edge Disjoint Paths (F-edp) Problem Consists Ofmentioning

confidence: 99%

“…We will show that PeRP is NP-hard via a reduction from the F-vertex disjoint path (F-VDP) problem which is known to be NP complete. 31 An instance of the F-VDP problem consists of a graph G and F pairs of vertices…”

Section: Appendixmentioning

confidence: 99%

Power‐efficient routing for SDN with discrete link rates and size‐limited flow tables: A tree‐based particle swarm optimization approach

et al. 2017

View full text Add to dashboard Cite

Summary Software‐defined networking is a promising networking paradigm for achieving programmability and centralized control in communication networks. These features simplify network management and enable innovation in network applications and services such as routing, virtual machine migration, load balancing, security, access control, and traffic engineering. The routing application can be optimized for power efficiency by routing flows and coalescing them such that the least number of links is activated with the lowest link rates. However, in practice, flow coalescing can generally overflow the flow tables, which are implemented in a size‐limited and power‐hungry ternary content addressable memory (TCAM). In this paper, a set of practical constraints is imposed to the software‐defined networking routing problem, namely, size‐limited flow table and discrete link rate constraints, to ensure applicability in real networks. Because the problem is NP‐hard and difficult to approximate, a low‐complexity particle swarm optimization–based and power‐efficient routing (PSOPR) heuristic is proposed. Performance evaluation results revealed that PSOPR achieves more than 90% of the optimal network power consumption while requiring only 0.0045% to 0.9% of the optimal computation time in real‐network topologies. In addition, PSOPR generates shorter routes than the optimal routes generated by CPLEX.

show abstract

Multiflow Feasibility: An Annotated Tableau

Cited by 19 publications

References 23 publications

Charting the Algorithmic Complexity of Waypoint Routing

Charting the Algorithmic Complexity of Waypoint Routing

A Walk in the Clouds: Routing Through VNFs on Bidirected Networks

Power‐efficient routing for SDN with discrete link rates and size‐limited flow tables: A tree‐based particle swarm optimization approach

Contact Info

Product

Resources

About