Short Schedules for Fast Flow Rerouting

05/15/2018
by   Saeed Akhoondian Amiri, et al.
0

This paper studies the fundamental problem of how to reroute k unsplittable flows of a certain demand in a capacitated network from their current paths to their respective new paths, in a congestion-free manner and fast. This scheduling problem has applications in traffic engineering in communication networks and has recently received much attention in software-defined networks, in which updates are distributed over an asynchronously network by a software controller. However, existing algorithms for this problem either have a super-polynomial runtime or only compute feasible schedules, which do not provide any guarantees on the length of the rerouting schedule. This paper presents the first polynomial-time algorithm for computing shortest update schedules to reroute flows in a congestion-free manner. We contribute an almost tight characterization of the polynomial-time tractability of the problem: We present the first polynomial-time solution for this problem for two flows, but also show that even the question whether a feasible update schedule exists, is already NP-hard for six flows. In fact, the presented algorithm runs in linear time and is hence not only optimal in terms of scheduling but also asymptotically optimal in terms of runtime.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/26/2017

A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes

This paper presents the first polynomial time algorithm to compute geode...
research
11/04/2021

Reallocation Problems with Minimum Completion Time

Reallocation scheduling is one of the most fundamental problems in vario...
research
04/08/2020

A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes

We consider the routing flow shop problem with two machines on an asymme...
research
03/24/2022

Scheduling UET-UCT DAGs of Depth Two on Two Processors

Given unit execution time (UET) tasks whose precedence constraints form ...
research
04/25/2019

Complexity of URLLC Scheduling and Efficient Approximation Schemes

In this paper we address the problem of joint admission control and reso...
research
01/09/2019

Polynomial-time Capacity Calculation and Scheduling for Half-Duplex 1-2-1 Networks

This paper studies the 1-2-1 half-duplex network model, where two half-d...
research
07/03/2019

Using Bi-Directional Information Exchange to Improve Decentralized Schedule-Driven Traffic Control

Recent work in decentralized, schedule-driven traffic control has demons...

Please sign up or login with your details

Forgot password? Click here to reset