Computer networks have become a critical infrastructure. In fact, networks should not only
meet strict requirements in terms of correctness, availability, and performance but they …

We consider the fundamental problem of updating arbitrary routes in a software-defined
network in a (transiently) loop-free manner. Our objective is to compute fast network update …

Computer networks such as the Internet or datacenter networks have become a crucial
infrastructure for many critical services. Accordingly, it is important that such networks …

Changing a given configuration in a graph into another one is known as a re-configuration
problem. Such problems have recently received much interest in the context of algorithmic …

In this work we study local checkability of network properties like s–t reachability, or whether
the network is acyclic or contains a cycle. A structural property S of a graph G is locally …

Software-defined networking (SDN) enables controlling the behavior of a network in
software, by managing the forwarding rules installed on switches. However, it can be difficult …

Traffic engineering (TE) and efficient network updating have been considered as separate
problems in previous SDN research. Traffic engineering mostly focuses on static traffic and …

In consistent flow migration, the task is to change the paths the flows take in the network, but
without inducing congestion during the update process. Even though the rise of Software …

Consistent routing updates through Software-Defined Networking (SDN) can be difficult due
to the asynchronous and distributed nature of the data plane. Recent studies have achieved …

The SDN control plane needs to frequently update the data plane as the network conditions
change. Since each switch updates its flow table independently and asynchronously, the …