András Gulyás

On QoS Support to Ofelia and OpenFlow

OpenFlow is the most promising architecture for future Software Defined Networks (SDNs). However, from the aspects of large-scale or carrier-grade networks, it still lacks some key components. For example, QoS (Quality of Service) provisioning is an indispensable part of such production networks. During the evolution of the OpenFlow standard, some QoS capabilities have been added to the protocol, however, even the latest version has only a limited and not well-defined QoS framework. Hence, integrated QoS support is missing in current OpenFlow experimental test beds including Ofelia. This paper describes a possible architectural extension to Ofelia in order to make it capable of running QoS related experiments. We summarize the initial tasks regarding the survey of QoS features and limitations of OpenFlow switches deployed in Ofelia islands and the performance tests needed to characterize these devices. For extending the feature palette of Ofelia, we propose a QoS management platform with full integration into the existing management framework. By means of this envisioned extension, QoS settings of the whole Ofelia test bed can be adjusted easily, in a user friendly fashion. Moreover, we walk through the main steps needed not only towards an integrated OpenFlow test bed with QoS support but towards a QoS architecture to OpenFlow.

Towards Unified Programmability of Cloud and Carrier Infrastructure

The rise of cloud services poses considerable challenges on the control of both cloud and carrier network infrastructures. While traditional telecom network services rely on rather static processes (often involving manual steps), the wide adoption of mobile devices including tablets, smartphones and wearables introduce previously unseen dynamics in the creation, scaling and withdrawal of new services. These phenomena require optimal flexibility in the characterization of services, as well as on the control and orchestration of both carrier and cloud infrastructure. This paper proposes a unified programmability framework addressing: the unification of network and cloud resources, the integrated control and management of cloud and network, the description for programming networked/cloud services, and the provisioning processes of these services. In addition proofs-of-concept are provided based on existing open source control software components.

ESCAPE: extensible service chain prototyping environment using mininet, click, NETCONF and POX

Mininet is a great prototyping tool which combines existing SDN-related software components (e.g., Open vSwitch, OpenFlow controllers, network namespaces, cgroups) into a framework, which can automatically set up and configure customized OpenFlow testbeds scaling up to hundreds of nodes. Standing on the shoulders of Mininet, we implement a similar prototyping system called ESCAPE, which can be used to develop and test various components of the service chaining architecture. Our framework incorporates Click for implementing Virtual Network Functions (VNF), NETCONF for managing Click-based VNFs and POX for taking care of traffic steering. We also add our extensible Orchestrator module, which can accommodate mapping algorithms from abstract service descriptions to deployed and running service chains.

Stateless multi-stage dissemination of information: Source routing revisited

Large-scale information distribution has been increasingly attracting attention, be it through uptake in new services or through recent research efforts in fields like information-centric networking. The core issue to be addressed is the more efficient distribution of information to a large set of receivers. Avoiding state in the forwarding elements is crucial for any scheme to be successful. This paper addresses this challenge by revisiting the idea of in-packet Bloom filters and source routing. As opposed to the traditional in-packet Bloom filter concept which represent the trees flatly as sets, we build our filter by enclosing limited information about the structure of the tree, namely its stage decomposition, which helps to get rid of typical Bloom filter illnesses as infinite loops and false positive forwarding. Our analytical and simulation results show that by using this information we obtain more succinct tree representation while still maintaining forwarding efficiency.

Navigable networks as Nash equilibria of navigation games

Common sense suggests that networks are not random mazes of purposeless connections, but that these connections are organized so that networks can perform their functions well. One function common to many networks is targeted transport or navigation. Here, using game theory, we show that minimalistic networks designed to maximize the navigation efficiency at minimal cost share basic structural properties with real networks. These idealistic networks are Nash equilibria of a network construction game whose purpose is to find an optimal trade-off between the network cost and navigability. We show that these skeletons are present in the Internet, metabolic, English word, US airport, Hungarian road networks, and in a structural network of the human brain. The knowledge of these skeletons allows one to identify the minimal number of edges, by altering which one can efficiently improve or paralyse navigation in the network.

OpenFlow Virtualization Framework with Advanced Capabilities

Due to its simplicity, transparency and performance, Flow Visor takes it all in todays virtualization tools for OpenFlow networks. We argue that this effectiveness comes at the price of intolerance towards diverse OpenFlow versions used simultaneously and also limited switch functionality. What is more Flow Visor based management frameworks cannot run and configure the network controllers. In this paper we present an integrated OpenFlow virtualization framework, that is capable of (i) running and managing multiple instances of OpenFlow switches with different forwarding capabilities and OpenFlow versions, (ii) running and configuring full controllers or network applications designed for controlling a virtual network under the management of the proposed framework, and (iii) configuring QoS in the network. Besides introducing the architecture we share implementation and deployment details in our prototype system.

SDN based testbeds for evaluating and promoting multipath TCP

Multipath TCP is an experimental transport protocol with remarkable recent past and non-negligible future potential. It has been standardized recently, however the evaluation studies focus only on a limited set of isolated use-cases and a comprehensive analysis or a feasible path of Internet-wide adoption is still missing. This is mostly because in the current networking practice it is unusual to configure multiple paths between the endpoints of a connection. Therefore, conducting and precisely controlling multipath experiments over the real “internet” is a challenging task for some experimenters and impossible for others. In this paper, we invoke SDN technology to make this control possible and exploit large-scale internet testbeds to conduct end-to-end MPTCP experiments. More specifically, we establish a special purpose control and measurement framework on top of two distinct internet testbeds. First, using the OpenFlow support of GÉANT, we build a testbed enabling measurements with real traffic. Second, we design and establish a publicly available large-scale multipath capable measurement framework on top of PlanetLab Europe and show the challenges of such a system. Furthermore, we present measurements results with MPTCP in both testbeds to get insight into its behavior in such not well explored environment.

Towards SmartFlow: case studies on enhanced programmable forwarding in OpenFlow switches

The limited capabilities of the switches renders the implementation of unorthodox routing and forwarding mechanisms as a hard task in OpenFlow. Our high level goal is therefore to inspect the possibilities of slightly smartening up the OpenFlow switches. As a first step in this direction we demonstrate (with Bloom filters, greedy routing and network coding) that a very limited computational capability enables us to natively support experimental technologies while preserving performance. We distribute the demos in source files and as a ready-to-experiment VM image to promote further improvements and evaluations.

One tool to rule them all: a modular troubleshooting framework for SDN (and other) networks

Due to the heterogeneous and distributed nature of computer networks, the detection of misconfigurations and software/hardware failures is frequently reported to be notoriously non-trivial. The advent of SDN complicates the situation even more, since besides troubleshooting, the problem of finding software bugs in controller/switch/VNF implementations also has to be solved. Today a wealth of general and SDN-specific troubleshooting tools are available which are usually tailored to identify network-related errors and bugs of a particular nature. In this paper we define a troubleshooting framework which can assemble many of these tools in a single platform and makes possible to flexibly combine them. As we see network operators and SDN developers execute similar tasks anyway, e.g. combine ping, traceroute and tcpdump (or more complex tools) manually to see what is going on in the network. Our framework can ease their work by consolidating the available troubleshooting tools in a flexible and automated manner.

Optimal false-positive-free Bloom filter design for scalable multicast forwarding

Large-scale information dissemination in multicast communications has been increasingly attracting attention, be it through uptake in new services or through recent research efforts. In these, the core issues are supporting increased forwarding speed, avoiding state in the forwarding elements, and scaling in terms of the multicast tree size. This paper addresses all these challenges-which are crucial for any scalable multicast scheme to be successful-by revisiting the idea of in-packet Bloom filters and source routing. As opposed to the traditional in-packet Bloom filter concept, we build our Bloom filter by enclosing limited information about the structure of the tree. Analytical investigation is conducted and approximation formulas are provided for optimal-length Bloom filters, in which we got rid of typical Bloom filter illnesses such as false-positive forwarding. These filters can be used in several multicast implementations, which are demonstrated through a prototype. Thorough simulations are conducted to demonstrate the scalability of the proposed Bloom filters compared to its counterparts.