Pub Date : 2021-09-08DOI: 10.14279/TUJ.ECEASST.80.1174
M. Frank
The ILDA Digital Network (IDN) is a novel protocol family providing digital data transmission for laser projection. While the new standards mainly aim to replace the old analogue signal transmission, the digital streaming concept also enables completely new applications and flexible networked scenarios. Very simple tools are existing to check the old analogue connection. Our demo presents the IDN-Laser-Tester, a new framework that allows for detecting and testing IDN enabled hardware or software in a local network in a user friendly manner from smartphone, tablet or portable computer.
{"title":"IDN-Laser-Tester: A Framework for Detecting and Testing ILDA Digital Network Consumers for Laser Projection","authors":"M. Frank","doi":"10.14279/TUJ.ECEASST.80.1174","DOIUrl":"https://doi.org/10.14279/TUJ.ECEASST.80.1174","url":null,"abstract":"The ILDA Digital Network (IDN) is a novel protocol family providing digital data transmission for laser projection. While the new standards mainly aim to replace the old analogue signal transmission, the digital streaming concept also enables completely new applications and flexible networked scenarios. Very simple tools are existing to check the old analogue connection. Our demo presents the IDN-Laser-Tester, a new framework that allows for detecting and testing IDN enabled hardware or software in a local network in a user friendly manner from smartphone, tablet or portable computer.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128727289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-08DOI: 10.14279/TUJ.ECEASST.80.1147.1086
Aliyu Makama, K. Kuladinithi, Musab Eltayeb Ahmed Ahmed, A. Timm‐Giel
Due to impediments associated with cable-based seismic survey, Wireless Seismic Data Acquisition (WSDA) has recently gained much attention from contractors, exploration companies, and researchers to layout enabling wireless technology and architecture for Wireless Geophone Networks (WGN) in seismic explorations. A potential approach is to employ multi-hop wireless ad-hoc communication. In this study, we propose a multi-hop WGN architecture consisting of several subnetworks to realize the expected network performance. We investigate the performance of proactive and reactive routing protocols to examine the optimal number of geophones that could be effectively supported within a subnetwork. The performance metrics used are packet delivery ratio (PDR) and average end-to-end delay.
{"title":"Evaluation of Multi-hop Ad-hoc Routing Protocols in Wireless Seismic Data Acquisition","authors":"Aliyu Makama, K. Kuladinithi, Musab Eltayeb Ahmed Ahmed, A. Timm‐Giel","doi":"10.14279/TUJ.ECEASST.80.1147.1086","DOIUrl":"https://doi.org/10.14279/TUJ.ECEASST.80.1147.1086","url":null,"abstract":"Due to impediments associated with cable-based seismic survey, Wireless Seismic Data Acquisition (WSDA) has recently gained much attention from contractors, exploration companies, and researchers to layout enabling wireless technology and architecture for Wireless Geophone Networks (WGN) in seismic explorations. A potential approach is to employ multi-hop wireless ad-hoc communication. In this study, we propose a multi-hop WGN architecture consisting of several subnetworks to realize the expected network performance. We investigate the performance of proactive and reactive routing protocols to examine the optimal number of geophones that could be effectively supported within a subnetwork. The performance metrics used are packet delivery ratio (PDR) and average end-to-end delay.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121767709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-08DOI: 10.14279/TUJ.ECEASST.80.1129
Julian Zobel, Niklas Stöhr, Ralf Kundel, Patrick Lieser, R. Steinmetz
In the aftermath of a disaster, information about the location of affected civilians is very important for an efficient disaster relief. A continuously operating autonomous Aerial Monitoring System with Unmanned Aerial Vehicles (UAVs) can provide an up-to-date overview of the disaster area by tracking wireless signals from carried or worn smart devices on the ground. This work highlights that dynamic allocation of monitoring areas facilitates a continuous deployment of a resilient Aerial Monitoring System with heterogeneous UAVs.
{"title":"Dynamic Monitoring Area Allocation for Aerial Post-Disaster Situation Monitoring","authors":"Julian Zobel, Niklas Stöhr, Ralf Kundel, Patrick Lieser, R. Steinmetz","doi":"10.14279/TUJ.ECEASST.80.1129","DOIUrl":"https://doi.org/10.14279/TUJ.ECEASST.80.1129","url":null,"abstract":"In the aftermath of a disaster, information about the location of affected civilians is very important for an efficient disaster relief. A continuously operating autonomous Aerial Monitoring System with Unmanned Aerial Vehicles (UAVs) can provide an up-to-date overview of the disaster area by tracking wireless signals from carried or worn smart devices on the ground. This work highlights that dynamic allocation of monitoring areas facilitates a continuous deployment of a resilient Aerial Monitoring System with heterogeneous UAVs.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130344230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-08DOI: 10.14279/TUJ.ECEASST.80.1153
Fabian Marquardt, Lennart Buhl
Web application software may be affected by vulnerabilities and a fast deployment of security updates is required to protect users from attacks. With daily scans of over 50 million websites we are able to measure the threat response behavior. Preliminary results indicate significant differences between the different observed web application softwares.
{"title":"Large Scale Monitoring of Web Application Software Distribution to Measure Threat Response Behavior","authors":"Fabian Marquardt, Lennart Buhl","doi":"10.14279/TUJ.ECEASST.80.1153","DOIUrl":"https://doi.org/10.14279/TUJ.ECEASST.80.1153","url":null,"abstract":"Web application software may be affected by vulnerabilities and a fast deployment of security updates is required to protect users from attacks. With daily scans of over 50 million websites we are able to measure the threat response behavior. Preliminary results indicate significant differences between the different observed web application softwares.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132428247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-08DOI: 10.14279/TUJ.ECEASST.80.1140
Thorben Krüger, D. Hausheer
Modern path-aware networking (PAN) architectures based on packet-carried forwarding state (PCFS) promise to support practical multipath communication with increased availability and redundancy, even for single-homed hosts. How exactly hosts can chose paths in a meaningful way while maintaining good network utilization as well as user satisfaction is the subject of this research. We demonstrate how overall network utilization is affected by the introduction of multipath communication and propose the term “Cost of Multipath” to reason about this observation. We also identify a collection of concrete practical techniques from networking research and engineering that can be adapted to allow hosts to make more informed path decisions. These tie into the practical implementation of an experimental path-selection engine with a high-level API that we aim to utilize to quantitatively investigate host-based approaches for traffic optimization in the existing path-aware SCION network architecture
{"title":"Early Work: Path Selection in a Path-aware Network Architecture","authors":"Thorben Krüger, D. Hausheer","doi":"10.14279/TUJ.ECEASST.80.1140","DOIUrl":"https://doi.org/10.14279/TUJ.ECEASST.80.1140","url":null,"abstract":"Modern path-aware networking (PAN) architectures based on packet-carried forwarding state (PCFS) promise to support practical multipath communication with increased availability and redundancy, even for single-homed hosts. How exactly hosts can chose paths in a meaningful way while maintaining good network utilization as well as user satisfaction is the subject of this research. We demonstrate how overall network utilization is affected by the introduction of multipath communication and propose the term “Cost of Multipath” to reason about this observation. We also identify a collection of concrete practical techniques from networking research and engineering that can be adapted to allow hosts to make more informed path decisions. These tie into the practical implementation of an experimental path-selection engine with a high-level API that we aim to utilize to quantitatively investigate host-based approaches for traffic optimization in the existing path-aware SCION network architecture","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122500312","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-08DOI: 10.14279/TUJ.ECEASST.80.1152
Yamani Dalpathadu, Thumma Showry, A. Udugama, Anna Förster
A casualty of disasters is the communication infrastructure. Rescuers, in the aftermath of the disaster, require solutions to maintain communications in order to communicate critical information gathered by them. Despite the numerous solutions proposed, a drawback is the communication range. In this work, we propose a communication system based on LoRa, a long-range, low-power communication technology. We use the commercially available, off-the-shelf LoRa based PyCom LoPy4 platform with opportunistic networking to demonstrate the viability of using LoRa for post-disaster recovery operations.
{"title":"Demo: Using LoRa Communications and Epidemic Routing in Disaster Rescue Operations","authors":"Yamani Dalpathadu, Thumma Showry, A. Udugama, Anna Förster","doi":"10.14279/TUJ.ECEASST.80.1152","DOIUrl":"https://doi.org/10.14279/TUJ.ECEASST.80.1152","url":null,"abstract":"A casualty of disasters is the communication infrastructure. Rescuers, in the aftermath of the disaster, require solutions to maintain communications in order to communicate critical information gathered by them. Despite the numerous solutions proposed, a drawback is the communication range. In this work, we propose a communication system based on LoRa, a long-range, low-power communication technology. We use the commercially available, off-the-shelf LoRa based PyCom LoPy4 platform with opportunistic networking to demonstrate the viability of using LoRa for post-disaster recovery operations.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124627025","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-08DOI: 10.14279/TUJ.ECEASST.80.1127
Stefan Geissler, Stanislav Lange, T. Hossfeld, P. Tran-Gia
In this work, we provide initial insights regarding the error introduced into multicomponent queueing systems by assuming the departure processes of arbitrary GI/GI/1-oo queues to be renewal processes. To this end, we compute the sojourn time distribution as well as departure distributions of a linear chain of queueing components and compare the results to a simulation of the same system. By applying the renewal approximation, potential autocorrelations of the departure processes are lost. We investigate the magnitude of this error regarding both the sojourn time as well as interdeparture time distributions for a broad set of parameters. Although more indepth studies are needed, our results show that both distributions can be closely approximated, which allows the application of the model to asses the performance of real world NFV function chains.
{"title":"Discrete-time Analysis of Multicomponent GI/GI/1 Queueing Networks","authors":"Stefan Geissler, Stanislav Lange, T. Hossfeld, P. Tran-Gia","doi":"10.14279/TUJ.ECEASST.80.1127","DOIUrl":"https://doi.org/10.14279/TUJ.ECEASST.80.1127","url":null,"abstract":"In this work, we provide initial insights regarding the error introduced into multicomponent queueing systems by assuming the departure processes of arbitrary GI/GI/1-oo queues to be renewal processes. To this end, we compute the sojourn time distribution as well as departure distributions of a linear chain of queueing components and compare the results to a simulation of the same system. By applying the renewal approximation, potential autocorrelations of the departure processes are lost. We investigate the magnitude of this error regarding both the sojourn time as well as interdeparture time distributions for a broad set of parameters. Although more indepth studies are needed, our results show that both distributions can be closely approximated, which allows the application of the model to asses the performance of real world NFV function chains.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126892198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-08DOI: 10.14279/TUJ.ECEASST.80.1173
F. Akbarian, William Tärneberg, Emma Fitzgerald, M. Kihl
The cloud control systems (CCs) are inseparable parts of industry 4.0. The cloud, by providing storage and computing resources, allows the controllers to evaluate complex problems that are too computationally demanding to perform locally. However, connecting physical systems to the cloud through the network can provide an entry point for attackers to infiltrate the system and cause damage with potentially catastrophic consequences. Hence, in this paper, we present a demo of our proposed security framework for CCs and demonstrate how it can detect attacks on this system quickly and mitigate them.
{"title":"Demonstration: A cloud-control system equipped with intrusion detection and mitigation","authors":"F. Akbarian, William Tärneberg, Emma Fitzgerald, M. Kihl","doi":"10.14279/TUJ.ECEASST.80.1173","DOIUrl":"https://doi.org/10.14279/TUJ.ECEASST.80.1173","url":null,"abstract":"The cloud control systems (CCs) are inseparable parts of industry 4.0. The cloud, by providing storage and computing resources, allows the controllers to evaluate complex problems that are too computationally demanding to perform locally. However, connecting physical systems to the cloud through the network can provide an entry point for attackers to infiltrate the system and cause damage with potentially catastrophic consequences. Hence, in this paper, we present a demo of our proposed security framework for CCs and demonstrate how it can detect attacks on this system quickly and mitigate them.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114621729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-08DOI: 10.14279/TUJ.ECEASST.80.1128
Christoph Döpmann, F. Fiedler, S. Lucia, Florian Tschorsch
Providing online anonymity to a broad range of Internet users, the Tor network today faces not only security concerns, but increasingly also performance issues. Due to its multi-hop nature, proper congestion control has been identified to be challenging in this situation. In this paper, we focus on PredicTor, a novel approach towards multi-hop congestion control based on distributed model predictive control (MPC), an advanced optimization-based control technique. We investigate PredicTor's significance for congestion control research. In particular, we carry out a simulation study to evaluate PredicTor's performance in non-trivial network scenarios. Our results indicate the great potential to push the status quo of congestion control, heavily improving achieved latency and fairness. By pointing out benefits and challenges of distributed MPC in this context, we open up a new promising research direction for congestion control
{"title":"Towards Optimization-Based Predictive Congestion Control for the Tor Network","authors":"Christoph Döpmann, F. Fiedler, S. Lucia, Florian Tschorsch","doi":"10.14279/TUJ.ECEASST.80.1128","DOIUrl":"https://doi.org/10.14279/TUJ.ECEASST.80.1128","url":null,"abstract":"Providing online anonymity to a broad range of Internet users, the Tor network today faces not only security concerns, but increasingly also performance issues. Due to its multi-hop nature, proper congestion control has been identified to be challenging in this situation. In this paper, we focus on PredicTor, a novel approach towards multi-hop congestion control based on distributed model predictive control (MPC), an advanced optimization-based control technique. We investigate PredicTor's significance for congestion control research. In particular, we carry out a simulation study to evaluate PredicTor's performance in non-trivial network scenarios. Our results indicate the great potential to push the status quo of congestion control, heavily improving achieved latency and fairness. By pointing out benefits and challenges of distributed MPC in this context, we open up a new promising research direction for congestion control","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130242476","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-08DOI: 10.14279/TUJ.ECEASST.80.1180
Zikai Zhou, W. Kellerer
Compared with legacy networks, programmable networks are highly flexible and need to be reconfigured dynamically. In this early work paper, we study the fast and consistent network update which is the key enabler to realize deterministic reconfigurable networks. The reconfiguration speed is one side of the coin. The ongoing best-effort traffic cannot be interrupted during the network reconfiguration as well. In terms of reconfiguration speed, we implement and compare our method with the state-of-the-art decentralized and centralized update methods.
{"title":"Towards Deterministic Reconfigurable Networks","authors":"Zikai Zhou, W. Kellerer","doi":"10.14279/TUJ.ECEASST.80.1180","DOIUrl":"https://doi.org/10.14279/TUJ.ECEASST.80.1180","url":null,"abstract":"Compared with legacy networks, programmable networks are highly flexible and need to be reconfigured dynamically. In this early work paper, we study the fast and consistent network update which is the key enabler to realize deterministic reconfigurable networks. The reconfiguration speed is one side of the coin. The ongoing best-effort traffic cannot be interrupted during the network reconfiguration as well. In terms of reconfiguration speed, we implement and compare our method with the state-of-the-art decentralized and centralized update methods.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125388402","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：