Programmability and verifiability lie at the heart of the software-defined networking paradigm. While OpenFlow and its match-action concept provide primitive operations to manipulate hardware configurations, over the last years, several more expressive network programming languages have been developed. This paper presents WNetKAT, the first network programming language accounting for the fact t...

Network virtualization techniques allow for the coexistence of many virtual networks (VNs) jointly sharing the resources of an underlying substrate network. The Virtual Network Embedding problem (VNE) arises when looking for the most profitable set of VNs to embed onto the substrate. In this paper, we address the offline version of the problem. We propose a Mixed-Integer Linear Programming form...

Missing and incorrect values often cause serious consequences. To deal with these data quality problems, a class of common employed tools are dependency rules, such as Functional Dependencies (FDs), Conditional Functional Dependencies (CFDs) and Edition Rules (ERs), etc. The stronger expressing ability a dependency has, data with the better quality can be obtained. To the best of our knowledge,...

We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, each associated with a positive flow demand, and a load-dependent performance function for each network element. We first prove the existence of a Nash equilibrium, considering two routing scenarios, namely when a user can ...

SAR interferometry (InSAR) has become one of the most powerful tools in radar remote sensing. Generation of digital elevation models, measurement of glacier flows and mapping of earthquakes, volcanoes and subsidence are the most prominent applications of InSAR. For most of these applications continuous acquisition of SAR data from space over many years, like with the ERS-1/2 or Radarsat, is ind...

The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...

Network virtualization is one of the fundamental building blocks of cloud computing, where computation, storage and networking resources are shared through virtualization technologies. However, the complexity of virtualization exposes additional security vulnerabilities, which can be taken advantage of by malicious users. While traditional network security technologies can help in virtualized e...

We study a capacitated network design problem in geometric setting. We assume that the input consists of an integral link capacity k and two sets of points on a plane, sources and sinks, each source/sink having an associated integral demand (amount of flow to be shipped from/to). The capacitated geometric network design problem is to construct a minimum-length network N that allows to route the...

In this paper we study the effects of data relaying in wireless sensor networks (WSNets) under QoS constraints with two different strategies. In the first, data packets originating from the same source are sent to the base station possibly along several different paths, while in the second, exactly one path is used for this purpose. The two strategies correspond to splitting and not splitting r...

This paper continues the project, initiated in [ACK], of describing general conditions under which relative splittings are derivable in the local structure of the enumeration degrees, for which the Ershov hierarchy provides an informative setting. The main results below include a proof that any high total e-degree below 0′ e is splittable over any low e-degree below it, a non-cupping result in ...