| 1. |
|
|
| 2. |
|
|
| 3. |
- Almgren, Magnus, 1972, et al.
(författare)
-
Cybersecurity in the Smart Grid
- 2013
-
Ingår i: Chalmers Energy Conference 2013.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)
|
|
| 4. |
|
|
| 5. |
- Butun, Ismail, 1981, et al.
(författare)
-
Intrusion Detection in Industrial Networks via Data Streaming
- 2020
-
Ingår i: Industrial IoT: Challenges, Design Principles, Applications, and Security. - Cham : Springer International Publishing. ; , s. 213-238
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- Given the increasing threat surface of industrial networks due to distributed, Internet-of-Things (IoT) based system architectures, detecting intrusions in Industrial IoT (IIoT) systems is all the more important, due to the safety implications of potential threats. The continuously generated data in such systems form both a challenge but also a possibility: data volumes/rates are high and require processing and communication capacity but they contain information useful for system operation and for detection of unwanted situations. In this chapter we explain that stream processing (a.k.a. data streaming) is an emerging useful approach both for general applications and for intrusion detection in particular, especially since it can enable data analysis to be carried out in the continuum of edge-fog-cloud distributed architectures of industrial networks, thus reducing communication latency and gradually filtering and aggregating data volumes. We argue that usefulness stems also due to facilitating provisioning of agile responses, i.e. due to potentially smaller latency for intrusion detection and hence also improved possibilities for intrusion mitigation. In the chapter we outline architectural features of IIoT networks, potential threats and examples of state-of-the art intrusion detection methodologies. Moreover, we give an overview of how leveraging distributed and parallel execution of streaming applications in industrial setups can influence the possibilities of protecting these systems. In these contexts, we give examples using electricity networks (a.k.a. Smart Grid systems). We conclude that future industrial networks, especially their Intrusion Detection Systems (IDSs), should take advantage of data streaming concept by decoupling semantics from the deployment.
|
|
| 6. |
- Cederman, Daniel, 1981, et al.
(författare)
-
Concurrent Data Structures for Efficient Streaming Aggregation
- 2013
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- In many data gathering applications, information arrives in the form of continuous streams rather than finite data sets.Efficient one-pass algorithms are required to cope with high input loads.Stream processing engines support continuous queries to process data in a real-time fashion and have evolved rapidly from centralized to distributed, parallel and elastic solutions.While a big effort has been put on leveraging the processing capacity of clusters of machines, less work has focused on leveraging the parallelism enabled by multi-core architectures by means of concurrent and lock-free data structures, to support the pipeline.This paper explores this aspect focusing on multiway aggregation, where large data volumes are received from multiple input streams.Multiway aggregation is crucial in contexts such as sensor networks, social media or clickstream analysis applications.We provide three enhanced aggregate operators that rely on two new concurrent data structures and their lock-free implementations, supporting both order-sensitive and order-insensitive aggregation functions.We provide an extensive study of the properties of the proposed aggregate operators and the new data structures.We also show an extensive experimental evaluation of the proposed methods, giving empirical evidence of their superiority.In this evaluation we run a variety of aggregation queries on two large datasets, one with data extracted from SoundCloud, a music social network, and one with data from a smart grid metering network.In all the experiments, the new data structures improved the aggregation performance significantly, up to one order of magnitude, in terms of both processing throughput and latency.
|
|
| 7. |
- Cederman, Daniel, 1981, et al.
(författare)
-
Lock-Free Concurrent Data Structures
- 2017
-
Ingår i: Programming multi-core and many-core computing systems. - Hoboken, NJ, USA : John Wiley & Sons, Inc.. - 9781119332015 ; , s. 29-58
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- © 2017 by John Wiley & Sons, Inc. All rights reserved. Concurrent data structures are the data sharing side of parallel programming. An implementation of a data structure is called lock-free, if it allows multiple processes/hreads to access the data structure concurrently and also guarantees that at least one operation among those finishes in a finite number of its own steps regardless of the state of the other operations. This chapter provides a sufficient background and intuition to help the interested reader to navigate in the complex research area of lock-free data structures. It offers the programmer familiarity to the subject that allows using truly concurrent methods. The chapter discusses the fundamental synchronization primitives on which efficient lock-free data structures rely. It discusses the problem of managing dynamically allocated memory in lock-free concurrent data structures and general concurrent environments. The idiosyncratic architectural features of graphics processors that is important to consider when designing efficient lock-free concurrent data structures for this emerging area.
|
|
| 8. |
- Cederman, Daniel, 1981, et al.
(författare)
-
Lock-free Concurrent Data Structures
- 2013
-
Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)abstract
- Concurrent data structures are the data sharing side of parallel programming. Data structures give the means to the program to store data, but also provide operations to the program to access and manipulate these data. These operations are implemented through algorithms that have to be efficient. In the sequential setting, data structures are crucially important for the performance of the respective computation. In the parallel programming setting, their importance becomes more crucial because of the increased use of data and resource sharing for utilizing parallelism. The first and main goal of this chapter is to provide a sufficient background and intuition to help the interested reader to navigate in the complex research area of lock-free data structures. The second goal is to offer the programmer familiarity to the subject that will allow her to use truly concurrent methods.
|
|
| 9. |
- Fu, Zhang, 1982, et al.
(författare)
-
CluB: A Cluster Based Method for Mitigating Distributed Denial of Service Attacks
- 2009
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- Distributed Denial of Service attacks are a threat not only for their direct targets but also for the core of the network. They are also hard to detect, hence methods to deal with them need to be proactive.By building on earlier work and improving on distribution of control aspects, we propose a proactive method, which we call CluB, to mitigate such attacks; the methodbalances the effectiveness-overhead trade-off by addressing the issue of granualarity of control in the network.CluB, can collaborate with different routing policies in the network, including contemporary datagram options.We estimate the effectiveness of the method and also study a set of factors for tunning the granularity of control.
|
|
| 10. |
- Fu, Zhang, 1982, et al.
(författare)
-
Managing your Trees: Insights from a Metropolitan-Scale Low-Power Wireless Network
- 2013
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- Low-power wireless, such as IEEE 802.15.4, is envisioned as one key technology for wireless control and communication.In the context of the Advanced Metering Infrastructure (AMI), it serves as an energy-efficient communication technology for both communications at building-scale networks and city-scale networks. Understanding real-world challenges and key properties of 802.15.4 based networks is an essential requirement for both the research community and practitioners:When deploying and operating low-power wireless networks at metropolitan-scale, a deep knowledge is essential to ensure network availability and performance at production-level quality.Similarly, researchers require realistic network models when developing new algorithms and protocols.In this paper, we present new and real-world insights from a deployed metropolitan-scale low-power wireless network:It includes 300,000 individual wireless sensors and cover a city with roughly 600,000 inhabitants.Our findings, for example, help to estimate real-world parameters such as the typical size of routing trees, their balance, and their dynamics over time.Moreover, these insights facilitate the understanding and the realistic calibration of simulation models in key properties such as reliability and throughput.
|
|
