% 
% This file was created by the TYPO3 extension
% bib
% --- Timezone: CEST
% Creation date: 2024-04-25
% Creation time: 04-16-20
% --- Number of references
% 36
% 

@Inproceedings { 2023-schemmel-kdalloc-tool,
   title = {KDAlloc: The KLEE Deterministic Allocator: Deterministic Memory Allocation during Symbolic Execution and Test Case Replay},
   year = {2023},
   month = {7},
   day = {13},
   url = {https://dl.acm.org/doi/pdf/10.1145/3597926.3604921},
   booktitle = {ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2023)},
   DOI = {10.1145/3597926.3604921},
   reviewed = {1},
   author = {Schemmel, Daniel and B{\"u}ning, Julian and Busse, Frank and Nowack, Martin and Cadar, Cristian}
}

@Incollection { 2023_pennekamp_crd-a.i,
   title = {Evolving the Digital Industrial Infrastructure for Production: Steps Taken and the Road Ahead},
   year = {2023},
   month = {2},
   day = {8},
   pages = {35-60},
   abstract = {The Internet of Production (IoP) leverages concepts such as digital shadows, data lakes, and a World Wide Lab (WWL) to advance today’s production. Consequently, it requires a technical infrastructure that can support the agile deployment of these concepts and corresponding high-level applications, which, e.g., demand the processing of massive data in motion and at rest. As such, key research aspects are the support for low-latency control loops, concepts on scalable data stream processing, deployable information security, and semantically rich and efficient long-term storage. In particular, such an infrastructure cannot continue to be limited to machines and sensors, but additionally needs to encompass networked environments: production cells, edge computing, and location-independent cloud infrastructures. Finally, in light of the envisioned WWL, i.e., the interconnection of production sites, the technical infrastructure must be advanced to support secure and privacy-preserving industrial collaboration. To evolve today’s production sites and lay the infrastructural foundation for the IoP, we identify five broad streams of research: (1) adapting data and stream processing to heterogeneous data from distributed sources, (2) ensuring data interoperability between systems and production sites, (3) exchanging and sharing data with different stakeholders, (4) network security approaches addressing the risks of increasing interconnectivity, and (5) security architectures to enable secure and privacy-preserving industrial collaboration. With our research, we evolve the underlying infrastructure from isolated, sparsely networked production sites toward an architecture that supports high-level applications and sophisticated digital shadows while facilitating the transition toward a WWL.},
   keywords = {Cyber-physical production systems; Data streams; Industrial data processing; Industrial network security; Industrial data security; Secure industrial collaboration},
   tags = {internet-of-production},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-pennekamp-iop-a.i.pdf},
   publisher = {Springer},
   series = {Interdisciplinary Excellence Accelerator Series},
   booktitle = {Internet of Production: Fundamentals, Applications and Proceedings},
   ISBN = {978-3-031-44496-8},
   DOI = {10.1007/978-3-031-44497-5_2},
   reviewed = {1},
   author = {Pennekamp, Jan and Belova, Anastasiia and Bergs, Thomas and Bodenbenner, Matthias and B{\"u}hrig-Polaczek, Andreas and Dahlmanns, Markus and Kunze, Ike and Kr{\"o}ger, Moritz and Geisler, Sandra and Henze, Martin and L{\"u}tticke, Daniel and Montavon, Benjamin and Niemietz, Philipp and Ortjohann, Lucia and Rudack, Maximilian and Schmitt, Robert H. and Vroomen, Uwe and Wehrle, Klaus and Zeng, Michael}
}

@Incollection { 2023_klugewilkes_crd-b2.iv,
   title = {Modular Control and Services to Operate Line-less Mobile Assembly Systems},
   year = {2023},
   month = {2},
   day = {8},
   pages = {303-328},
   abstract = {The increasing product variability and lack of skilled workers demand for autonomous, flexible production. Since assembly is considered a main cost driver and accounts for a major part of production time, research focuses on new technologies in assembly. The paradigm of Line-less Mobile Assembly Systems (LMAS) provides a solution for the future of assembly by mobilizing all resources. Thus, dynamic product routes through spatiotemporally configured assembly stations on a shop floor free of fixed obstacles are enabled. In this chapter, we present research focal points on different levels of LMAS, starting with the macroscopic level of formation planning, followed by the mesoscopic level of mobile robot control and multipurpose input devices and the microscopic level of services, such as interpreting autonomous decisions and in-network computing. We provide cross-level data and knowledge transfer through a novel ontology-based knowledge management. Overall, our work contributes to future safe and predictable human-robot collaboration in dynamic LMAS stations based on accurate online formation and motion planning of mobile robots, novel human-machine interfaces and networking technologies, as well as trustworthy AI-based decisions.},
   keywords = {Lineless mobile assembly systems (LMAS); Formation planning; Online motion planning; In-network computing; Interpretable AI; Human-machine collaboration; Ontology-based knowledge management},
   tags = {internet-of-production},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-klugewilkes-iop-b2.iv.pdf},
   publisher = {Springer},
   series = {Interdisciplinary Excellence Accelerator Series},
   booktitle = {Internet of Production: Fundamentals, Applications and Proceedings},
   ISBN = {978-3-031-44496-8},
   DOI = {10.1007/978-3-031-44497-5_13},
   reviewed = {1},
   author = {Kluge-Wilkes, Aline and Baier, Ralph and Gossen, Daniel and Kunze, Ike and M{\"u}ller, Aleksandra and Shahidi, Amir and Wolfschl{\"a}ger, Dominik and Brecher, Christian and Corves, Burkhard and H{\"u}sing, Mathias and Nitsch, Verena and Schmitt, Robert H. and Wehrle, Klaus}
}

@Inproceedings { 2022-serror-ccs-inside,
   title = {Poster: INSIDE - Enhancing Network Intrusion Detection in Power Grids with Automated Facility Monitoring},
   year = {2022},
   month = {11},
   day = {7},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/2022-serror-ccs-inside.pdf},
   publisher = {ACM},
   howpublished = {online},
   booktitle = {Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security},
   event_place = {Los Angeles, CA, USA},
   event_date = {November 8, 2022},
   DOI = {10.1145/3548606.3563500},
   reviewed = {1},
   author = {Serror, Martin and Bader, Lennart and Henze, Martin and Schwarze, Arne and N{\"u}rnberger, Kai}
}

@Inproceedings { 2022-schemmel-kdalloc,
   title = {A Deterministic Memory Allocator for Dynamic Symbolic Execution},
   year = {2022},
   month = {6},
   tags = {safe},
   url = {https://drops.dagstuhl.de/opus/volltexte/2022/16237/pdf/LIPIcs-ECOOP-2022-9.pdf},
   booktitle = {European Conference on Object-Oriented Programming (ECOOP 2022)},
   DOI = {10.4230/LIPIcs.ECOOP.2022.9},
   reviewed = {1},
   author = {Schemmel, Daniel and B{\"u}ning, Julian and Busse, Frank and Nowack, Martin and Cadar, Cristian}
}

@Inproceedings { 2021-kunze-signal-detection,
   title = {Detecting Out-Of-Control Sensor Signals in Sheet Metal Forming using In-Network Computing},
   year = {2021},
   month = {6},
   day = {10},
   tags = {internet-of-production},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-kunze-signal-detection.pdf},
   publisher = {IEEE},
   booktitle = {Proceedings of the 2021 IEEE 30th International Symposium
on Industrial Electronics (ISIE)},
   ISBN = {978-1-7281-9023-5},
   ISSN = {2163-5145},
   DOI = {10.1109/ISIE45552.2021.9576221},
   reviewed = {1},
   author = {Kunze, Ike and Niemietz, Philipp and Tirpitz, Liam and Glebke, Ren{\'e} and Trauth, Daniel and Bergs, Thomas and Wehrle, Klaus}
}

@Article { 2021_buckhorst_lmas,
   title = {Holarchy for Line-less Mobile Assembly Systems Operation in the Context of the Internet of Production},
   journal = {Procedia CIRP},
   year = {2021},
   month = {5},
   day = {3},
   volume = {99},
   pages = {448-453},
   abstract = {Assembly systems must provide maximum flexibility qualified by organization and technology to offer cost-compliant performance features to differentiate themselves from competitors in buyers' markets. By mobilization of multipurpose resources and dynamic planning, Line-less Mobile Assembly Systems (LMASs) offer organizational reconfigurability. By proposing a holarchy to combine LMASs with the concept of an Internet of Production (IoP), we enable LMASs to source valuable information from cross-level production networks, physical resources, software nodes, and data stores that are interconnected in an IoP. The presented holarchy provides a concept of how to address future challenges, meet the requirements of shorter lead times, and unique lifecycle support. The paper suggests an application of decision making, distributed sensor services, recommender-based data reduction, and in-network computing while considering safety and human usability alike.},
   note = {Proceedings of the 14th CIRP Conference on Intelligent Computation in Manufacturing Engineering (ICME '20), July 14-17, 2020, Gulf of Naples, Italy},
   keywords = {Internet of Production; Line-less Mobile Assembly System; Industrial Assembly; Smart Factory},
   tags = {internet-of-production},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-buckhorst-holarchy.pdf},
   publisher = {Elsevier},
   event_place = {Gulf of Naples, Italy},
   event_date = {July 14-17, 2020},
   ISSN = {2212-8271},
   DOI = {10.1016/j.procir.2021.03.064},
   reviewed = {1},
   author = {Buckhorst, Armin F. and Montavon, Benjamin and Wolfschl{\"a}ger, Dominik and Buchsbaum, Melanie and Shahidi, Amir and Petruck, Henning and Kunze, Ike and Pennekamp, Jan and Brecher, Christian and H{\"u}sing, Mathias and Corves, Burkhard and Nitsch, Verena and Wehrle, Klaus and Schmitt, Robert H.}
}

@Article { 2020_niemietz_stamping,
   title = {Stamping Process Modelling in an Internet of Production},
   journal = {Procedia Manufacturing},
   year = {2020},
   month = {7},
   day = {11},
   volume = {49},
   pages = {61-68},
   abstract = {Sharing data between companies throughout the supply chain is expected to be beneficial for product quality as well as for the economical savings in the manufacturing industry. To utilize the available data in the vision of an Internet of Production (IoP) a precise condition monitoring of manufacturing and production processes that facilitates the quantification of influences throughout the supply chain is inevitable. In this paper, we consider stamping processes in the context of an Internet of Production and the preliminaries for analytical models that utilize the ever-increasing available data. Three research objectives to cope with the amount of data and for a methodology to monitor, analyze and evaluate the influence of available data onto stamping processes have been identified: (i) State detection based on cyclic sensor signals, (ii) mapping of in- and output parameter variations onto process states, and (iii) models for edge and in-network computing approaches. After discussing state-of-the-art approaches to monitor stamping processes and the introduction of the fineblanking process as an exemplary stamping process, a research roadmap for an IoP enabling modeling framework is presented.},
   note = {Proceedings of the 8th International Conference on Through-Life Engineering Service (TESConf '19), October 27-29, 2019, Cleveland, OH, USA},
   keywords = {Stamping Process; Industry 4.0; Fine-blanking; Internet of production; Condition monitoring; Data analytics},
   tags = {internet-of-production},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2020/2020-niemietz-stamping-modelling.pdf},
   publisher = {Elsevier},
   event_place = {Cleveland, OH, USA},
   event_date = {October 27-29, 2019},
   ISSN = {2351-9789},
   DOI = {10.1016/j.promfg.2020.06.012},
   reviewed = {1},
   author = {Niemietz, Philipp and Pennekamp, Jan and Kunze, Ike and Trauth, Daniel and Wehrle, Klaus and Bergs, Thomas}
}

@Inproceedings { 2020_pennekamp_supply_chain_accountability,
   title = {Private Multi-Hop Accountability for Supply Chains},
   year = {2020},
   month = {6},
   day = {7},
   abstract = {Today's supply chains are becoming increasingly flexible in nature. While adaptability is vastly increased, these more dynamic associations necessitate more extensive data sharing among different stakeholders while simultaneously overturning previously established levels of trust. Hence, manufacturers' demand to track goods and to investigate root causes of issues across their supply chains becomes more challenging to satisfy within these now untrusted environments. Complementarily, suppliers need to keep any data irrelevant to such routine checks secret to remain competitive. To bridge the needs of contractors and suppliers in increasingly flexible supply chains, we thus propose to establish a privacy-preserving and distributed multi-hop accountability log among the involved stakeholders based on Attribute-based Encryption and backed by a blockchain. Our large-scale feasibility study is motivated by a real-world manufacturing process, i.e., a fine blanking line, and reveals only modest costs for multi-hop tracing and tracking of goods.},
   keywords = {supply chain; multi-hop tracking and tracing; blockchain; attribute-based encryption; Internet of Production},
   tags = {internet-of-production},
   url = {https://comsys.rwth-aachen.de/fileadmin/papers/2020/2020-pennekamp-supply-chain-privacy.pdf},
   publisher = {IEEE},
   booktitle = {Proceedings of the 2020 IEEE International Conference on Communications Workshops (ICC Workshops '20), 1st Workshop on Blockchain for IoT and Cyber-Physical Systems (BIoTCPS '20), June 7-11, 2020, Dublin, Ireland},
   event_place = {Dublin, Ireland},
   event_date = {June 7-11, 2020},
   ISBN = {978-1-7281-7440-2},
   ISSN = {2474-9133},
   DOI = {10.1109/ICCWorkshops49005.2020.9145100},
   reviewed = {1},
   author = {Pennekamp, Jan and Bader, Lennart and Matzutt, Roman and Niemietz, Philipp and Trauth, Daniel and Henze, Martin and Bergs, Thomas and Wehrle, Klaus}
}

@Article { 2020_gleim_factDAG,
   title = {FactDAG: Formalizing Data Interoperability in an Internet of Production},
   journal = {IEEE Internet of Things Journal},
   year = {2020},
   month = {4},
   day = {14},
   volume = {7},
   number = {4},
   pages = {3243-3253},
   abstract = {In the production industry, the volume, variety and velocity of data as well as the number of deployed protocols increase exponentially due to the influences of IoT advances. While hundreds of isolated solutions exist to utilize this data, e.g., optimizing processes or monitoring machine conditions, the lack of a unified data handling and exchange mechanism hinders the implementation of approaches to improve the quality of decisions and processes in such an interconnected environment.
The vision of an Internet of Production promises the establishment of a Worldwide Lab, where data from every process in the network can be utilized, even interorganizational and across domains. While numerous existing approaches consider interoperability from an interface and communication system perspective, fundamental questions of data and information interoperability remain insufficiently addressed.
In this paper, we identify ten key issues, derived from three distinctive real-world use cases, that hinder large-scale data interoperability for industrial processes. Based on these issues we derive a set of five key requirements for future (IoT) data layers, building upon the FAIR data principles. We propose to address them by creating FactDAG, a conceptual data layer model for maintaining a provenance-based, directed acyclic graph of facts, inspired by successful distributed version-control and collaboration systems. Eventually, such a standardization should greatly shape the future of interoperability in an interconnected production industry.},
   keywords = {Data Management; Data Versioning; Interoperability; Industrial Internet of Things; Worldwide Lab},
   tags = {internet-of-production},
   url = {https://comsys.rwth-aachen.de/fileadmin/papers/2020/2020-gleim-iotj-iop-interoperability.pdf},
   publisher = {IEEE},
   ISSN = {2327-4662},
   DOI = {10.1109/JIOT.2020.2966402},
   reviewed = {1},
   author = {Gleim, Lars and Pennekamp, Jan and Liebenberg, Martin and Buchsbaum, Melanie and Niemietz, Philipp and Knape, Simon and Epple, Alexander and Storms, Simon and Trauth, Daniel and Bergs, Thomas and Brecher, Christian and Decker, Stefan and Lakemeyer, Gerhard and Wehrle, Klaus}
}

@Article { 2019-unterberg-matclass,
   title = {In-situ material classification in sheet-metal blanking using deep convolutional neural networks},
   journal = {Production Engineering},
   year = {2019},
   month = {11},
   day = {13},
   volume = {13},
   number = {6},
   pages = {743-749},
   keywords = {internet-of-production},
   DOI = {10.1007/s11740-019-00928-w},
   reviewed = {1},
   author = {Unterberg, Martin and Niemietz, Phillip and Trauth, Daniel and Wehrle, Klaus and Bergs, Thomas}
}

@Inproceedings { 2019_pennekamp_dataflows,
   title = {Dataflow Challenges in an Internet of Production: A Security \& Privacy Perspective},
   year = {2019},
   month = {11},
   day = {11},
   pages = {27-38},
   abstract = {The Internet of Production (IoP) envisions the interconnection of previously isolated CPS in the area of manufacturing across institutional boundaries to realize benefits such as increased profit margins and product quality as well as reduced product development costs and time to market. This interconnection of CPS will lead to a plethora of new dataflows, especially between (partially) distrusting entities. In this paper, we identify and illustrate these envisioned inter-organizational dataflows and the participating entities alongside two real-world use cases from the production domain: a fine blanking line and a connected job shop. Our analysis allows us to identify distinct security and privacy demands and challenges for these new dataflows. As a foundation to address the resulting requirements, we provide a survey of promising technical building blocks to secure inter-organizational dataflows in an IoP and propose next steps for future research. Consequently, we move an important step forward to overcome security and privacy concerns as an obstacle for realizing the promised potentials in an Internet of Production.},
   keywords = {Internet of Production; dataflows; Information Security},
   tags = {internet-of-production},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-pennekamp-dataflows.pdf},
   publisher = {ACM},
   booktitle = {Proceedings of the 5th ACM Workshop on Cyber-Physical Systems Security and PrivaCy (CPS-SPC '19), co-located with the 26th ACM SIGSAC Conference on Computer and Communications Security (CCS '19), November 11-15, 2019, London, United Kingdom},
   event_place = {London, United Kingdom},
   event_date = {November 11-15, 2019},
   ISBN = {978-1-4503-6831-5/19/11},
   DOI = {10.1145/3338499.3357357},
   reviewed = {1},
   author = {Pennekamp, Jan and Henze, Martin and Schmidt, Simo and Niemietz, Philipp and Fey, Marcel and Trauth, Daniel and Bergs, Thomas and Brecher, Christian and Wehrle, Klaus}
}

@Inproceedings { 2019_pennekamp_infrastructure,
   title = {Towards an Infrastructure Enabling the Internet of Production},
   year = {2019},
   month = {5},
   day = {8},
   pages = {31-37},
   abstract = {New levels of cross-domain collaboration between manufacturing companies throughout the supply chain are anticipated to bring benefits to both suppliers and consumers of products. Enabling a fine-grained sharing and analysis of data among different stakeholders in an automated manner, such a vision of an Internet of Production (IoP) introduces demanding challenges to the communication, storage, and computation infrastructure in production environments. In this work, we present three example cases that would benefit from an IoP (a fine blanking line, a high pressure die casting process, and a connected job shop) and derive requirements that cannot be met by today’s infrastructure. In particular, we identify three orthogonal research objectives: (i) real-time control of tightly integrated production processes to offer seamless low-latency analysis and execution, (ii) storing and processing heterogeneous production data to support scalable data stream processing and storage, and (iii) secure privacy-aware collaboration in production to provide a basis for secure industrial collaboration. Based on a discussion of state-of-the-art approaches for these three objectives, we create a blueprint for an infrastructure acting as an enabler for an IoP.},
   keywords = {Internet of Production; Cyber-Physical Systems; Data Processing; Low Latency; Secure Industrial Collaboration},
   tags = {internet-of-production},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-pennekamp-iop-infrastructure.pdf},
   publisher = {IEEE},
   booktitle = {Proceedings of the 2nd IEEE International Conference on Industrial Cyber-Physical Systems (ICPS '19), May 6-9, 2019, Taipei, TW},
   event_place = {Taipei, TW},
   event_date = {May 6-9, 2019},
   ISBN = {978-1-5386-8500-6/19},
   DOI = {10.1109/ICPHYS.2019.8780276},
   reviewed = {1},
   author = {Pennekamp, Jan and Glebke, Ren{\'e} and Henze, Martin and Meisen, Tobias and Quix, Christoph and Hai, Rihan and Gleim, Lars and Niemietz, Philipp and Rudack, Maximilian and Knape, Simon and Epple, Alexander and Trauth, Daniel and Vroomen, Uwe and Bergs, Thomas and Brecher, Christian and B{\"u}hrig-Polaczek, Andreas and Jarke, Matthias and Wehrle, Klaus}
}

@Inproceedings { 2019-glebke-hicss-integrated,
   title = {A Case for Integrated Data Processing in Large-Scale Cyber-Physical Systems},
   year = {2019},
   month = {1},
   day = {8},
   pages = {7252-7261},
   tags = {internet-of-production,reflexes},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-glebke-integrated.pdf},
   misc2 = {Online},
   publisher = {University of Hawai'i at Manoa / AIS},
   booktitle = {Proceedings of the 52nd Hawaii International Conference on System Sciences (HICSS), Wailea, HI, USA},
   language = {en},
   ISBN = {978-0-9981331-2-6},
   DOI = {10.24251/HICSS.2019.871},
   reviewed = {1},
   author = {Glebke, Ren{\'e} and Henze, Martin and Wehrle, Klaus and Niemietz, Philipp and Trauth, Daniel and Mattfeld, Patrick and Bergs, Thomas}
}

@Inproceedings { 2018-cav-schemmel-liveness,
   title = {Symbolic Liveness Analysis of Real-World Software},
   year = {2018},
   month = {7},
   day = {14},
   tags = {symbiosys},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2018/2018-schemmel-symbolic-liveness-analysis-of-real-world-software.pdf},
   booktitle = {Computer Aided Verification (CAV 2018)},
   event_place = {Oxford, Great Britain},
   event_name = {30th International Conference on Computer Aided Verification},
   event_date = {2018-07-14 to 2018-07-17},
   language = {en},
   DOI = {10.1007/978-3-319-96142-2_27},
   reviewed = {1},
   author = {Schemmel, Daniel and B{\"u}ning, Julian and Soria Dustmann, Oscar and Noll, Thomas and Wehrle, Klaus}
}

@Article { 2018-scheitle-ccr-caa,
   title = {A First Look at Certification Authority Authorization (CAA)},
   journal = {ACM SIGCOMM Computer Communications Review (CCR)},
   year = {2018},
   month = {4},
   volume = {48},
   pages = {10-23},
   note = {https://www.net.in.tum.de/fileadmin/bibtex/publications/papers/caa17.pdf},
   tags = {internet-measurements},
   url = {https://ccronline.sigcomm.org/wp-content/uploads/2018/05/sigcomm-ccr-final163.pdf},
   web_url = {https://ccronline.sigcomm.org/2018/a-first-look-at-certification-authority-authorization-caa/},
   web_url_date = {2018-06-05},
   DOI = {10.1145/3213232.3213235},
   reviewed = {1},
   author = {Scheitle, Quirin and Chung, Taejoong and Hiller, Jens and Gasser, Oliver and Naab, Johannes and van Rijswijk-Deij, Roland and Hohlfeld, Oliver and Holz, Ralph and Choffnes, Dave and Mislove, Alan and Carle, Georg}
}

@Inproceedings { 2017-maurer-trustcom-coinjoin,
   title = {Anonymous CoinJoin Transactions with Arbitrary Values},
   year = {2017},
   month = {8},
   day = {1},
   pages = {522-529},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/2017-maurer-trustcom-coinjoin.pdf},
   misc2 = {Online},
   publisher = {IEEE},
   booktitle = {2017 IEEE Trustcom/BigDataSE/ICESS},
   event_place = {Sydney, NSW, Australia},
   event_name = {16th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (IEEE TrustCom)},
   event_date = {1. - 4. August 2017},
   ISBN = {978-1-5090-4906-6},
   ISSN = {2324-9013},
   DOI = {10.1109/Trustcom/BigDataSE/ICESS.2017.280},
   reviewed = {1},
   author = {Maurer, Felix Konstantin and Neudecker, Till and Florian, Martin}
}

@Article { 2017-comnet-lru,
   title = {Performance Evaluation for New Web Caching Strategies Combining LRU with Score Based Object Selection},
   journal = {Elsevier Computer Networks},
   year = {2017},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/COMNET-D-16-957R1-Updated-Submit.pdf},
   state = {accepted},
   author = {Hasslinger, Gerhard and Ntougias, Konstantinos and Hasslinger, Frank and Hohlfeld, Oliver}
}

@Conference { 2016-itc-caching,
   title = {Performance Evaluation for New Web Caching Strategies Combining RU with Score Based Object Selection},
   year = {2016},
   month = {9},
   booktitle = {ITC 28},
   event_name = {ITC 28},
   author = {Hasslinger, Gerhard and Ntougias, Kostas and Hasslinger, Frank and Hohlfeld, Oliver}
}

@Article { 2016-hohlfeld-nfv_ccr,
   title = {New Kid on the Block: Network Functions Virtualization: From Big Boxes to Carrier Clouds},
   journal = {ACM SIGCOMM CCR},
   year = {2016},
   month = {7},
   url = {http://ccracmsigcomm.info.ucl.ac.be/wp-content/uploads/2016/07/sigcomm-ccr-paper29.pdf},
   author = {Nobach, Leonhard and Hohlfeld, Oliver and Hausheer, David}
}

@Incollection { 2013-wtc-eggert-sensorcloud,
   title = {SensorCloud: Towards the Interdisciplinary Development of a Trustworthy Platform for Globally Interconnected Sensors and Actuators},
   year = {2014},
   month = {12},
   day = {14},
   pages = {203-218},
   tags = {sensorcloud},
   url = {fileadmin/papers/2013/2013-wtc-eggert-sensorcloud.pdf},
   misc2 = {Online},
   editor = {Krcmar, Helmut and Reussner, Ralf and Rumpe, Bernhard},
   publisher = {Springer},
   booktitle = {Trusted Cloud Computing},
   language = {en},
   ISBN = {978-3-319-12717-0},
   DOI = {10.1007/978-3-319-12718-7_13},
   reviewed = {1},
   author = {Eggert, Michael and H{\"a}u{\ss}ling, Roger and Henze, Martin and Hermerschmidt, Lars and Hummen, Ren{\'e} and Kerpen, Daniel and Navarro P{\'e}rez, Antonio and Rumpe, Bernhard and Thi{\ss}en, Dirk and Wehrle, Klaus}
}

@Conference { EW2013_parruca_gross,
   title = {On Semi-Static Interference Coordination under Proportional Fair Scheduling in LTE Systems},
   year = {2013},
   pages = {8},
   abstract = {In this paper we consider the design of semi-static inter-cell interference coordination schemes for LTE networks. In this approach, base stations coordinate the power settings per resource block over long time spans such as seconds. In order to optimize the power settings, one needs to employ models which predict the rate of terminals over the next coordination period under the usage of a given power setting. However, these models are typically quite simple and neglect the impact from fading as well as from dynamic resource allocation performed at the base stations on a millisecond basis. Ignoring such properties of OFDMA networks leads therefore to suboptimal transmit power settings. In this paper, we study the impact from a precise rate prediction model that accurately accounts for fading and dynamic resource allocation. On the down-side, this more precise model leads to a much more involved optimization problem to be solved once per coordination period. We propose two different heuristic methods to deal with this problem. Especially the usage of genetic algorithm results to be promising to counteract the complexity increase. We then study the overall system performance and find precise rate prediction models to be essential for semi-static interference coordination as they provide significant performance improvements in comparison to approaches with simpler models.},
   keywords = {ICIC, proportional fair scheduling, power mask, resource block, scheduling, dynamic scheduling, inter cell interference coordination, LTE, OFDMA, WiMAX},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2013/2013_ICIC_parruca_grysla_gross.pdf},
   web_url = {http://www.vde-verlag.de/proceedings-en/563498043.html},
   editor = {vde-verlag},
   publisher = {vde-verlag},
   address = {http://www.vde-verlag.de/},
   booktitle = {Proceedings: European Wireless 2013},
   event_place = {Guildford, UK},
   event_name = {2013 - 19th European Wireless Conference},
   event_date = {04/16/2012 - 04/18/2013},
   language = {English},
   author = {Parruca, Donald and Grysla, Marius and M{\"a}h{\"o}nen, Petri and Petrova, Marina and Zhou, Han and Naghibi, Farshad and Gross, James}
}

@Inproceedings { 2010-kunz-mascots-horizon,
   title = {Expanding the Event Horizon in Parallelized Network Simulations},
   year = {2010},
   month = {8},
   day = {18},
   pages = {172-181},
   abstract = {The simulation models of wireless networks rapidly increase in complexity to accurately model wireless channel characteristics and the properties of advanced transmission technologies. Such detailed models typically lead to a high computational load per simulation event that accumulates to extensive simulation runtimes. Reducing runtimes through parallelization is challenging since it depends on detecting causally independent events that can execute concurrently. Most existing approaches base this detection on lookaheads derived from channel propagation latency or protocol characteristics. In wireless networks, these lookaheads are typically short, causing the potential for parallelization and the achievable speedup to remain small. This paper presents Horizon, which unlocks a substantial portion of a simulation model's workload for parallelization by going beyond the traditional lookahead. We show how to augment discrete events with durations to identify a much larger horizon of independent simulation events and efficiently schedule them on multi-core systems. Our evaluation shows that this approach can significantly cut down the runtime of simulations, in particular for complex and accurate models of wireless networks.},
   tags = {horizon},
   url = {fileadmin/papers/2010/2010-kunz-mascots-horizon.pdf},
   misc2 = {Online},
   publisher = {IEEE Computer Society},
   address = {Los Alamitos, CA, USA},
   booktitle = {Proceedings of the 18th Annual Meeting of the IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS'10), Miami, FL, USA},
   event_place = {Miami, FL, USA},
   event_name = {18th Annual Meeting of the IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS'10)},
   event_date = {August 17-19, 2010},
   language = {en},
   ISBN = {978-0-7695-4197-6},
   ISSN = {1526-7539},
   DOI = {10.1109/MASCOTS.2010.26},
   reviewed = {1},
   author = {Kunz, Georg and Landsiedel, Olaf and Gross, James and G{\"o}tz, Stefan and Naghibi, Farshad and Wehrle, Klaus}
}

@Conference { 200803riechemmvecluster,
   title = {Clustering Players for Load Balancing in Virtual Worlds},
   year = {2008},
   month = {3},
   day = {18},
   pages = {9-13},
   abstract = {Massively Multiplayer Online Games (MMOGs) have become increasingly popular in the last years. So far the distribution of load, caused by the players in these games, is not distributed dynamically. After the launch of a new game, the introduction of new content, during special ingame events, or also during normal operations, players tend to concentrate in certain regions of the game worlds and cause overload conditions. Therefore we propose the use of structured P2P technology for the server infrastructure of the MMOGs to improve the reliability and scalability. Previous work segmented the game work into rectangular areas; however this approach often split a group of players to different servers, causing additional overhead. This work presents a cluster-based Peer-to-Peer approach, which can be used for load balancing in MMOGs or in other virtual worlds. The system is able to dynamically adapt to the current state of the game and handle uneven distributions of the players in the game world. We show through simulation, also with traces from real online games, that the cluster-based approach performs better than the previous P2P-based systems, which split the world in rectangular areas.},
   affiliation = {RWTH Aachen University - Distributed Systems Group},
   url = {http://www.pap.vs.uni-due.de/MMVE08/papers/proceedings.pdf},
   web_url = {http://www.pap.vs.uni-due.de/MMVE08/},
   misc2 = {Online},
   editor = {Gregor Schiele, Daniel Weiskopf, Ben Leong, Shun-Yun Hu},
   booktitle = {Proceedings of 1st International Workshop on Massively Multiuser Virtual Environments at IEEE Virtual Reality 2008 (MMVE 2008)},
   event_place = {Reno, Nevada, USA},
   event_name = {1st International Workshop on Massively Multiuser Virtual Environments at IEEE Virtual Reality 2008 (MMVE 2008)},
   event_date = {March 8th, 2008},
   language = {en},
   reviewed = {1},
   author = {Rieche, Simon and Wehrle, Klaus and Fouquet, Marc and Niedermayer, Heiko and Teifel, Timo and Carle, Georg}
}

@Article { 200812riecheIJAMCcluster,
   title = {Clustering Players for Load Balancing in Virtual Worlds},
   journal = {International Journal of Advanced Media and Communication (IJAMC)},
   year = {2008},
   volume = {2},
   number = {4},
   pages = {351-363},
   abstract = {In current Massively Multiplayer Online Games (MMOGs) the distribution of load is not distributed dynamically. But players tend to concentrate in certain regions of the game world and cause overload conditions. Therefore we propose the use of structured Peer-to-Peer technology for the server infrastructure of the MMOGs to improve the reliability and scalability. Previous work segmented the game work into rectangular areas but often split a group of players to different servers. This work presents a cluster-based P2P approach, which is able to dynamically adapt to the current state of the game and handle uneven distributions of players.Weshow through simulation, also with traces from real online games, that the cluster-based approach performs better than the previous P2P-based system.},
   affiliation = {RWTH Aachen University - Distributed Systems Group},
   web_url = {http://www.inderscience.com/browse/index.php?journalID=67},
   misc2 = {print},
   language = {en},
   ISSN = {1462-4613},
   reviewed = {1},
   author = {Rieche, Simon and Wehrle, Klaus and Fouquet, Marc and Niedermayer, Heiko and Teifel, Timo and Carle, Georg}
}

@Inbook { 2008-thissen-LNCS-synergy,
   title = {Synergy by Integrating New Functionality},
   year = {2008},
   pages = {519-526},
   misc2 = {Print},
   editor = {M. Nagl, W. Marquardt},
   publisher = {Springer},
   series = {Lecture Notes in Computer Science 4970},
   booktitle = {Collaborative and Distributed Chemical Engineering, From Understanding to Substantial Design Process Support},
   language = {en},
   ISBN = {978-3-540-70551-2},
   author = {Becker, Simon and Heller, Markus and Jarke, Matthias and Marquardt, Wolfgang and Nagl, Manfred and Spaniol, Otto and Thi{\ss}en, Dirk}
}

@Conference { 200701riecheccncmmog,
   title = {Peer-to-Peer-based Infrastructure Support for Massively Multiplayer Online Games},
   year = {2007},
   month = {1},
   day = {11},
   pages = {763-767},
   abstract = {Online games are an interesting challenge and chance for the future development of the Peer-to-Peer paradigm. Massively multiplayer online games (MMOGs) are becoming increasingly popular today. However, even high-budget titles like World of Warcraft that have gone through extensive betatesting suffer from downtimes because of hard- and software problems. Our approach is to use structured P2P technology for the server infrastructure of MMOGs to improve their reliability and scalability. Such P2P networks are also able to adapt to the current state of the game and handle uneven distributions of the players in the game world. Another feature of our approach is being able to add supplementary servers at runtime. Our system allows using off-the-shelf PCs as infrastructure peers for participation in different game worlds as needed. Due to the nature of the Economy of Scale the same number of hosts will provide a better service than dedicated servers for each game world.},
   affiliation = {RWTH Aachen University - Distributed Systems Group},
   url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4199088\&arnumber=4199243\&count=254\&index=154},
   web_url = {http://www.ieee-ccnc.org/2007/},
   misc2 = {Print},
   publisher = {IEEE Press},
   booktitle = {Proceedings of 4th Annual IEEE Consumer Communications and Networking Conference (CCNC 2007)},
   organization = {IEEE},
   event_place = {Las Vegas, Nevada, USA},
   event_name = {4th Annual IEEE Consumer Communications and Networking Conference (CCNC 2007)},
   event_date = {11-13 January 2007},
   language = {en},
   ISBN = {1-4244-0667-6},
   DOI = {10.1109/CCNC.2007.155},
   reviewed = {1},
   author = {Rieche, Simon and Wehrle, Klaus and Fouquet, Marc and Niedermayer, Heiko and Petrak, Leo and Carle, Georg}
}

@Conference { 200711Globecom2007Landsiedelmultipathonionrouting,
   title = {Dynamic Multipath Onion Routing in Anonymous Peer-To-Peer Overlay Networks},
   year = {2007},
   abstract = {Although recent years provided many protocols for anonymous routing in overlay networks, they commonly rely on the same communication paradigm: Onion Routing. In Onion Routing a static tunnel through an overlay network is build via layered encryption. All traffic exchanged by its end points is relayed through this tunnel.In contrast, this paper introduces dynamic multipath Onion Routing to extend the static Onion Routing paradigm. This approach allows each packet exchanged between two end points to travel along a different path. To provide anonymity the first half of this path is selected by the sender and the second half by the receiver of the packet. The results are manifold: First, dynamic multipath Onion Routing increases the resilience against threats, especially pattern and timing based analysis attacks. Second, the dynamic paths reduce the impact of misbehaving and overloaded relays. Finally, inspired by Internet routing, the forwarding nodes do not need to maintain any state about ongoing flows and so reduce the complexity of the router. In this paper, we describe the design of our dynamic Multipath Onion Router (MORE) for peer-to-peer overlay networks, and evaluate its performance. Furthermore, we integrate address virtualization to abstract from Internet addresses and provide transparent support for IP applications. Thus, no application-level gateways, proxies or modifications of applications are required to sanitize protocols from network level information. Acting as an IP-datagram service, our scheme provides a substrate for anonymous communication to a wide range of applications using TCP and UDP.},
   booktitle = {IEEE Global Communication Conference (GlobeCom), Washington D.C.},
   author = {Landsiedel, Olaf and Pimenidis, Alexis and Wehrle, Klaus and Niedermayer, Heiko and Carle, Georg}
}

@Techreport { 200608riechetrmmog,
   title = {Peer-to-Peer-based Infrastructure Support for Massively Multiplayer Online Games},
   year = {2006},
   month = {8},
   number = {WSI-2006-04},
   abstract = {Online games are an interesting challenge and chance for the future development of the Peer-to-Peer paradigm. Massively multiplayer online games (MMOGs) are becoming increasingly popular today. However, even high-budget titles like World of Warcraft that have gone through extensive beta-testing suffer from downtimes because of hard- and software problems. Our approach is to use structured P2P technology for the server infrastructure of MMOGs to improve their reliability and scalability. Such P2P networks are also able to adapt to the current state of the game and handle uneven distributions of the players in the game world. Another feature of our approach is being able to add supplementary servers at runtime. Our system allows using off-the-shelf PCs as infrastructure peers for participation in different game worlds as needed. Due to the nature of the Economy of Scale the same number of hosts will provide a better service than dedicated servers for each game world.},
   affiliation = {RWTH Aachen University - Distributed Systems Group},
   url = {http://www.rieche.net/pdf/wsi-2006-04.pdf},
   misc2 = {Online},
   address = {T{\"u}bingen, Germany},
   institution = {Wilhelm-Schickard-Institute for Computer Science, University of T{\"u}bingen},
   type = {Technical Report},
   language = {en},
   author = {Rieche, Simon and Fouquet, Marc and Niedermayer, Heiko and Petrak, Leo and Wehrle, Klaus and Carle, Georg}
}

@Inproceedings { landsiedel2005anonymous,
   title = {Anonymous IP-Services via Overlay Routing},
   year = {2005},
   month = {3},
   abstract = {Although research provides anonymous Internet communication schemes,
anonymous IP-services received only limited attention. In this paper
we present SARA (Anonymous Overlay Routing Providing Sender And
Receiver Anonymity), which enables sender, receiver and relationship
anonymity using layered encryption and distributed traffic mixes,
similar to a Chaumian Mix. Via IP-datagram service and address
virtualization it is fully transparent to applications. Organized as
structured Peer-To-Peer system, SARA is highly scalable and fault
tolerant.

In SARA each communication partner randomly selects a number of
nodes from the overlay and concatenates them to an anonymous
communication path. The sender selects the head of the path, the
receiver builds the tail and publishes this information in the
overlay network using an anonymous ID. Via this ID the sender
retrieves the tail nodes of the path and concatenates both path
section. Layered encryption hides the identities of the sender,
receiver and the intermediate nodes.},
   booktitle = {5. W{\"u}rzburger ''Workshop IP Netzmanagement, IP Netzplanung und Optimierung''},
   event_place = {W{\"u}rzburg, Germany},
   event_name = {5. W{\"u}rzburger ''Workshop IP Netzmanagement, IP Netzplanung und Optimierung''},
   event_date = {March 2005},
   author = {Landsiedel, Olaf and Rieche, Simon and Niedermayer, Heiko and Wehrle, Klaus and Carle, Georg}
}

@Inproceedings { niedermayer2005distribution,
   title = {On the Distribution of Nodes in Distributed Hash Tables},
   year = {2005},
   month = {3},
   booktitle = {Proceedings of Workshop Peer-to-Peer-Systems and -Applications, KiVS 2005},
   event_place = {Kaiserslautern, Germany},
   event_name = {Workshop Peer-to-Peer-Systems and -Applications, KiVS 2005},
   event_date = {March 2005},
   author = {Niedermayer, Heiko and Rieche, Simon and Wehrle, Klaus and Carle, Georg}
}

@Inproceedings { 200507riecheipgames,
   title = {On the Use of Structured Peer-to-Peer Systems for Online Gaming},
   year = {2005},
   month = {3},
   abstract = {Massively multiplayer games are becoming increasingly popular today. However, even high-budget titles suffer from downtimes because of hard- and software problems. Our approach is to use structured Peer-to-Peer technology for the server infrastructure of massively multiplayer online games, which improves reliability and scalability of these applications.},
   booktitle = {5. W{\"u}rzburger ''Workshop IP Netzmanagement, IP Netzplanung und Optimierung''},
   event_place = {W{\"u}rzburg, Germany},
   event_name = {5. W{\"u}rzburger ''Workshop IP Netzmanagement, IP Netzplanung und Optimierung''},
   event_date = {March 2005},
   author = {Rieche, Simon and Fouquet, Marc and Niedermayer, Heiko and Wehrle, Klaus and Carle, Georg}
}

@Inbook { 200509riechep2pbookreliability,
   title = {Reliability and Load Balancing in Distributed Hash Tables},
   year = {2005},
   pages = {119-135},
   editor = {Ralf Steinmetz, Klaus Wehrle},
   publisher = {Springer},
   address = {Heidelberg, Germany},
   series = {Lecture Notes in Computer Science, LNCS},
   chapter = {9},
   booktitle = {Peer-to-Peer Systems and Applications},
   author = {Rieche, Simon and Niedermayer, Heiko and G{\"o}tz, Stefan and Wehrle, Klaus}
}

@Inproceedings { 2006-heer-gi2004,
   title = {On the Use of Structured P2P Indexing Mechanisms in Mobile Ad-Hoc Scenarios},
   year = {2004},
   month = {9},
   volume = {51},
   pages = {239-244},
   abstract = {Recently, Distributed Hash Tables evolved to a preferred approach for decentralized data management in widely distributed systems. Due to their crucial characteristics – namely scalability, flexibility, and resilience – they are quite interesting for being applied in ad-hoc networks. But, there are plenty of open questions concerning the applicability of Distributed Hash Tables in mobile ad-hoc scenarios: Do new problems arise when both technologies are used together? Are there any synergy effects when both technologies are combined? Are the results and assumptions, made for the infrastructural Internet, still true if a mobile ad-hoc network is used instead? In this paper, we discuss these and further questions and offer some solutions for using Distributed Hash Tables in ad-hoc networks.},
   misc2 = {Print},
   publisher = {GI. LNI},
   address = {Bonn, Germany},
   series = {LNI},
   booktitle = {Proceedings of Workshop on Algorithms and Protocols for Efficient Peer-to-Peer Applications (PEPPA), GI-Jahrestagung Informatik 2004, Bonn, Germany},
   event_place = {Ulm, Germany},
   event_name = {GI-Jahrestagung Informatik 2004},
   language = {en},
   ISBN = {3-88579-380-6},
   reviewed = {1},
   author = {Heer, Tobias and Niedermayer, Heiko and Petrak, Leo and Rieche, Simon and Wehrle, Klaus}
}

@Inproceedings { 2000-thissen-USM-loadbal,
   title = {Integrating Trading and Load Balancing for Efficient Management of Services in Distributed Systems},
   year = {2000},
   pages = {42-53},
   misc2 = {Print},
   publisher = {Springer},
   booktitle = {Proceedings of the 3rd International IFIP/GI Working Conference on Trends in Distributed Systems: Towards a Universal Service Market (USM 2000), Munich, Germany},
   event_place = {Munich},
   event_name = {3rd International IFIP/GI Working Conference on Trends in Distributed Systems: Towards a Universal Service Market (USM 2000)},
   language = {en},
   ISBN = {3-540-41024-4},
   reviewed = {1},
   author = {Thi{\ss}en, Dirk and Neukirchen, Helmut}
}

@Inproceedings { 2000-thissen-ISCC-loadbal,
   title = {Managing Services in Distributed Systems by Integrating Trading and Load Balancing},
   year = {2000},
   pages = {641-646},
   misc2 = {Print},
   publisher = {IEEE},
   booktitle = {Proceedings of the 5th IEEE Symposium on Computers and Communications (ISCC 2000), Antibes - Juan les Pins, France},
   event_place = {Antibes - Juan les Pins, France},
   event_name = {5th IEEE Symposium on Computers and Communications (ISCC 2000)},
   language = {en},
   ISBN = {0-7695-0722-0},
   reviewed = {1},
   author = {Thi{\ss}en, Dirk and Neukirchen, Helmut}
}