@inproceedings {INPROC-2018-16,
   author = {Thomas Kohler and Ruben Mayer and Frank D{\"u}rr and Marius Maa{\ss} and Sukanya Bhowmik and Kurt Rothermel},
   title = {{P4CEP: Towards In-Network Complex Event Processing}},
   booktitle = {Proceedings of the ACM SIGCOMM 2018 Morning Workshop on In-Network Computing},
   address = {Budapest, Hungary},
   publisher = {ACM},
   institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
   series = {NetCompute'18},
   pages = {0--5},
   type = {Konferenz-Beitrag},
   month = {August},
   year = {2018},
   doi = {10.1145/3229591.3229593},
   isbn = {978-1-4503-5908-5/18/08},
   keywords = {In-network Computing, Data Plane Programming, P4, Complex Event Processing (CEP)},
   language = {Englisch},
   cr-category = {C.2.1 Network Architecture and Design,     C.2.4 Distributed Systems,     C.2.3 Network Operations},
   ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2018-16/INPROC-2018-16.pdf,     https://doi.org/10.1145/3229591.3229593},
   contact = {thomas.kohler@ipvs.uni-stuttgart.de},
   department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
   abstract = {In-network computing using programmable networking hardware is a strong trend in networking that promises to reduce latency and consumption of server resources through offloading to network elements (programmable switches and smart NICs). In particular, the data plane programming language P4 together with powerful P4 networking hardware has spawned projects offloading services into the network, e.g., consensus services or caching services. In this paper, we present a novel case for in-network computing, namely, Complex Event Processing (CEP). CEP processes streams of basic events, e.g., stemming from networked sensors, into meaningful complex events. Traditionally, CEP processing has been performed on servers or overlay networks. However, we argue in this paper that CEP is a good candidate for in-network computing along the communication path avoiding detouring streams to distant servers to minimize communication latency while also exploiting processing capabilities of novel networking hardware. We show that it is feasible to express CEP operations in P4 and also present a tool to compile CEP operations, formulated in our P4CEP rule specification language, to P4 code. Moreover, we identify challenges and problems that we have encountered to show future research directions for implementing full-fledged in-network CEP systems.},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2018-16&engl=0}
}
@inproceedings {INPROC-2017-55,
   author = {Thomas Kohler and Frank D{\"u}rr and Christian B{\"a}umlisberger and Kurt Rothermel},
   title = {{InFEP - Lightweight Virtualization of Distributed Control on White-box Networking Hardware}},
   booktitle = {2017 International Workshop on Management of SDN and NFV Systems (ManSDNNFV2017)},
   editor = {IFIP/IEEE},
   address = {Tokyo, Japan},
   publisher = {IEEE},
   institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
   pages = {1--6},
   type = {Konferenz-Beitrag},
   month = {November},
   year = {2017},
   doi = {10.23919/CNSM.2017.8256045},
   keywords = {Software-defined Networking; Control Plane Distribution; Virtualization},
   language = {Englisch},
   cr-category = {C.2.1 Network Architecture and Design,     C.2.4 Distributed Systems,     C.2.3 Network Operations},
   ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2017-55/INPROC-2017-55.pdf,     https://doi.org/10.23919/CNSM.2017.8256045},
   contact = {thomas.kohler@ipvs.uni-stuttgart.de},
   department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
   abstract = {Recent developments in networking hardware and software-defined networking have enabled full distribution of network control to reduce control latency and increase reliability. However, both, hardware and software of current white-box networking hardware are highly heterogeneous, which limits the deployment and operation of switch-local control applications. Furthermore, switch-local control raises yet unconsidered security concerns. In this paper, we present our concept of in-forward-element processing, which leverages the open access to the control plane of white-box networking hardware to deploy control logic directly onto switches. We combine local control applications with lightweight virtualization to cope with networking hardware heterogeneity and to achieve required isolation properties and ease of management. Beyond distributed network control, we show this scheme is also beneficial for implementing switch-local virtual network functions (NFV), processing packets. Highlighting the practicability of the concepts, we provide an overview of the current white-box networking hardware and software landscape and their compatibility with lightweight virtualization technologies. To this end, we perform an empirical evaluation of NOS-virtualization combinations on such hardware and compare the results with respect to incurring virtualization overhead.},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2017-55&engl=0}
}
@inproceedings {INPROC-2017-22,
   author = {Thomas Kohler and Frank D{\"u}rr and Kurt Rothermel},
   title = {{ZeroSDN: A Highly Flexible and Modular Architecture for Full-range Network Control Distribution}},
   booktitle = {Proceedings of the 13th ACM/IEEE Symposium on Architectures for Networking and Communications Systems: ANCS'17, May 18-19, 2017, Beijing, China},
   editor = {ACM/IEEE},
   publisher = {Association for Computing Machinery (ACM) / Institute of Electrical and Electronics Engineers (IEEE)},
   institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
   pages = {1--13},
   type = {Konferenz-Beitrag},
   month = {Mai},
   year = {2017},
   keywords = {Software-defined Networking; OpenFlow; Control Plane Distribution; Publish/Subscribe; White-box Networking},
   language = {Englisch},
   cr-category = {C.2.1 Network Architecture and Design,     C.2.4 Distributed Systems,     C.2.3 Network Operations},
   ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2017-22/INPROC-2017-22.pdf},
   contact = {thomas.kohler@ipvs.uni-stuttgart.de},
   department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
   abstract = {},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2017-22&engl=0}
}
@inproceedings {INPROC-2015-49,
   author = {Thomas Kohler and Frank D{\"u}rr and Kurt Rothermel},
   title = {{Update Consistency in Software-defined Networking based Multicast Networks}},
   booktitle = {Proceedings of the 2015 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN), San Francisco, USA, November 18-21, 2015},
   address = {San Francisco, USA},
   publisher = {IEEE Computer Society},
   institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
   pages = {177--183},
   type = {Konferenz-Beitrag},
   month = {September},
   year = {2015},
   doi = {10.1109/NFV-SDN.2015.7387424},
   keywords = {Software-defined Networking; Multicast communication; Computer network management; Concurrency Control},
   language = {Englisch},
   cr-category = {C.2.1 Network Architecture and Design,     C.2.3 Network Operations,     C.2.4 Distributed Systems},
   ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2015-49/INPROC-2015-49.pdf,     http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7387424},
   contact = {thomas.kohler@ipvs.uni-stuttgart.de},
   department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
   abstract = {When applying updates on distributed network elements with SDN, intra-update states may violate desired network properties, such as drop- and loop-freeness. Current stateless approaches cannot guarantee the constancy of arbitrary network invariants (correctness) in general, yet update procedures guaranteeing certain invariants do exist. In this paper, we investigate on update consistency for the case of multicast routing and show that there is no correct update procedure w.r.t. both drop- and duplicate-freeness. We show that certain updates of multicast routes inherently raise a concurrency issue, which necessarily results in the occurrence of either drops or duplicates. Furthermore, we present a generic update procedure for multicast routing updates that identifies concurrency-relevant update steps. This procedure allows for the selection of an update strategy, such that either drops or duplicates are avoided. These effects can severely degrade network performance or quality of experience. To investigate the implications of drops and duplicates, we evaluate their frequencies and impact for wide-area network scenarios both, analytically and empirically, through direct measurement in the data plane under update.},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2015-49&engl=0}
}
@inproceedings {INPROC-2014-55,
   author = {Thomas Kohler and Jan-Philipp Stegh{\"o}fer and D{\'\i}dac Busquets and Jeremy Pitt},
   title = {{The Value of Fairness: Trade-offs in Repeated Dynamic Resource Allocation}},
   booktitle = {Proceedings of the 2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2014), London, UK},
   publisher = {IEEE Computer Society},
   institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
   pages = {1--10},
   type = {Konferenz-Beitrag},
   month = {September},
   year = {2014},
   doi = {10.1109/SASO.2014.12},
   isbn = {978-1-4799-5367-7},
   keywords = {artificial intelligence; distributive justice; electronic institution; fairness; multi-agent system; allocation},
   language = {Englisch},
   cr-category = {I.2.11 Distributed Artificial Intelligence},
   ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2014-55/INPROC-2014-55.pdf,     http://dx.doi.org/10.1109/SASO.2014.12},
   contact = {thomas.kohler@ipvs.uni-stuttgart.de},
   department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
   abstract = {Resource allocation problems are an important part of many distributed autonomous systems. In sensor networks, they determine which nodes get to use the communication links, in SmartGrid applications they decree which electric vehicle batteries are loaded, and in autonomous power management they select which generators produce the power required to satisfy the overall load. These cases have been considered in the literature before under the aspect of demand satisfaction: how well can distributed algorithms with local knowledge approximate the best allocation. A factor that has been ignored, however, is fairness: how fair is the resource allocation and - in extension - the distribution of revenue, wear, or recovery time. In this paper, we bring together previously disjoint approaches on dynamic distributed resource allocation and on fairness in electronic institutions. We show that fair allocations based on Ostrom's principles and on Rescher's canons of distributive justice create value in repeated resource allocations. We apply the scheme to solve the multi-objective problem of distributing load to generators fairly based on demands made by the individual generators. Our evaluation shows that a fair distribution increases satisfaction of the individual agents while reducing the hazard of optimising the problem in the short-term at the cost of long-term robustness and stability.},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2014-55&engl=0}
}
@article {ART-2018-10,
   author = {Thomas Kohler and Frank D{\"u}rr and Kurt Rothermel},
   title = {{ZeroSDN: A Highly Flexible and Modular Architecture for Full-range Distribution of Event-based Network Control}},
   journal = {IEEE Transactions on Network and Service Management},
   editor = {Wolfgang Kellerer},
   publisher = {IEEE Communications Society},
   pages = {1--14},
   type = {Artikel in Zeitschrift},
   month = {Januar},
   year = {2018},
   keywords = {Software-defined Networking; OpenFlow; Control Plane Distribution; Publish/Subscribe; White-box Networking; Virtualization},
   language = {Englisch},
   cr-category = {C.2.1 Network Architecture and Design,     C.2.4 Distributed Systems,     C.2.3 Network Operations},
   ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/ART-2018-10/ART-2018-10.pdf},
   contact = {thomas.kohler@ipvs.uni-stuttgart.de},
   department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
   abstract = {},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2018-10&engl=0}
}
@article {ART-2016-24,
   author = {Sukanya Bhowmik and Muhammad Adnan Tariq and Boris Koldehofe and Frank D{\"u}rr and Thomas Kohler and Kurt Rothermel},
   title = {{High Performance Publish/Subscribe Middleware in Software-Defined Networks}},
   journal = {IEEE/ACM Transactions on Networking},
   publisher = {IEEE},
   volume = {25},
   number = {3},
   pages = {1--16},
   type = {Artikel in Zeitschrift},
   month = {Dezember},
   year = {2016},
   isbn = {10.1109/TNET.2016.2632970},
   language = {Englisch},
   cr-category = {C.2.1 Network Architecture and Design,     C.2.4 Distributed Systems},
   ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/ART-2016-24/ART-2016-24.pdf},
   department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
   abstract = {},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2016-24&engl=0}
}
@article {ART-2016-07,
   author = {Thomas Kohler and Frank D{\"u}rr and Kurt Rothermel},
   title = {{Consistent Network Management for Software-defined Networking based Multicast}},
   journal = {IEEE Transactions on Network and Service Management},
   editor = {Rolf Stadler},
   publisher = {IEEE Communications Society},
   pages = {1--1},
   type = {Artikel in Zeitschrift},
   month = {September},
   year = {2016},
   isbn = {10.1109/TNSM.2016.2585672},
   keywords = {Software-defined networking, configuration management, update consistency, quality-of-service management, multicast communication},
   language = {Englisch},
   cr-category = {C.2.1 Network Architecture and Design,     C.2.3 Network Operations,     C.2.4 Distributed Systems},
   ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/ART-2016-07/ART-2016-07.pdf,     http://dx.doi.org/10.1109/TNSM.2016.2585672},
   contact = {thomas.kohler@ipvs.uni-stuttgart.de},
   department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
   abstract = {Updating a network is an essential and continual task in the management of today{\^a}€™s softwarized networks. When applying updates on distributed network elements, desired network properties, such as drop- and loop-freeness, might be transiently violated. Although being crucial, update consistency has yet been less considered in network management. In this article, we argue for incorporating the particularities of update consistency into the reconfiguration process of continuous network management. We present a generic management architecture allowing for an appropriate selection of an update mechanism and its parameters based on expected inconsistency effects. We investigate update consistency for the case of multicast routing and show in an extensive analysis why simultaneous drop- and duplicate-freeness is not possible. We present an update procedure for multicast routing updates that identifies critical update steps, which are fed back into the reconfiguration process, along with a lightweight approach that allows for the selection of an update strategy, preventing either drops or duplicates. Furthermore, we present an optimization of an existing powerful, but resource-intensive update approach as well as an approach for in-network filtering of duplicates.},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2016-07&engl=0}
}