Learn More
We consider the problem of updating arbitrary routes in a software-defined network in a (transiently) loop-free manner. We are interested in fast network updates, i.e., in schedules which minimize the number of interactions (i.e., rounds) between the controller and the network nodes. We first prove that this problem is difficult in general: The problem of(More)
Networks are critical for the security of many computer systems. However, their complex and asynchronous nature often renders it difficult to formally reason about network behavior. Accordingly, it is challenging to provide correctness guarantees, especially during network updates. This paper studies how to update networks while maintaining a most basic(More)
Virtualization is arguably the main innovation motor in the Internet today. Virtualization enables the decoupling of applications from the physical infrastructure, and introduces new mapping and scheduling flexibilities. While the corresponding algorithmic problems are fairly well-understood, we ask: Who reaps the benefits from the virtualization(More)
Computer networks have become a critical infrastructure. Especially in shared environments such as datacenters it is important that a correct, consistent and secure network operation is guaranteed at any time, even during routing policy updates. In particular, at no point in time should it be possible for packets to bypass security critical waypoints~(such(More)
Computer networks such as the Internet or datacenter networks have become a a crucial infrastructure for many criticial services. Accordingly, it is important that such networks preserve correctness criteria, even during transitions from one correct configuration to a new correct configuration. This paper initiates the study of how to simultaneously update(More)
The software-defined networking paradigm introduces interesting opportunities to operate networks in a more flexible, optimized, yet formally verifiable manner. Despite the logically centralized control, however, a Software-Defined Network (SDN) is still a distributed system, with inherent delays between the switches and the controller. Especially the(More)
The virtualization trend in today's Internet decouples services from the constraints of the underlying physical infrastructure. This decoupling has the potential to facilitate more flexible and efficient resource allocations: the service can be realized at any place in the substrate network which fulfills the service specification requirements. This paper(More)
Cloud computing heralded an era where resources can be scaled up and down elastically and in an online manner. This paper initiates the study of cost-effective cloud resource allocation algorithms under price discounts, using a competitive analysis approach. We show that for a single resource, the online resource renting problem can be seen as a(More)
—The virtualization trend in today's Internet decou-ples services from the constraints of the underlying physical infrastructure. This decoupling facilitates more flexible and efficient resource allocations: the service can be realized at any place in the substrate network which fulfills the service specification requirements. This paper studies such(More)
Electron spins in semiconductor quantum dots are good candidates of quantum bits for quantum information processing. Basic operations of the qubit have been realized in recent years: initialization, manipulation of single spins, two qubit entanglement operations, and readout. Now it becomes crucial to demonstrate scalability of this architecture by(More)