This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-04-25 Creation time: 21-02-36 --- Number of references 36 inproceedings 2023-schemmel-kdalloc-tool 2023 7 13 https://dl.acm.org/doi/pdf/10.1145/3597926.3604921 ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2023) 10.1145/3597926.3604921 1 DanielSchemmel JulianBüning FrankBusse MartinNowack CristianCadar incollection 2023_pennekamp_crd-a.i 2023 2 8 35-60 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. Cyber-physical production systems; Data streams; Industrial data processing; Industrial network security; Industrial data security; Secure industrial collaboration internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-pennekamp-iop-a.i.pdf Springer Interdisciplinary Excellence Accelerator Series Internet of Production: Fundamentals, Applications and Proceedings 978-3-031-44496-8 10.1007/978-3-031-44497-5_2 1 JanPennekamp AnastasiiaBelova ThomasBergs MatthiasBodenbenner AndreasBührig-Polaczek MarkusDahlmanns IkeKunze MoritzKröger SandraGeisler MartinHenze DanielLütticke BenjaminMontavon PhilippNiemietz LuciaOrtjohann MaximilianRudack Robert H.Schmitt UweVroomen KlausWehrle MichaelZeng incollection 2023_klugewilkes_crd-b2.iv 2023 2 8 303-328 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. Lineless mobile assembly systems (LMAS); Formation planning; Online motion planning; In-network computing; Interpretable AI; Human-machine collaboration; Ontology-based knowledge management internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-klugewilkes-iop-b2.iv.pdf Springer Interdisciplinary Excellence Accelerator Series Internet of Production: Fundamentals, Applications and Proceedings 978-3-031-44496-8 10.1007/978-3-031-44497-5_13 1 AlineKluge-Wilkes RalphBaier DanielGossen IkeKunze AleksandraMüller AmirShahidi DominikWolfschläger ChristianBrecher BurkhardCorves MathiasHüsing VerenaNitsch Robert H.Schmitt KlausWehrle inproceedings 2022-serror-ccs-inside 2022 11 7 https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/2022-serror-ccs-inside.pdf ACM online Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security Los Angeles, CA, USA November 8, 2022 10.1145/3548606.3563500 1 MartinSerror LennartBader MartinHenze ArneSchwarze KaiNürnberger inproceedings 2022-schemmel-kdalloc 2022 6 safe https://drops.dagstuhl.de/opus/volltexte/2022/16237/pdf/LIPIcs-ECOOP-2022-9.pdf European Conference on Object-Oriented Programming (ECOOP 2022) 10.4230/LIPIcs.ECOOP.2022.9 1 DanielSchemmel JulianBüning FrankBusse MartinNowack CristianCadar inproceedings 2021-kunze-signal-detection 2021 6 10 internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-kunze-signal-detection.pdf IEEE Proceedings of the 2021 IEEE 30th International Symposium on Industrial Electronics (ISIE) 978-1-7281-9023-5 2163-5145 10.1109/ISIE45552.2021.9576221 1 IkeKunze PhilippNiemietz LiamTirpitz RenéGlebke DanielTrauth ThomasBergs KlausWehrle article 2021_buckhorst_lmas Procedia CIRP 2021 5 3 99 448-453 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. Proceedings of the 14th CIRP Conference on Intelligent Computation in Manufacturing Engineering (ICME '20), July 14-17, 2020, Gulf of Naples, Italy Internet of Production; Line-less Mobile Assembly System; Industrial Assembly; Smart Factory internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-buckhorst-holarchy.pdf Elsevier Gulf of Naples, Italy July 14-17, 2020 2212-8271 10.1016/j.procir.2021.03.064 1 Armin F.Buckhorst BenjaminMontavon DominikWolfschläger MelanieBuchsbaum AmirShahidi HenningPetruck IkeKunze JanPennekamp ChristianBrecher MathiasHüsing BurkhardCorves VerenaNitsch KlausWehrle Robert H.Schmitt article 2020_niemietz_stamping Procedia Manufacturing 2020 7 11 49 61-68 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. Proceedings of the 8th International Conference on Through-Life Engineering Service (TESConf '19), October 27-29, 2019, Cleveland, OH, USA Stamping Process; Industry 4.0; Fine-blanking; Internet of production; Condition monitoring; Data analytics internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2020/2020-niemietz-stamping-modelling.pdf Elsevier Cleveland, OH, USA October 27-29, 2019 2351-9789 10.1016/j.promfg.2020.06.012 1 PhilippNiemietz JanPennekamp IkeKunze DanielTrauth KlausWehrle ThomasBergs inproceedings 2020_pennekamp_supply_chain_accountability 2020 6 7 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. supply chain; multi-hop tracking and tracing; blockchain; attribute-based encryption; Internet of Production internet-of-production https://comsys.rwth-aachen.de/fileadmin/papers/2020/2020-pennekamp-supply-chain-privacy.pdf IEEE 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 Dublin, Ireland June 7-11, 2020 978-1-7281-7440-2 2474-9133 10.1109/ICCWorkshops49005.2020.9145100 1 JanPennekamp LennartBader RomanMatzutt PhilippNiemietz DanielTrauth MartinHenze ThomasBergs KlausWehrle article 2020_gleim_factDAG IEEE Internet of Things Journal 2020 4 14 7 4 3243-3253 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. Data Management; Data Versioning; Interoperability; Industrial Internet of Things; Worldwide Lab internet-of-production https://comsys.rwth-aachen.de/fileadmin/papers/2020/2020-gleim-iotj-iop-interoperability.pdf IEEE 2327-4662 10.1109/JIOT.2020.2966402 1 LarsGleim JanPennekamp MartinLiebenberg MelanieBuchsbaum PhilippNiemietz SimonKnape AlexanderEpple SimonStorms DanielTrauth ThomasBergs ChristianBrecher StefanDecker GerhardLakemeyer KlausWehrle article 2019-unterberg-matclass Production Engineering 2019 11 13 13 6 743-749 internet-of-production 10.1007/s11740-019-00928-w 1 MartinUnterberg PhillipNiemietz DanielTrauth KlausWehrle ThomasBergs inproceedings 2019_pennekamp_dataflows 2019 11 11 27-38 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. Internet of Production; dataflows; Information Security internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-pennekamp-dataflows.pdf ACM 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 London, United Kingdom November 11-15, 2019 978-1-4503-6831-5/19/11 10.1145/3338499.3357357 1 JanPennekamp MartinHenze SimoSchmidt PhilippNiemietz MarcelFey DanielTrauth ThomasBergs ChristianBrecher KlausWehrle inproceedings 2019_pennekamp_infrastructure 2019 5 8 31-37 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. Internet of Production; Cyber-Physical Systems; Data Processing; Low Latency; Secure Industrial Collaboration internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-pennekamp-iop-infrastructure.pdf IEEE Proceedings of the 2nd IEEE International Conference on Industrial Cyber-Physical Systems (ICPS '19), May 6-9, 2019, Taipei, TW Taipei, TW May 6-9, 2019 978-1-5386-8500-6/19 10.1109/ICPHYS.2019.8780276 1 JanPennekamp RenéGlebke MartinHenze TobiasMeisen ChristophQuix RihanHai LarsGleim PhilippNiemietz MaximilianRudack SimonKnape AlexanderEpple DanielTrauth UweVroomen ThomasBergs ChristianBrecher AndreasBührig-Polaczek MatthiasJarke KlausWehrle inproceedings 2019-glebke-hicss-integrated 2019 1 8 7252-7261 internet-of-production,reflexes https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-glebke-integrated.pdf Online University of Hawai'i at Manoa / AIS Proceedings of the 52nd Hawaii International Conference on System Sciences (HICSS), Wailea, HI, USA en 978-0-9981331-2-6 10.24251/HICSS.2019.871 1 RenéGlebke MartinHenze KlausWehrle PhilippNiemietz DanielTrauth PatrickMattfeld ThomasBergs inproceedings 2018-cav-schemmel-liveness 2018 7 14 symbiosys https://www.comsys.rwth-aachen.de/fileadmin/papers/2018/2018-schemmel-symbolic-liveness-analysis-of-real-world-software.pdf Computer Aided Verification (CAV 2018) Oxford, Great Britain 30th International Conference on Computer Aided Verification 2018-07-14 to 2018-07-17 en 10.1007/978-3-319-96142-2_27 1 DanielSchemmel JulianBüning OscarSoria Dustmann ThomasNoll KlausWehrle article 2018-scheitle-ccr-caa ACM SIGCOMM Computer Communications Review (CCR) 2018 4 48 10-23 https://www.net.in.tum.de/fileadmin/bibtex/publications/papers/caa17.pdf internet-measurements https://ccronline.sigcomm.org/wp-content/uploads/2018/05/sigcomm-ccr-final163.pdf https://ccronline.sigcomm.org/2018/a-first-look-at-certification-authority-authorization-caa/ 2018-06-05 10.1145/3213232.3213235 1 QuirinScheitle TaejoongChung JensHiller OliverGasser JohannesNaab Rolandvan Rijswijk-Deij OliverHohlfeld RalphHolz DaveChoffnes AlanMislove GeorgCarle inproceedings 2017-maurer-trustcom-coinjoin 2017 8 1 522-529 https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/2017-maurer-trustcom-coinjoin.pdf Online IEEE 2017 IEEE Trustcom/BigDataSE/ICESS Sydney, NSW, Australia 16th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (IEEE TrustCom) 1. - 4. August 2017 978-1-5090-4906-6 2324-9013 10.1109/Trustcom/BigDataSE/ICESS.2017.280 1 Felix KonstantinMaurer TillNeudecker MartinFlorian article 2017-comnet-lru Elsevier Computer Networks 2017 https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/COMNET-D-16-957R1-Updated-Submit.pdf accepted GerhardHasslinger KonstantinosNtougias FrankHasslinger OliverHohlfeld conference 2016-itc-caching 2016 9 ITC 28 ITC 28 GerhardHasslinger KostasNtougias FrankHasslinger OliverHohlfeld article 2016-hohlfeld-nfv_ccr ACM SIGCOMM CCR 2016 7 http://ccracmsigcomm.info.ucl.ac.be/wp-content/uploads/2016/07/sigcomm-ccr-paper29.pdf LeonhardNobach OliverHohlfeld DavidHausheer incollection 2013-wtc-eggert-sensorcloud 2014 12 14 203-218 sensorcloud fileadmin/papers/2013/2013-wtc-eggert-sensorcloud.pdf Online Krcmar, Helmut and Reussner, Ralf and Rumpe, Bernhard Springer Trusted Cloud Computing en 978-3-319-12717-0 10.1007/978-3-319-12718-7_13 1 MichaelEggert RogerHäußling MartinHenze LarsHermerschmidt RenéHummen DanielKerpen AntonioNavarro Pérez BernhardRumpe DirkThißen KlausWehrle conference EW2013_parruca_gross 2013 8 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. ICIC, proportional fair scheduling, power mask, resource block, scheduling, dynamic scheduling, inter cell interference coordination, LTE, OFDMA, WiMAX https://www.comsys.rwth-aachen.de/fileadmin/papers/2013/2013_ICIC_parruca_grysla_gross.pdf http://www.vde-verlag.de/proceedings-en/563498043.html vde-verlag vde-verlag

http://www.vde-verlag.de/

Proceedings: European Wireless 2013 Guildford, UK 2013 - 19th European Wireless Conference 04/16/2012 - 04/18/2013 English DonaldParruca MariusGrysla PetriMähönen MarinaPetrova HanZhou FarshadNaghibi JamesGross inproceedings 2010-kunz-mascots-horizon 2010 8 18 172-181 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. horizon fileadmin/papers/2010/2010-kunz-mascots-horizon.pdf Online IEEE Computer Society

Los Alamitos, CA, USA

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 Miami, FL, USA 18th Annual Meeting of the IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS'10) August 17-19, 2010 en 978-0-7695-4197-6 1526-7539 10.1109/MASCOTS.2010.26 1 GeorgKunz OlafLandsiedel JamesGross StefanGötz FarshadNaghibi KlausWehrle conference 200803riechemmvecluster 2008 3 18 9-13 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. RWTH Aachen University - Distributed Systems Group http://www.pap.vs.uni-due.de/MMVE08/papers/proceedings.pdf http://www.pap.vs.uni-due.de/MMVE08/ Online Gregor Schiele, Daniel Weiskopf, Ben Leong, Shun-Yun Hu Proceedings of 1st International Workshop on Massively Multiuser Virtual Environments at IEEE Virtual Reality 2008 (MMVE 2008) Reno, Nevada, USA 1st International Workshop on Massively Multiuser Virtual Environments at IEEE Virtual Reality 2008 (MMVE 2008) March 8th, 2008 en 1 SimonRieche KlausWehrle MarcFouquet HeikoNiedermayer TimoTeifel GeorgCarle article 200812riecheIJAMCcluster International Journal of Advanced Media and Communication (IJAMC) 2008 2 4 351-363 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. RWTH Aachen University - Distributed Systems Group http://www.inderscience.com/browse/index.php?journalID=67 print en 1462-4613 1 SimonRieche KlausWehrle MarcFouquet HeikoNiedermayer TimoTeifel GeorgCarle inbook 2008-thissen-LNCS-synergy 2008 519-526 Print M. Nagl, W. Marquardt Springer Lecture Notes in Computer Science 4970 Collaborative and Distributed Chemical Engineering, From Understanding to Substantial Design Process Support en 978-3-540-70551-2 SimonBecker MarkusHeller MatthiasJarke WolfgangMarquardt ManfredNagl OttoSpaniol DirkThißen conference 200701riecheccncmmog 2007 1 11 763-767 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. RWTH Aachen University - Distributed Systems Group http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4199088&arnumber=4199243&count=254&index=154 http://www.ieee-ccnc.org/2007/ Print IEEE Press Proceedings of 4th Annual IEEE Consumer Communications and Networking Conference (CCNC 2007) IEEE Las Vegas, Nevada, USA 4th Annual IEEE Consumer Communications and Networking Conference (CCNC 2007) 11-13 January 2007 en 1-4244-0667-6 10.1109/CCNC.2007.155 1 SimonRieche KlausWehrle MarcFouquet HeikoNiedermayer LeoPetrak GeorgCarle conference 200711Globecom2007Landsiedelmultipathonionrouting 2007 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. IEEE Global Communication Conference (GlobeCom), Washington D.C. OlafLandsiedel AlexisPimenidis KlausWehrle HeikoNiedermayer GeorgCarle techreport 200608riechetrmmog 2006 8 WSI-2006-04 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. RWTH Aachen University - Distributed Systems Group http://www.rieche.net/pdf/wsi-2006-04.pdf Online

Tübingen, Germany

Wilhelm-Schickard-Institute for Computer Science, University of Tübingen Technical Report en SimonRieche MarcFouquet HeikoNiedermayer LeoPetrak KlausWehrle GeorgCarle inproceedings landsiedel2005anonymous 2005 3 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. 5. Würzburger "Workshop IP Netzmanagement, IP Netzplanung und Optimierung" Würzburg, Germany 5. Würzburger "Workshop IP Netzmanagement, IP Netzplanung und Optimierung" March 2005 OlafLandsiedel SimonRieche HeikoNiedermayer KlausWehrle GeorgCarle inproceedings niedermayer2005distribution 2005 3 Proceedings of Workshop Peer-to-Peer-Systems and -Applications, KiVS 2005 Kaiserslautern, Germany Workshop Peer-to-Peer-Systems and -Applications, KiVS 2005 March 2005 HeikoNiedermayer SimonRieche KlausWehrle GeorgCarle inproceedings 200507riecheipgames 2005 3 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. 5. Würzburger "Workshop IP Netzmanagement, IP Netzplanung und Optimierung" Würzburg, Germany 5. Würzburger "Workshop IP Netzmanagement, IP Netzplanung und Optimierung" March 2005 SimonRieche MarcFouquet HeikoNiedermayer KlausWehrle GeorgCarle inbook 200509riechep2pbookreliability 2005 119-135 Ralf Steinmetz, Klaus Wehrle Springer

Heidelberg, Germany

Lecture Notes in Computer Science, LNCS 9 Peer-to-Peer Systems and Applications SimonRieche HeikoNiedermayer StefanGötz KlausWehrle inproceedings 2006-heer-gi2004 2004 9 51 239-244 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. Print GI. LNI

Bonn, Germany

LNI Proceedings of Workshop on Algorithms and Protocols for Efficient Peer-to-Peer Applications (PEPPA), GI-Jahrestagung Informatik 2004, Bonn, Germany Ulm, Germany GI-Jahrestagung Informatik 2004 en 3-88579-380-6 1 TobiasHeer HeikoNiedermayer LeoPetrak SimonRieche KlausWehrle inproceedings 2000-thissen-USM-loadbal 2000 42-53 Print Springer Proceedings of the 3rd International IFIP/GI Working Conference on Trends in Distributed Systems: Towards a Universal Service Market (USM 2000), Munich, Germany Munich 3rd International IFIP/GI Working Conference on Trends in Distributed Systems: Towards a Universal Service Market (USM 2000) en 3-540-41024-4 1 DirkThißen HelmutNeukirchen inproceedings 2000-thissen-ISCC-loadbal 2000 641-646 Print IEEE Proceedings of the 5th IEEE Symposium on Computers and Communications (ISCC 2000), Antibes - Juan les Pins, France Antibes - Juan les Pins, France 5th IEEE Symposium on Computers and Communications (ISCC 2000) en 0-7695-0722-0 1 DirkThißen HelmutNeukirchen