@inproceedings {INPROC-2020-29,
author = {Ahmad Slo and Sukanya Bhowmik and Kurt Rothermel},
title = {{hSPICE: State-Aware Event Shedding in Complex Event Processing}},
booktitle = {Proceedings of the 14th ACM International Conference on Distributed and Event-based Systems (DEBS '20), July 13--17, 2020, Virtual Event, QC, Canada.},
publisher = {ACM},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {1--12},
type = {Konferenz-Beitrag},
month = {Juli},
year = {2020},
language = {Englisch},
cr-category = {C.2.4 Distributed Systems},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2020-29/INPROC-2020-29.pdf},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
abstract = {In complex event processing (CEP), load shedding is performed to maintain a
given latency bound during overload situations when there is a limitation on
resources. However, shedding load implies degradation in the quality of results
(QoR). Therefore, it is crucial to perform load shedding in a way that has the
lowest impact on QoR. Researchers, in the CEP domain, propose to drop either
events or partial matches (PMs) in overload cases. They assign utilities to
events or PMs by considering either the importance of events or the importance
of PMs but not both together. In this paper, we propose a load shedding
approach for CEP systems that combines these approaches by assigning a utility
to an event by considering both the event importance and the importance of PMs.
We adopt a probabilistic model that uses the type and position of an event in a
window and the state of a PM to assign a utility to an event corresponding to
each PM. We, also, propose an approach to predict a utility threshold that is
used to drop the required amount of events to maintain a given latency bound.
By extensive evaluations on two real-world datasets and several representative
queries, we show that, in the majority of cases, our load shedding approach
outperforms state-of-the-art load shedding approaches, w.r.t. QoR.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2020-29&engl=0}
}
@inproceedings {INPROC-2019-26,
author = {Ahmad Slo and Sukanya Bhowmik and Albert Flaig and Kurt Rothermel},
title = {{pSPICE: Partial Match Shedding for Complex Event Processing}},
booktitle = {Proceedings of the 2019 IEEE International Conference on Big Data (BigData '19); Los Angeles, CA, USA 9 - 12 December, 2019},
publisher = {IEEE},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {1--11},
type = {Konferenz-Beitrag},
month = {Dezember},
year = {2019},
language = {Englisch},
cr-category = {C.2.4 Distributed Systems},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2019-26/INPROC-2019-26.pdf},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
abstract = {Complex event processing (CEP) systems continuously process input event streams
to detect patterns. Over time, the input event rate might fluctuate and
overshoot the system{\^a}s capabilities. One way to reduce the overload on the
system is to use load shedding. In this paper, we propose a load shedding
strategy for CEP systems which drops a portion of the CEP operator{\^a}s internal
state (a.k.a. partial matches) to maintain a given latency bound. The crucial
question here is how many and which partial matches to drop so that a given
latency bound is maintained while minimizing the degradation in the quality of
results. In the stream processing domain, different load shedding strategies
have been proposed that mainly depend on the importance of individual tuples.
However, as CEP systems perform pattern detection, the importance of events is
also influenced by other events in the stream. Our load shedding strategy uses
Markov chain and Markov reward process to predict the utility/importance of
partial matches to determine the ones to be dropped. In addition, we represent
the utility in a way that minimizes the overhead of load shedding. Furthermore,
we provide algorithms to decide when to start dropping partial matches and how
many partial matches to drop. By extensively evaluating our approach on three
real-world datasets and several representative queries, we show that the
adverse impact of our load shedding strategy on the quality of results is
considerably less than the impact of state-of-the-art load shedding strategies.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-26&engl=0}
}
@inproceedings {INPROC-2019-25,
author = {Ahmad Slo and Sukanya Bhowmik and Kurt Rothermel},
title = {{eSPICE: Probabilistic Load Shedding from Input Event Streams in Complex Event Processing}},
booktitle = {Proceedings of Middleware '19: 20th International Middleware Conference (Middleware '19) Dec 08-13 2019. Davis, CA, USA . ACM, New York, NY, USA},
publisher = {ACM Press},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {1--13},
type = {Konferenz-Beitrag},
month = {Dezember},
year = {2019},
keywords = {Complex Event Processing; Stream Processing; Load Shedding; Approximate Computing; latency bound; QoS},
language = {Englisch},
cr-category = {H.3.4 Information Storage and Retrieval Systems and Software},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2019-25/INPROC-2019-25.pdf},
contact = {ahmad.slo@ipvs.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
abstract = {Complex event processing systems process the input event streams on-the-fly.
Since input event rate could overshoot the system{\^a}s capabilities and results
in violating a defined latency bound, load shedding is used to drop a portion
of the input event streams. The crucial question here is how many and which
events to drop so the defined latency bound is maintained and the degradation
in the quality of results is minimized. In stream processing domain, different
load shedding strategies have been proposed but they mainly depend on the
importance of individual tuples (events). However, as complex event processing
systems perform pattern detection, the importance of events is also influenced
by other events in the same pattern. In this paper, we propose a load shedding
framework called eSPICE for complex event processing systems. eSPICE depends on
building a probabilistic model that learns about the importance of events in a
window. The position of an event in a window and its type are used as features
to build the model. Further, we provide algorithms to decide when to start
dropping events and how many events to drop. Moreover, we extensively evaluate
the performance of eSPICE on two real-world datasets.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-25&engl=0}
}
@inproceedings {INPROC-2019-21,
author = {Henriette R{\"o}ger and Sukanya Bhowmik and Kurt Rothermel},
title = {{Combining it all: Cost minimal and low-latency stream processing across distributed heterogeneous infrastructures}},
booktitle = {Proceedings of Middleware '19: 20th International Middleware Conference (Middleware '19) Dec 08-13 2019. Davis, CA, USA . ACM, New York, NY, USA},
publisher = {ACM Press},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {1--13},
type = {Konferenz-Beitrag},
month = {Dezember},
year = {2019},
isbn = {ISDB: 978-1-4503-7009-7/19/12},
doi = {10.1145/3361525.3361551},
language = {Deutsch},
cr-category = {C.2.4 Distributed Systems,
C.4 Performance of Systems},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2019-21/INPROC-2019-21.pdf},
contact = {henriette.roeger@ipvs.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
abstract = {Control mechanisms of stream processing applications (SPAs) that ensure latency
bounds at minimal runtime cost mostly target a specific infrastructure, e.g.,
homogeneous nodes. With the growing popularity of the Internet of Things, fog,
and edge computing, SPAs are more often distributed on het- erogeneous
infrastructures, triggering the need for a holis- tic SPA-control that still
considers heterogeneity. We there- fore combine individual control mechanisms
via the latency- distribution problem that seeks to distribute latency budgets
to individually managed components of distributed SPAs for a lightweight yet
effective end-to-end control. To this end, we introduce a hierarchical control
architecture, give a formal definition of the latency-distribution problem, and
provide both an ILP formulation to find an optimal solution as well as a
heuristic approach, thereby enabling the combi- nation of individual control
mechanisms into one SPA while ensuring global cost minimality. Our evaluations
show that both solutions are effective{\^a}while the heuristic approach is only
slightly more costly than the optimal ILP solution, it significantly reduces
runtime and communication overhead.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-21&engl=0}
}
@inproceedings {INPROC-2018-55,
author = {Guilherme F. Lima and Ahmad Slo and Sukanya Bhowmik and Markus Endler and Kurt Rothermel},
title = {{Skipping Unused Events to Speed Up Rollback-Recovery in Distributed Data-Parallel CEP}},
booktitle = {Proceedings of 2018 IEEE/ACM 5th International Conference on Big Data Computing Applications and Technologies (BDCAT)},
publisher = {IEEE},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {1--10},
type = {Konferenz-Beitrag},
month = {Dezember},
year = {2018},
language = {Englisch},
cr-category = {C.2.4 Distributed Systems},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2018-55/INPROC-2018-55.pdf},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
abstract = {We propose two extensions for a state-of-the-art method of rollback-recovery in
distributed CEP (complex event processing). In CEP, an operator network is used
to search for patterns in events streams. Sometimes these operators fail and
lose their state. Rollback-recovery is a method for dealing with such state
losses. The type of rollback-recovery we consider is upstream backup, where the
state of a failed operator is recovered by replaying to it the input events
that led it to that state. These events are kept in upstream operators{\^a}
memory buffers, which are trimmed continuously as the downstream operator
progresses. The first extension we propose saves memory and speeds up recovery
by avoiding to store and retransmit unnecessary events. The second extension
makes the base method of upstream backup compatible with data-parallel CEP,
allowing that the windows into which operators partition their input be
processed in parallel. We evaluated the proposed extensions through experiments
that showed a significant reduction in memory usage and recovery time at the
expense of a negligible processing overhead during normal operation.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2018-55&engl=0}
}
@inproceedings {INPROC-2018-45,
author = {Christian Mayer and Ruben Mayer and Sukanya Bhowmik and Lukas Epple and Kurt Rothermel},
title = {{HYPE: Massive Hypergraph Partitioning with Neighborhood Expansion}},
booktitle = {Proceedings of the 2018 IEEE International Conference on Big Data (BigData '18); Seattle, WA, USA, December 10-13, 2018},
publisher = {IEEE},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {1--10},
type = {Konferenz-Beitrag},
month = {Dezember},
year = {2018},
language = {Englisch},
cr-category = {C.2.4 Distributed Systems},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2018-45/INPROC-2018-45.pdf},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
abstract = {Many important real-world applications---such as social networks or distributed
data bases---can be modeled as hypergraphs. In such a model, vertices represent
entities---such as users or data records---whereas hyperedges model a group
membership of the vertices---such as the authorship in a specific topic or the
membership of a data record in a specific replicated shard. To optimize such
applications, we need an efficient and effective solution to the NP-hard
balanced k-way hypergraph partitioning problem. However, existing hypergraph
partitioners that scale to very large graphs do not effectively exploit the
hypergraph structure when performing the partitioning decisions. We propose
HYPE, a hypergraph partitionier that exploits the neighborhood relations
between vertices in the hypergraph using an efficient implementation of
neighborhood expansion. HYPE improves partitioning quality by up to 95\% and
reduces runtime by up to 39\% compared to the state of the art.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2018-45&engl=0}
}
@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-30,
author = {Sukanya Bhowmik and Muhammad Adnan Tariq and Alexander Balogh and Kurt Rothermel},
title = {{Addressing TCAM Limitations of Software-Defined Networks for Content-Based Routing}},
booktitle = {Proceedings of Distributed and Event- Based Systems, Barcelona, Spain, June 19-23, 2017 (DEBS 17)},
publisher = {ACM},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {1--12},
type = {Konferenz-Beitrag},
month = {Juni},
year = {2017},
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/INPROC-2017-30/INPROC-2017-30.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=INPROC-2017-30&engl=0}
}
@inproceedings {INPROC-2016-18,
author = {Sukanya Bhowmik and Muhammad Adnan Tariq and Jonas Grunert and Kurt Rothermel},
title = {{Bandwidth-Efficient Content-Based Routing on Software-Defined Networks}},
booktitle = {Proceedings of the ACM International Conference on Distributed and Event-based Systems (DEBS 2016); Irvine, California, US, June 20-24, 2016},
publisher = {IEEE},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {1--8},
type = {Konferenz-Beitrag},
month = {Juni},
year = {2016},
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/INPROC-2016-18/INPROC-2016-18.pdf},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
abstract = {With the vision of Internet of Things gaining popularity at a global level,
efficient publish/subscribe middleware for communication within and across
datacenters is extremely desirable. In this respect, the very popular
Software-defined Networking (SDN), which enables publish/subscribe middleware
to perform line-rate filtering of events directly on hardware, can prove to be
very useful. While deploying content filters directly on switches of a
software-defined network allows optimized paths, high throughput rates, and low
end-to-end latency, it suffers from certain inherent limitations w.r.t. no. of
bits available on hardware switches to represent these filters. Such a
limitation affects expressiveness of filters, resulting in unnecessary traffic
in the network.
In this paper, we explore various techniques to represent content filters
expressively while being limited by hardware. We implement and evaluate
techniques that i) use workload, in terms of events and subscriptions, to
represent content, and ii) efficiently select attributes to reduce redundancy
in content. Moreover, these techniques complement each other and can be
combined together to further enhance performance. Our detailed performance
evaluations show the potential of these techniques in reducing unnecessary
traffic when subjected to different workloads.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2016-18&engl=0}
}
@inproceedings {INPROC-2016-16,
author = {Sukanya Bhowmik and Muhammad Adnan Tariq and Lobna Hegazy and Kurt Rothermel},
title = {{Hybrid Content-based Routing Using Network and Application Layer Filtering}},
booktitle = {Proceedings of the 36th IEEE International Conference on Distributed Computing Systems (ICDCS 2016), Nara, Japan, June 27-30, 2016},
publisher = {IEEE},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
type = {Konferenz-Beitrag},
month = {Juni},
year = {2016},
keywords = {Content-based Routing; Publish/Subscribe; Software-defined Networking; Network Virtualization; Hybrid Routing},
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/INPROC-2016-16/INPROC-2016-16.pdf},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
abstract = {Over the past few decades, content-based publish/subscribe has been primarily
implemented as an overlay network of software brokers. Even though such systems
provide the possibility of bandwidth efficient expressive filtering in
software, they cannot match up to the performance (in terms of end-to-end
latency and throughput) of communication protocols implemented on the network
layer. To exploit network layer performance benefits, recently, content-based
publish/subscribe was realized using the capabilities of Software-defined
Networking (SDN). While SDN allows line-rate forwarding of events by content
filters directly installed on switches, it suffers from inherent hardware
limitations (w.r.t. flow table size, limited availability of bits in header
fields) that adversely impact expressiveness of these filters, resulting in
unnecessary network traffic.
In this paper, we strike a balance between purely application-layer-based and
purely network-layer-based publish/subscribe implementations by realizing the
first hybrid content-based middleware that enables filtering of events in both
layers. Moreover, we provide different selection algorithms with varying
degrees of complexity to determine the events to be filtered at each layer such
that unnecessary network traffic can be minimized while also considering delay
requirements of the middleware. Our hybrid middleware offers full flexibility
to configure it according to the performance requirements of the system. We
provide a detailed performance evaluation of the proposed selection algorithms
to determine their impact on the performance of the designed hybrid middleware
which we further compare to state-of-the art solutions.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2016-16&engl=0}
}
@inproceedings {INPROC-2015-22,
author = {Sukanya Bhowmik and Muhammad Adnan Tariq and Boris Koldehofe and Andre Kutzleb and Kurt Rothermel},
title = {{Distributed Control Plane for Software-defined Networks: A Case Study Using Event-based Middleware}},
booktitle = {Proceedings of the 9th International Conference on Distributed Event-based Systems, Oslo, Norway, June 29 - July 3, 2015},
publisher = {ACM},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {1--12},
type = {Konferenz-Beitrag},
month = {Juni},
year = {2015},
isbn = {http://doi.acm.org/10.1145/2675743.2771835},
language = {Englisch},
cr-category = {C.2.1 Network Architecture and Design,
C.2.4 Distributed Systems,
D.2.11 Software Engineering Software Architectures},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2015-22/INPROC-2015-22.pdf},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
abstract = {Realizing a communication middleware in a software-defined network can leverage
significant performance gains in terms of latency, throughput and bandwidth
efficiency. For example, filtering operations in an event-based middleware can
be performed highly efficiently in the TCAM memory of switches enabling
line-rate forwarding of events. A key challenge in a software-defined network,
however, is to ensure high responsiveness of the control plane to dynamically
changing communication interactions. In this paper, we propose a methodology
for both vertical and horizontal scaling of the distributed control plane that
is capable of improving the responsiveness by enabling concurrent network
updates in the presence of high dynamics while ensuring consistent changes to
the data plane of a communication middleware. In contrast to existing scaling
approaches that aim for a general-purpose distributed control plane, our
approach uses knowledge of the application semantics that is already available
in the design of the data plane of a communication middleware, e.g.
subscriptions and advertisements in an event-based middleware. By proposing a
methodology for an application-aware control distribution, we show, in the
context of PLEROMA, an event-based middleware, that application-awareness is
significantly beneficial in avoiding the synchronization bottlenecks for
ensuring consistency in the presence of concurrent network updates and thus
greatly improves the responsiveness of the control plane.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2015-22&engl=0}
}
@inproceedings {INPROC-2014-67,
author = {Muhammad Adnan Tariq and Boris Koldehofe and Sukanya Bhowmik and Kurt Rothermel},
title = {{PLEROMA: A SDN-based High Performance Publish/Subscribe Middleware}},
booktitle = {To appear in Proceedings of the ACM/IFIP/USENIX Middleware Conference},
publisher = {ACM press.},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
type = {Konferenz-Beitrag},
month = {Dezember},
year = {2014},
doi = {10.1145/2663165.2663338},
keywords = {Content-based Routing, Publish/Subscribe, Software-defined Networking, Network Virtualization},
language = {Englisch},
cr-category = {C.2.1 Network Architecture and Design,
C.2.4 Distributed Systems,
D.2.11 Software Engineering Software Architectures},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2014-67/INPROC-2014-67.pdf},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
abstract = {With the increasing popularity of Software-defined networks (SDN), TCAM memory
of switches can be directly accessed by a publish/subscribe middleware to
perform filtering operations at low latency. This way two important
requirements for a publish/subscribe middleware can be fulfilled: namely
bandwidth efficiency and line-rate performance in forwarding messages between
producers and consumers. Nevertheless, it is challenging to sustain line-rate
performance in the presence of dynamic changes in the interest of producers and
consumers. In this paper, we propose and evaluate the PLEROMA middleware to
realize publish/subscribe at line-rate and bandwidth efficiently in SDN.
PLEROMA offers methods to efficiently reconfigure a deployed topology in the
presence of dynamic subscriptions and advertisements. Furthermore, PLEROMA
ensures interoperability and independent reconfiguration of multiple controlled
SDN networks.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2014-67&engl=0}
}
@article {ART-2022-05,
author = {Jonathan Falk and Heiko Geppert and Frank D{\"u}rr and Sukanya Bhowmik and Kurt Rothermel},
title = {{Dynamic QoS-Aware Traffic Planning for Time-Triggered Flows in the Real-time Data Plane}},
journal = {IEEE Transactions on Network and Service Management},
publisher = {IEEE},
volume = {19},
number = {2},
pages = {1807--1825},
type = {Artikel in Zeitschrift},
month = {Juni},
year = {2022},
isbn = {10.1109/TNSM.2022.3150664},
keywords = {traffic planning, QoS, reconfiguration, time-triggered},
language = {Deutsch},
cr-category = {C.2.3 Network Operations,
C.2.5 Local and Wide-Area Networks},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/ART-2022-05/ART-2022-05.pdf},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
abstract = {Many networked applications, e.g., in the domain of cyber-physical systems,
require strict service guarantees for time-triggered traffic flows, usually in
the form of jitter and latency bounds. It is a notoriously hard problem to
compute a network-wide traffic plan, i.e., a set of routes and transmission
schedules, that satisfies these requirements, and dynamic changes in the flow
set add even more challenges. Existing traffic-planning methods are ill-suited
for dynamic scenarios because they either suffer from high computational cost,
can result in low network utilization, or provide no explicit guarantees when
transitioning to a new traffic plan that incorporates new flows.
Therefore, we present a novel approach for dynamic traffic planning of
time-triggered flows. Our conflict-graph-based modeling of the traffic planning
problem allows for the reconfiguration of active flows to increase the network
utilization, while also providing per-flow QoS guarantees during the transition
to the new traffic plan. Additionally, we introduce a novel heuristic for
computing the new traffic plans. Evaluations of our prototypical implementation
show that we can efficiently compute new traffic plans in scenarios with
hundreds of active flows for a wide range of settings.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2022-05&engl=0}
}
@article {ART-2022-04,
author = {Jonathan Falk and Heiko Geppert and Frank D{\"u}rr and Sukanya Bhowmik and Kurt Rothermel},
title = {{Dynamic QoS-Aware Traffic Planning for Time-Triggered Flows in the Real-time Data Plane}},
journal = {IEEE Transactions on Network and Service Management},
publisher = {IEEE},
volume = {19},
number = {2},
pages = {1807--1825},
type = {Artikel in Zeitschrift},
month = {Juni},
year = {2022},
isbn = {10.1109/TNSM.2022.3150664},
keywords = {traffic planning, QoS, reconfiguration, time-triggered},
language = {Deutsch},
cr-category = {C.2.3 Network Operations,
C.2.5 Local and Wide-Area Networks},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/ART-2022-04/ART-2022-04.pdf},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
abstract = {Many networked applications, e.g., in the domain of cyber-physical systems,
require strict service guarantees for time-triggered traffic flows, usually in
the form of jitter and latency bounds. It is a notoriously hard problem to
compute a network-wide traffic plan, i.e., a set of routes and transmission
schedules, that satisfies these requirements, and dynamic changes in the flow
set add even more challenges. Existing traffic-planning methods are ill-suited
for dynamic scenarios because they either suffer from high computational cost,
can result in low network utilization, or provide no explicit guarantees when
transitioning to a new traffic plan that incorporates new flows.
Therefore, we present a novel approach for dynamic traffic planning of
time-triggered flows. Our conflict-graph-based modeling of the traffic planning
problem allows for the reconfiguration of active flows to increase the network
utilization, while also providing per-flow QoS guarantees during the transition
to the new traffic plan. Additionally, we introduce a novel heuristic for
computing the new traffic plans. Evaluations of our prototypical implementation
show that we can efficiently compute new traffic plans in scenarios with
hundreds of active flows for a wide range of settings.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2022-04&engl=0}
}
@article {ART-2022-03,
author = {Jonathan Falk and Heiko Geppert and Frank D{\"u}rr and Sukanya Bhowmik and Kurt Rothermel},
title = {{Dynamic QoS-Aware Traffic Planning for Time-Triggered Flows in the Real-time Data Plane}},
journal = {IEEE Transactions on Network and Service Management},
publisher = {IEEE},
volume = {19},
number = {2},
pages = {1807--1825},
type = {Artikel in Zeitschrift},
month = {Juni},
year = {2022},
isbn = {10.1109/TNSM.2022.3150664},
keywords = {traffic planning, QoS, reconfiguration, time-triggered},
language = {Deutsch},
cr-category = {C.2.3 Network Operations,
C.2.5 Local and Wide-Area Networks},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/ART-2022-03/ART-2022-03.pdf},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
abstract = {Many networked applications, e.g., in the domain of cyber-physical systems,
require strict service guarantees for time-triggered traffic flows, usually in
the form of jitter and latency bounds. It is a notoriously hard problem to
compute a network-wide traffic plan, i.e., a set of routes and transmission
schedules, that satisfies these requirements, and dynamic changes in the flow
set add even more challenges. Existing traffic-planning methods are ill-suited
for dynamic scenarios because they either suffer from high computational cost,
can result in low network utilization, or provide no explicit guarantees when
transitioning to a new traffic plan that incorporates new flows.
Therefore, we present a novel approach for dynamic traffic planning of
time-triggered flows. Our conflict-graph-based modeling of the traffic planning
problem allows for the reconfiguration of active flows to increase the network
utilization, while also providing per-flow QoS guarantees during the transition
to the new traffic plan. Additionally, we introduce a novel heuristic for
computing the new traffic plans. Evaluations of our prototypical implementation
show that we can efficiently compute new traffic plans in scenarios with
hundreds of active flows for a wide range of settings.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2022-03&engl=0}
}
@article {ART-2022-02,
author = {Jonathan Falk and Heiko Geppert and Frank D{\"u}rr and Sukanya Bhowmik and Kurt Rothermel},
title = {{Dynamic QoS-Aware Traffic Planning for Time-Triggered Flows in the Real-time Data Plane}},
journal = {IEEE Transactions on Network and Service Management},
publisher = {IEEE},
volume = {19},
number = {2},
pages = {1807--1825},
type = {Artikel in Zeitschrift},
month = {Juni},
year = {2022},
isbn = {10.1109/TNSM.2022.3150664},
keywords = {traffic planning, QoS, reconfiguration, time-triggered},
language = {Deutsch},
cr-category = {C.2.3 Network Operations,
C.2.5 Local and Wide-Area Networks},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/ART-2022-02/ART-2022-02.pdf},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
abstract = {Many networked applications, e.g., in the domain of cyber-physical systems,
require strict service guarantees for time-triggered traffic flows, usually in
the form of jitter and latency bounds. It is a notoriously hard problem to
compute a network-wide traffic plan, i.e., a set of routes and transmission
schedules, that satisfies these requirements, and dynamic changes in the flow
set add even more challenges. Existing traffic-planning methods are ill-suited
for dynamic scenarios because they either suffer from high computational cost,
can result in low network utilization, or provide no explicit guarantees when
transitioning to a new traffic plan that incorporates new flows.
Therefore, we present a novel approach for dynamic traffic planning of
time-triggered flows. Our conflict-graph-based modeling of the traffic planning
problem allows for the reconfiguration of active flows to increase the network
utilization, while also providing per-flow QoS guarantees during the transition
to the new traffic plan. Additionally, we introduce a novel heuristic for
computing the new traffic plans. Evaluations of our prototypical implementation
show that we can efficiently compute new traffic plans in scenarios with
hundreds of active flows for a wide range of settings.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2022-02&engl=0}
}
@article {ART-2020-21,
author = {Ahmad Slo and Sukanya Bhowmik and Kurt Rothermel},
title = {{State-Aware Load Shedding from Input Event Streams in Complex Event Processing}},
journal = {IEEE Transactions on Big Data},
publisher = {IEEE},
pages = {1--18},
type = {Artikel in Zeitschrift},
month = {Dezember},
year = {2020},
isbn = {10.1109/TBDATA.2020.3047438},
language = {Englisch},
cr-category = {C.2.4 Distributed Systems},
ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/ART-2020-21/ART-2020-21.pdf},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
abstract = {In complex event processing (CEP), load shedding is performed to maintain a
given latency bound during overload situations when there is a limitation on
resources. However, shedding load implies degradation in the quality of results
(QoR). Therefore, it is crucial to perform load shedding in a way that has the
lowest impact on QoR. Researchers, in the CEP domain, propose to drop either
events or partial matches (PMs) in overload cases. They assign utilities to
events or PMs by considering either the importance of events or the importance
of PMs but not both together. In this paper, we combine these approaches where
we propose to assign a utility to an event by considering both the event
importance and the importance of PMs. We propose two load shedding approaches
for CEP systems. The first approach drops events from PMs, while the second
approach drops events from windows. We adopt a probabilistic model that uses
the type and position of an event in a window and the state of a PM to assign a
utility to an event. We, also, propose an approach to predict a utility
threshold that is used to drop the required amount of events to maintain a
given latency bound. By extensive evaluations on two real-world datasets and
several representative queries, we show that, in the majority of cases, our
load shedding approach outperforms state-of-the-art load shedding approaches,
w.r.t. QoR.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2020-21&engl=0}
}
@article {ART-2018-09,
author = {Sukanya Bhowmik and Muhammad Adnan Tariq and Jonas Grunert and Deepak Srinivasan and Kurt Rothermel},
title = {{Expressive Content-Based Routing in Software-Defined Networks}},
journal = {IEEE Transactions on Parallel and Distributed Systems},
publisher = {IEEE},
pages = {1--18},
type = {Artikel in Zeitschrift},
month = {Mai},
year = {2018},
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-2018-09/ART-2018-09.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-2018-09&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}
}