Institut für Parallele und Verteilte Systeme (IPVS)

Publikationen

Eine Übersicht der Publikationen des Instituts für Parallele und Verteilte Systeme

Publikationen VS: Bibliographie 2019 BibTeX

 
@inproceedings {INPROC-2019-45,
   author = {Otto Bibartiu and Frank D{\"u}rr and Kurt Rothermel and Beate Ottenw{\"a}lder and Andreas Grau},
   title = {{Towards Scalable k-out-of-n Models for Assessing the Reliability of Large-scale Function-as-a-Service Systems with Bayesian Networks}},
   booktitle = {2019 IEEE 12th International Conference on Cloud Computing (CLOUD)},
   editor = {IEEE},
   address = {Milan, Italy},
   publisher = {Online},
   institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
   pages = {1--3},
   type = {Konferenz-Beitrag},
   month = {Juli},
   year = {2019},
   isbn = {10.1109/CLOUD.2019.00095},
   keywords = {Bayesian networks, k-out-of-n gates, scalable structures},
   language = {Englisch},
   cr-category = {B.8.1 Reliability, Testing, and Fault-Tolerance},
   ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2019-45/INPROC-2019-45.pdf,     https://ieeexplore.ieee.org/document/8814557/},
   contact = {otto.bibartiu@ipvs.uni-stuttgart.de},
   department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
   abstract = {Typically, Function-as-a-Service (FaaS) involves state-less replication with very large numbers of instances. The reliability of such services can be evaluated using Bayesian Networks and k-out-of-n models. However, existing k-out-of-n models do not scale to the larger number of hosts of FaaS services. Therefore, we propose a scalable k-out-of-n model in this paper with the same semantics as the standard k-out-of-n voting gates in fault trees, enabling the reliability analysis of FaaS services.},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-45&engl=0}
}
@inproceedings {INPROC-2019-27,
   author = {Mohamed Abdelaal and Mochamad Dandy and Marwan Abdelgawad and Frank Duerr and Kurt Rothermel},
   title = {{GaaS: Adaptive Cross-Platform Gateway for IoT Applications}},
   booktitle = {Proceedings of the 16th IEEE International Conference on Mobile Ad-Hoc and Smart Systems (EEE MASS)},
   address = {Monterey, California, USA},
   publisher = {IEEE},
   institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
   pages = {1--10},
   type = {Konferenz-Beitrag},
   month = {November},
   year = {2019},
   keywords = {Internet of Things; Mobile Gateways; Opportunistic Data Collection; Priority-Based Scheduling},
   language = {Englisch},
   cr-category = {C.2.4 Distributed Systems},
   ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2019-27/INPROC-2019-27.pdf},
   department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
   abstract = {Internet of Things (IoT) is expanding at a rapid rate where it allows for virtually endless opportunities and connections to take place. In general, IoT opens the door to a myriad of applications but also to many challenges. One of the major challenges is how to efficiently retrieve the sensory data from {\^a}€œresources-limited{\^a}€ IoT devices. Such devices typically have a restricted energy budget, which broadly hinders their direct connection to the Internet. In this realm, modern mobile devices, e.g. smartphones, tablets, smartwatches, have been harnessed to bridge between the low-power IoT devices and the Internet. However, the current vision which mainly relies on designing siloed gateways, i.e. a separate gateway/App for each IoT device, is certainly impractical, especially with the rapid growth in the number of IoT devices. Furthermore, energy efficiency of the smart mobile devices hosting the IoT gateways has to be thoroughly considered. To tackle these challenges, we introduce GaaS (Gateway as a Service), a cross-platform gateway architecture for opportunistically retrieving sensory data from the low-power IoT sensors. Through Bluetooth low energy radios, GaaS is capable of simultaneously connecting to several nearby IoT sensors. To this end, we devise two distinct priority-based scheduling algorithms, namely the EP-WSM and FEP-AHP schedulers, which rank the detected IoT sensors, before estimating the connection time for each IoT sensor. The intuition behind ranking the IoT sensors is to improve the data retrieval rate from these sensors together with reducing the energy overhead on the mobile devices. Additionally, GaaS encompasses a self-adaptive engine to automatically balance the trade-off between energy efficiency and data retrieval rate through switching between schedulers according to the runtime dynamics. To demonstrate the effectiveness of GaaS, we implemented an IoT testbed to evaluate the energy consumption, the latency, and the data retrieval rate. The results show that using GaaS, compared to siloed gateways, we can identify up to 18\% savings in the consumed energy while requiring much less data retrieval time.},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-27&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-23,
   author = {Jonathan Falk and Frank D{\"u}rr and Steffen Linsenmayer and Stefan Wildhagen and Carabelli Ben and Kurt Rothermel},
   title = {{Optimal Routing and Scheduling of Complemental Flows in Converged Networks}},
   booktitle = {Proceedings of the 27th International Conference on Real-Time Networks and Systems (RTNS 2019), November 6-8, 2019 -Toulouse/France},
   publisher = {ACM},
   institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
   type = {Konferenz-Beitrag},
   month = {November},
   year = {2019},
   doi = {10.1145/3356401.3356415},
   keywords = {Routing Scheduling Complemental Flows},
   language = {Englisch},
   cr-category = {C.2.4 Distributed Systems},
   ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2019-23/INPROC-2019-23.pdf},
   department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
   abstract = {Converged networks support applications with completely different (real-time) requirements. The communication paradigms offered in converged networks are predominantly treated as separate entities from the perspective of traffic engineering, e.g., time-triggered traffic for closed-loop control systems, shaped traffic for multimedia-streaming applications, and best-effort traffic for non-time-critical IT applications. However, there are scenarios where applications benefit from considering time-triggered messages and non-time-triggered messages as complemental components of a single traffic flow. These applications have the property that time-triggered transmissions guarantee basic functionality (e.g., stability of a control system), and additional non-time-triggered transmissions improve the application's performance. We present how to model these so-called complemental traffic flows for this type of application using a traffic metric for the description of the non-time-triggered traffic part. Furthermore, we show that complemental flows are suitable for traffic engineering by presenting two different approaches for the problem of optimized joint routing and scheduling in converged networks with mixed integer linear programming. In our evaluations, we use an exemplary min-max objective for the joint routing and scheduling problem which yields an average reduction of the peak value of the traffic metric by 20-30$\backslash$\% over constraint-based approaches.},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-23&engl=0}
}
@inproceedings {INPROC-2019-22,
   author = {Jonathan Falk and Frank D{\"u}rr and Kurt Rothermel},
   title = {{Modeling Time-Triggered Service Intermittence In Network Calculus}},
   booktitle = {Proceedings of the 27th International Conference on Real-Time Networks and Systems (RTNS 2019), November 6-8, 2019 -Toulouse/France},
   publisher = {ACM},
   institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
   type = {Konferenz-Beitrag},
   month = {November},
   year = {2019},
   doi = {10.1145/3356401.3356411},
   keywords = {Real-time, Network Calculus Service Intermittence},
   language = {Englisch},
   cr-category = {C.2.4 Distributed Systems},
   ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2019-22/INPROC-2019-22.pdf},
   department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
   abstract = {Network elements (e.g., switches), which intermit service, i.e., stop forwarding and transmission of data according to a repeating schedule, can be found in many real-time capable communication networks, e.g., communication networks with TDMA, Ethernet with Time-aware Shapers or low-power wireless networks. The behavior of those network elements depends on the (stationary) properties of the network elements, their schedule, and the current time, as well as the offered traffic load. If a networked real-time system generates traffic flows which are not synchronized to the schedules of the network elements, formal frameworks such as Network Calculus (NC) are highly valuable to derive deterministic guarantees for the communication. In this paper, we show the fundamental implications of modeling time-triggered network elements with service intermittence in NC. We identify two archetypes of network elements with intermittent service, and propose time-variant and time-invariant approaches to derive service curve formulations to model them. We evaluate the differences between time-variant and time-invariant service curves with respect to the overestimation of worst-case backlog and worst-case delay, and we identify schedule properties which influence the tightness of the derived bounds.},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-22&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-2019-04,
   author = {Jonathan Falk and David Hellmanns and Ben Carabelli and Naresh Nayak and Frank D{\"u}rr and Stephan Kehrer and Kurt Rothermel},
   title = {{NeSTiNg: Simulating IEEE Time-sensitive Networking (TSN) in OMNeT++}},
   booktitle = {Proceedings of the 2019 International Conference on Networked Systems (NetSys)},
   address = {Garching b. M{\"u}nchen, Germany},
   publisher = {IEEE},
   institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
   type = {Konferenz-Beitrag},
   month = {M{\"a}rz},
   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-04/INPROC-2019-04.pdf,     https://gitlab.com/ipvs/nesting},
   department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
   abstract = {IEEE 802.1 Time-sensitive Networking (TSN) enables real-time communication with deterministically bounded network delay and jitter over standard IEEE 802.3 networks (``Ethernet''). In particular, TSN specifies a time-triggered scheduling mechanism in IEEE Std 802.1Qbv implemented by switches to control when outgoing queues get access to switch ports. Besides this time-triggered scheduling mechanism, other scheduling mechanisms can be active in the network at the same time including priority queuing and a credit-based shaper. Moreover, further supporting mechanisms such as the possibility to interrupt frames already in transmission (frame preemption) are specified by the TSN standards. Overall, this leads to a complex network infrastructure transporting both, real-time and non-real-time traffic in one converged network, making it hard to analyze the behavior of converged networks. To facilitate the analysis of TSN networks, we present TSN-specific extensions to the popular OMNeT++/INET framework for network simulations in this paper including, in particular, the time-triggered scheduling mechanism of IEEE Std 802.1Qbv. Besides the design of the TSN simulator, we present a proof-of-concept implementation and exemplary evaluation of TSN networks.},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-04&engl=0}
}
@inproceedings {INPROC-2019-01,
   author = {Steffen Linsenmayer and Ben W. Carabelli and Frank D{\"u}rr and Jonathan Falk and Frank Allg{\"o}wer and Kurt Rothermel},
   title = {{Integration of Communication Networks and Control Systems Using a Slotted Transmission Classification Model}},
   booktitle = {Proceedings of the 16th IEEE Annual Consumer Communications \& Networking Conference (CCNC)},
   address = {Las Vegas, NV, USA},
   publisher = {IEEE},
   institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
   type = {Workshop-Beitrag},
   month = {Januar},
   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-01/INPROC-2019-01.pdf},
   department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
   abstract = {In this paper, we present a communication abstraction for Networked Control Systems that is characterized by a slotted transmission classification model. We discuss, how such a model can be implemented over local area networks by using IEEE Time Sensitive Networking methods. Furthermore, it is shown how asymptotic stability can be analyzed for linear systems that communicate over such a network. Based on the stability result, a controller design procedure is derived that takes the information captured in the network model into account. Further topics and related open problems that are implicated by the proposed model are briefly discussed as an outlook.},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-01&engl=0}
}
@article {ART-2019-20,
   author = {Henriette R{\"o}ger and Ruben Mayer},
   title = {{A Comprehensive Survey on Parallelization and Elasticity in Stream Processing}},
   journal = {ACM Computing Surveys (CSUR)},
   address = {New York},
   publisher = {ACM},
   volume = {52},
   number = {2},
   pages = {1--37},
   type = {Artikel in Zeitschrift},
   month = {April},
   year = {2019},
   doi = {10.1145/3303849},
   keywords = {Stream Processing; Complex Event Processing; Parallelization; Elasticity},
   language = {Deutsch},
   cr-category = {C.1.4 Processor Architectures, Parallel Architectures},
   ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/ART-2019-20/ART-2019-20.pdf,     https://dl.acm.org/citation.cfm?id=3303849},
   department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Verteilte Systeme},
   abstract = {Stream Processing (SP) has evolved as the leading paradigm to process and gain value from the high volume of streaming data produced, e.g., in the domain of the Internet of Things. An SP system is a middleware that deploys a network of operators between data sources, such as sensors, and the consuming applications. SP systems typically face intense and highly dynamic data streams. Parallelization and elasticity enable SP systems to process these streams with continuous high quality of service. The current research landscape provides a broad spectrum of methods for parallelization and elasticity in SP. Each method makes specific assumptions and focuses on particular aspects. However, the literature lacks a comprehensive overview and categorization of the state of the art in SP parallelization and elasticity, which is necessary to consolidate the state of the research and to plan future research directions on this basis. Therefore, in this survey, we study the literature and develop a classification of current methods for both parallelization and elasticity in SP systems.},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2019-20&engl=0}
}
 
Zum Seitenanfang