Publications
Bibliography from the DBLP export. Search, filter, sort and download — the original BibTeX entries are preserved.
Highlighted author: Kalman Graffi
-
Journal article · 2025Federated Learning-Based Intrusion Detection in IoT Networks: Performance Evaluation and Data Scaling StudyAbstract
This paper presents a large-scale empirical study aimed at identifying the optimal local deep learning model and data volume for deploying intrusion detection systems (IDS) on resource-constrained IoT devices using federated learning (FL). While previous studies on FL-based IDS for IoT have primarily focused on maximizing accuracy, they often overlook the computational limitations of IoT hardware and the feasibility of local model deployment. In this work, three deep learning architectures—a deep neural network (DNN), a convolutional neural network (CNN), and a hybrid CNN+BiLSTM—are trained using the CICIoT2023 dataset within a federated learning environment simulating up to 150 IoT devices. The study evaluates how detection accuracy, convergence speed, and inference costs (latency and model size) vary across different local data scales and model complexities. Results demonstrate that CNN achieves the best trade-off between detection performance and computational efficiency, reaching ~98% accuracy with low latency and a compact model footprint. The more complex CNN+BiLSTM architecture yields slightly higher accuracy (~99%) at a significantly greater computational cost. Deployment tests on Raspberry Pi 5 devices confirm that all three models can be effectively implemented on real-world IoT edge hardware.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- MDPI — Journal of Sensor and Actuator Networks — MDPI JSAN
- Venue in bibliography
- J. Sens. Actuator Networks
- DOI
- 10.3390/JSAN14040078
- Pages
- 78
- Volume
- 14
- Number
- 4
- DBLP key
- DBLP:journals/jsan/AlbanbayTGUKAA25
@article{DBLP:journals/jsan/AlbanbayTGUKAA25, author = {Nurtay Albanbay and Yerlan Tursynbek and Kalman Graffi and Raissa Uskenbayeva and Zhuldyz B. Kalpeyeva and Zhastalap Abilkaiyr and Yerlan Ayapov}, title = {Federated Learning-Based Intrusion Detection in IoT Networks: Performance Evaluation and Data Scaling Study}, journal = {J. Sens. Actuator Networks}, volume = {14}, number = {4}, pages = {78}, year = {2025}, url = {https://doi.org/10.3390/jsan14040078}, doi = {10.3390/JSAN14040078}, timestamp = {Tue, 04 Aug 2026 18:49:48 +0200}, biburl = {https://dblp.org/rec/journals/jsan/AlbanbayTGUKAA25.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2025--AlbanbayTGUKAA25--Federated-Learning-Based-Intrusion-Detection-in-IoT-Networks-Performance-Evaluation-and-Data-Scaling-Study.pdf} } -
Journal article · 2025A Tale of Many Networks: Splitting and Merging of Chord-like Overlays in Partitioned NetworksAbstract
Peer-to-peer overlays define an approach to operating data management platforms, which are robust against censorship attempts from countries or large enterprises The robustness of such overlays is endangered in the presence of national Internet isolations, such as was the case in recent years during political revolutions. In this paper, we focus on splits and, with stronger emphasis, on the merging of ring-based overlays in the presence of network partitioning in the underlying Internet due to various reasons. We present a new merging algorithm named the Ring Reunion Algorithm and highlight a method for reducing the number of messages in both separated and united overlay states. The algorithm is parallelized for accelerated merging and is able to automatically detect overlay partitioning and start the corresponding merging processes. Through simulations, we evaluate the new Ring Reunion Algorithm in its simple and parallelized forms in comparison to a plain Chord algorithm, the Chord–Zip algorithm, and two versions of the Ring-Unification Algorithm. The evaluation shows that only our parallelized Ring Reunion Algorithm allows the merging of two, three, and more isolated overlay networks in parallel. Our approach quickly merges the overlays, even under churn, and stabilizes the node contacts in the overlay with small traffic overhead.
taken from the linked PDF
Details
- Venue series
- MDPI — Future Internet — MDPI FI
- Venue in bibliography
- Future Internet
- DOI
- 10.3390/FI17060248
- Pages
- 248
- Volume
- 17
- Number
- 6
- DBLP key
- DBLP:journals/fi/AmftG25
@article{DBLP:journals/fi/AmftG25, author = {Tobias Amft and Kalman Graffi}, title = {A Tale of Many Networks: Splitting and Merging of Chord-like Overlays in Partitioned Networks}, journal = {Future Internet}, volume = {17}, number = {6}, pages = {248}, year = {2025}, url = {https://doi.org/10.3390/fi17060248}, doi = {10.3390/FI17060248}, timestamp = {Sun, 01 Feb 2026 13:38:37 +0100}, biburl = {https://dblp.org/rec/journals/fi/AmftG25.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2025--AmftG25--A-Tale-of-Many-Networks-Splitting-and-Merging-of-Chord-like-Overlays-in-Partitioned-Networks.pdf} } -
Journal article · 2024Uncovering CWE-CVE-CPE Relations with Threat Knowledge GraphsAbstract
Security assessment relies on public information about products, vulnerabilities, and weaknesses. So far, databases in these categories have rarely been analyzed in combination. Yet, doing so could help predict unreported vulnerabilities and identify common threat patterns. In this article, we propose a methodology for producing and optimizing a knowledge graph that aggregates knowledge from common threat databases (CVE, CWE, and CPE). We apply the threat knowledge graph to predict associations between threat databases, specifically between products, vulnerabilities, and weaknesses. We evaluate the prediction performance both in closed world with associations from the knowledge graph and in open world with associations revealed afterward. Using rank-based metrics (i.e., Mean Rank, Mean Reciprocal Rank, and Hits@N scores), we demonstrate the ability of the threat knowledge graph to uncover many associations that are currently unknown but will be revealed in the future, which remains useful over different time periods. We propose approaches to optimize the knowledge graph and show that they indeed help in further uncovering associations. We have made the artifacts of our work publicly available.
taken from the linked PDF · the PDF has no "Abstract" heading, so the text before the keyword block was used
Details
- Venue series
- ACM — Transactions on Privacy and Security — ACM TOPS
- Venue in bibliography
- ACM Transactions on Privacy and Security
- DOI
- 10.1145/3641819
- Pages
- 13:1--13:26
- Volume
- 27
- Number
- 1
- DBLP key
- DBLP:journals/tissec/ShiMGS24
@article{DBLP:journals/tissec/ShiMGS24, author = {Zhenpeng Shi and Nikolay Matyunin and Kalman Graffi and David Starobinski}, editor = {}, title = {{Uncovering {CWE-CVE-CPE} Relations with Threat Knowledge Graphs}}, journal = {{ACM} Transactions on Privacy and Security}, volume = {27}, number = {1}, pages = {13:1--13:26}, year = {2024}, url = {https://doi.org/10.1145/3641819}, doi = {10.1145/3641819}, timestamp = {Sun, 19 Jan 2025 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tissec/ShiMGS24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2024--ShiMGS24--Uncovering-CWE-CVE-CPE-Relations-with-Threat-Knowledge-Graphs.pdf} } -
Journal article · 2023Uncovering CWE-CVE-CPE Relations with Threat Knowledge GraphsAbstract
Security assessment relies on public information about products, vulnerabilities, and weaknesses. So far, databases in these categories have rarely been analyzed in combination. Yet, doing so could help predict unreported vulnerabilities and identify common threat patterns. In this paper, we propose a methodology for producing and optimizing a knowledge graph that aggregates knowledge from common threat databases (CVE, CWE, and CPE). We apply the threat knowledge graph to predict associations between threat databases, specifically between products, vulnerabilities, and weaknesses. We evaluate the prediction performance both in closed world with associations from the knowledge graph, and in open world with associations revealed afterward. Using rank-based metrics (i.e., Mean Rank, Mean Reciprocal Rank, and Hits@N scores), we demonstrate the ability of the threat knowledge graph to uncover many associations that are currently unknown but will be revealed in the future, which remains useful over different time periods. We propose approaches to optimize the knowledge graph, and show that they indeed help in further uncovering associations.
taken from the linked PDF · the PDF has no "Abstract" heading, so the text before the keyword block was used
Details
- Venue series
- arXiv — Preprints (Computer Science) — CoRR
- Venue in bibliography
- CoRR
- DOI
- 10.48550/ARXIV.2305.00632
- Volume
- abs/2305.00632
- DBLP key
- DBLP:journals/corr/abs-2305-00632
@article{DBLP:journals/corr/abs-2305-00632, author = {Zhenpeng Shi and Nikolay Matyunin and Kalman Graffi and David Starobinski}, editor = {}, title = {{Uncovering {CWE-CVE-CPE} Relations with Threat Knowledge Graphs}}, journal = {CoRR}, volume = {abs/2305.00632}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2305.00632}, doi = {10.48550/ARXIV.2305.00632}, eprinttype = {arXiv}, eprint = {2305.00632}, timestamp = {Fri, 05 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2305-00632.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2023--abs-2305-00632--Uncovering-CWE-CVE-CPE-Relations-with-Threat-Knowledge-Graphs.pdf} } -
Conference paper · 2022Uncovering Product Vulnerabilities with Threat Knowledge GraphsAbstract
Threat modeling and security assessment rely on public information on products, vulnerabilities and weaknesses. So far, databases in these categories have rarely been analyzed in combination. Yet, doing so could help predict unreported vulnerabilities and identify common threat patterns. In this paper, we propose a methodology for producing and optimizing a knowledge graph that aggregates knowledge from common threat databases (CPE, CVE, and CWE). We apply the threat knowledge graph to predict associations between threat databases, specifically between products and vulnerabilities. We evaluate the prediction performance based on historical data, using precision, recall, and F1-score metrics. We demonstrate the ability of the threat knowledge graph to uncover many associations that are currently unknown but will be revealed in the future.
taken from the linked PDF
Details
- Venue series
- IEEE — Secure Development Conference — IEEE SecDev
- Venue in bibliography
- IEEE Secure Development Conference, SecDev 2022, Atlanta, GA, USA, October 18-20, 2022
- DOI
- 10.1109/SECDEV53368.2022.00028
- Pages
- 84--90
- Publisher
- IEEE
- DBLP key
- DBLP:conf/secdev/ShiMGS22
@inproceedings{DBLP:conf/secdev/ShiMGS22, author = {Zhenpeng Shi and Nikolay Matyunin and Kalman Graffi and David Starobinski}, title = {{Uncovering Product Vulnerabilities with Threat Knowledge Graphs}}, booktitle = {{IEEE} Secure Development Conference, SecDev 2022, Atlanta, GA, USA, October 18-20, 2022}, pages = {84--90}, publisher = {{IEEE}}, year = {2022}, url = {https://doi.org/10.1109/SecDev53368.2022.00028}, doi = {10.1109/SECDEV53368.2022.00028}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/secdev/ShiMGS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2022--ShiMGS22--Uncovering-Product-Vulnerabilities-with-Threat-Knowledge-Graphs.pdf} } -
Journal article · 2022Threat Modeling Tools: A TaxonomyAbstract
Threat modeling tools allow to identify weaknesses in a system design. Yet, understanding conceptual differences between the tools is not trivial. We propose a taxonomy of threat modeling tools, and use it to compare several popular ones. Alongside, we conduct a case study to illustrate differences between the tools.
taken from the linked PDF
Details
- Venue series
- IEEE — Security and Privacy — IEEE S&P
- Venue in bibliography
- IEEE Security and Privacy
- DOI
- 10.1109/MSEC.2021.3125229
- Pages
- 29--39
- Volume
- 20
- Number
- 4
- DBLP key
- DBLP:journals/ieeesp/ShiGSM22
@article{DBLP:journals/ieeesp/ShiGSM22, author = {Zhenpeng Shi and Kalman Graffi and David Starobinski and Nikolay Matyunin}, editor = {}, title = {{Threat Modeling Tools: {A} Taxonomy}}, journal = {{IEEE} Security and Privacy}, volume = {20}, number = {4}, pages = {29--39}, year = {2022}, url = {https://doi.org/10.1109/MSEC.2021.3125229}, doi = {10.1109/MSEC.2021.3125229}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ieeesp/ShiGSM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2022--ShiGSM22--Threat-Modeling-Tools-A-Taxonomy.pdf} } -
Conference paper · 2022TargetFuzz: Using DARTs to Guide Directed Greybox FuzzersAbstract
Software development is a continuous and incremental process. Developers continuously improve their software in small batches rather than in one large batch. The high frequency of small batches makes it essential to use effective testing methods that detect bugs under limited testing time. To this end, researchers propose directed greybox fuzzing (DGF) which aims to generate test cases towards stressing certain target sites. Different from the coverage-based greybox fuzzing (CGF) which aims to maximize code coverage in the whole program, the goal of DGF is to cover potentially buggy code regions (e.g., a recently modified program region). While prior works improve several aspects of DGF (such as power scheduling, input prioritization, and target selection), little attention has been given to improving the seed selection process. Existing DGF tools use seed corpora mainly tailored for CGF (i.e., a set of seeds that cover different regions of the program). We observe that using CGFbased corpora limits the bug-finding capability of a directed greybox fuzzer. To mitigate this shortcoming, we propose TargetFuzz, a mechanism that provides a DGF tool with a target-oriented seed corpus. We refer to this corpus as DART corpus, which contains only ‘close’ seeds to the targets. This way, DART corpus guides DGF to the targets, thereby exposing bugs even under limited fuzzing time.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- ACM — Asia Conference on Computer and Communications Security — ASIA CCS
- Venue in bibliography
- ASIA CCS '22: ACM Asia Conference on Computer and Communications Security, Nagasaki, Japan, 30 May 2022 - 3 June 2022
- DOI
- 10.1145/3488932.3501276
- Pages
- 561--573
- Publisher
- ACM
- DBLP key
- DBLP:conf/asiaccs/CanakciMGJE22
@inproceedings{DBLP:conf/asiaccs/CanakciMGJE22, author = {Sadullah Canakci and Nikolay Matyunin and Kalman Graffi and Ajay Joshi and Manuel Egele}, title = {{TargetFuzz: Using DARTs to Guide Directed Greybox Fuzzers}}, booktitle = {{ASIA} {CCS} '22: {ACM} Asia Conference on Computer and Communications Security, Nagasaki, Japan, 30 May 2022 - 3 June 2022}, pages = {561--573}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3488932.3501276}, doi = {10.1145/3488932.3501276}, timestamp = {Tue, 24 May 2022 13:40:31 +0200}, biburl = {https://dblp.org/rec/conf/asiaccs/CanakciMGJE22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2022--CanakciMGJE22--TargetFuzz-Using-DARTs-to-Guide-Directed-Greybox-Fuzzers.pdf} } -
Conference paper · 2022Batched Differentially Private Information RetrievalAbstract
Private Information Retrieval (PIR) allows several clients to query a database held by one or more servers, such that the contents of their queries remain private. Prior PIR schemes have achieved sublinear communication and computation by leveraging computational assumptions, federating trust among many servers, relaxing security to permit differentially private leakage, refactoring effort into an offline stage to reduce online costs, or amortizing costs over a large batch of queries. In this work, we present an efficient PIR protocol that combines all of the above techniques to achieve constant amortized communication and computation complexity in the size of the database and constant client work. We leverage differentially private leakage in order to provide better trade-offs between privacy and efficiency. Our protocol achieves speedups up to and exceeding 10x in practical settings compared to state of the art PIR protocols, and can scale to batches with hundreds of millions of queries on cheap commodity AWS machines. Our protocol builds upon a new secret sharing scheme that is both incremental and non-malleable, which may be of interest to a wider audience. Our protocol provides security up to abort against malicious adversaries that can corrupt all but one party.
taken from the linked PDF
Details
- Venue series
- USENIX — Security Symposium — USENIX Security
- Venue in bibliography
- 31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022
- Pages
- 3327--3344
- Publisher
- USENIX Association
- DBLP key
- DBLP:conf/uss/AlbabIVG22
@inproceedings{DBLP:conf/uss/AlbabIVG22, author = {Kinan Dak Albab and Rawane Issa and Mayank Varia and Kalman Graffi}, title = {{Batched Differentially Private Information Retrieval}}, booktitle = {31st {USENIX} Security Symposium, {USENIX} Security 2022, Boston, MA, USA, August 10-12, 2022}, pages = {3327--3344}, publisher = {{USENIX} Association}, year = {2022}, url = {https://www.usenix.org/conference/usenixsecurity22/presentation/albab}, timestamp = {Tue, 18 Oct 2022 17:10:36 +0200}, biburl = {https://dblp.org/rec/conf/uss/AlbabIVG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2022--AlbabIVG22--Batched-Differentially-Private-Information-Retrieval.pdf} } -
Conference paper · 2021Past, Present, and Future of Swarm RoboticsAbstract
Swarm Robotics is an emerging field of adapting the phenomenon of natural swarms to robotics. It is a study of robots that are aimed to mimic natural swarms, like ants and birds, to form a system that is scalable, flexible and robust. These robots show self-organisation, autonomy, cooperation and coordination amongst themselves. The cost and design complexity factor is aimed to keep low, hence trying to form systems that are very much similar to natural swarms. The robots operate without any central entity to control them, and the communication amongst the robots can either be direct (robot-to-robot) or indirect (robotto-environment). Swarm robotics has a wide range of application fields, from simple household tasks to military missions. This paper reviews the swarm robotics approach from its history to its future. It discusses the basic idea of swarm robotics, its important features, simulators, projects, real life applications and some future ideas. The collective behaviour shown by natural swarms like, honey bees, ants, fishes and others, has inspired humans to build such systems with robots, that can act in the most similar way as the natural swarms. These natural swarms can coordinate their simple behaviours and form complex behaviours with the help of which, they can accomplish tasks that are impossible for single individuals to perform.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- Intelligent Systems Conference — IntelliSys
- Venue in bibliography
- Intelligent Systems and Applications - Proceedings of the 2021 Intelligent Systems Conference, IntelliSys 2021, Amsterdam, The Netherlands, 2-3 September, 2021, Volume 3
- DOI
- 10.1007/978-3-030-82199-9_13
- Pages
- 190--233
- Volume
- 296
- Publisher
- Springer
- DBLP key
- DBLP:conf/intellisys/CheraghiSG21
@inproceedings{DBLP:conf/intellisys/CheraghiSG21, author = {Ahmad Reza Cheraghi and Sahdia Shahzad and Kalman Graffi}, title = {{Past, Present, and Future of Swarm Robotics}}, booktitle = {Intelligent Systems and Applications - Proceedings of the 2021 Intelligent Systems Conference, IntelliSys 2021, Amsterdam, The Netherlands, 2-3 September, 2021, Volume 3}, series = {Lecture Notes in Networks and Systems}, volume = {296}, pages = {190--233}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-82199-9_13}, doi = {10.1007/978-3-030-82199-9_13}, timestamp = {Thu, 12 Aug 2021 13:45:57 +0200}, biburl = {https://dblp.org/rec/conf/intellisys/CheraghiSG21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2021--CheraghiSG21--Past-Present-and-Future-of-Swarm-Robotics.pdf} } -
Journal article · 2021Past, Present, and Future of Swarm RoboticsAbstract
Swarm Robotics is an emerging field of adapting the phenomenon of natural swarms to robotics. It is a study of robots that are aimed to mimic natural swarms, like ants and birds, to form a system that is scalable, flexible, and robust. These robots show self-organization, autonomy, cooperation, and coordination amongst themselves. The cost and design complexity factor is aimed to keep low, hence trying to form systems that are very much similar to natural swarms. The robots operate without any central entity to control them, and the communication amongst the robots can either be direct (robot-to-robot) or indirect (robotto-environment). Swarm robotics has a wide range of application fields, from simple household tasks to military missions. This paper reviews the swarm robotics approach from its history to its future. It discusses the basic idea of swarm robotics, its important features, simulators, projects, real life applications and some future ideas. gives an overview of the swarm robotics field. It discusses the features, advantages, issues, tasks and application fields for swarm robotics. The present work, that includes different experimental and simulation platforms for swarm robotics, is described in section IV. This section discusses the different types of simulators as well as real life applications in the field of swarm robotics.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- arXiv — Preprints (Computer Science) — CoRR
- Venue in bibliography
- CoRR
- Volume
- abs/2101.00671
- DBLP key
- DBLP:journals/corr/abs-2101-00671
@article{DBLP:journals/corr/abs-2101-00671, author = {Ahmad Reza Cheraghi and Sahdia Shahzad and Kalman Graffi}, editor = {}, title = {{Past, Present, and Future of Swarm Robotics}}, journal = {CoRR}, volume = {abs/2101.00671}, year = {2021}, url = {https://arxiv.org/abs/2101.00671}, eprinttype = {arXiv}, eprint = {2101.00671}, timestamp = {Thu, 21 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2101-00671.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2021--abs-2101-00671--Past-Present-and-Future-of-Swarm-Robotics.pdf} } -
Journal article · 2021LibreSocial: A Peer-To-Peer Framework for Online Social NetworksAbstract
Distributed online social networks (DOSNs) were first proposed to solve the problem of privacy, security, and scalability. A significant amount of research was undertaken to offer viable DOSN solutions that were capable of competing with the existing centralized OSN applications such as Facebook, LinkedIn, and Instagram. This research led to the emergence of the use of peer-to-peer (P2P) networks as a possible solution, upon which several OSNs such as LifeSocial.KOM, Safebook, PeerSoN among others were based. In this article, we define the basic requirements for an P2P OSN. We then revisit one of the first P2P-based OSNs, LifeSocial.KOM, that is now called LibreSocial, which evolved in the past years to address the challenges of running a completely decentralized social network. Over the course of time, several essential new technologies have been incorporated within LibreSocial for better functionalities. In this article we describe the architecture and each individual component of LibreSocial and point out how LibreSocial meets the basic requirements for a fully functional
taken from the linked PDF
Details
- Venue series
- Wiley — Concurrency and Computation: Practice and Experience — Wiley CCEPE
- Venue in bibliography
- Wiley Concurrency and Computation: Practice and Experience
- DOI
- 10.1002/CPE.6150
- Volume
- 33
- Number
- 8
- DBLP key
- DBLP:journals/concurrency/GraffiM21
@article{DBLP:journals/concurrency/GraffiM21, author = {Kalman Graffi and Newton Masinde}, editor = {}, title = {{LibreSocial: {A} Peer-To-Peer Framework for Online Social Networks}}, journal = {Wiley Concurrency and Computation: Practice and Experience}, volume = {33}, number = {8}, year = {2021}, url = {https://doi.org/10.1002/cpe.6150}, doi = {10.1002/CPE.6150}, timestamp = {Fri, 14 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/concurrency/GraffiM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2021--GraffiM21--LibreSocial-A-Peer-To-Peer-Framework-for-Online-Social-Networks.pdf} } -
Conference paper · 2020Universal 2-Dimensional Terrain Marking for Autonomous Robot SwarmsAbstract
This research introduces the design and implementation of a universal systematic 2-dimensional terrain marking and coverage solution. Real world applications such as lawn mowing, mine detection, chemical spill clean-up, and humanitarian search and rescue missions can be automated by employing swarms of autonomous mobile robots to complete the task. In most of these real world applications, efficiency is of utmost importance especially when human lives are involved. The solution proposed builds up on two graph traversal algorithms; Depth First Search (DFS) and Breadth First Search (BFS), where the algorithms are adapted and modified to be utilized for coverage of 2-dimensional isometric grid-like representations of terrains. The solution is developed so that each robot in the swarm would be fully capable of covering and marking any terrain by itself. The efficiency of the solution is optimized by increasing the swarm size, as robots benefit from data sharing in their path planning and self organization within the terrain. Communication between robots enable them to perform on a higher level by benefiting from the collaborative distributed behavior of the swarm as a whole. The communication between particles is decentralized and is carried out at a local level with no need for a central guidance mechanism.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — Asia-Pacific Conference on Intelligent Robot Systems — IEEE ACIRS
- Venue in bibliography
- 5th Asia-Pacific Conference on Intelligent Robot Systems, ACIRS 2020, Singapore, July 17-19, 2020
- DOI
- 10.1109/ACIRS49895.2020.9162613
- Pages
- 24--32
- Publisher
- IEEE
- DBLP key
- DBLP:conf/acirs/CheraghiAG20
@inproceedings{DBLP:conf/acirs/CheraghiAG20, author = {Ahmad Reza Cheraghi and Abdelrahman Abdelgalil and Kalman Graffi}, title = {{Universal 2-Dimensional Terrain Marking for Autonomous Robot Swarms}}, booktitle = {5th Asia-Pacific Conference on Intelligent Robot Systems, {ACIRS} 2020, Singapore, July 17-19, 2020}, pages = {24--32}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/ACIRS49895.2020.9162613}, doi = {10.1109/ACIRS49895.2020.9162613}, timestamp = {Thu, 27 Aug 2020 14:16:30 +0200}, biburl = {https://dblp.org/rec/conf/acirs/CheraghiAG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2020--CheraghiAG20--Universal-2-Dimensional-Terrain-Marking-for-Autonomous-Robot-Swarms.pdf} } -
Journal article · 2020Systematic Evaluation of LibreSocial - A Peer-to-Peer Framework for Online Social NetworksAbstract
Peer-to-peer (P2P) networks have been under investigation for several years now, with many novel mechanisms proposed as is shown by available articles. Much of the research focused on showing how the proposed mechanism improves system performance. In addition, several applications were proposed to harness the benefits of the P2P networks. Of these applications, online social networks (OSNs) raised much interest particularly because of the scalability and privacy concerns with centralized OSNs, hence several proposals are in existence. However, accompanying studies on the overall performance of the P2P network under the weight of the OSN applications outside simulations are very few, if any. In this paper, the aim is to undertake a systematic evaluation of the performance of a P2P framework for online social networks called LibreSocial. Benchmark tests are designed, taking into account the random behavior of users, effects of churn on system stability and effect of replication factor. We manage to run benchmark tests for up to 2000 nodes and show the performance against costs of the system in general. From the results it is evident that LibreSocial’s performance is capable of meeting the needs of users.
taken from the linked PDF
Details
- Venue series
- MDPI — Future Internet — MDPI FI
- Venue in bibliography
- MDPI Future Internet
- DOI
- 10.3390/FI12090140
- Pages
- 140
- Volume
- 12
- Number
- 9
- DBLP key
- DBLP:journals/fi/MasindeKDG20
@article{DBLP:journals/fi/MasindeKDG20, author = {Newton Masinde and Liat Khitman and Iakov Dlikman and Kalman Graffi}, editor = {}, title = {{Systematic Evaluation of LibreSocial - {A} Peer-to-Peer Framework for Online Social Networks}}, journal = {MDPI Future Internet}, volume = {12}, number = {9}, pages = {140}, year = {2020}, url = {https://doi.org/10.3390/fi12090140}, doi = {10.3390/FI12090140}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/fi/MasindeKDG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2020--MasindeKDG20--Systematic-Evaluation-of-LibreSocial-A-Peer-to-Peer-Framework-for-Online-Social-Networks.pdf} } -
Conference paper · 2020Swarm-Sim: A 2D & 3D Simulation Core for Swarm AgentsAbstract
(Robot) swarm networks are consisting of magnitudes of individual agents that are capable to move in a world and interact with each other or with passive items. Through local, individual algorithms applied in the agents desired properties of the swarm can emerge. In this paper, we present swarm-sim, a round-based simulator that supports the evaluation of such large scale swarms in a 2D and 3D world. Agents can move in the simulated world, perceive their surrounding, carry other agents and items, as well as communicate with the position their stand on through pheromones or markings as well as with other agents and items in this world. Through this, a large number of swarm-related use cases are supported. Implementing swarm algorithms is easy as the simulator is completely written in python and its code is open-source. This allows also to simulate large swarms due to the good performance of the simulator. Thorough analysis of the swarm behavior is supported through plots and Swarm intelligence is the ability of a swarm of individual agents with limited information about their environment and restricted or even no communication among themselves to perform a given task.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Intelligent Robotic and Control Engineering — IEEE IRCE
- Venue in bibliography
- 3rd International Conference on Intelligent Robotic and Control Engineering (IRCE'20)
- DOI
- 10.1109/IRCE50905.2020.9199255
- Pages
- 1-10
- DBLP key
- DBLP:conf/irce/CheraghiA20
@INPROCEEDINGS{DBLP:conf/irce/CheraghiA20, author = {Cheraghi, Ahmad Reza and Actun, Karol and Shahzad, Sahdia and Graffi, Kalman}, booktitle = {3rd International Conference on Intelligent Robotic and Control Engineering (IRCE'20)}, title = {{Swarm-Sim: A 2D & 3D Simulation Core for Swarm Agents}}, year = {2020}, volume = {}, number = {}, pages = {1-10}, doi = {10.1109/IRCE50905.2020.9199255}, file = {2021--CheraghiA21--SwarmSim-A-2D-3D-Simulation-Core-for-Swarm-Agents.pdf} } -
Conference paper · 2020Robot Swarm Flocking on a 2D Triangular GraphAbstract
Flocking behavior in swarms is phenomenal. Many small entities are interacting to form a large shape and to protect themselves from bigger entities. An examples are fish, they become a flock to be safe from predators. The way of how flocks move without getting separated, having a constant speed and not interfering each other is known as the flocking problem. In this paper, we build up a the three-zones flocking model on a two dimensional triangular graph to solve the flocking problem and evaluate the impact of changes in the separation, alignment and cohesion zone sizes on the flocking behavior. Fig. 1: Three flocks as connected components in a graph In recent years, the field of multi agent systems (MAS) and swarm robotics in particular have captured significant attention. They have been extensively studied since computer simulations allow the detailed investigation of these complex systems. Swarm robotic systems have different properties on the macro as well as on the micro level. On a macro level all MAS are reliable, efficient, flexible and cheap. Swarm robotic systems are a specific type of MAS that are additionally scalable, decentralized and homogeneous. Considering the micro level, the agents of the swarm are mobile, autonomous, proactive, robust, adaptive, and social.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — Asia-Pacific Conference on Intelligent Robot Systems — IEEE ACIRS
- Venue in bibliography
- 5th Asia-Pacific Conference on Intelligent Robot Systems, ACIRS 2020, Singapore, July 17-19, 2020
- DOI
- 10.1109/ACIRS49895.2020.9162599
- Pages
- 154--162
- Publisher
- IEEE
- DBLP key
- DBLP:conf/acirs/CheraghiJG20
@inproceedings{DBLP:conf/acirs/CheraghiJG20, author = {Ahmad Reza Cheraghi and Asma Ben Janete and Kalman Graffi}, title = {{Robot Swarm Flocking on a 2D Triangular Graph}}, booktitle = {5th Asia-Pacific Conference on Intelligent Robot Systems, {ACIRS} 2020, Singapore, July 17-19, 2020}, pages = {154--162}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/ACIRS49895.2020.9162599}, doi = {10.1109/ACIRS49895.2020.9162599}, timestamp = {Thu, 27 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/acirs/CheraghiJG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2020--CheraghiJG20--Robot-Swarm-Flocking-on-a-2D-Triangular-Graph.pdf} } -
Conference paper · 2020Reducing IoT Bandwidth Requirements by Fog-Based Distributed Hash TablesAbstract
Internet-of-Things (IoT) devices often rely on cloud services for computations and data management. As the number of IoT devices is growing fast, the Internet connection to the cloud data-center can be become a bottleneck regarding bandwidth and latency. Fog computing has been introduced by Cisco to address these challenges. We have proposed a peer-to-peer (p2p) Fog model allowing fog-nodes to cooperate and reduce the bandwidth requirement to the cloud and the system as a whole. In a previous paper we studied the benefits of applying Chord on fog nodes. In this publication we evaluated Pastry and CAN for implementing a DHT on fog nodes. The simulation results show that Pastry offers much better results in terms of bandwidth throughput compared models. The overall reduction in bandwidth requirements reflects
taken from the linked PDF
Details
- Venue series
- IEEE — Conference on Cloud and Internet of Things — IEEE CIoT
- Venue in bibliography
- 4th Conference on Cloud and Internet of Things, CIoT 2020, Niteroi, Brazil, October 7-9, 2020
- DOI
- 10.1109/CIOT50422.2020.9244294
- Pages
- 25--32
- Publisher
- IEEE
- DBLP key
- DBLP:conf/ciot/RabayaKKGS20
@inproceedings{DBLP:conf/ciot/RabayaKKGS20, author = {Ahmad Rabay'a and Pascal Kudla and Lukas Kubitza and Kalman Graffi and Michael Sch{\"{o}}ttner}, title = {{Reducing IoT Bandwidth Requirements by Fog-Based Distributed Hash Tables}}, booktitle = {4th Conference on Cloud and Internet of Things, CIoT 2020, Niteroi, Brazil, October 7-9, 2020}, pages = {25--32}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/CIoT50422.2020.9244294}, doi = {10.1109/CIOT50422.2020.9244294}, timestamp = {Fri, 20 Nov 2020 12:18:13 +0100}, biburl = {https://dblp.org/rec/conf/ciot/RabayaKKGS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2020--RabayaKKGS20--Reducing-IoT-Bandwidth-Requirements-by-Fog-Based-Distributed-Hash-Tables.pdf} } -
Conference paper · 2020Prevention of Ant Mills in Pheromone based Swarm AlgorithmsAbstract
Technical developments are often motivated by concepts from nature. The ant algorithm is such a concept. This algorithm takes on the idea of using the environment as a data store in order to contact to other participants (robots or ants). Copying this concept, however, the same problems occur, like real ants have. Especially with the army ant, which is characterized by their uniform behavior, ants mills appear. Gadget by a wide pheromone trail an ant on a random circle intensifies this trail for each round. Other ants that run in these the circular trail, they additionally reinforce it until an ant mill is formed and the whole colony starves to death. Nature solves this problem with a new breed at a new location. In an implementation as mars robots or molecular machines a new breed is not possible. We develop a closer look at this ant mill problem. We also find the ant algorithm interesting in terms of molecular machines where a wireless link is not an option for communication. In our simulation the ants build randomly ant mills and highly frequented routes to already depleted sources of food. Both cases are characterized by a high density of ants. Therefore, we present an extended algorithm which triggers an escape behavior, if three or more ants are standing near to each other.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Intelligent Robotic and Control Engineering — IEEE IRCE
- Venue in bibliography
- 3rd International Conference on Intelligent Robotic and Control Engineering (IRCE'20)
- DOI
- 10.1109/IRCE50905.2020.9199239
- Pages
- 1-10
- DBLP key
- DBLP:conf/irce/CheraghiP20
@INPROCEEDINGS{DBLP:conf/irce/CheraghiP20, author = {Cheraghi, Ahmad Reza and Peters, Jochen and Graffi, Kalman}, booktitle = {3rd International Conference on Intelligent Robotic and Control Engineering (IRCE'20)}, title = {{Prevention of Ant Mills in Pheromone based Swarm Algorithms}}, year = {2020}, volume = {}, number = {}, pages = {1-10}, doi = {10.1109/IRCE50905.2020.9199239}, file = {2021--CheraghiP21--Prevention-of-ant-mills-in-pheromone-based-search-algorithm-for-robot-swarms.pdf} } -
Conference paper · 2020Phototactic Movement of Battery-Powered and Self-Charging Robot SwarmsAbstract
In biology, phototaxing is one of the many forms of directed motions that organisms can exhibit. If stimulated by light, these organisms can move towards or away from the source. In this paper we present an algorithm that is reliably capable of moving a swarm of virtual robots away from a light source, all while the individual virtual robots are incapable of determining the direction and origin of the light source. The individual agents cannot generate phototactic behavior by themselves, instead this is realized through the overall, emergent behavior of the swarm. This paper explores an algorithm to produce phototactic movement in swarms of virtual robots. The algorithm is developed so that robots in a swarm of any size can execute it in a decentralized fashion, without the need for any globalized control or communication between them. We explore two different sets of virtual robots, one with self-charging and one with battery-powered characteristics. In a rigorous testing and evaluation we find that the swarms behavior and performance with regards to moving away from a light source varies strongly. Phototaxing is a common biological phenomenon and just one of the many kinds of directed movements that organisms can exhibit. It describes the movement towards or away from a light source and is especially beneficial to organisms that photosynthesize.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — Asia-Pacific Conference on Intelligent Robot Systems — IEEE ACIRS
- Venue in bibliography
- 5th Asia-Pacific Conference on Intelligent Robot Systems, ACIRS 2020, Singapore, July 17-19, 2020
- DOI
- 10.1109/ACIRS49895.2020.9162628
- Pages
- 73--79
- Publisher
- IEEE
- DBLP key
- DBLP:conf/acirs/CheraghiVG20
@inproceedings{DBLP:conf/acirs/CheraghiVG20, author = {Ahmad Reza Cheraghi and Fabio Schloesser Vila and Kalman Graffi}, title = {{Phototactic Movement of Battery-Powered and Self-Charging Robot Swarms}}, booktitle = {5th Asia-Pacific Conference on Intelligent Robot Systems, {ACIRS} 2020, Singapore, July 17-19, 2020}, pages = {73--79}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/ACIRS49895.2020.9162628}, doi = {10.1109/ACIRS49895.2020.9162628}, timestamp = {Thu, 27 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/acirs/CheraghiVG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2020--CheraghiVG20--Phototactic-Movement-of-Battery-Powered-and-Self-Charging-Robot-Swarms.pdf} } -
Journal article · 2020Peer-to-Peer-Based Social Networks: A Comprehensive SurveyAbstract
Peer-to-peer (P2P) networks have been under investigation for several years now, with many novel mechanisms proposed as is shown by available articles. Much of the research focused on showing how the proposed mechanism improves system performance. In addition, several applications were proposed to harness the benefits of the P2P networks. Of these applications, online social networks (OSNs) raised much interest particularly because of the scalability and privacy concerns with centralized OSNs, hence several proposals are in existence. However, accompanying studies on the overall performance of the P2P network under the weight of the OSN applications outside simulations are very few, if any. In this paper, the aim is to undertake a systematic evaluation of the performance of a P2P framework for online social networks called LibreSocial. Benchmark tests are designed, taking into account the random behavior of users, effects of churn on system stability and effect of replication factor. We manage to run benchmark tests for up to 2000 nodes and show the performance against costs of the system in general. From the results it is evident that LibreSocial’s performance is capable of meeting the needs of users.
taken from the linked PDF
Details
- Venue series
- Springer Nature — Computer Science
- Venue in bibliography
- Springer Nature Computer Science
- DOI
- 10.1007/S42979-020-00315-8
- Pages
- 299
- Volume
- 1
- Number
- 5
- DBLP key
- DBLP:journals/sncs/MasindeG20
@article{DBLP:journals/sncs/MasindeG20, author = {Newton Masinde and Kalman Graffi}, editor = {}, title = {{Peer-to-Peer-Based Social Networks: {A} Comprehensive Survey}}, journal = {{Springer Nature} Computer Science}, volume = {1}, number = {5}, pages = {299}, year = {2020}, url = {https://doi.org/10.1007/s42979-020-00315-8}, doi = {10.1007/S42979-020-00315-8}, timestamp = {Wed, 21 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sncs/MasindeG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2020--MasindeG20--Peer-to-Peer-Based-Social-Networks-A-Comprehensive-Survey.pdf} } -
Journal article · 2020Peer-to-Peer based Social Networks: A Comprehensive SurveyAbstract
Online social networks, such as Facebook and twitter, are a growing phenomenon in today’s world, with various platforms providing capabilities for individuals to collaborate through messaging and chatting as well as sharing of content such as videos and photos. Most, if not all, of these platforms are based on centralized computing systems, meaning that the control and management of the systems lies in the hand of one provider, which must be trusted to treat the data and communication traces securely. While users aim for privacy and data sovereignty, often the providers aim to monetize the data they store. Even, federated privately run social networks require a few enthusiasts that serve the community and have, through that, access to the data they manage. As a zero-trust alternative, peer-to-peer (P2P) technologies promise networks that are self organizing and secure-by-design, in which the final data sovereignty lies at the corresponding user. Such networks support endto-end communication, uncompromising access control, anonymity and resilience against censorship and massive data leaks through misused trust. The goals of this survey are three-fold. Firstly, the survey elaborates the properties of P2P-based online social networks and defines the requirements for such (zero-trust) platforms.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- arXiv — Preprints (Computer Science) — CoRR
- Venue in bibliography
- CoRR
- Volume
- abs/2001.02611
- DBLP key
- DBLP:journals/corr/abs-2001-02611
@article{DBLP:journals/corr/abs-2001-02611, author = {Newton Masinde and Kalman Graffi}, editor = {}, title = {{Peer-to-Peer based Social Networks: {A} Comprehensive Survey}}, journal = {CoRR}, volume = {abs/2001.02611}, year = {2020}, url = {http://arxiv.org/abs/2001.02611}, eprinttype = {arXiv}, eprint = {2001.02611}, timestamp = {Mon, 13 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2001-02611.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2020--abs-2001-02611--Peer-to-Peer-based-Social-Networks-A-Comprehensive-Survey.pdf} } -
Conference paper · 2020Opportunistic Network Behavior in a Swarm: Passing Messages to DestinationAbstract
This paper evaluates and compares two routing algorithms for message passing in opportunistic peer-to-peer networks in the swarm network simulator Swarm-Sim. The two considered algorithms, Epidemic Routing and PRoPHET Routing, are compared in terms of delivery rates, efficiency and overhead, while presenting different mobility models. By this, we combine a variation of mobility models and a set of communication protocols, measuring their impact on the swarm behavior. Message delivery rates for Epidemic routing are considerably and consistently better. However, PRoPHET generates less overhead than Epidemic Routing independent of mobility models and scenarios. The measured overhead of Epidemic exceeded that of PRoPHET by about 100%. Memory requirements for keeping delivery probabilities - used by PRoPHET to circumvent flooding - might be a limitation as they must be kept locally per peer, this detail offers aspects for further research in the future. Finally, this paper demonstrates Swarm-Sim to be a viable alternative to simulate routing protocols in opportunistic peer to peer networks without requiring great insight into the simulator’s architecture and thus establishing itself as an easy to use simulator. It achieves simplicity without yielding any of flexibility of application.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — Asia-Pacific Conference on Intelligent Robot Systems — IEEE ACIRS
- Venue in bibliography
- 5th Asia-Pacific Conference on Intelligent Robot Systems, ACIRS 2020, Singapore, July 17-19, 2020
- DOI
- 10.1109/ACIRS49895.2020.9162614
- Pages
- 138--144
- Publisher
- IEEE
- DBLP key
- DBLP:conf/acirs/CheraghiZG20
@inproceedings{DBLP:conf/acirs/CheraghiZG20, author = {Ahmad Reza Cheraghi and Julian Zenz and Kalman Graffi}, title = {{Opportunistic Network Behavior in a Swarm: Passing Messages to Destination}}, booktitle = {5th Asia-Pacific Conference on Intelligent Robot Systems, {ACIRS} 2020, Singapore, July 17-19, 2020}, pages = {138--144}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/ACIRS49895.2020.9162614}, doi = {10.1109/ACIRS49895.2020.9162614}, timestamp = {Thu, 27 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/acirs/CheraghiZG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2020--CheraghiZG20--Opportunistic-Network-Behavior-in-a-Swarm-Passing-Messages-to-Destination.pdf} } -
Journal article · 2020LibreSocial: A Peer-to-Peer Framework for Online Social NetworksAbstract
Distributed online social networks (DOSNs) were first proposed to solve the problem of privacy, security and scalability. A significant amount of research was undertaken to offer viable DOSN solutions that were capable of competing with the existing centralized OSN applications such as Facebook, LinkedIn and Instagram. This research led to the emergence of the use of peer-topeer (P2P) networks as a possible solution, upon which several OSNs such as LifeSocial.KOM, Safebook, PeerSoN among others were based. In this paper, we define the basic requirements for an P2P OSN. We then revisit one of the first P2P-based OSNs, LifeSocial.KOM, that is now called LibreSocial, which evolved in the past years to address the challenges of running a completely decentralized social network. Over the course of time, several essential new technologies have been incorporated within LibreSocial for better functionalities. In this paper we describe the architecture and each individual component of LibreSocial and point out how LibreSocial meets the basic requirements for a fully functional distributed OSN.
taken from the linked PDF
Details
- Venue series
- arXiv — Preprints (Computer Science) — CoRR
- Venue in bibliography
- CoRR
- Volume
- abs/2001.02962
- DBLP key
- DBLP:journals/corr/abs-2001-02962
@article{DBLP:journals/corr/abs-2001-02962, author = {Kalman Graffi and Newton Masinde}, editor = {}, title = {{LibreSocial: {A} Peer-to-Peer Framework for Online Social Networks}}, journal = {CoRR}, volume = {abs/2001.02962}, year = {2020}, url = {http://arxiv.org/abs/2001.02962}, eprinttype = {arXiv}, eprint = {2001.02962}, timestamp = {Mon, 13 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2001-02962.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2020--abs-2001-02962--LibreSocial-A-Peer-to-Peer-Framework-for-Online-Social-Networks.pdf} } -
Conference paper · 2020General Coating of Arbitrary Objects Using Robot SwarmsAbstract
(Nano) robot swarms promise new applications in the field of health and entertainment. One of the tasks such a swarm could solve is coating, in which the robots in the swarm locate themselves as close to an object of arbitrary shape as possible. In this paper, we present a swarm coating algorithm for simple robots using only local communication and decentralized coordination only. The robots calculate distances to the coating target object for themselves and all adjacent spaces around them, trying then to move to a lower distance than they are currently at. Through simulations, we show that our approach is able to efficiently coat various object forms with a 100% success rate, even objects with cave-like structures are coated correctly.
taken from the linked PDF
Details
- Venue series
- IEEE — Asia-Pacific Conference on Intelligent Robot Systems — IEEE ACIRS
- Venue in bibliography
- 5th Asia-Pacific Conference on Intelligent Robot Systems, ACIRS 2020, Singapore, July 17-19, 2020
- DOI
- 10.1109/ACIRS49895.2020.9162617
- Pages
- 59--67
- Publisher
- IEEE
- DBLP key
- DBLP:conf/acirs/CheraghiWG20
@inproceedings{DBLP:conf/acirs/CheraghiWG20, author = {Ahmad Reza Cheraghi and Gorden Wunderlich and Kalman Graffi}, title = {{General Coating of Arbitrary Objects Using Robot Swarms}}, booktitle = {5th Asia-Pacific Conference on Intelligent Robot Systems, {ACIRS} 2020, Singapore, July 17-19, 2020}, pages = {59--67}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/ACIRS49895.2020.9162617}, doi = {10.1109/ACIRS49895.2020.9162617}, timestamp = {Thu, 27 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/acirs/CheraghiWG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2020--CheraghiWG20--General-Coating-of-Arbitrary-Objects-Using-Robot-Swarms.pdf} } -
Conference paper · 2020Capacity Management Protocol for a Structured P2P-based Online Social NetworkAbstract
Peer-to-peer (P2P) networks were first made popular by filesharing applications such as KaZaA, Napster, LimeWire and BitTorrent These early applications on P2P networks relied exclusively on always connected users to ensure that the services were available by utilizing some form of centralized indexing services. With the rapid technological developments, the computing devices have become increasingly smaller and are connected via mobile networks run by teleecommunication companies. Additionally, more sophisticated applications that are even more resource intensive such as online social networks (OSNs) on P2P platforms are possible. The smaller devices that are connected to the P2P OSNs may not have adequate resource capacities, such as bandwidth, memory or storage space, to share with the P2P network. In this paper, we present an algorithm that handles capacity management as he new users join the network. We implement and test the algorithm on our P2P framework for OSNs called LibreSocial, and show that network functions well even when there is a significantly high number of limited capacity devices join the network.
taken from the linked PDF
Details
- Venue series
- IEEE — International Conference on Social Networks Analysis, Management and Security — IEEE SNAMS
- Venue in bibliography
- Seventh International Conference on Social Networks Analysis, Management and Security, SNAMS 2020, Virtual Event, France, December 14-16, 2020
- DOI
- 10.1109/SNAMS52053.2020.9336563
- Pages
- 1--8
- Publisher
- IEEE
- DBLP key
- DBLP:conf/snams/MasindeBG20
@inproceedings{DBLP:conf/snams/MasindeBG20, author = {Newton Masinde and Sebastian Bischoff and Kalman Graffi}, title = {{Capacity Management Protocol for a Structured P2P-based Online Social Network}}, booktitle = {Seventh International Conference on Social Networks Analysis, Management and Security, {SNAMS} 2020, Virtual Event, France, December 14-16, 2020}, pages = {1--8}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/SNAMS52053.2020.9336563}, doi = {10.1109/SNAMS52053.2020.9336563}, timestamp = {Thu, 30 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/snams/MasindeBG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2020--MasindeBG20--Capacity-Management-Protocol-for-a-Structured-P2P-based-Online-Social-Network.pdf} } -
Conference paper · 2020Caching Structures for Distributed Data Management in P2P-based Social NetworksAbstract
Distributed applications require novel solutions to tackle problems that arise due to the scarcity of resources such as bandwidth, memory and processing power. One of these challenges is seen in distributed data management. The challenge is the two part problem of ensuring that the content is valid when accessed and updating it immediately when changed. This is especially difficult when considering p2p-based distributed online social networks, which aim to build reliable, secure social networking platforms on top of often unreliable and insecure devices. In this paper, we propose three selection strategies, random, trend and social score, for a social caching mechanism. They consider the social interaction patterns in the social network. We implement and evaluate them in a DHT-based distributed online social networks called LibreSocial and show that the social score is the best strategy. Further we implement the social caching solution and also show that when used in combination with the existing caching solution almost all requests can be serviced via cache while retaining the consistency of data during updates. Online social networks have revolutionized how users communicate with each other and share content as well as information.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Symposium on Networks, Computers and Communications — IEEE ISNCC
- Venue in bibliography
- 2020 International Symposium on Networks, Computers and Communications, ISNCC 2020, Montreal, QC, Canada, October 20-22, 2020
- DOI
- 10.1109/ISNCC49221.2020.9297202
- Pages
- 1--8
- Publisher
- IEEE
- DBLP key
- DBLP:conf/isncc/MasindeKG20
@inproceedings{DBLP:conf/isncc/MasindeKG20, author = {Newton Masinde and Moritz Kanzler and Kalman Graffi}, title = {{Caching Structures for Distributed Data Management in P2P-based Social Networks}}, booktitle = {2020 International Symposium on Networks, Computers and Communications, {ISNCC} 2020, Montreal, QC, Canada, October 20-22, 2020}, pages = {1--8}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/ISNCC49221.2020.9297202}, doi = {10.1109/ISNCC49221.2020.9297202}, timestamp = {Fri, 15 Jan 2021 09:21:28 +0100}, biburl = {https://dblp.org/rec/conf/isncc/MasindeKG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2020--MasindeKG20--Caching-Structures-for-Distributed-Data-Management-in-P2P-based-Social-Networks.pdf} } -
Journal article · 2020Caching Structures for Distributed Data Management in P2P-based Social NetworksAbstract
Distributed applications require novel solutions to tackle problems that arise due to the scarcity of resources such as bandwidth, memory and processing power. One of these challenges is seen in distributed data management. The challenge is the two part problem of ensuring that the content is valid when accessed and updating it immediately when changed. This is especially difficult when considering p2p-based distributed online social networks, which aim to build reliable, secure social networking platforms on top of often unreliable and insecure devices. In this paper, we propose three selection strategies, random, trend and social score, for a social caching mechanism. They consider the social interaction patterns in the social network. We implement and evaluate them in a DHT-based distributed online social networks called LibreSocial and show that the social score is the best strategy. Further we implement the social caching solution and also show that when used in combination with the existing caching solution almost all requests can be serviced via cache while retaining the consistency of data during updates. Online social networks have revolutionized how users communicate with each other and share content as well as information.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- arXiv — Preprints (Computer Science) — CoRR
- Venue in bibliography
- CoRR
- Volume
- abs/2004.07033
- DBLP key
- DBLP:journals/corr/abs-2004-07033
@article{DBLP:journals/corr/abs-2004-07033, author = {Newton Masinde and Moritz Kanzler and Kalman Graffi}, title = {{Caching Structures for Distributed Data Management in P2P-based Social Networks}}, journal = {CoRR}, volume = {abs/2004.07033}, year = {2020}, url = {https://arxiv.org/abs/2004.07033}, eprinttype = {arXiv}, eprint = {2004.07033}, timestamp = {Tue, 21 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2004-07033.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2020--abs-2004-07033--Caching-Structures-for-Distributed-Data-Management-in-P2P-based-Social-Networks.pdf} } -
Journal article · 2020Batched Differentially Private Information RetrievalAbstract
Private Information Retrieval (PIR) allows several clients to query a database held by one or more servers, such that the contents of their queries remain private. Prior PIR schemes have achieved sublinear communication and computation by leveraging computational assumptions, federating trust among many servers, relaxing security to permit differentially private leakage, refactoring effort into an offline stage to reduce online costs, or amortizing costs over a large batch of queries. In this work, we present an efficient PIR protocol that combines all of the above techniques to achieve constant amortized communication and computation complexity in the size of the database and constant client work. We leverage differentially private leakage in order to provide better trade-offs between privacy and efficiency. Our protocol achieves speedups up to and exceeding 10x in practical settings compared to state of the art PIR protocols, and can scale to batches with hundreds of millions of queries on cheap commodity AWS machines. Our protocol builds upon a new secret sharing scheme that is both incremental and non-malleable, which may be of interest to a wider audience. Our protocol provides security up to abort against malicious adversaries that can corrupt all but one party.
taken from the linked PDF
Details
- Venue series
- IACR — Cryptology ePrint Archive — IACR ePrint
- Venue in bibliography
- IACR Cryptology ePrint Archive
- Pages
- 1596
- DBLP key
- DBLP:journals/iacr/AlbabIVG20
@article{DBLP:journals/iacr/AlbabIVG20, author = {Kinan Dak Albab and Rawane Issa and Mayank Varia and Kalman Graffi}, title = {{Batched Differentially Private Information Retrieval}}, journal = {{IACR} Cryptology ePrint Archive}, pages = {1596}, year = {2020}, url = {https://eprint.iacr.org/2020/1596}, timestamp = {Mon, 04 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iacr/AlbabIVG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2020--AlbabIVG20--Batched-Differentially-Private-Information-Retrieval.pdf} } -
Conference paper · 2020A Leader Based Coating Algorithm for Simple and Cave Shaped Objects with Robot SwarmsAbstract
Self-organizing swarm systems promise an essential progress in several research areas. They can find application in health context, such as through nano-robots, or material context, such as for healthhealing properties. Swarm behavior in nature is well known e.g. bird flocks that protect individual birds, ants that collaboratively transport bigger objects, or predators who hunt in packs. Applying these strategies to future robot swarms promises to open further opportunities. In this paper, we address the problem of object coating, in which a swarm of “subjects” aims to position itself as tightly as possible around an object. We introduce a leader-based coating algorithm that promises nearoptimal performance. A leader is elected to coordinate the actions of the swarm; thus, it scans the entire object and plans the placement of the individual swarm members upfront. Through its coordination, each individual subject is placed around the scanned object. While simple shapes are easy to master, a strong emphasis of this paper lies on dealing with cave-shaped objects in which passages or trails might be blocked in a naive approach. We elaborate how to deal with such problems and how our algorithm addresses this issue. Evaluation shows that our approach can coat arbitrary object shapes in competitive times. Cancer is still a deadly disease that is hard to cure.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — Asia-Pacific Conference on Intelligent Robot Systems — IEEE ACIRS
- Venue in bibliography
- 5th Asia-Pacific Conference on Intelligent Robot Systems, ACIRS 2020, Singapore, July 17-19, 2020
- DOI
- 10.1109/ACIRS49895.2020.9162610
- Pages
- 43--51
- Publisher
- IEEE
- DBLP key
- DBLP:conf/acirs/CheraghiG20
@inproceedings{DBLP:conf/acirs/CheraghiG20, author = {Ahmad Reza Cheraghi and Kalman Graffi}, title = {{A Leader Based Coating Algorithm for Simple and Cave Shaped Objects with Robot Swarms}}, booktitle = {5th Asia-Pacific Conference on Intelligent Robot Systems, {ACIRS} 2020, Singapore, July 17-19, 2020}, pages = {43--51}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/ACIRS49895.2020.9162610}, doi = {10.1109/ACIRS49895.2020.9162610}, timestamp = {Thu, 27 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/acirs/CheraghiG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2020--CheraghiG20--A-Leader-Based-Coating-Algorithm-for-Simple-and-Cave-Shaped-Objects-with-Robot-Swarms.pdf} } -
Conference paper · 2019On the Impact of Device Characteristics on Opportunistic Network PerformanceAbstract
With smartphones gaining relevance in everyone’s regular day more than ever, the application of opportunistic networks on those devices has become a popular field of research, as it enables smartphones to connect locally with high bandwidth and to provide networked applications for regional use. Conventional Delay Tolerant Networks and opportunistic network methods and techniques however cannot be directly applied on smartphones. Challenges are brought up by missing ad-hoc communication possibilities and system architecture constraints. Through tethering hotspot-based communication it is possible to create opportunistic networks for smartphones, although with specific network characteristics. We conduct a survey on the impact of device characteristics and network transmission properties on the overall network performance. Using the ONE simulator, we deploy a tethering hotspot-based connection strategy and, as the main contribution of this paper, asses the influence of single device properties onto the global opportunistic network device’s radio transmission range as the most significant factor one should consider when designing algorithms for smartphonebased opportunistic networks.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — Conference on Internet of Things, Green Computing, Cyber, Physical and Social Computing and Smart Data — iThings/GreenCom/CPSCom/SmartData
- Venue in bibliography
- 2019 International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData), iThings/GreenCom/CPSCom/SmartData 2019, Atlanta, GA, USA, July 14-17, 2019
- DOI
- 10.1109/ITHINGS/GREENCOM/CPSCOM/SMARTDATA.2019.00082
- Pages
- 373--380
- Publisher
- IEEE
- DBLP key
- DBLP:conf/ithings/BialonSG19
@inproceedings{DBLP:conf/ithings/BialonSG19, author = {Raphael Bialon and Jan Steimann and Kalman Graffi}, title = {{On the Impact of Device Characteristics on Opportunistic Network Performance}}, booktitle = {2019 International Conference on Internet of Things (iThings) and {IEEE} Green Computing and Communications (GreenCom) and {IEEE} Cyber, Physical and Social Computing (CPSCom) and {IEEE} Smart Data (SmartData), iThings/GreenCom/CPSCom/SmartData 2019, Atlanta, GA, USA, July 14-17, 2019}, pages = {373--380}, publisher = {{IEEE}}, year = {2019}, url = {https://doi.org/10.1109/iThings/GreenCom/CPSCom/SmartData.2019.00082}, doi = {10.1109/ITHINGS/GREENCOM/CPSCOM/SMARTDATA.2019.00082}, timestamp = {Thu, 24 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ithings/BialonSG19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2019--BialonSG19--On-the-Impact-of-Device-Characteristics-on-Opportunistic-Network-Performance.pdf} } -
Conference paper · 2019Improving Message Delivery in Opportunistic Networks with Fragmentation and Network CodingAbstract
In opportunistic networks, no guarantees about network connectivity and node behavior can be made. Routing protocols aim at delivering messages by choosing promising paths throughout the network. These paths are created by nodes replicating messages and forwarding them to other nodes upon encountering them. The first replicated message reaching its destination node is the successful delivery, while others routed along different paths might arrive at a later time. The order and possibility of arrival depend on many factors such as the path length and sufficient transfer time for a complete message upon inter-node contact. We motivate the use of distinct paths throughout the network for Fragmentation and Network Coding and propose Fragmentation Strategies on the edge of the opportunistic network improving general message delivery. By carefully choosing appropriate fragment sizes and the amount of network coding added, we show that our Fragmentation Strategies are able to improve message delivery for large messages regardless of the routing protocol in use. As the main contribution of this paper, we provide the mathematical equations needed for fragment creation, and make available an implementation of our set of participating nodes forms the not fully connected network by spontaneously connecting to other nodes upon encountering them.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — Conference on Internet of Things, Green Computing, Cyber, Physical and Social Computing and Smart Data — iThings/GreenCom/CPSCom/SmartData
- Venue in bibliography
- 2019 International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData), iThings/GreenCom/CPSCom/SmartData 2019, Atlanta, GA, USA, July 14-17, 2019
- DOI
- 10.1109/ITHINGS/GREENCOM/CPSCOM/SMARTDATA.2019.00046
- Pages
- 148--155
- Publisher
- IEEE
- DBLP key
- DBLP:conf/ithings/BialonTG19
@inproceedings{DBLP:conf/ithings/BialonTG19, author = {Raphael Bialon and Jan T{\"{o}}lkes and Kalman Graffi}, title = {{Improving Message Delivery in Opportunistic Networks with Fragmentation and Network Coding}}, booktitle = {2019 International Conference on Internet of Things (iThings) and {IEEE} Green Computing and Communications (GreenCom) and {IEEE} Cyber, Physical and Social Computing (CPSCom) and {IEEE} Smart Data (SmartData), iThings/GreenCom/CPSCom/SmartData 2019, Atlanta, GA, USA, July 14-17, 2019}, pages = {148--155}, publisher = {{IEEE}}, year = {2019}, url = {https://doi.org/10.1109/iThings/GreenCom/CPSCom/SmartData.2019.00046}, doi = {10.1109/ITHINGS/GREENCOM/CPSCOM/SMARTDATA.2019.00046}, timestamp = {Thu, 24 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ithings/BialonTG19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2019--BialonTG19--Improving-Message-Delivery-in-Opportunistic-Networks-with-Fragmentation-and-Network-Coding.pdf} } -
Conference paper · 2019Implementing Enterprise Resource Planning Systems in the Cloud: Challenges and SolutionsAbstract
Cloud computing for ERP provides solutions to the difficulties encountered by conventional ERP systems. This research investigates the accompanying issues of implementing ERP systems using Cloud computing, and introduces solutions to these issues including SLA, standardization, and customers' resistance. The issues have been investigated through an exploratory study and proposed solutions have been introduced, and then validated based on data from the Cloud Security Alliance (CSA). The results of this research are simplified assembling of issues, best practices, and specifications toward implementing ERP in a cloud. The research results include: SLA is a necessary contract, but it is not sufficient, as more auditing and checking procedures must be added to the SLA to assure availability and redundancy of offered services. Moreover, bigger vendors did not welcome a standard for ERP in a cloud, and they might get convinced by standardizing only the core part of ERP in a cloud. Finally, there are different views about the potential resistance toward ERP in a cloud, but services that would let customer try the systems before purchasing them could help overcoming this resistance. The results of this work should help the market and researchers get a better view about ERP in
taken from the linked PDF
Details
- Venue series
- IEEE — International Symposium on Networks, Computers and Communications — IEEE ISNCC
- Venue in bibliography
- 2019 International Symposium on Networks, Computers and Communications, ISNCC 2019, Istanbul, Turkey, June 18-20, 2019
- DOI
- 10.1109/ISNCC.2019.8909115
- Pages
- 1--8
- Publisher
- IEEE
- DBLP key
- DBLP:conf/isncc/RabayaG19
@inproceedings{DBLP:conf/isncc/RabayaG19, author = {Ahmad Rabay'a and Kalman Graffi}, title = {{Implementing Enterprise Resource Planning Systems in the Cloud: Challenges and Solutions}}, booktitle = {2019 International Symposium on Networks, Computers and Communications, {ISNCC} 2019, Istanbul, Turkey, June 18-20, 2019}, pages = {1--8}, publisher = {{IEEE}}, year = {2019}, url = {https://doi.org/10.1109/ISNCC.2019.8909115}, doi = {10.1109/ISNCC.2019.8909115}, timestamp = {Wed, 27 Nov 2019 19:28:17 +0100}, biburl = {https://dblp.org/rec/conf/isncc/RabayaG19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2019--RabayaG19--Implementing-Enterprise-Resource-Planning-Systems-in-the-Cloud-Challenges-and-Solutions.pdf} } -
Conference paper · 2019Fog Computing with P2P: Enhancing Fog Computing Bandwidth for IoT ScenariosAbstract
Cloud computing is an architecture which several Internet-of-Things (IoT) devices relay on to outsource their computation tasks. The numbers and needs of IoT devices have grown massively, to which cloud computing could not fulfill these needs. Cloud computing has its shortcomings in terms of bandwidth, latency, and real-time response. To overcome these shortcomings fog computing paradigm was introduced, which can fulfill requests from IoT devices and forward requests to the cloud if necessary. However, there are still requests that need to go to the cloud and might suffer from its shortcomings. Our proposed peer-to-peer (p2p) fog model enhances fog computing by adding p2p mechanism into the fog layer, which allow the fog nodes to collaborate in order to meet the clients needs. This way we minimize the requests that go to the cloud and fulfill most of the requests by the fog nodes at the proximity of the user. In this research, we evaluate the proposed p2p fog model and show that it has better outcomes in term of bandwidth throughput compared to cloud computing and fog computing models. Therefore we have simulated cloud computing, fog computing, and p2p fog computing scenarios, then compared and evaluated their outcome results. Further research into fog computing could build upon this proposed model and extend existing fog computing architectures.
taken from the linked PDF
Details
- Venue series
- IEEE — Conference on Internet of Things, Green Computing, Cyber, Physical and Social Computing and Smart Data — iThings/GreenCom/CPSCom/SmartData
- Venue in bibliography
- 2019 International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData), iThings/GreenCom/CPSCom/SmartData 2019, Atlanta, GA, USA, July 14-17, 2019
- DOI
- 10.1109/ITHINGS/GREENCOM/CPSCOM/SMARTDATA.2019.00036
- Pages
- 82--89
- Publisher
- IEEE
- DBLP key
- DBLP:conf/ithings/SchleicherGR19
@inproceedings{DBLP:conf/ithings/SchleicherGR19, author = {Eduard Schleicher and Kalman Graffi and Ahmad Rabay'a}, title = {{Fog Computing with {P2P:} Enhancing Fog Computing Bandwidth for IoT Scenarios}}, booktitle = {2019 International Conference on Internet of Things (iThings) and {IEEE} Green Computing and Communications (GreenCom) and {IEEE} Cyber, Physical and Social Computing (CPSCom) and {IEEE} Smart Data (SmartData), iThings/GreenCom/CPSCom/SmartData 2019, Atlanta, GA, USA, July 14-17, 2019}, pages = {82--89}, publisher = {{IEEE}}, year = {2019}, url = {https://doi.org/10.1109/iThings/GreenCom/CPSCom/SmartData.2019.00036}, doi = {10.1109/ITHINGS/GREENCOM/CPSCOM/SMARTDATA.2019.00036}, timestamp = {Thu, 24 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ithings/SchleicherGR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2019--SchleicherGR19--Fog-Computing-with-P2P-Enhancing-Fog-Computing-Bandwidth-for-IoT-Scenarios.pdf} } -
Conference paper · 2019Congestion Control for Epidemic Routing in Opportunistic NetworksAbstract
Flooding-based routing protocols in opportunistic networks like Epidemic provide a simple routing algorithm. While delivery probability is high and delivery latency is low, the generated overhead of distributing every message to each node generates unnecessary load in the network, especially in areas with higher node density and areas with network congestion. Several approaches try to control congestion by utilizing additionally transferred information to coordinate packet transmissions. Due to the nature of an opportunistic network, solutions designed to use a central or global oracle are seldom feasible. Our solution contributes a per-message probability-based decision for congestion control using ephemeral information of a nodes’ surroundings. Simulations conducted using the ONE simulator show, that after a certain node density resulting in a congested network area, overhead ratio decreases and delivery probability significantly increases compared to Epidemic routing. By testing scenarios with different movement models, we also foreclose algorithm efficiency based on node interactions.
taken from the linked PDF
Details
- Venue series
- IEEE — Conference on Internet of Things, Green Computing, Cyber, Physical and Social Computing and Smart Data — iThings/GreenCom/CPSCom/SmartData
- Venue in bibliography
- 2019 International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData), iThings/GreenCom/CPSCom/SmartData 2019, Atlanta, GA, USA, July 14-17, 2019
- DOI
- 10.1109/ITHINGS/GREENCOM/CPSCOM/SMARTDATA.2019.00039
- Pages
- 102--109
- Publisher
- IEEE
- DBLP key
- DBLP:conf/ithings/BialonG19
@inproceedings{DBLP:conf/ithings/BialonG19, author = {Raphael Bialon and Kalman Graffi}, title = {{Congestion Control for Epidemic Routing in Opportunistic Networks}}, booktitle = {2019 International Conference on Internet of Things (iThings) and {IEEE} Green Computing and Communications (GreenCom) and {IEEE} Cyber, Physical and Social Computing (CPSCom) and {IEEE} Smart Data (SmartData), iThings/GreenCom/CPSCom/SmartData 2019, Atlanta, GA, USA, July 14-17, 2019}, pages = {102--109}, publisher = {{IEEE}}, year = {2019}, url = {https://doi.org/10.1109/iThings/GreenCom/CPSCom/SmartData.2019.00039}, doi = {10.1109/ITHINGS/GREENCOM/CPSCOM/SMARTDATA.2019.00039}, timestamp = {Thu, 24 Oct 2019 15:55:06 +0200}, biburl = {https://dblp.org/rec/conf/ithings/BialonG19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2019--BialonG19--Congestion-Control-for-Epidemic-Routing-in-Opportunistic-Networks.pdf} } -
Book chapter · 2018Webs of Change? The Transformation of Online Social Networks and Communication Infrastructures from a Technological Point of ViewAbstract
Online social networks and online real-time communication tools have gained large popularity in the last few years. During the Arab uprisings they emerged as one of the main tools for exchanging ideas and for organizing activities. In this article, we review the technology and infrastructure for online social communication, as well as the weaknesses that were used to spy, censor and block it, and highlight current trends in research on how to overcome these obstacles. Specifically, we present networking technologies that provide tools to the users to make their communication resilient, secured and impossible to track. Thus, we investigate social communication during but also beyond the Arab uprisings from the perspective of computer science, and combine the resulting insights with current developments in this discipline. in the project “Academia in Transformation”. A collective volume of all project papers will be edited by Sarhan Dhouib and published by NOMOS in 2017. is Junior-Professor for the ''Technology of Social Networks'' at the Germany. With his nine PhD students, he concentrates his research on network protocols and mechanisms to support the freedom of speech and privacy around the globe.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- Academia in Transformation: Scholars Facing the Arab Uprisings
- Venue in bibliography
- Academia in Transformation: Scholars Facing the Arab Uprisings
- Publisher
- Nomos Verlagsgesellschaft mbH & Co. KG
- DBLP key
- DBLP:books/nomos/AmftG18
@incollection{DBLP:books/nomos/AmftG18, author = {Tobias Amft and Kalman Graffi}, editor = {Florian Kohstall and Carola Richter and Sarhan Dhouib and Fatima Kastner}, title = {{Webs of Change? The Transformation of Online Social Networks and Communication Infrastructures from a Technological Point of View}}, booktitle = {Academia in Transformation: Scholars Facing the Arab Uprisings}, publisher = {Nomos Verlagsgesellschaft mbH \& Co. KG}, address = {Baden-Baden, Germany}, year = {2018}, isbn = {978-3-8487-2829-9}, note = {Arab-German Young Academy of Sciences and Humanities (AGYA). Also available as ePDF: ISBN 978-3-8452-7434-8}, file = {2018--AmftG18--Webs-of-Change-The-Transformation-of-Online-Social-Networks-and-Communication-Infrastructures-from-a-Technological-Point-of-View.pdf} } -
Conference paper · 2018Time and Space in Android-Based Opportunistic NetworksAbstract
Mobile devices like smartphones or other smart objects can create Opportunistic Networks with intermittent node contacts due to their wireless technology and their user’s social behavior. In disaster, emergency and censorship situations, or if simply no internet connection is available, Opportunistic Networking can be used to connect devices to each other. We attempt to improve our Android-based network and take a look at time modification and buffer management issues. Syncing the time is a known problem due to the probable lack of a connection to the internet. Since the devices are user-controlled, changes in time have to be noticed and time differences between devices have to be exchanged. Also, we take a look at the special buffer which is not reserved entirely for the network but is shared with all applications on the device. For this paper, we developed functionality in form of multiple libraries to detect time changes and possible storage shortages on the devices, to synchronize time for our network, and to remove messages in a system in which there is not only one buffer but multiple virtual ones that belong to different applications. We conduct tests which detect when the Android system begins to notify about storage congestion and starts deleting buffer content.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Advanced Information Networking and Applications — AINA
- Venue in bibliography
- 32nd IEEE International Conference on Advanced Information Networking and Applications, AINA 2018, Krakow, Poland, May 16-18, 2018
- DOI
- 10.1109/AINA.2018.00046
- Pages
- 244--250
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/aina/IppischKG18
@inproceedings{DBLP:conf/aina/IppischKG18, author = {Andre Ippisch and Tobias Kuper and Kalman Graffi}, title = {{Time and Space in Android-Based Opportunistic Networks}}, booktitle = {32nd {IEEE} International Conference on Advanced Information Networking and Applications, {AINA} 2018, Krakow, Poland, May 16-18, 2018}, pages = {244--250}, publisher = {{IEEE} Computer Society}, year = {2018}, url = {https://doi.org/10.1109/AINA.2018.00046}, doi = {10.1109/AINA.2018.00046}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/aina/IppischKG18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2018--IppischKG18--Time-and-Space-in-Android-Based-Opportunistic-Networks.pdf} } -
Conference paper · 2018Search Algorithms for Distributed Data Structures in P2P NetworksAbstract
The search problem in distributed systems has been evaluated and various proposals have been made to solve them. The problem is particularly pronounced when considering P2P networks, because the different types of P2P network topologies used to dictate the search mechanisms that are used. Specifically, search mechanisms may be key-based, as in structured P2P networks that use distributed data structures such as Distributed for unstructured P2P networks. Online systems today utilize metadata to support search algorithms. Metadata searches are trivial in unstructured networks but are a challenge to the structured networks because of the distributed data structures (DDS). This work proposes to introduce algorithms that support metadata searches in structured P2P networks that utilize DHT overlays. DDSs are introduced into the system as storage layers that support complex data structures. We show that this can be done and searching can be achieved with acceptable performance. Peer-to-peer (P2P) network technologies have been extensively researched in literature and have rapidly found usefulness in various interactive online applications, such as massive multiplayer games (MMGs) and online social networks (OSNs). However, from the onset, research reveals that P2P networks face some debilitating challenges that hamper the smooth functioning of the interactive online application.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Symposium on Networks, Computers and Communications — IEEE ISNCC
- Venue in bibliography
- 2018 International Symposium on Networks, Computers and Communications, ISNCC 2018, Rome, Italy, June 19-21, 2018
- DOI
- 10.1109/ISNCC.2018.8530977
- Pages
- 1--8
- Publisher
- IEEE
- DBLP key
- DBLP:conf/isncc/Al-AaridhiDMG18
@inproceedings{DBLP:conf/isncc/Al-AaridhiDMG18, author = {Raed Al{-}Aaridhi and Iakov Dlikman and Newton Masinde and Kalman Graffi}, title = {{Search Algorithms for Distributed Data Structures in {P2P} Networks}}, booktitle = {2018 International Symposium on Networks, Computers and Communications, {ISNCC} 2018, Rome, Italy, June 19-21, 2018}, pages = {1--8}, publisher = {{IEEE}}, year = {2018}, url = {https://doi.org/10.1109/ISNCC.2018.8530977}, doi = {10.1109/ISNCC.2018.8530977}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isncc/Al-AaridhiDMG18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2018--Al-AaridhiDMG18--Search-Algorithms-for-Distributed-Data-Structures-in-P2P-Networks.pdf} } -
Conference paper · 2018Optimal Replication Based on Optimal Path Hops for Opportunistic NetworksAbstract
Opportunistic Networks are highly mobile networks which may lack a reliable path between some source and destination. Therefore, this type of network uses Store, Carry and Forward and delivers messages based on hop-by-hop routing. Epidemic is the simplest routing protocol for Opportunistic Networks, as it replicates messages to all encountered nodes. For messages spread by Epidemic replication, we study and analyze the trade-off between the messages’ delivery ratio, delay, and overhead. We consider that all members of the network, at any given time, know the amount of relay nodes that pass the message and each message carrier knows the amount of infected nodes that already have acquired the message. We address the problem of deriving the optimal closed-loop control for the replication strategy in our network. We draft this issue as a controlled, discrete-time and finite-state Markov Chain with an All Hops Optimal Path formulation. In real life scenarios, however, due to the intermittent correspondence in Opportunistic Networks the nodes do not have insight of the network’s global state. We try to solve this issue by obtaining an Ordinary Differential Equation approximation of the Markov Chain for the replication process of messages. Furthermore, our model considers All Hops Optimal Path as network graph analysis for the optimally controlled replication.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Advanced Information Networking and Applications — AINA
- Venue in bibliography
- 32nd IEEE International Conference on Advanced Information Networking and Applications, AINA 2018, Krakow, Poland, May 16-18, 2018
- DOI
- 10.1109/AINA.2018.00047
- Pages
- 251--258
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/aina/IppischSG18
@inproceedings{DBLP:conf/aina/IppischSG18, author = {Andre Ippisch and Salem Sati and Kalman Graffi}, title = {{Optimal Replication Based on Optimal Path Hops for Opportunistic Networks}}, booktitle = {32nd {IEEE} International Conference on Advanced Information Networking and Applications, {AINA} 2018, Krakow, Poland, May 16-18, 2018}, pages = {251--258}, publisher = {{IEEE} Computer Society}, year = {2018}, url = {https://doi.org/10.1109/AINA.2018.00047}, doi = {10.1109/AINA.2018.00047}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/aina/IppischSG18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2018--IppischSG18--Optimal-Replication-Based-on-Optimal-Path-Hops-for-Opportunistic-Networks.pdf} } -
Conference paper · 2018Mr.Tree: Multiple Realities in Tree-based Monitoring Overlays for Peer-to-Peer NetworksAbstract
Peer-to-peer systems are difficult to manage due to their decentralized nature and the lack of a central controlling task. In the last decade, decentralized monitoring approaches have been proposed, which are either precise or fault-tolerant. Tree-based approaches, which belong to the former category, are prone to churn as the structure needs to reorganize itself on node failures. In this paper, we propose the monitoring approach Mr.Tree, a protocol that enhances the robustness of existing tree-based approaches by introducing multiple realities, through building up multiple trees, and smartly replicating and maintaining aggregated data. Three modes are proposed to fit individual scenarios and needs. The evaluation shows a significant decrease of the error in completeness of monitoring data while keeping the costs relatively low. The error of the extended protocol under heavy churn is in the magnitude of the original protocol under low churn conditions, which is 8%, whereby the error of the original protocol under heavy churn raises to a value above 22%. The superior precision cancels out the increased costs already in scenarios with moderate churn. Nowadays, it is common, widespread and especially good practice to monitor communication systems. Their operators are mainly interested in a certain quality of service (QoS) with the aim to maximize the user experience.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Computing, Networking and Communications — IEEE ICNC
- Venue in bibliography
- 2018 International Conference on Computing, Networking and Communications, ICNC 2018, Maui, HI, USA, March 5-8, 2018
- DOI
- 10.1109/ICCNC.2018.8390361
- Pages
- 354--360
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/iccnc/DisterhoftSIG18
@inproceedings{DBLP:conf/iccnc/DisterhoftSIG18, author = {Andreas Disterh{\"{o}}ft and Phillip Sandkuhler and Andre Ippisch and Kalman Graffi}, title = {{Mr.Tree: Multiple Realities in Tree-based Monitoring Overlays for Peer-to-Peer Networks}}, booktitle = {2018 International Conference on Computing, Networking and Communications, {ICNC} 2018, Maui, HI, USA, March 5-8, 2018}, pages = {354--360}, publisher = {{IEEE} Computer Society}, year = {2018}, url = {https://doi.org/10.1109/ICCNC.2018.8390361}, doi = {10.1109/ICCNC.2018.8390361}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iccnc/DisterhoftSIG18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2018--DisterhoftSIG18--Mr-Tree-Multiple-Realities-in-Tree-based-Monitoring-Overlays-for-Peer-to-Peer-Networks.pdf} } -
Conference paper · 2018Minicamp: Middleware for Incomplete Participation in Structured Peer-to-Peer Monitoring ProtocolsAbstract
In order to provide a certain level of quality to the users of a peer-to-peer network, the network’s status needs to be monitored in the first place. In this paper, we tackle the problem of monitoring peer-to-peer networks with structured monitoring solutions with the constraint of incomplete participation of the nodes in the monitoring process. We propose a middleware overlay which operates between the common p2p overlay aiming at routing and resolving lookups and a monitoring overlay aiming to obtain and disseminate statistics on the network. Our solution covers an assignment, maintenance and probing scheme to build up a common global view for all nodes in the common p2p overlay. Evaluation shows a high precision for the assignment and probing scheme in the presence of only a fraction of the nodes in the network contributing to the monitoring. Peer-to-peer networks provide various functions in a fully decentralized manner. In order to maintain a quality level of these functions, information on the quality and cost of the network needs to be monitored, analyzed and used for improvements, as suggested in [10]. In the last decade, different monitoring solutions for peer-to-peer networks have been proposed.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Advanced Information Networking and Applications — AINA
- Venue in bibliography
- 32nd IEEE International Conference on Advanced Information Networking and Applications, AINA 2018, Krakow, Poland, May 16-18, 2018
- DOI
- 10.1109/AINA.2018.00150
- Pages
- 1034--1042
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/aina/DisterhoftG18
@inproceedings{DBLP:conf/aina/DisterhoftG18, author = {Andreas Disterh{\"{o}}ft and Kalman Graffi}, title = {{Minicamp: Middleware for Incomplete Participation in Structured Peer-to-Peer Monitoring Protocols}}, booktitle = {32nd {IEEE} International Conference on Advanced Information Networking and Applications, {AINA} 2018, Krakow, Poland, May 16-18, 2018}, pages = {1034--1042}, publisher = {{IEEE} Computer Society}, year = {2018}, url = {https://doi.org/10.1109/AINA.2018.00150}, doi = {10.1109/AINA.2018.00150}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/aina/DisterhoftG18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2018--DisterhoftG18--Minicamp-Middleware-for-Incomplete-Participation-in-Structured-Peer-to-Peer-Monitoring-Protocols.pdf} } -
Conference paper · 2018Field Experiment on the Performance of an Android-Based Opportunistic NetworkAbstract
Android smartphones ubiquitously available, they are mobile and have sophisticated communication opportunities. With Opportunistic Networks, we can use the wireless connectivity of smartphones and other smart devices to relay messages in store-carry-forward fashion from one node to another in order to implement novel data-oriented applications. These networks can be used for high-bandwidth local data transfers, in cases with low or no connectivity, such as in third-world countries or remote areas, or in cases where communication should not leave any traces. In the last years, we developed an Android application for Opportunistic Networking, named opptain, that can be deployed on off-the-shelf unrooted smartphones and smart devices, enabling to harness this idea by simply installing an app. As the quality of such networks is essential, we implemented a test framework for Android-based opportunistic networks to run tests and aggregate results automatically. In this paper, we present the evaluation results of a field experiment we conducted with the opptain application, in which we used 26 devices to evaluate the outcome typical use cases. The tests show that the expected quality is reached and provides a robust performance for various applications.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- International Workshops on Parallel Processing — Euro-Par
- Venue in bibliography
- Euro-Par 2018: Parallel Processing Workshops - Euro-Par 2018 International Workshops, Turin, Italy, August 27-28, 2018, Revised Selected Papers
- DOI
- 10.1007/978-3-030-10549-5_43
- Pages
- 547--558
- Volume
- 11339
- Publisher
- Springer
- DBLP key
- DBLP:conf/europar/IppischBG18
@inproceedings{DBLP:conf/europar/IppischBG18, author = {Andre Ippisch and Philipp Br{\"{u}}hn and Kalman Graffi}, title = {{Field Experiment on the Performance of an Android-Based Opportunistic Network}}, booktitle = {Euro-Par 2018: Parallel Processing Workshops - Euro-Par 2018 International Workshops, Turin, Italy, August 27-28, 2018, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {11339}, pages = {547--558}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-10549-5_43}, doi = {10.1007/978-3-030-10549-5_43}, timestamp = {Fri, 27 Dec 2019 21:26:53 +0100}, biburl = {https://dblp.org/rec/conf/europar/IppischBG18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2018--IppischBG18--Field-Experiment-on-the-Performance-of-an-Android-Based-Opportunistic-Network.pdf} } -
Conference paper · 2018An Android Wear OS Framework for Sensor Data and Network InterfacesAbstract
Wearable devices like smartwatches conquer the market and simplify our everyday life. Mostly, these devices are connected to our mobile phones, helping us to make communication easier and faster. However, wearable devices feature plenty of sensors and network interfaces that are mostly unused. Thus, the question arises on how to use this potential to improve the functionality and user experience of handset applications. This paper presents a framework for the Android operating system which enables us to retrieve information from the wearable device and store and use it on the handheld device. The primary focus lies on sensor and network interfaces, and as a result, this information can be considered for further computations. We offer the framework as an Android library which can be included in all Android projects. We evaluate the framework by conducting network performance tests as well as tests regarding CPU, memory and battery usage, and achieve promising results. Concluding, we can say that the wearable technology offers lots of opportunities for present and future Android projects. Due to the different types of framework services, we achieve the goal of providing a broad base of information that can be utilized by all developers.
taken from the linked PDF
Details
- Venue series
- IEEE — Conference on Local Computer Networks — LCN
- Venue in bibliography
- 43rd IEEE Conference on Local Computer Networks Workshops, LCN Workshops 2018, Chicago, IL, USA, October 1-4, 2018
- DOI
- 10.1109/LCNW.2018.8628494
- Pages
- 98--104
- Publisher
- IEEE
- DBLP key
- DBLP:conf/lcn/BerzatiIG18
@inproceedings{DBLP:conf/lcn/BerzatiIG18, author = {Bashkim Berzati and Andre Ippisch and Kalman Graffi}, title = {{An Android Wear {OS} Framework for Sensor Data and Network Interfaces}}, booktitle = {43rd {IEEE} Conference on Local Computer Networks Workshops, {LCN} Workshops 2018, Chicago, IL, USA, October 1-4, 2018}, pages = {98--104}, publisher = {{IEEE}}, year = {2018}, url = {https://doi.org/10.1109/LCNW.2018.8628494}, doi = {10.1109/LCNW.2018.8628494}, timestamp = {Wed, 16 Oct 2019 14:14:53 +0200}, biburl = {https://dblp.org/rec/conf/lcn/BerzatiIG18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2018--BerzatiIG18--An-Android-Wear-OS-Framework-for-Sensor-Data-and-Network-Interfaces.pdf} } -
Journal article · 2017SkyEye: A Tree-Based Peer-To-Peer Monitoring ApproachAbstract
Peer-to-Peer overlays, used by applications like distributed online social networks, need the ability to adjust their system parameters and thus the system performance to provide a certain level of quality, i.e. to ensure maximum response times. For the control of p2p network, a reliable information basis about the system’s state is essential, i.e. what the current average response time is. A precise and rapidly adapting monitoring mechanism can provide the desired knowledge. In this paper we propose SkyEye, a tree-based monitoring approach which operates on top of an existing structured p2p overlay. It provides through a lightweight, error-prone protocol a continuous monitoring of all peers in the network. It gathers and disseminates sophisticated statistics on a wide range of metrics from all peers, to all peers. Evaluation shows a superior precision and adapting rate compared to an implementation of the gossip-based push-sum algorithm in scenarios with churn and without churn. Peer-to-Peer (p2p) networks are well-studied decentralized structures which operate in a self-organized fashion, but also without any global overview. However, it is very useful to keep an eye on metrics or key performance indicators of a running p2p system, e.g. in order to identify weaknesses, bugs and misleading trends.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- Elsevier — Pervasive and Mobile Computing — Elsevier PMC
- Venue in bibliography
- Elsevier Pervasive and Mobile Computing
- DOI
- 10.1016/J.PMCJ.2017.07.003
- Pages
- 593--610
- Volume
- 40
- DBLP key
- DBLP:journals/percom/GraffiD17
@article{DBLP:journals/percom/GraffiD17, author = {Kalman Graffi and Andreas Disterh{\"{o}}ft}, editor = {}, title = {{SkyEye: {A} Tree-Based Peer-To-Peer Monitoring Approach}}, journal = {Elsevier Pervasive and Mobile Computing}, volume = {40}, pages = {593--610}, year = {2017}, url = {https://doi.org/10.1016/j.pmcj.2017.07.003}, doi = {10.1016/J.PMCJ.2017.07.003}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/percom/GraffiD17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2017--GraffiD17--SkyEye-A-Tree-Based-Peer-To-Peer-Monitoring-Approach.pdf} } -
Conference paper · 2017Replication Probability-Based Routing Scheme for Opportunistic NetworksAbstract
Opportunistic networks offer a delay-tolerant endto-end message delivery in networks with intermittently connected nodes and communication islands. In this paper, we propose a probabilistic forwarding scheme for opportunistic (RPRS), based on controlled replication of messages aiming to have a high delivery ratio while drastically reducing the message overhead. It uses from each single message the replication count and hop count to calculate the desired replication probability, which is prioritizes the message for replication. Also, it has its own drop policy whose utility function is a function of replication count, hop count, and the buffer time of a message, being an estimate of the end-to-end delay. Through this, RPRS allows us to decide when it is desirable to further spread a message and thus reach a high delivery ratio without congesting the network with unnecessary message copies. In simulation results, we analyze the performance of RPRS and compare it with wellknown routing protocols such as Epidemic routing and Spray & Wait, with different scheduling and drop policies based on the same variables. Conducted scenarios show that our scheme has better performance regarding delivery ratio, delay, buffer delay and overhead.
taken from the linked PDF
Details
- Venue series
- Conference on Networked Systems — NetSys
- Venue in bibliography
- 2017 Conference on Networked Systems, NetSys 2017, Göttingen, Germany, March 13-16, 2017
- DOI
- 10.1109/NETSYS.2017.7903953
- Pages
- 1--8
- Publisher
- IEEE
- DBLP key
- DBLP:conf/kivs/SatiIG17
@inproceedings{DBLP:conf/kivs/SatiIG17, author = {Salem Sati and Andre Ippisch and Kalman Graffi}, title = {{Replication Probability-Based Routing Scheme for Opportunistic Networks}}, booktitle = {2017 Conference on Networked Systems, NetSys 2017, G{\"{o}}ttingen, Germany, March 13-16, 2017}, pages = {1--8}, publisher = {{IEEE}}, year = {2017}, url = {https://doi.org/10.1109/NetSys.2017.7903953}, doi = {10.1109/NETSYS.2017.7903953}, timestamp = {Wed, 16 Oct 2019 14:14:53 +0200}, biburl = {https://dblp.org/rec/conf/kivs/SatiIG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2017--SatiIG17--Replication-Probability-Based-Routing-Scheme-for-Opportunistic-Networks.pdf} } -
Conference paper · 2017PacketSkip: Skip Graph for Multidimensional Search in Structured Peer-to-Peer SystemsAbstract
The Internet is ubiquitous and nodes participating in it are becoming increasingly diverse and heterogeneous. Especially is this true in decentralized, overlay-based networks, which traditionally build upon the infrastructure of the Internet. An ability to search for nodes with specific capabilities becomes of growing interest, for example, to support the node capacity discovery in large scale, distributed networks, such as in peerto-peer systems. With PacketSkip, we propose a distributed, ordered, multidimensional indexing structure based on a Skip Graph, which operates on top of popular distributed hash tables. Its purpose is to offer, among other functions, capacity-based, high dimensional range searches for peers and their dynamic capacities. PacketSkip provides a very high search performance, also in comparison to other approaches, as well as low update and maintenance costs. Evaluations show that update and search durations are low and well scalable. Even in dynamic systems, its inner graph structure remains robust and stable. Users nowadays participate in Internet services with a diverse range of device types. These devices are highly heterogeneous in terms of their capacity, such as processing power or storage. Latest research is increasingly focused on the Internet of Things (IoT), which increases the number of Internetcapable devices dramatically.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Self-Adaptive and Self-Organizing Systems — IEEE SASO
- Venue in bibliography
- 11th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2017, Tucson, AZ, USA, September 18-22, 2017
- DOI
- 10.1109/SASO.2017.11
- Pages
- 21--30
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/saso/DisterhoftFG17
@inproceedings{DBLP:conf/saso/DisterhoftFG17, author = {Andreas Disterh{\"{o}}ft and Andreas Funke and Kalman Graffi}, title = {{PacketSkip: Skip Graph for Multidimensional Search in Structured Peer-to-Peer Systems}}, booktitle = {11th {IEEE} International Conference on Self-Adaptive and Self-Organizing Systems, {SASO} 2017, Tucson, AZ, USA, September 18-22, 2017}, pages = {21--30}, publisher = {{IEEE} Computer Society}, year = {2017}, url = {https://doi.ieeecomputersociety.org/10.1109/SASO.2017.11}, doi = {10.1109/SASO.2017.11}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/saso/DisterhoftFG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2017--DisterhoftFG17--PacketSkip-Skip-Graph-for-Multidimensional-Search-in-Structured-Peer-to-Peer-Systems.pdf} } -
Conference paper · 2017Moving Peers in Distributed, Location-Based Peer-To-Peer OverlaysAbstract
In the past decades, various concepts of peer-topeer (P2P) systems have been realized in desktop applications for stationary PCs. Last recent years show that computers have evolved to handy devices which can be used nearly everywhere, not only at home. For this reason, location-based services which allow to associate peers in a network with geographical positions, e.g. to track a device in emergency cases, become interesting. In this paper, we introduce LobSter, a lightweight location-based service over unmodified DHTs like Chord [24], Kademlia [14] and Pastry [21] which supports the mobility of peers. Our evaluation compares LobSter to related work in stationary situations and gives insights about the general limits of distributed locationbased services in mobile environments. Since most mobile devices include electronics and software to determine the geographical position of the device, locationbased services are interesting nowadays as they enable a user to find peers in a certain area around a location. Older works about location-based P2P overlays mostly assume stationary nodes which are not able to move. Reason for this observation might be the fact that mobility became important in the last years when mobile devices emerged. In the beginning of the era of research on P2P systems (around 2000 - 2007), computers were rather fixed to one location.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Computing, Networking and Communications — IEEE ICNC
- Venue in bibliography
- 2017 International Conference on Computing, Networking and Communications, ICNC 2017, Silicon Valley, CA, USA, January 26-29, 2017
- DOI
- 10.1109/ICCNC.2017.7876253
- Pages
- 906--911
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/iccnc/AmftG17
@inproceedings{DBLP:conf/iccnc/AmftG17, author = {Tobias Amft and Kalman Graffi}, title = {{Moving Peers in Distributed, Location-Based Peer-To-Peer Overlays}}, booktitle = {2017 International Conference on Computing, Networking and Communications, {ICNC} 2017, Silicon Valley, CA, USA, January 26-29, 2017}, pages = {906--911}, publisher = {{IEEE} Computer Society}, year = {2017}, url = {https://doi.org/10.1109/ICCNC.2017.7876253}, doi = {10.1109/ICCNC.2017.7876253}, timestamp = {Wed, 16 Oct 2019 14:14:57 +0200}, biburl = {https://dblp.org/rec/conf/iccnc/AmftG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2017--AmftG17--Moving-Peers-in-Distributed-Location-Based-Peer-To-Peer-Overlays.pdf} } -
Journal article · 2017Moving Measurements: Measuring Network Characteristics of Mobile Cellular Networks on The MoveAbstract
Trace-based simulation of mobile cellular communication requires valid measurements of real-world delay, available data rate and packet loss. These network characteristics need to be measured simultaneously and with high frequency. Previously introduced measurement methods either do not combine the measurement of all three key network characteristics, suffer from low measurement frequencies or are not able to adapt to rapidly changing network conditions. In this paper we propose a novel measurement method that allows the simultaneous measurement of those three key characteristics for both communication directions while moving at high speed. Furthermore it is able to adapt to rapidly changing network
taken from the linked PDF
Details
- Venue series
- Elsevier — Computer Communications — Elsevier ComCom
- Venue in bibliography
- Elsevier Computer Communications
- DOI
- 10.1016/J.COMCOM.2016.06.002
- Pages
- 81--95
- Volume
- 97
- DBLP key
- DBLP:journals/comcom/GoebelKGM17
@article{DBLP:journals/comcom/GoebelKGM17, author = {Norbert Goebel and Tobias Krauthoff and Kalman Graffi and Martin Mauve}, editor = {}, title = {{Moving Measurements: Measuring Network Characteristics of Mobile Cellular Networks on The Move}}, journal = {Elsevier Computer Communications}, volume = {97}, pages = {81--95}, year = {2017}, url = {https://doi.org/10.1016/j.comcom.2016.06.002}, doi = {10.1016/J.COMCOM.2016.06.002}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comcom/GoebelKGM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2017--GoebelKGM17--Moving-Measurements-Measuring-Network-Characteristics-of-Mobile-Cellular-Networks-on-The-Move.pdf} } -
Conference paper · 2017Minicamp: Prototype for Partial Participation in Structured Peer-to-Peer Monitoring ProtocolsAbstract
Quality of service and quality of experience are of increasingly interest for successful communication network applications, particularly for decentralized networks, such as peer-to-peer (p2p) networks. They need sophisticated monitoring mechanisms to be able to adapt the system’s parameters to maintain a certain level of quality of service. In the literature, several well-studied approaches, classified as structured monitoring overlays, have been proposed. To the best known of the authors, these do not tackle the problem of partial participation. With Minicamp we propose a middleware which operates between the p2p overlay and the monitoring overlay and creates the opportunity to run monitoring services on just a subset of all nodes. These nodes gather and disseminate monitoring data of the whole system which is achieved by probing the subset of participating nodes. Evaluations reveal high precision for the probing scheme even when facing low participation rates. Quality of service is an important basis for the users’ experience which participate in applications operating on top of certain communication networks. Being able to hold a certain level of quality is crucial for such networks, especially, if the (p2p) fashion. Proposed state-of-the-art structured monitoring and SkyEye.KOM [8], [9], tackle this problem and provide information about the current state of the network.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — Conference on Local Computer Networks — LCN
- Venue in bibliography
- 42nd IEEE Conference on Local Computer Networks, LCN 2017, Singapore, October 9-12, 2017
- DOI
- 10.1109/LCN.2017.58
- Pages
- 203--206
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/lcn/DisterhoftG17
@inproceedings{DBLP:conf/lcn/DisterhoftG17, author = {Andreas Disterh{\"{o}}ft and Kalman Graffi}, title = {{Minicamp: Prototype for Partial Participation in Structured Peer-to-Peer Monitoring Protocols}}, booktitle = {42nd {IEEE} Conference on Local Computer Networks, {LCN} 2017, Singapore, October 9-12, 2017}, pages = {203--206}, publisher = {{IEEE} Computer Society}, year = {2017}, url = {https://doi.org/10.1109/LCN.2017.58}, doi = {10.1109/LCN.2017.58}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/lcn/DisterhoftG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2017--DisterhoftG17--Minicamp-Prototype-for-Partial-Participation-in-Structured-Peer-to-Peer-Monitoring-Protocols.pdf} } -
Conference paper · 2017Infrastructure Mode based Opportunistic Networks on Android DevicesAbstract
Opportunistic Networks are delay-tolerant mobile networks with intermittent node contacts in which data is transferred with the store-carry-forward principle. Owners of smartphones and smart objects form such networks due to their social behaviour. Opportunistic Networking can be used in remote areas with no access to the Internet, to establish communication after disasters, in emergency situations or to bypass censorship, but also in parallel to familiar networking. In this work, we create a mobile network application that connects Android devices over Wi-Fi, offers identification and encryption, and gathers information for routing in the network. The network application is constructed in such a way that third party applications can use the network application as network layer to send and receive data packets. We create secure and reliable connections while maintaining a high transmission speed, and with the gathered information about the network we offer knowledge for state of the art routing protocols. We conduct tests on connectivity, transmission range and speed, battery life and encryption speed and show a proof of concept for routing in the network.
taken from the linked PDF
Details
- Venue series
- IEEE — International Conference on Advanced Information Networking and Applications — AINA
- Venue in bibliography
- 31st IEEE International Conference on Advanced Information Networking and Applications, AINA 2017, Taipei, Taiwan, March 27-29, 2017
- DOI
- 10.1109/AINA.2017.32
- Pages
- 454--461
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/aina/IppischG17
@inproceedings{DBLP:conf/aina/IppischG17, author = {Andre Ippisch and Kalman Graffi}, title = {{Infrastructure Mode based Opportunistic Networks on Android Devices}}, booktitle = {31st {IEEE} International Conference on Advanced Information Networking and Applications, {AINA} 2017, Taipei, Taiwan, March 27-29, 2017}, pages = {454--461}, publisher = {{IEEE} Computer Society}, year = {2017}, url = {https://doi.org/10.1109/AINA.2017.32}, doi = {10.1109/AINA.2017.32}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/aina/IppischG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2017--IppischG17--Infrastructure-Mode-based-Opportunistic-Networks-on-Android-Devices.pdf} } -
Conference paper · 2017Dynamic Replication Control Strategy for Opportunistic NetworksAbstract
Epidemic routing is proposed as one of the routing protocols for Opportunistic Networks. These kind of networks behave as sparse and/or highly mobile networks in which there may not be a reliable path from source to destination. We study the trade-off between delivery delay/ratio and resource has to be spread to each encountered node by epidemic relaying. In addition to the destination, there are several other nodes in the network that can cooperate in relaying the message. We first assume that, at every instant, all the nodes can predict the number of relays storing the message and the number of new message replicators that have received the message. We formulate the problem as a controlled finite discrete Markov chain and derive the optimal closed-loop control (replication policy). However, in practice, the intermittent connectivity in the network implies that the nodes may not have the required perfect knowledge of the system state. To address this greedy issue, we obtain an ordinary differential equation (ODE) approximation for the optimally controlled Markov chain. Finally, we evaluate the performance of the replication control policy over finite networks. Numerical results show that this dynamic replication policy performs close to the optimal closed-loop policy.
taken from the linked PDF
Details
- Venue series
- IEEE — International Conference on Computing, Networking and Communications — IEEE ICNC
- Venue in bibliography
- 2017 International Conference on Computing, Networking and Communications, ICNC 2017, Silicon Valley, CA, USA, January 26-29, 2017
- DOI
- 10.1109/ICCNC.2017.7876274
- Pages
- 1017--1023
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/iccnc/SatiIG17
@inproceedings{DBLP:conf/iccnc/SatiIG17, author = {Salem Sati and Andre Ippisch and Kalman Graffi}, title = {{Dynamic Replication Control Strategy for Opportunistic Networks}}, booktitle = {2017 International Conference on Computing, Networking and Communications, {ICNC} 2017, Silicon Valley, CA, USA, January 26-29, 2017}, pages = {1017--1023}, publisher = {{IEEE} Computer Society}, year = {2017}, url = {https://doi.org/10.1109/ICCNC.2017.7876274}, doi = {10.1109/ICCNC.2017.7876274}, timestamp = {Sun, 21 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iccnc/SatiIG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2017--SatiIG17--Dynamic-Replication-Control-Strategy-for-Opportunistic-Networks.pdf} } -
Conference paper · 2017Device to Device Communication in Mobile Delay Tolerant NetworksAbstract
Available smartphones and smart objects can use short range connections like WiFi and Bluetooth as a communication technique to exchange information with nearby devices. Those techniques are used in cases of absent end-toend connection such as in Delay Tolerant Networks (DTNs) or transmission processes and contact information in such networks has more attention nowadays, where contact information and message transfer have a great impact on Store-Carry-Forward routing decisions. The performance of routing mechanisms is measured based on bandwidth utilization and energy consumption concerning the delivery ratio. Therefore in this paper, we present a study framework to formulate the message propagation process in addition to contact information with a view on energy consumption. The study gives a detailed expression of contact information such as contact probability based on node density and transmission range in a bounded area. Furthermore, the message exchange process as element of channel utilization and energy consumption will be conducted. We formulate expressions based on our simulation experiment results, and we evaluate the influence of various parameters on each other and finally on the system performance.
taken from the linked PDF
Details
- Venue series
- IEEE/ACM — International Symposium on Distributed Simulation and Real Time Applications — DS-RT
- Venue in bibliography
- 21st IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications, DS-RT 2017, Rome, Italy, October 18-20, 2017
- DOI
- 10.1109/DISTRA.2017.8167671
- Pages
- 91--98
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/dsrt/IppischSG17
@inproceedings{DBLP:conf/dsrt/IppischSG17, author = {Andre Ippisch and Salem Sati and Kalman Graffi}, title = {{Device to Device Communication in Mobile Delay Tolerant Networks}}, booktitle = {21st {IEEE/ACM} International Symposium on Distributed Simulation and Real Time Applications, {DS-RT} 2017, Rome, Italy, October 18-20, 2017}, pages = {91--98}, publisher = {{IEEE} Computer Society}, year = {2017}, url = {https://doi.org/10.1109/DISTRA.2017.8167671}, doi = {10.1109/DISTRA.2017.8167671}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/dsrt/IppischSG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2017--IppischSG17--Device-to-Device-Communication-in-Mobile-Delay-Tolerant-Networks.pdf} } -
Conference paper · 2017CapSearch: Capacity-Based Search in Highly Dynamic Peer-to-Peer NetworksAbstract
In times of greatly heterogeneous devices, e.g. smart phones vs. desktop PCs, and their users participating in various types of networks new scenarios appear. These scenarios include peer-to-peer networks participants providing their capacities in order to operate this system. In case of weaker participants, which temporarily do not have enough capacities to contribute their share to the network, get overloaded. In a different case, participants may delegate a certain job to another participant, which is capable for this job. In this paper we propose a fast and reliable indexing and search mechanism for participants’ capacities. We focus on a churn-resilient structure using a kdtree with logical nodes in order to be capable of highly dynamic node capacities. Evaluation shows our approach is able to find nearly 60% of all nodes and over 80% of a certain number k of all nodes in big range queries, while keeping the false positive rate close to zero. Today’s participants of miscellaneous networked applications are highly heterogeneous in terms of their capabilities. For example, participants of online social networks use their smart phones, tablets, laptops or desktop PC’s to access their applications.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Advanced Information Networking and Applications — AINA
- Venue in bibliography
- 31st IEEE International Conference on Advanced Information Networking and Applications, AINA 2017, Taipei, Taiwan, March 27-29, 2017
- DOI
- 10.1109/AINA.2017.129
- Pages
- 621--630
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/aina/DisterhoftG17
@inproceedings{DBLP:conf/aina/DisterhoftG17, author = {Andreas Disterh{\"{o}}ft and Kalman Graffi}, title = {{CapSearch: Capacity-Based Search in Highly Dynamic Peer-to-Peer Networks}}, booktitle = {31st {IEEE} International Conference on Advanced Information Networking and Applications, {AINA} 2017, Taipei, Taiwan, March 27-29, 2017}, pages = {621--630}, publisher = {{IEEE} Computer Society}, year = {2017}, url = {https://doi.org/10.1109/AINA.2017.129}, doi = {10.1109/AINA.2017.129}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/aina/DisterhoftG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2017--DisterhoftG17--CapSearch-Capacity-Based-Search-in-Highly-Dynamic-Peer-to-Peer-Networks.pdf} } -
Conference paper · 2017Access Control for Secure Distributed Data Structures in Distributed Hash TablesAbstract
Peer-To-Peer (P2P) networks open up great possibilities for intercommunication, collaborative and social projects like file sharing, communication protocols or social networks while offering advantages over the conventional Client-Server model of computing pattern. Such networks counter the problems of centralized servers such as that P2P networks can scale to millions without additional costs. In previous work, we presented Distributed Data Structure (DDS) which offers a middle-ware scheme for distributed applications. This scheme builds on top of DHT (Distributed Hash Table) based P2P overlays, and offers distributed data storage services as a middle-ware it still needs to address security issues. The main objective of this paper is to investigate possible ways to handle the security problem for DDS, and to develop a possibly reusable security architecture for access control for secure distributed data structures in P2P networks without depending on trusted third parties. Peer-To-Peer (P2P) networks are networks consisting of multiple participating peers which are treated equally. Usually, P2P system does not have a central authority. Unlike the ClientServer Model, the functionality of applications on top of the P2P networks depends on peers to cooperate.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Symposium on Local and Metropolitan Area Networks — IEEE LANMAN
- Venue in bibliography
- 2017 IEEE International Symposium on Local and Metropolitan Area Networks, LANMAN 2017, Osaka, Japan, June 12-14, 2017
- DOI
- 10.1109/LANMAN.2017.7972147
- Pages
- 1--3
- Publisher
- IEEE
- DBLP key
- DBLP:conf/lanman/Al-AaridhiYG17
@inproceedings{DBLP:conf/lanman/Al-AaridhiYG17, author = {Raed Al{-}Aaridhi and Ahmed Yuksektepe and Kalman Graffi}, title = {{Access Control for Secure Distributed Data Structures in Distributed Hash Tables}}, booktitle = {2017 {IEEE} International Symposium on Local and Metropolitan Area Networks, {LANMAN} 2017, Osaka, Japan, June 12-14, 2017}, pages = {1--3}, publisher = {{IEEE}}, year = {2017}, url = {https://doi.org/10.1109/LANMAN.2017.7972147}, doi = {10.1109/LANMAN.2017.7972147}, timestamp = {Wed, 16 Oct 2019 14:14:55 +0200}, biburl = {https://dblp.org/rec/conf/lanman/Al-AaridhiYG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2017--Al-AaridhiYG17--Access-Control-for-Secure-Distributed-Data-Structures-in-Distributed-Hash-Tables.pdf} } -
Conference paper · 2016The State of Simulation Tools for P2P Networks on Mobile Ad-Hoc and Opportunistic NetworksAbstract
During the Arab spring and other states of political turbulences, the access to selected servers of large communication sites and even the country-wide internet infrastructure has often been affected by enforced censorship and limited the possible communication tools. In order to overcome this censorship a full mobile decentralized network seems to be a viable option. Even though, through the strong dynamism in this decentralized mobile network, future threats, namely intermittent connectivity, changing topologies, and unreliable end nodes may occur. To handle these threats and to provide the desired functionality, selforganized protocols are necessary. This paper presents a survey on the current status of simulation tools for peer-to-peer (P2P), (MANET) with the aim to identify a suitable evaluation tool that is capable for combining these three networks and for simulating decentralized mobile networks. This combination will allow us to create a fully decentralized and self-organized system which cannot be blocked e.g. through the influences of political parties. Online social networks and online real-time communication tools gained large popularity in the last decade. In the so-called Arab Spring and other states of political turbulence, these tools emerged as important for exchanging information and for organizing activities.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Computer Communication and Networks — ICCCN
- Venue in bibliography
- 25th International Conference on Computer Communication and Networks, ICCCN 2016, Waikoloa, HI, USA, August 1-4, 2016
- DOI
- 10.1109/ICCCN.2016.7568584
- Pages
- 1--7
- Publisher
- IEEE
- DBLP key
- DBLP:conf/icccn/CheraghiASHG16
@inproceedings{DBLP:conf/icccn/CheraghiASHG16, author = {Ahmad Cheraghi and Tobias Amft and Salem Sati and Philipp Hagemeister and Kalman Graffi}, title = {{The State of Simulation Tools for {P2P} Networks on Mobile Ad-Hoc and Opportunistic Networks}}, booktitle = {25th International Conference on Computer Communication and Networks, {ICCCN} 2016, Waikoloa, HI, USA, August 1-4, 2016}, pages = {1--7}, publisher = {{IEEE}}, year = {2016}, url = {https://doi.org/10.1109/ICCCN.2016.7568584}, doi = {10.1109/ICCCN.2016.7568584}, timestamp = {Wed, 16 Oct 2019 14:14:49 +0200}, biburl = {https://dblp.org/rec/conf/icccn/CheraghiASHG16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2016--CheraghiASHG16--The-State-of-Simulation-Tools-for-P2P-Networks-on-Mobile-Ad-Hoc-and-Opportunistic-Networks.pdf} } -
Journal article · 2016Systematic Evaluation of Peer-To-Peer Systems using PeerfactSim.KOMAbstract
Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we present the peer-to-peer system simulator PeerfactSim.KOM, which we extended over the last years. PeerfactSim.KOM comes with an extensive layer model to support various facets and protocols of peer-topeer networking. In this article, we describe PeerfactSim.KOM and show how it can be used for detailed measurements of large-scale peer-to-peer networks. We enhanced PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate sets of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated, and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems. An immediate comparison of different configurations and overlays under different aspects is possible directly after the execution without any manual post-processing. Copyright
taken from the linked PDF
Details
- Venue series
- Wiley — Concurrency and Computation: Practice and Experience — Wiley CCEPE
- Venue in bibliography
- Wiley Concurrency and Computation: Practice and Experience
- DOI
- 10.1002/CPE.3716
- Pages
- 1655--1677
- Volume
- 28
- Number
- 5
- DBLP key
- DBLP:journals/concurrency/FeldottoG16
@article{DBLP:journals/concurrency/FeldottoG16, author = {Matthias Feldotto and Kalman Graffi}, editor = {}, title = {{Systematic Evaluation of Peer-To-Peer Systems using PeerfactSim.KOM}}, journal = {Wiley Concurrency and Computation: Practice and Experience}, volume = {28}, number = {5}, pages = {1655--1677}, year = {2016}, url = {https://doi.org/10.1002/cpe.3716}, doi = {10.1002/CPE.3716}, timestamp = {Mon, 02 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/concurrency/FeldottoG16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2016--FeldottoG16--Systematic-Evaluation-of-Peer-To-Peer-Systems-using-PeerfactSim-KOM.pdf} } -
Conference paper · 2016Sets, Lists and Trees: Distributed Data Structures on Distributed Hash TablesAbstract
Distributed hash tables and unstructured peer-topeer overlay networks allow to store, search and retrieve single data elements. While this is useful for simple applications such as file sharing, for future sophisticated applications more sophisticated distributed data structures should be supported. In order to build, for example architectures for distributed online social networks or distributed computing graphs, more advances data structures such as sets, lists of sorted trees should be supported by the peer-to-peer storage overlay with convenient access to the entries. Taking for example the set of albums in an distributed online social network. This set consists of a set of albums consist of sets of images, which themselves have each a list of comments. Using distributed data structures for sets, lists or trees in a distributed hash table allow to easily build sophisticated applications. In this paper, we present and evaluate a concept for such distributed data structures in peer-to-peer networks. In the evaluation we show, that all elements of each distributed data structure are successfully stored and retrieved and that the approach comes with low overhead and delay. Peer-to-peer (p2p) networks were in the focus of interest during the phase of popular file sharing networks.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Performance Computing and Communications Conference — IEEE IPCCC
- Venue in bibliography
- 35th IEEE International Performance Computing and Communications Conference, IPCCC 2016, Las Vegas, NV, USA, December 9-11, 2016
- DOI
- 10.1109/PCCC.2016.7820639
- Pages
- 1--8
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/ipccc/Al-AaridhiG16
@inproceedings{DBLP:conf/ipccc/Al-AaridhiG16, author = {Raed Al{-}Aaridhi and Kalman Graffi}, title = {{Sets, Lists and Trees: Distributed Data Structures on Distributed Hash Tables}}, booktitle = {35th {IEEE} International Performance Computing and Communications Conference, {IPCCC} 2016, Las Vegas, NV, USA, December 9-11, 2016}, pages = {1--8}, publisher = {{IEEE} Computer Society}, year = {2016}, url = {https://doi.org/10.1109/PCCC.2016.7820639}, doi = {10.1109/PCCC.2016.7820639}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ipccc/Al-AaridhiG16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2016--Al-AaridhiG16--Sets-Lists-and-Trees-Distributed-Data-Structures-on-Distributed-Hash-Tables.pdf} } -
Conference paper · 2016Privacy-Preserving Data Allocation in Decentralized Online Social NetworksAbstract
Distributed Online Social Networks (DOSNs) have been recently proposed as an alternative to centralized solutions to allow a major control of the users over their own data. Since there is no centralized service provider which decides the term of service, the DOSNs infrastructure exploit users’ devices to take on the online social network services. In this paper, we propose a data allocation strategy for DOSNs which exploits the privacy policies of the users to increase the availability of the users’ contents without diverging from their privacy preferences. A set of replicas of the contents of the profile of a user U are stored on the devices of other users who are entitled to access the profile according to U’s privacy policies. The set of experimental results obtained by simulations on a set of traces taken from a real social network show the effectiveness of our approach.
taken from the linked PDF
Details
- Venue series
- IFIP — International Conference on Distributed Applications and Interoperable Systems — DAIS
- Venue in bibliography
- Distributed Applications and Interoperable Systems - 16th IFIP WG 6.1 International Conference, DAIS 2016, Held as Part of the 11th International Federated Conference on Distributed Computing Techniques, DisCoTec 2016, Heraklion, Crete, Greece, June 6-9, 2016, Proceedings
- DOI
- 10.1007/978-3-319-39577-7_4
- Pages
- 47--60
- Volume
- 9687
- Publisher
- Springer
- DBLP key
- DBLP:conf/dais/SalveMRAG16
@inproceedings{DBLP:conf/dais/SalveMRAG16, author = {Andrea De Salve and Paolo Mori and Laura Ricci and Raed Al{-}Aaridhi and Kalman Graffi}, title = {{Privacy-Preserving Data Allocation in Decentralized Online Social Networks}}, booktitle = {Distributed Applications and Interoperable Systems - 16th {IFIP} {WG} 6.1 International Conference, {DAIS} 2016, Held as Part of the 11th International Federated Conference on Distributed Computing Techniques, DisCoTec 2016, Heraklion, Crete, Greece, June 6-9, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9687}, pages = {47--60}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-39577-7_4}, doi = {10.1007/978-3-319-39577-7_4}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/dais/SalveMRAG16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2016--SalveMRAG16--Privacy-Preserving-Data-Allocation-in-Decentralized-Online-Social-Networks.pdf} } -
Conference paper · 2016Misrouted Prophecy - On the Impact of Security Attacks on PRoPHETAbstract
In opportunistic networking, the wireless connectivity of mobile nodes is used to engage in opportunistic contacts, to exchange messages and thus to forward message in a store-carry-forward approach to a destination. Routing algorithms were developed with regards to the characteristics of these regularly partitioned networks. Network partitioning, no guarantee on device availability, and long delivery delays make these networks outstanding from traditional networks. In this paper, we investigate the behaviour of the prominent routing algorithm PRoPHET in opportunistic networks under dierent attack strategies. The attacks are performed by malicious nodes aimed at sabotaging the routing process in the network. Utilising ONE, the opportunistic network environment simulator, we conduct tests on these attacks and evaluate the outcomes of networks with malicious nodes compared to regular network behaviour. Through characteristic scenarios we document the behaviour of the network under attack. While in most cases the impact is tremendous, we also observe an interesting case of an attack causing an improved result in the network under attack.
taken from the linked PDF
Details
- Venue series
- International Workshops on Parallel Processing — Euro-Par
- Venue in bibliography
- Euro-Par 2016: Parallel Processing Workshops - Euro-Par 2016 International Workshops, Grenoble, France, August 24-26, 2016, Revised Selected Papers
- DOI
- 10.1007/978-3-319-58943-5_24
- Pages
- 296--308
- Volume
- 10104
- Publisher
- Springer
- DBLP key
- DBLP:conf/europar/BialonG16
@inproceedings{DBLP:conf/europar/BialonG16, author = {Raphael Bialon and Kalman Graffi}, title = {{Misrouted Prophecy - On the Impact of Security Attacks on PRoPHET}}, booktitle = {Euro-Par 2016: Parallel Processing Workshops - Euro-Par 2016 International Workshops, Grenoble, France, August 24-26, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10104}, pages = {296--308}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-58943-5_24}, doi = {10.1007/978-3-319-58943-5_24}, timestamp = {Sun, 06 Oct 2024 21:01:21 +0200}, biburl = {https://dblp.org/rec/conf/europar/BialonG16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2016--BialonG16--Misrouted-Prophecy-On-the-Impact-of-Security-Attacks-on-PRoPHET.pdf} } -
Conference paper · 2016Implementing Forward and Drop Policies for Improving PRoPHET's Routing PerformanceAbstract
Routing protocols for delay tolerant network are designed to operate in an environment where there is no stable end to end path. The DTN research has focused primarily on the performance of routing protocols that build on a StoreCarry-Forward manner without consideration of a physical buffer limitation. Therefore, the need of a message sorting and drop policy according to priorities is very critical and favorable in such restricted environments. In this paper, we present effective forward and drop policies to improve the performance of PRoPHET routing protocol. These forward and drop policies are applied on the PRoPHET version 2 routing protocol, which is currently commonly used as routing protocol for practical implementations of DTN middlewares. In this paper, we propose a stopping rule for the forward strategy in PRoPHET together with a dynamic drop policy. By this, we optimize the routing performance based on reducing the number of relayed messages while keeping a desired delivery ratio. To further improve the resource conservation, we propose new rules for message forwarding when encountering nodes. A forwarding error approximation is used to give the optimal threshold of the forwarding decision. In addition, we propose a dynamic drop policy which considers delay and overhead of the message based on multiple parameters.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Mobile Ad-Hoc and Sensor Networks — MSN
- Venue in bibliography
- 12th International Conference on Mobile Ad-Hoc and Sensor Networks, MSN 2016, Hefei, China, December 16-18, 2016
- DOI
- 10.1109/MSN.2016.045
- Pages
- 236--242
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/msn/SatiPG16
@inproceedings{DBLP:conf/msn/SatiPG16, author = {Salem Sati and Christopher Probst and Kalman Graffi}, title = {{Implementing Forward and Drop Policies for Improving PRoPHET's Routing Performance}}, booktitle = {12th International Conference on Mobile Ad-Hoc and Sensor Networks, {MSN} 2016, Hefei, China, December 16-18, 2016}, pages = {236--242}, publisher = {{IEEE} Computer Society}, year = {2016}, url = {https://doi.org/10.1109/MSN.2016.045}, doi = {10.1109/MSN.2016.045}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/msn/SatiPG16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2016--SatiPG16--Implementing-Forward-and-Drop-Policies-for-Improving-PRoPHET-s-Routing-Performance.pdf} } -
Conference paper · 2016Distributed Data Structures Improvement for Collective Retrieval TimeAbstract
In peer-to-peer overlay networks, distributed hash tables have been characterized as self-organizing, scalable, and robust. Up to now, distributed hash tables allow to store, search and retrieve only single data elements, which make the creation of more complex applications, such as distributed online social networks, very cumbersome. Sophisticated applications require the support for various and advanced data structures such as sets, lists and trees. Ideally, the DHT should support these advanced Distributed Data Structures. In previous work, we presented a new approach for Distributed Data Structure on distributed hash tables, which comes with low overhead and delay. In this paper, we address the issue of the time-consuming retrieval of deep data structures and present therefore a Cache Structures, which helps to accelerate the retrieval process by magnitudes. Simulations show that the Cache Structure gives us new functionality and an alternative way to retrieve the complete Distributed Data Structure much faster. Peer-to-peer (P2P) networks propose an approach to run platforms for various applications through a fully distributed approach. They have been used to not only in the form of file sharing applications but also in further application domains, such as for streaming of for P2P-based online social networks for optimization procedures [5], [6].
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- International Symposium on Wireless Personal Multimedia Communications — WPMC
- Venue in bibliography
- 19th International Symposium on Wireless Personal Multimedia Communications, WPMC 2016, Shenzhen, China, November 14-16, 2016
- Pages
- 85--90
- Publisher
- IEEE
- DBLP key
- DBLP:conf/wpmc/Al-AaridhiYAG16
@inproceedings{DBLP:conf/wpmc/Al-AaridhiYAG16, author = {Raed Al{-}Aaridhi and Ahmet Yuksektepe and Tobias Amft and Kalman Graffi}, title = {{Distributed Data Structures Improvement for Collective Retrieval Time}}, booktitle = {19th International Symposium on Wireless Personal Multimedia Communications, {WPMC} 2016, Shenzhen, China, November 14-16, 2016}, pages = {85--90}, publisher = {{IEEE}}, year = {2016}, url = {https://ieeexplore.ieee.org/document/7954459}, timestamp = {Thu, 12 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wpmc/Al-AaridhiYAG16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2016--Al-AaridhiYAG16--Distributed-Data-Structures-Improvement-for-Collective-Retrieval-Time.pdf} } -
Journal article · 2016DiDuSoNet: A P2P Architecture for Distributed Dunbar-Based Social NetworksAbstract
Online Social Networks (OSNs) are becoming more and more popular on the Web. Distributed Online Social Networks (DOSNs) are OSNs which do not exploit a central server for storing users data and enable users to have more control on their profile content, ensuring a higher level of privacy. In a DOSN there are some technical challenges to face. One of the most important challenges is the data availability problem when a user is offline. In this paper Social Network where users can exercise full access control on their data. Our system exploits trust relationships for providing a set of important social services, such as trustness, information diffusion, and data availability. In this paper we show how our system manages the problem of data availability by proposing a new P2P dynamic trusted storage approach. By following the Dunbar concept, our system stores the data of a user only on a restricted number of friends which have regular contacts with him/her. Differently from other approaches, nodes chosen to keep data replicas are not statically defined but dynamically change according to users churn. In according to our previous work, we use only two online profile replicas at time. By using real Facebook data traces we prove that our approach offers high availability.
taken from the linked PDF
Details
- Venue series
- Springer Nature — Peer-to-Peer Networks and Applications
- Venue in bibliography
- Springer Nature Peer-to-Peer Networks and Applications
- DOI
- 10.1007/S12083-015-0366-7
- Pages
- 1177--1194
- Volume
- 9
- Number
- 6
- DBLP key
- DBLP:journals/ppna/GuidiASGR16
@article{DBLP:journals/ppna/GuidiASGR16, author = {Barbara Guidi and Tobias Amft and Andrea De Salve and Kalman Graffi and Laura Ricci}, editor = {}, title = {{DiDuSoNet: {A} {P2P} Architecture for Distributed Dunbar-Based Social Networks}}, journal = {Springer Nature Peer-to-Peer Networks and Applications}, volume = {9}, number = {6}, pages = {1177--1194}, year = {2016}, url = {https://doi.org/10.1007/s12083-015-0366-7}, doi = {10.1007/S12083-015-0366-7}, timestamp = {Mon, 04 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ppna/GuidiASGR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2016--GuidiASGR16--DiDuSoNet-A-P2P-Architecture-for-Distributed-Dunbar-Based-Social-Networks.pdf} } -
Journal article · 2016Decentralized Communication Against Surveillance and Privacy ViolationAbstract
The Internet is one of the main communication platforms of our society. In many countries, communication contents and patterns are surveilled aiming to identify, punish or block undesired ideas. I focus with my research on fully decentralized and secure communication platforms which cannot be surveilled or switched off, on Android-based wireless mesh networks which support local communication that do not pass through the Internet, as well as on concepts for Internet-based democracy. My contributions aim for a practical usability in form of prototypes and software provided to potential users. ACM CCS: Networks → Network types → Overlay and other logical network structures
taken from the linked PDF
Details
- Venue series
- it — Information Technology
- Venue in bibliography
- it Information Technology
- Pages
- 112--116
- Volume
- 58
- Number
- 2
- DBLP key
- DBLP:journals/it/Graffi16
@article{DBLP:journals/it/Graffi16, author = {Kalman Graffi}, editor = {}, title = {{Decentralized Communication Against Surveillance and Privacy Violation}}, journal = {it Information Technology}, volume = {58}, number = {2}, pages = {112--116}, year = {2016}, url = {http://www.degruyter.com/view/j/itit.2016.58.issue-2/itit-2015-0051/itit-2015-0051.xml}, timestamp = {Fri, 06 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/it/Graffi16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2016--Graffi16--Decentralized-Communication-Against-Surveillance-and-Privacy-Violation.pdf} } -
Conference paper · 2016Coupled Simulation of Mobile Cellular Networks, Road Traffic and V2x Applications using TracesAbstract
The development and evaluation of Vehicle-to-X (V2X) applications using mobile cellular networks by means of field tests is time consuming and expensive. Simulations can speed up the development and largely reduce evaluation costs. However, due to the complex nature of the network involved, it is quite difficult to be certain that the results obtained using simulation will actually match the observable behaviour in the real world. In this paper, we introduce a novel trace-based simulation environment for V2X applications using mobile cellular networks. It employs real world measurement traces as a basis and thus avoids many uncertainties of other simulation approaches. Estimating the impact of a particular V2X application is a pivotal question in the context of vehicular communication. While this question can be addressed using field tests like where a large number of equipped vehicles conduct planned experiments in various locations, those field tests are costly and time consuming. It is quite unlikely that this approach can be used for each V2X application that is developed in the As an alternative to field tests during V2X application development, simulations could be used. However, the maturity and accuracy of simulation approaches for V2X applications is very heterogeneous, depending on the underlying communication technology.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Communications — IEEE ICC
- Venue in bibliography
- 2016 IEEE International Conference on Communications, ICC 2016, Kuala Lumpur, Malaysia, May 22-27, 2016
- DOI
- 10.1109/ICC.2016.7511126
- Pages
- 1--7
- Publisher
- IEEE
- DBLP key
- DBLP:conf/icc/GoebelBMG16
@inproceedings{DBLP:conf/icc/GoebelBMG16, author = {Norbert Goebel and Raphael Bialon and Martin Mauve and Kalman Graffi}, title = {{Coupled Simulation of Mobile Cellular Networks, Road Traffic and {V2x} Applications using Traces}}, booktitle = {2016 {IEEE} International Conference on Communications, {ICC} 2016, Kuala Lumpur, Malaysia, May 22-27, 2016}, pages = {1--7}, publisher = {{IEEE}}, year = {2016}, url = {https://doi.org/10.1109/ICC.2016.7511126}, doi = {10.1109/ICC.2016.7511126}, timestamp = {Wed, 16 Oct 2019 14:14:50 +0200}, biburl = {https://dblp.org/rec/conf/icc/GoebelBMG16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2016--GoebelBMG16--Coupled-Simulation-of-Mobile-Cellular-Networks-Road-Traffic-and-V2x-Applications-using-Traces.pdf} } -
Conference paper · 2016Convex Hull Watchdog: Mitigation of Malicious Nodes in Tree-Based P2P Monitoring SystemsAbstract
Monitoring the global state in peer-to-peer networks through decentralized mechanisms allows targeted optimization and improvement of the peer-to-peer network. However, malicious nodes could aim to distort the process of gathering the global state through monitoring. In this paper we propose DOMiNo, a security solution for tree-based peer-to-peer monitoring mechanisms. It passively listens to incoming events, e.g. data, and rates its suspiciousness based on outlier detection, structural verification and sanity check mechanisms. For our main objective, which is to limit the monitoring error of the desired global view, we performed an extensive evaluation. Evaluation shows tolerance with normal fluctuations but effective filtering of outliers, that severely influence the global view. As our watchdog solution operates passively, we do not add any costs nor create new surface for attacks to the monitoring system. Peer-to-peer (P2P) networks offer many advantages compared to client-server network models. They are able to build networks using only the capacities of every single peer participating in the network and build up applications with a minimum of operational costs. However, as no central instance is present it is hard to manage these networks to offer a certain Quality of Service.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — Conference on Local Computer Networks — LCN
- Venue in bibliography
- 41st IEEE Conference on Local Computer Networks, LCN 2016, Dubai, United Arab Emirates, November 7-10, 2016
- DOI
- 10.1109/LCN.2016.16
- Pages
- 52--60
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/lcn/DisterhoftG16
@inproceedings{DBLP:conf/lcn/DisterhoftG16, author = {Andreas Disterh{\"{o}}ft and Kalman Graffi}, title = {{Convex Hull Watchdog: Mitigation of Malicious Nodes in Tree-Based {P2P} Monitoring Systems}}, booktitle = {41st {IEEE} Conference on Local Computer Networks, {LCN} 2016, Dubai, United Arab Emirates, November 7-10, 2016}, pages = {52--60}, publisher = {{IEEE} Computer Society}, year = {2016}, url = {https://doi.org/10.1109/LCN.2016.16}, doi = {10.1109/LCN.2016.16}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/lcn/DisterhoftG16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2016--DisterhoftG16--Convex-Hull-Watchdog-Mitigation-of-Malicious-Nodes-in-Tree-Based-P2P-Monitoring-Systems.pdf} } -
Conference paper · 2016Analysis of Buffer Management Policies for Opportunistic NetworksAbstract
Opportunistic Networks are a subclass of delay tolerant networks, which aims at wireless data delivery in severely partitioned networks. Messages are routed on a best effort basis. If nodes cannot forward messages due to missing connectivity, the messages are buffered according to a queue policy, and scheduled for transmission once there is a connection again. In case of congestion, nodes drop messages based on a drop policy. The scheduling and the drop policy form together the buffer management policy, which has an impact on routing performance. Although a multitude of different policies exist, there has not yet been a comprehensive study regarding routing performance, which compares all possible policies against each other. In this paper, we conduct this comprehensive study and investigate the impact of the various parameters a message has, namely the arrival time, replication count, number of relayed nodes, time to live and message size, on the performance of the routing in an opportunistic network. In specific, this paper analyzes epidemic routing with 121 different policies and compares them in terms of delivery ratio, overhead and latency in three use cases. Evaluation shows the strengths and weaknesses of the various buffer management policies and highlights, that there is not one policy that is always to recommend.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Computer Communication and Networks — ICCCN
- Venue in bibliography
- 25th International Conference on Computer Communication and Networks, ICCCN 2016, Waikoloa, HI, USA, August 1-4, 2016
- DOI
- 10.1109/ICCCN.2016.7568494
- Pages
- 1--8
- Publisher
- IEEE
- DBLP key
- DBLP:conf/icccn/SatiPG16
@inproceedings{DBLP:conf/icccn/SatiPG16, author = {Salem Sati and Christopher Probst and Kalman Graffi}, title = {{Analysis of Buffer Management Policies for Opportunistic Networks}}, booktitle = {25th International Conference on Computer Communication and Networks, {ICCCN} 2016, Waikoloa, HI, USA, August 1-4, 2016}, pages = {1--8}, publisher = {{IEEE}}, year = {2016}, url = {https://doi.org/10.1109/ICCCN.2016.7568494}, doi = {10.1109/ICCCN.2016.7568494}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icccn/SatiPG16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2016--SatiPG16--Analysis-of-Buffer-Management-Policies-for-Opportunistic-Networks.pdf} } -
Report · 2016Aggregation and Map-Matching of Mobile Cellular Network TracesAbstract
The trace-based simulation of Vehicle-to-X (V2X) applications relies on sound traces in a format usable by the simulation framework. However traces normally use gps coordinates and traffic simulators operate on graph based road networks. Furthermore positions gathered using gps are error prone. Thus some post-processing of the traces has to be conducted to mapmatch and prepare them for the V2X simulation framework. In this paper, we introduce our post-processing techniques used to make traces generated by the Rate Measurement Framework (RMF) available to our trace-based simulation environment. Furthermore we present a walk-through usage example of our A fundamentally important requirement for trace-based simulations are sound traces in a format usable by the simulation model. While high quality network traces of high volatile networks can be obtained by various means, they often need to be aggregated to be useful for the simulation model. Network traces for trace-based simulation of V2X communication add the challenge of map-matching, where Global Positioning System (GPS) coordinates need to be matched onto a road network graph. We utilize the RMF [1] to obtain high quality network traces of mobile cellular networks while being on the road.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- Heinrich-Heine-Universität Düsseldorf — Computer Science Department, Computer Networks Group
- Venue in bibliography
- Heinrich Heine University Düsseldorf, Computer Science Department, Computer Networks Group
- Number
- TR-2016-001
- DBLP key
- DBLP:tr/hhu/GoebelSMG16
@techreport{DBLP:tr/hhu/GoebelSMG16, author = {Norbert Goebel and Adrian Skuballa and Martin Mauve and Kalman Graffi}, title = {{Aggregation and Map-Matching of Mobile Cellular Network Traces}}, institution = {Heinrich Heine University D{\"{u}}sseldorf, Computer Science Department, Computer Networks Group}, type = {Technical Report}, number = {TR-2016-001}, address = {D{\"{u}}sseldorf, Germany}, month = {jul}, year = {2016}, file = {2016--GoebelSMG16--Aggregation-and-Map-Matching-of-Mobile-Cellular-Network-Traces.pdf} } -
Conference paper · 2015SandMash: An Approach for Mashups Techniques on SmartphonesAbstract
Supporting Mashup on mobile devices allows supporting advanced use cases and thus to accelerate the creation and combination of smart mobile applications. In this paper, we evaluate the three clientside Mashups proposals JS.JS, OMash and SMash on mobile devices. Our evaluation on mobile devices shows that the SMash proposal by IBM is reasonably suited for mobile mashups development as it requires less amount of effort from developers and at the same time it has cross-mobile-browser compatibility. In order to address the security, we integrated a sandbox functionality. We have modified the OpenAjax JavaScript library proposed in SMash and have added support of HTML5 hiframei tag’s ”sandbox” attribute to it. hiframei “sandbox” attribute, mobile mashups developers can restrict the framed-content (which may not be trustworthy) in a low-privileged environment. We demonstrate our proposal on a mobile mashup application that integrates content from three different providers (i.e., News, Stock and Weather service).
taken from the linked PDF
Details
- Venue series
- International Conference on Mobile Web and Intelligent Information Systems — MobiWis
- Venue in bibliography
- Mobile Web and Intelligent Information Systems - 12th International Conference, MobiWis 2015, Rome, Italy, August 24-26, 2015, Proceedings
- DOI
- 10.1007/978-3-319-23144-0_19
- Pages
- 211--217
- Volume
- 9228
- Publisher
- Springer
- DBLP key
- DBLP:conf/mobiwis/AliG15
@inproceedings{DBLP:conf/mobiwis/AliG15, author = {Raed Ali and Kalman Graffi}, title = {{SandMash: An Approach for Mashups Techniques on Smartphones}}, booktitle = {Mobile Web and Intelligent Information Systems - 12th International Conference, MobiWis 2015, Rome, Italy, August 24-26, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9228}, pages = {211--217}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-23144-0_19}, doi = {10.1007/978-3-319-23144-0_19}, timestamp = {Wed, 25 Sep 2019 18:14:19 +0200}, biburl = {https://dblp.org/rec/conf/mobiwis/AliG15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2015--AliG15--SandMash-An-Approach-for-Mashups-Techniques-on-Smartphones.pdf} } -
Conference paper · 2015Protected Chords in the Web: Secure P2P Framework for Decentralized Online Social NetworksAbstract
Online social networks have emerged as a main solutions are prone to censorship, privacy violations and unwanted marketing of the users data, decentralized solutions, e.g. based on p2p technology, promise to overcome these limitations. One major shortcoming is the need to install additional software, which is progressively not accepted by users which are used to web-based applications. In this paper, we present how WebRTC can be used to implement an installation-free, fully decentralized online social network. With WebRTC, standard browsers can communicate directly, which allows to construct PKI secured p2p overlays with replicated and access-controlled, reliable storage. Evaluation shows that our approach is scalable in terms of the number of users and complies with performance requirements stated to today’s social networks. solutions, which unfortunately carry the risk of information leakage, data misuse and spying on the users due to the central access of the provider. Provider of current social networking sites or communication tools, such as Facebook or Skype, have an interest in using the user’s data for marketing purposes as well as an obligation to hand over all information and communication details to national security organizations.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Peer-to-Peer Computing — IEEE P2P
- Venue in bibliography
- 2015 IEEE International Conference on Peer-to-Peer Computing, P2P 2015, Boston, MA, USA, September 21-25, 2015
- DOI
- 10.1109/P2P.2015.7328520
- Pages
- 1--5
- Publisher
- IEEE
- DBLP key
- DBLP:conf/p2p/DisterhoftG15
@inproceedings{DBLP:conf/p2p/DisterhoftG15, author = {Andreas Disterh{\"{o}}ft and Kalman Graffi}, title = {{Protected Chords in the Web: Secure {P2P} Framework for Decentralized Online Social Networks}}, booktitle = {2015 {IEEE} International Conference on Peer-to-Peer Computing, {P2P} 2015, Boston, MA, USA, September 21-25, 2015}, pages = {1--5}, publisher = {{IEEE}}, year = {2015}, url = {https://doi.org/10.1109/P2P.2015.7328520}, doi = {10.1109/P2P.2015.7328520}, timestamp = {Wed, 16 Oct 2019 14:14:52 +0200}, biburl = {https://dblp.org/rec/conf/p2p/DisterhoftG15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2015--DisterhoftG15--Protected-Chords-in-the-Web-Secure-P2P-Framework-for-Decentralized-Online-Social-Networks.pdf} } -
Conference paper · 2015FRoDO: Friendly Routing over Dunbar-Based OverlaysAbstract
Centralized Online Social Networks (OSNs) have become the main communication channel in both the personal and the business domain. A current trend for developing OSN services is towards the distribution of the social network infrastructure by using P2P architectures as basis for Distributed Online Social Networks (DOSNs). One of the main challenges of DOSNs comes from guaranteeing privacy and protection of private data. In previous work [18], we proposed a Dunbar-based approach to preserve data availability in DOSNs. Using Dunbar’s circles of intimacy a certain level of trust is ensured which bases on the users confidence in their friends. Now, to achieve privacy and anonymity, we focus on the incorporation of social contacts into existing Peer-to-Peer Overlays and show that a naive integration of social links into existing Overlays like Chord and Pastry is not satisfactory. In order to address drawbacks of the naive approach we introduce goLLuM, a general solution which can be used on top of existing structured and unstructured P2P networks. Our protocol enables to route messages via friendly nodes only, even if only few friends per node exist.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — Conference on Local Computer Networks — LCN
- Venue in bibliography
- 40th IEEE Conference on Local Computer Networks, LCN 2015, Clearwater Beach, FL, USA, October 26-29, 2015
- DOI
- 10.1109/LCN.2015.7366330
- Pages
- 356--364
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/lcn/AmftGGR15
@inproceedings{DBLP:conf/lcn/AmftGGR15, author = {Tobias Amft and Barbara Guidi and Kalman Graffi and Laura Ricci}, title = {{FRoDO: Friendly Routing over Dunbar-Based Overlays}}, booktitle = {40th {IEEE} Conference on Local Computer Networks, {LCN} 2015, Clearwater Beach, FL, USA, October 26-29, 2015}, pages = {356--364}, publisher = {{IEEE} Computer Society}, year = {2015}, url = {https://doi.org/10.1109/LCN.2015.7366330}, doi = {10.1109/LCN.2015.7366330}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/lcn/AmftGGR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2015--AmftGGR15--FRoDO-Friendly-Routing-over-Dunbar-Based-Overlays.pdf} } -
Conference paper · 2015Chunked-Swarm: Divide and Conquer for Real-Time Bounds in Video StreamingAbstract
Live user-generated video streaming platforms like Twitch.tv generate a large portion of the Internet traffic. Millions of viewers daily watch user channels, although roughly 85 % of all channels have less than 200 views during one session. Due to latency, Twitch.tv provides one or more servers for each of Twitch.tv’s supported countries. An alternative approach could enable peer-to-peer communication in order to utilize the capacities of the user devices. Solutions up to now, mainly offer only best effort delay guarantees on the distribution speed from initial seeders to all peers. In this paper, we present Chunked-Swarm, a swarm-based approach, which aims to offer predictable streaming delays, independently of the number of peers. Evaluation shows the various impact of the number of peers, number of video parts and chunks on the streaming delay. Being able to hold specific deadlines for up to 200 peers, predestines our solution to be suitable for the majority of Twitch.tv’s channels.
taken from the linked PDF
Details
- Venue series
- IFIP — International Conference on the Internet of Things, Smart Spaces and Next Generation Networks and Systems — NEW2AN/ruSMART
- Venue in bibliography
- Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 15th International Conference, NEW2AN 2015, and 8th Conference, ruSMART 2015, St. Petersburg, Russia, August 26-28, 2015, Proceedings
- DOI
- 10.1007/978-3-319-23126-6_18
- Pages
- 198--210
- Volume
- 9247
- Publisher
- Springer
- DBLP key
- DBLP:conf/new2an/ProbstDG15
@inproceedings{DBLP:conf/new2an/ProbstDG15, author = {Christopher Probst and Andreas Disterh{\"{o}}ft and Kalman Graffi}, title = {{Chunked-Swarm: Divide and Conquer for Real-Time Bounds in Video Streaming}}, booktitle = {Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 15th International Conference, {NEW2AN} 2015, and 8th Conference, ruSMART 2015, St. Petersburg, Russia, August 26-28, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9247}, pages = {198--210}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-23126-6_18}, doi = {10.1007/978-3-319-23126-6_18}, timestamp = {Sat, 19 Oct 2019 20:32:03 +0200}, biburl = {https://dblp.org/rec/conf/new2an/ProbstDG15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2015--ProbstDG15--Chunked-Swarm-Divide-and-Conquer-for-Real-Time-Bounds-in-Video-Streaming.pdf} } -
Conference paper · 2015Adapting the Beacon Interval for Opportunistic Network CommunicationsAbstract
A dominant trend nowadays is the rapid spread of small devices, such as laptops and smartphones, carried by people. The users’ need for applications with local highbandwidth requirements and due to limited wireless Internet access, a challenge if identified which is critical for the success of applications such as local wireless data synchronization, gaming or communication. Opportunistic networks provide a solution to localized wireless communication between smart devices. The opportunistic communication between two encountered devices are commonly accomplished by using a radio technology such as Wi-Fi or Bluetooth. One issue involved in device-to-device communication is improving the connection establishment in a mobile opportunistic network with minimum resource consumption. This paper includes a proposal and empirical analysis of the beaconing in opportunistic communication using Wi-Fi technology in the infrastructure mode. With our analysis of the MAC layer, we aim at improving the connection establishment between two adjacent nodes. Precisely, the broadcasting beacon frame is sent by the master device to discover neighbors (stations) at fixed intervals. The contribution of this paper is to propose and evaluate a double hundred kilo beacon interval for opportunistic network communications.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Advances in Computing, Communications and Informatics — ICACCI
- Venue in bibliography
- 2015 International Conference on Advances in Computing, Communications and Informatics, ICACCI 2015, Kochi, India, August 10-13, 2015
- DOI
- 10.1109/ICACCI.2015.7275576
- Pages
- 6--12
- Publisher
- IEEE
- DBLP key
- DBLP:conf/icacci/SatiG15
@inproceedings{DBLP:conf/icacci/SatiG15, author = {Salem Sati and Kalman Graffi}, title = {{Adapting the Beacon Interval for Opportunistic Network Communications}}, booktitle = {2015 International Conference on Advances in Computing, Communications and Informatics, {ICACCI} 2015, Kochi, India, August 10-13, 2015}, pages = {6--12}, publisher = {{IEEE}}, year = {2015}, url = {https://doi.org/10.1109/ICACCI.2015.7275576}, doi = {10.1109/ICACCI.2015.7275576}, timestamp = {Wed, 24 Apr 2024 14:55:54 +0200}, biburl = {https://dblp.org/rec/conf/icacci/SatiG15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2015--SatiG15--Adapting-the-Beacon-Interval-for-Opportunistic-Network-Communications.pdf} } -
Conference paper · 2015A Systematic Quality Analysis of Virtual Desktop Infrastructure TechnologiesAbstract
The Virtual Desktop Infrastructure is a promising technology hosted by powerful servers or within the cloud that allows remote and potentially weak devices to run their virtualized desktop environment on a powerful machine. Mainly used in commercial environments, i.e. enterprises, also private users might be interested in this functionality. The benefits are given through customizable (virtual) hardware resources on the fly while maintaining a long lasting desktop environment. Hardware failures, resource limitations and risks due to damages to the physical hardware are omitted with desktops running upon a Virtual Desktop Infrastructure. Currently, many Virtual Desktop Infrastructure solutions are available, most important of which are XenDesktop by Citrix, Horizon View by VMware, and VDI by Microsoft. In this article, we deploy and systematically evaluate the quality of these solutions in terms of streaming quality under the workload of popular application types and under the influence of various network conditions. We conclude that XenDesktop by Citrix is performing best, Horizon View by VMware is close, but provides less features, while VDI by Microsoft is both limited in its quality and its functionality.
taken from the linked PDF
Details
- Venue series
- International Workshops on Parallel Processing — Euro-Par
- Venue in bibliography
- Euro-Par 2015: Parallel Processing Workshops - Euro-Par 2015 International Workshops, Vienna, Austria, August 24-25, 2015, Revised Selected Papers
- DOI
- 10.1007/978-3-319-27308-2_26
- Pages
- 311--323
- Volume
- 9523
- Publisher
- Springer
- DBLP key
- DBLP:conf/europar/SheikholeslamiG15
@inproceedings{DBLP:conf/europar/SheikholeslamiG15, author = {Arman Sheikholeslami and Kalman Graffi}, title = {{A Systematic Quality Analysis of Virtual Desktop Infrastructure Technologies}}, booktitle = {Euro-Par 2015: Parallel Processing Workshops - Euro-Par 2015 International Workshops, Vienna, Austria, August 24-25, 2015, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9523}, pages = {311--323}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-27308-2_26}, doi = {10.1007/978-3-319-27308-2_26}, timestamp = {Tue, 14 May 2019 10:00:46 +0200}, biburl = {https://dblp.org/rec/conf/europar/SheikholeslamiG15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2015--SheikholeslamiG15--A-Systematic-Quality-Analysis-of-Virtual-Desktop-Infrastructure-Technologies.pdf} } -
Conference paper · 2014Trace-based Simulation of C2X-Communication using Cellular NetworksAbstract
Simulation of cellular network communication is complex and typically requires a high degree of knowledge about the underlying network and its parameters. At the same time simulating cellular networks is important for the automotive industry in order to be able to test the feasibility of applications that use car-to-x-communication applications before performing costly field tests. In this paper we propose a trace-based simulation model derived from real-world measurements. It does not require any information about the network besides information that can be readily measured by a regular user, it is much faster than regular simulation, and it has been validated by comparing simulation results to real world measurements. In the context of Car-to-X (C2X) communications, the impact of a particular C2X application is a pivotal question that needs to be answered in the development process. To this end, it is vital to get a thorough understanding of the underlying communication channel. Currently, C2X applications utilize either local, ad-hoc short-range communication (e. g., IEEE 802.11p) or conventional cellular mobile communication (e. g., GPRS, UMTS or LTE).
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IFIP/IEEE — Conference on Wireless On-demand Network Systems and Services — WONS
- Venue in bibliography
- 11th Annual Conference on Wireless On-demand Network Systems and Services, WONS 2014, Obergurgl, Austria, April 2-4, 2014
- DOI
- 10.1109/WONS.2014.6814730
- Pages
- 108--115
- Publisher
- IEEE
- DBLP key
- DBLP:conf/wons/GoebelKMG14
@inproceedings{DBLP:conf/wons/GoebelKMG14, author = {Norbert Goebel and Markus Koegel and Martin Mauve and Kalman Graffi}, title = {{Trace-based Simulation of C2X-Communication using Cellular Networks}}, booktitle = {11th Annual Conference on Wireless On-demand Network Systems and Services, {WONS} 2014, Obergurgl, Austria, April 2-4, 2014}, pages = {108--115}, publisher = {{IEEE}}, year = {2014}, url = {https://doi.org/10.1109/WONS.2014.6814730}, doi = {10.1109/WONS.2014.6814730}, timestamp = {Wed, 16 Oct 2019 14:14:55 +0200}, biburl = {https://dblp.org/rec/conf/wons/GoebelKMG14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2014--GoebelKMG14--Trace-based-Simulation-of-C2X-Communication-using-Cellular-Networks.pdf} } -
Conference paper · 2014The Impact of Routing Attacks on Pastry-Based P2P Online Social NetworksAbstract
Peer-to-Peer (p2p) networks are common in several areas by now. Besides the well-known file sharing platforms, p2p overlays also emerge as a basis for decentralized social networks. In these, the overlay is used as robust storage for several kinds of social information. With gaining relevance, attackers might have an interest in tampering the functionality of the overlay. In this paper we investigate the routing attacks on the distributed hash table Pastry that we use as basis in our p2p social network LifeSocial. We determine through simulations the impact of routing attacks on the performance of the overlay.
taken from the linked PDF
Details
- Venue series
- International Workshops on Parallel Processing — Euro-Par
- Venue in bibliography
- Euro-Par 2014: Parallel Processing Workshops - Euro-Par 2014 International Workshops, Porto, Portugal, August 25-26, 2014, Revised Selected Papers, Part I
- DOI
- 10.1007/978-3-319-14325-5_30
- Pages
- 347--358
- Volume
- 8805
- Publisher
- Springer
- DBLP key
- DBLP:conf/europar/EichertMG14
@inproceedings{DBLP:conf/europar/EichertMG14, author = {Felix A. Eichert and Markus Monhof and Kalman Graffi}, title = {{The Impact of Routing Attacks on Pastry-Based {P2P} Online Social Networks}}, booktitle = {Euro-Par 2014: Parallel Processing Workshops - Euro-Par 2014 International Workshops, Porto, Portugal, August 25-26, 2014, Revised Selected Papers, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {8805}, pages = {347--358}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-14325-5_30}, doi = {10.1007/978-3-319-14325-5_30}, timestamp = {Sun, 12 Nov 2023 02:07:45 +0100}, biburl = {https://dblp.org/rec/conf/europar/EichertMG14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2014--EichertMG14--The-Impact-of-Routing-Attacks-on-Pastry-Based-P2P-Online-Social-Networks.pdf} } -
Conference paper · 2014Secure Distributed Data Structures for Peer-to-Peer-based Social NetworksAbstract
Online social networks are attracting billions of nowadays, both on a global scale as well as in social enterprise networks. Using distributed hash tables and peer-to-peer technology allows online social networks to be operated securely and efficiently only by using the resources of the user devices, thus alleviating censorship or data misuse by a single network operator. In this paper, we address the challenges that arise in implementing reliably and conveniently to use distributed data structures, such as lists or sets, in such a distributed hash-tablebased online social network. We present a secure, distributed list data structure that manages the list entries in several buckets in the distributed hash table. The list entries are authenticated, integrity is maintained and access control for single users and also groups is integrated. The approach for secure distributed lists is also applied for prefix trees and sets, and implemented and evaluated in a peer-to-peer framework for social networks. Evaluation shows that the distributed data structure is convenient and efficient to use and that the requirements on security hold.
taken from the linked PDF
Details
- Venue series
- IEEE — International Conference on Collaboration Technologies and Systems — CTS
- Venue in bibliography
- 2014 International Conference on Collaboration Technologies and Systems, CTS 2014, Minneapolis, MN, USA, May 19-23, 2014
- DOI
- 10.1109/CTS.2014.6867595
- Pages
- 396--405
- Publisher
- IEEE
- DBLP key
- DBLP:conf/cts/JaniukMG14
@inproceedings{DBLP:conf/cts/JaniukMG14, author = {Jens Janiuk and Alexander M{\"{a}}cker and Kalman Graffi}, title = {{Secure Distributed Data Structures for Peer-to-Peer-based Social Networks}}, booktitle = {2014 International Conference on Collaboration Technologies and Systems, {CTS} 2014, Minneapolis, MN, USA, May 19-23, 2014}, pages = {396--405}, publisher = {{IEEE}}, year = {2014}, url = {https://doi.org/10.1109/CTS.2014.6867595}, doi = {10.1109/CTS.2014.6867595}, timestamp = {Wed, 16 Oct 2019 14:14:53 +0200}, biburl = {https://dblp.org/rec/conf/cts/JaniukMG14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2014--JaniukMG14--Secure-Distributed-Data-Structures-for-Peer-to-Peer-based-Social-Networks.pdf} } -
Conference paper · 2014HSkip+: A Self-stabilizing Overlay Network for Nodes with Heterogeneous BandwidthsAbstract
In this paper we present and analyze HSkip+, a self-stabilizing overlay network for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology as the Skip+ graph proposed by Jacob et al. [1] but its self-stabilization mechanism significantly outperforms the self-stabilization mechanism proposed for Skip+. Also, the nodes are now ordered according to their bandwidths and not according to their identifiers. Various other solutions have already been proposed for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing. In addition to HSkip+ being self-stabilizing, its performance is on par with the best previous bounds on the time and work for joining or leaving a network of peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation and congestion for routing messages is on par with the best previous bounds for such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical investigations are backed by simulations demonstrating that HSkip+ is indeed performing much better than Skip+ and working correctly under high churn rates. Peer-to-peer systems have become very popular for a variety of reasons.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Peer-to-Peer Computing — IEEE P2P
- Venue in bibliography
- 14th IEEE International Conference on Peer-to-Peer Computing, P2P 2014, London, United Kingdom, September 9-11, 2014, Proceedings
- DOI
- 10.1109/P2P.2014.6934300
- Pages
- 1--10
- Publisher
- IEEE
- DBLP key
- DBLP:conf/p2p/FeldottoSG14
@inproceedings{DBLP:conf/p2p/FeldottoSG14, author = {Matthias Feldotto and Christian Scheideler and Kalman Graffi}, title = {{HSkip+: {A} Self-stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}}, booktitle = {14th {IEEE} International Conference on Peer-to-Peer Computing, {P2P} 2014, London, United Kingdom, September 9-11, 2014, Proceedings}, pages = {1--10}, publisher = {{IEEE}}, year = {2014}, url = {https://doi.org/10.1109/P2P.2014.6934300}, doi = {10.1109/P2P.2014.6934300}, timestamp = {Wed, 16 Oct 2019 14:14:52 +0200}, biburl = {https://dblp.org/rec/conf/p2p/FeldottoSG14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2014--FeldottoSG14--HSkip-A-Self-stabilizing-Overlay-Network-for-Nodes-with-Heterogeneous-Bandwidths.pdf} } -
Journal article · 2014HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous BandwidthsAbstract
In this paper we present and analyze HSkip+, a self-stabilizing overlay network for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology as the Skip+ graph proposed by Jacob et al. [1] but its self-stabilization mechanism significantly outperforms the self-stabilization mechanism proposed for Skip+. Also, the nodes are now ordered according to their bandwidths and not according to their identifiers. Various other solutions have already been proposed for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing. In addition to HSkip+ being self-stabilizing, its performance is on par with the best previous bounds on the time and work for joining or leaving a network of peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation and congestion for routing messages is on par with the best previous bounds for such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical investigations are backed by simulations demonstrating that HSkip+ is indeed performing much better than Skip+ and working correctly under high churn rates. Peer-to-peer systems have become very popular for a variety of reasons.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- arXiv — Preprints (Computer Science) — CoRR
- Venue in bibliography
- CoRR
- Volume
- abs/1408.0395
- DBLP key
- DBLP:journals/corr/FeldottoSG14
@article{DBLP:journals/corr/FeldottoSG14, author = {Matthias Feldotto and Christian Scheideler and Kalman Graffi}, editor = {}, title = {{HSkip+: {A} Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}}, journal = {CoRR}, volume = {abs/1408.0395}, year = {2014}, url = {http://arxiv.org/abs/1408.0395}, eprinttype = {arXiv}, eprint = {1408.0395}, timestamp = {Tue, 17 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/FeldottoSG14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2014--FeldottoSG14--HSkip-A-Self-Stabilizing-Overlay-Network-for-Nodes-with-Heterogeneous-Bandwidths.pdf} } -
Conference paper · 2014Data Aggregation in VANETs: A Generalized Framework for Channel Load Adaptive SchemesAbstract
One of the main communication challenges in vehicleto-x communication is scalability. With increasing number of communication nodes the wireless channel must not get congested especially if a large amount of sensor data has to be forwarded over multiple nodes to a data processing application. This challenge can be solved by reducing the data load through data aggregation. This work introduces a framework for data aggregation as a decentralized congestion control mechanism on the application layer. This framework can be used to flexibly design aggregation schemes that adaptively adjust the generated data load depending on the overall channel load. Three basic aggregation schemes with different complexity and resulting data precision were developed within this framework and they are discussed in this paper. Performance evaluations show that the aggregation schemes are able to adapt to given channel load thresholds within seconds and deliver optimal data quality even in traffic jam situations.
taken from the linked PDF
Details
- Venue series
- IEEE — Conference on Local Computer Networks — LCN
- Venue in bibliography
- IEEE 39th Conference on Local Computer Networks, LCN 2014, Edmonton, AB, Canada, 8-11 September, 2014
- DOI
- 10.1109/LCN.2014.6925800
- Pages
- 394--397
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/lcn/JiruBG14
@inproceedings{DBLP:conf/lcn/JiruBG14, author = {Josef Jiru and Lars Bremer and Kalman Graffi}, title = {{Data Aggregation in VANETs: A Generalized Framework for Channel Load Adaptive Schemes}}, booktitle = {{IEEE} 39th Conference on Local Computer Networks, {LCN} 2014, Edmonton, AB, Canada, 8-11 September, 2014}, pages = {394--397}, publisher = {{IEEE} Computer Society}, year = {2014}, url = {https://doi.org/10.1109/LCN.2014.6925800}, doi = {10.1109/LCN.2014.6925800}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/lcn/JiruBG14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2014--JiruBG14--Data-Aggregation-in-VANETs-A-Generalized-Framework-for-Channel-Load-Adaptive-Schemes.pdf} } -
Conference paper · 2013Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia CaseAbstract
Cloud computing offers high availability, dynamic scalability, and elasticity requiring only very little administration. However, this service comes with financial costs. Peer-to-peer systems, in contrast, operate at very low costs but cannot match the quality of service of the cloud. This paper focuses on the case study of Wikipedia and presents an approach to reduce the operational costs of hosting similar websites in the cloud by using a practical peer-to-peer approach. The visitors of the site are joining a Chord overlay, which acts as first cache for article lookups. Simulation results show, that up to 72% of the article lookups in Wikipedia could be answered by other visitors instead of using the cloud. The cloud offers elasticity, scalability, and robustness to failures. These properties address and solve the traditional shortcomings of centralized architectures. Previously, peer-topeer (p2p) systems have been discussed in the last decade to reach same goals. Both paradigms fit to serve millions of users with desired content. However, success of p2p is found only in specific application areas. The cloud instead offers controlled quality of service, which comes with corresponding operational costs for storage and bandwidth. While p2p operates at “no” costs, one cannot match the quality of service of the cloud as all data serving relies on unreliable user devices.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Communications — IEEE ICC
- Venue in bibliography
- Proceedings of IEEE International Conference on Communications, ICC 2013, Budapest, Hungary, June 9-13, 2013
- DOI
- 10.1109/ICC.2013.6655082
- Pages
- 3444--3449
- Publisher
- IEEE
- DBLP key
- DBLP:conf/icc/BremerG13
@inproceedings{DBLP:conf/icc/BremerG13, author = {Lars Bremer and Kalman Graffi}, title = {{Symbiotic Coupling of {P2P} and Cloud Systems: The Wikipedia Case}}, booktitle = {Proceedings of {IEEE} International Conference on Communications, {ICC} 2013, Budapest, Hungary, June 9-13, 2013}, pages = {3444--3449}, publisher = {{IEEE}}, year = {2013}, url = {https://doi.org/10.1109/ICC.2013.6655082}, doi = {10.1109/ICC.2013.6655082}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icc/BremerG13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2013--BremerG13--Symbiotic-Coupling-of-P2P-and-Cloud-Systems-The-Wikipedia-Case.pdf} } -
Conference paper · 2013Hash-Based File Content Identification Using Distributed SystemsAbstract
A serious problem in digital forensics is handling very large amounts of data. Since forensic investigators often have to analyze several terabytes of data within a single case, efficient and effective tools for automatic data identification or filtering are very important. A commonly used data identification technique is using the cryptographic hash of a file and match it against white and black lists containing hashes of files with harmless or harmful/illegal content. However, such lists are never complete and miss the hashes of most existing files. Also, cryptographic hashes can be easily defeated e. g. when used to identify multimedia content. In this work we analyze different distributed systems available in the Internet regarding their suitability to support the identification of file content. We present a framework which is able to support an automatic file content identification by searching for file hashes and collecting, aggregating, and presenting the search results. In our evaluation we were able to identify the content of about 26% of the files of a test set by using found file names which briefly describe the file content. Therefore, our framework can help to significantly reduce the workload of forensic investigators.
taken from the linked PDF
Details
- Venue series
- IFIP — International Conference on Digital Forensics — IFIP WG 11.9
- Venue in bibliography
- Advances in Digital Forensics IX - 9th IFIP WG 11.9 International Conference on Digital Forensics, Orlando, FL, USA, January 28-30, 2013, Revised Selected Papers
- DOI
- 10.1007/978-3-642-41148-9_8
- Pages
- 119--134
- Volume
- 410
- Publisher
- Springer
- DBLP key
- DBLP:conf/ifip11-9/YannikosSSWG13
@inproceedings{DBLP:conf/ifip11-9/YannikosSSWG13, author = {York Yannikos and Jonathan Schluessler and Martin Steinebach and Christian Winter and Kalman Graffi}, title = {{Hash-Based File Content Identification Using Distributed Systems}}, booktitle = {Advances in Digital Forensics {IX} - 9th {IFIP} {WG} 11.9 International Conference on Digital Forensics, Orlando, FL, USA, January 28-30, 2013, Revised Selected Papers}, series = {{IFIP} Advances in Information and Communication Technology}, volume = {410}, pages = {119--134}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-41148-9_8}, doi = {10.1007/978-3-642-41148-9_8}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ifip11-9/YannikosSSWG13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2013--YannikosSSWG13--Hash-Based-File-Content-Identification-Using-Distributed-Systems.pdf} } -
Conference paper · 2013Continuous Gossip-Based Aggregation through Dynamic Information AgingAbstract
Existing solutions for gossip-based aggregation in peer-to-peer networks use epochs to calculate a global estimation from an initial static set of local values. Once the estimation converges system-wide, a new epoch is started with fresh initial values. Long epochs result in precise estimations based on old measurements and short epochs result in imprecise aggregated estimations. In contrast to this approach, we present in this paper a continuous, epoch-less approach which considers fresh local values in every round of the gossip-based aggregation. By using an approach for dynamic information aging, inaccurate values and values from left peers fade from the aggregation memory. Evaluation shows that the presented approach for continuous information aggregation in peer-to-peer systems monitors the system performance precisely, adapts to changes and is lightweight Overlay networks allow the operation of content-centric and communication-centric applications in the Internet. These networks may index content, nodes and users and make them searchable in order to decentrally connect providers and consumers. One important element of a professionally run overlay is the estimation of the performance of the running overlay in terms of quality of service.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Computer Communication and Networks — ICCCN
- Venue in bibliography
- 22nd International Conference on Computer Communication and Networks, ICCCN 2013, Nassau, Bahamas, July 30 - Aug. 2, 2013
- DOI
- 10.1109/ICCCN.2013.6614118
- Pages
- 1--7
- Publisher
- IEEE
- DBLP key
- DBLP:conf/icccn/RappG13
@inproceedings{DBLP:conf/icccn/RappG13, author = {Vitaliy Rapp and Kalman Graffi}, title = {{Continuous Gossip-Based Aggregation through Dynamic Information Aging}}, booktitle = {22nd International Conference on Computer Communication and Networks, {ICCCN} 2013, Nassau, Bahamas, July 30 - Aug. 2, 2013}, pages = {1--7}, publisher = {{IEEE}}, year = {2013}, url = {https://doi.org/10.1109/ICCCN.2013.6614118}, doi = {10.1109/ICCCN.2013.6614118}, timestamp = {Wed, 16 Oct 2019 14:14:49 +0200}, biburl = {https://dblp.org/rec/conf/icccn/RappG13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2013--RappG13--Continuous-Gossip-Based-Aggregation-through-Dynamic-Information-Aging.pdf} } -
Conference paper · 2013Comparative Evaluation of Peer-to-Peer Systems using PeerfactSim.KOMAbstract
Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we enhanced the peerto-peer systems simulator PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate a set of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems. Peer-to-peer (p2p) networks emerged in the early 2000s and shaped the view on large-scale overlay networks. Besides the popular file sharing applications, further use cases also emerged, such as real-time communication [1] or online social networks [2]-[6]. The general strength of p2p overlays is the harness of the overlay network members to create an efficient, cost-free infrastructure to host distributed applications. Also in future, the trend towards decentralized overlays will continue. However, several challenges arise like reliability, availability, robustness and security, among others. In order to address these challenges, several p2p protocols have been proposed.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- International Conference on High Performance Computing & Simulation — HPCS
- Venue in bibliography
- International Conference on High Performance Computing & Simulation, HPCS 2013, Helsinki, Finland, July 1-5, 2013
- DOI
- 10.1109/HPCSIM.2013.6641399
- Pages
- 99--106
- Publisher
- IEEE
- DBLP key
- DBLP:conf/ieeehpcs/FeldottoG13
@inproceedings{DBLP:conf/ieeehpcs/FeldottoG13, author = {Matthias Feldotto and Kalman Graffi}, title = {{Comparative Evaluation of Peer-to-Peer Systems using PeerfactSim.KOM}}, booktitle = {International Conference on High Performance Computing {\&} Simulation, {HPCS} 2013, Helsinki, Finland, July 1-5, 2013}, pages = {99--106}, publisher = {{IEEE}}, year = {2013}, url = {https://doi.org/10.1109/HPCSim.2013.6641399}, doi = {10.1109/HPCSIM.2013.6641399}, timestamp = {Wed, 16 Oct 2019 14:14:54 +0200}, biburl = {https://dblp.org/rec/conf/ieeehpcs/FeldottoG13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2013--FeldottoG13--Comparative-Evaluation-of-Peer-to-Peer-Systems-using-PeerfactSim-KOM.pdf} } -
Conference paper · 2013Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay NetworkAbstract
Self-stabilization is the property of a system to transfer itself regardless of the initial state into a legitimate state. Chord as a simple, decentralized and scalable distributed hash table is an ideal showcase to introduce self-stabilization for p2p overlays. In this paper, we present Re-Chord, a self-stabilizing version of Chord. We show, that the stabilization process is functional, but prone to strong churn. For that, we present CaRe-Chord, a churn resistant version of Re-Chord, that allows the creation of a useful DHT in any kind of graph regardless of the initial state. Simulation results attest the churn resistance and good performance of Ca-Re-Chord. Peer-to-peer (p2p) networks have a long history in networking research. Their main characteristic is the self-organizing approach to interact decentralized and to provide powerful networking functions. Since their advent in the early 2000s, their application range extended from filesharing, multimedia streaming to online social networks [7], sometimes serving several Millions of users using only the resources contributed by the user devices. According to [12], p2p becomes a business relevant paradigm. One main advantage of the p2p paradigm over centralized approaches is the robustness of the network against failures of individual nodes.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- Conference on Networked Systems — NetSys
- Venue in bibliography
- 2013 Conference on Networked Systems, NetSys 2013, Stuttgart, Germany, March 11-15, 2013
- DOI
- 10.1109/NETSYS.2013.11
- Pages
- 27--34
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/kivs/BenterDKKG13
@inproceedings{DBLP:conf/kivs/BenterDKKG13, author = {Markus Benter and Mohammad Divband Soorati and Sebastian Kniesburges and Andreas Koutsopoulos and Kalman Graffi}, title = {{Ca-Re-Chord: {A} Churn Resistant Self-Stabilizing Chord Overlay Network}}, booktitle = {2013 Conference on Networked Systems, NetSys 2013, Stuttgart, Germany, March 11-15, 2013}, pages = {27--34}, publisher = {{IEEE} Computer Society}, year = {2013}, url = {https://doi.org/10.1109/NetSys.2013.11}, doi = {10.1109/NETSYS.2013.11}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/kivs/BenterDKKG13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2013--BenterDKKG13--Ca-Re-Chord-A-Churn-Resistant-Self-Stabilizing-Chord-Overlay-Network.pdf} } -
Conference paper · 2013Bootstrapping SkyNet: Calibration and Autonomic Self-control of Structured Peer-to-Peer NetworksAbstract
Peer-to-peer systems scale to millions of nodes and provide routing and storage functions with best effort quality. In order to provide a guaranteed quality of the overlay functions, even under strong dynamics in the network with regard to peer capacities, online participation and usage patterns, we propose to calibrate the peer-to-peer overlay and to autonomously learn which qualities can be reached. For that, we simulate the peerto-peer overlay systematically under a wide range of parameter configurations and use neural networks to learn the effects of the configurations on the quality metrics. Thus, by choosing a specific quality setting by the overlay operator, the network can tune itself to the learned parameter configurations that lead to the desired quality. Evaluation shows that the presented self-calibration succeeds in learning the configuration-quality interdependencies and that peer-to-peer systems can learn and adapt their behavior according to desired quality goals. Peer-to-peer (p2p) systems have gained a lot of attention in the last decade, supporting large-scale networks for various Kademlia, are used to connect all nodes in the p2p system. Most of these overlays are exhaustively configurable, ranging from routing table sizes, timeouts or, if enhanced, also in the strategies of how to choose contacts.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Peer-to-Peer Computing — IEEE P2P
- Venue in bibliography
- 13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013, Trento, Italy, September 9-11, 2013, Proceedings
- DOI
- 10.1109/P2P.2013.6688720
- Pages
- 1--5
- Publisher
- IEEE
- DBLP key
- DBLP:conf/p2p/KlerxG13
@inproceedings{DBLP:conf/p2p/KlerxG13, author = {Timo Klerx and Kalman Graffi}, title = {{Bootstrapping SkyNet: Calibration and Autonomic Self-control of Structured Peer-to-Peer Networks}}, booktitle = {13th {IEEE} International Conference on Peer-to-Peer Computing, {IEEE} {P2P} 2013, Trento, Italy, September 9-11, 2013, Proceedings}, pages = {1--5}, publisher = {{IEEE}}, year = {2013}, url = {https://doi.org/10.1109/P2P.2013.6688720}, doi = {10.1109/P2P.2013.6688720}, timestamp = {Wed, 16 Oct 2019 14:14:52 +0200}, biburl = {https://dblp.org/rec/conf/p2p/KlerxG13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2013--KlerxG13--Bootstrapping-SkyNet-Calibration-and-Autonomic-Self-control-of-Structured-Peer-to-Peer-Networks.pdf} } -
Conference paper · 2013Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash TablesAbstract
Distributed hash tables are very versatile to use, as distributed storage is a desirable feature for various applications. Typical structured overlays like Chord, Pastry or Kademlia consider only homogeneous nodes with equal capacities, which does not resemble reality. In a practical use case, nodes might get overloaded by storing popular data. In this paper, we present a general approach to enable capacity awareness and loadbalancing capability of homogeneous structured overlays. We introduce a hierarchical second structured overlay aside, which allows efficient capacity-based access on the nodes in the system as hosting mirrors. Simulation results show that the structured overlay is able to store various contents, such as of a social network, with only a negligible number of overloaded peers. Content, even if very popular, is hosted by easily findable capable peers. Thus, long-existing and well-evaluated overlays like Chord or Pastry can be used to create attractive DHT-based applications. Peer-to-peer (p2p) overlays have been intensively researched in the last decade, mostly in the context of file sharing. With the rise of online social networks, decentralized alternatives are also being reviewed. Online social networks are the most popular web applications nowadays.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- Conference on Networked Systems — NetSys
- Venue in bibliography
- 2013 Conference on Networked Systems, NetSys 2013, Stuttgart, Germany, March 11-15, 2013
- DOI
- 10.1109/NETSYS.2013.9
- Pages
- 35--42
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/kivs/WetteG13
@inproceedings{DBLP:conf/kivs/WetteG13, author = {Philip Wette and Kalman Graffi}, title = {{Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables}}, booktitle = {2013 Conference on Networked Systems, NetSys 2013, Stuttgart, Germany, March 11-15, 2013}, pages = {35--42}, publisher = {{IEEE} Computer Society}, year = {2013}, url = {https://doi.org/10.1109/NetSys.2013.9}, doi = {10.1109/NETSYS.2013.9}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/kivs/WetteG13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2013--WetteG13--Adding-Capacity-Aware-Storage-Indirection-to-Homogeneous-Distributed-Hash-Tables.pdf} } -
Conference paper · 2011Traceability Link Evolution with Version ControlAbstract
Traceability links enable the possibility to trace the evolution of a project from the earliest requirements engineering phase over the design and implementation to the test phases of a project. Having a link between the artifacts resulting from these phases, a requirement can be traced to, e.g., the test report, which tested the code implementing the requirement. However, as the artifacts evolve into new versions the traceability links between these artifacts evolve as well. Concurrent work on the artifacts might result in conflicts which reflects in conflicting versions of the traceability links. Often the artifacts created in different phases of a development process are stored in different repositories. In this paper we present a version control system capable of controlling the evolutionary changes of traceability links which connect artifacts residing in different repositories and resolve the conflicts caused by concurrent work
taken from the linked PDF
Details
- Venue series
- GI — Fachtagung Software Engineering — GI SE
- Venue in bibliography
- Software Engineering 2011 - Workshopband (inkl. Doktorandensymposium), Fachtagung des GI-Fachbereichs Softwaretechnik, 21.-25.02.2011, Karlsruhe
- Pages
- 151--161
- Volume
- P-184
- Publisher
- GI
- DBLP key
- DBLP:conf/se/MukherjeeSKGSS11
@inproceedings{DBLP:conf/se/MukherjeeSKGSS11, author = {Patrick Mukherjee and Karsten Saller and Aleksandra Kovacevic and Kalman Graffi and Andy Sch{\"{u}}rr and Ralf Steinmetz}, title = {{Traceability Link Evolution with Version Control}}, booktitle = {Software Engineering 2011 - Workshopband (inkl. Doktorandensymposium), Fachtagung des GI-Fachbereichs Softwaretechnik, 21.-25.02.2011, Karlsruhe}, series = {{LNI}}, volume = {{P-184}}, pages = {151--161}, publisher = {{GI}}, year = {2011}, url = {https://dl.gi.de/handle/20.500.12116/19883}, timestamp = {Tue, 27 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/se/MukherjeeSKGSS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2011--MukherjeeSKGSS11--Traceability-Link-Evolution-with-Version-Control.pdf} } -
Conference paper · 2011Towards a Biometric RandomNumber Generator - A General Approach For True Random Extraction FromBiometric SamplesAbstract
Biometric systems are per definition used to identify individuals or verify an identity claim – one difficulty of getting reliable decisions is the inherent noise that makes it difficult to extract stable features from biometric data. This paper describes how biometric samples can be used to generate strong random numbers which form the basis of many security protocols. Independent from the biometric modality, the only requirement of the proposed solution are feature vectors of fixed length and structure. Each element of such a feature vector is analyzed for its reliability – only unreliable positions, that cannot be reproduced coherently from one source, are extracted as bits to form the final random bit sequences. Optionally a strong hash-based random extraction can be used. The practicability is shown testing vascular patterns against the NIST-recommended test suite for random number generators.
taken from the linked PDF
Details
- Venue series
- GI — Special Interest Group on Biometrics and Electronic Signatures — BIOSIG
- Venue in bibliography
- BIOSIG 2011 - Proceedings of the Special Interest Group on Biometrics and Electronic Signatures, 08.-09. September 2011 in Darmstadt, Germany
- Pages
- 267--274
- Volume
- P-191
- Publisher
- GI
- DBLP key
- DBLP:conf/biosig/HartungWGP11
@inproceedings{DBLP:conf/biosig/HartungWGP11, author = {Daniel Hartung and Knut Wold and Kalman Graffi and Slobodan Petrovic}, title = {{Towards a Biometric RandomNumber Generator - {A} General Approach For True Random Extraction FromBiometric Samples}}, booktitle = {{BIOSIG} 2011 - Proceedings of the Special Interest Group on Biometrics and Electronic Signatures, 08.-09. September 2011 in Darmstadt, Germany}, series = {{LNI}}, volume = {{P-191}}, pages = {267--274}, publisher = {{GI}}, year = {2011}, url = {https://dl.gi.de/handle/20.500.12116/18550}, timestamp = {Tue, 04 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/biosig/HartungWGP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2011--HartungWGP11--Towards-a-Biometric-RandomNumber-Generator-A-General-Approach-For-True-Random-Extraction-FromBiometric-Samples.pdf} } -
Book chapter · 2011Programming for Distributed Computing: From Physical to Logical NetworksAbstract
No abstract found in the linked PDF.
Details
- Venue series
- Springer Nature — Computer Science
- Venue in bibliography
- Computer Science, The Hardware, Software and Heart of It
- DOI
- 10.1007/978-1-4614-1168-0_9
- Pages
- 155--168
- Publisher
- Springer
- DBLP key
- DBLP:books/sp/cs2011/ScheidelerG11
@incollection{DBLP:books/sp/cs2011/ScheidelerG11, author = {Christian Scheideler and Kalman Graffi}, title = {{Programming for Distributed Computing: From Physical to Logical Networks}}, booktitle = {Computer Science, The Hardware, Software and Heart of It}, pages = {155--168}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-1-4614-1168-0_9}, doi = {10.1007/978-1-4614-1168-0_9}, timestamp = {Tue, 16 May 2017 14:01:44 +0200}, biburl = {https://dblp.org/rec/books/sp/cs2011/ScheidelerG11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2011--ScheidelerG11--Programming-for-Distributed-Computing-From-Physical-to-Logical-Networks.pdf} } -
Conference paper · 2011PeerfactSim.KOM: A P2P System Simulator - Experiences and Lessons LearnedAbstract
No abstract found in the linked PDF.
Details
- Venue series
- IEEE — International Conference on Peer-to-Peer Computing — IEEE P2P
- Venue in bibliography
- 2011 IEEE International Conference on Peer-to-Peer Computing, P2P 2011, Kyoto, Japan, August 31 - September 2, 2011
- DOI
- 10.1109/P2P.2011.6038673
- Pages
- 154--155
- Publisher
- IEEE
- DBLP key
- DBLP:conf/p2p/Graffi11
@inproceedings{DBLP:conf/p2p/Graffi11, author = {Kalman Graffi}, title = {{PeerfactSim.KOM: {A} {P2P} System Simulator - Experiences and Lessons Learned}}, booktitle = {2011 {IEEE} International Conference on Peer-to-Peer Computing, {P2P} 2011, Kyoto, Japan, August 31 - September 2, 2011}, pages = {154--155}, publisher = {{IEEE}}, year = {2011}, url = {https://doi.org/10.1109/P2P.2011.6038673}, doi = {10.1109/P2P.2011.6038673}, timestamp = {Wed, 16 Oct 2019 14:14:52 +0200}, biburl = {https://dblp.org/rec/conf/p2p/Graffi11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2011--Graffi11--PeerfactSim-KOM-A-P2P-System-Simulator-Experiences-and-Lessons-Learned.pdf} } -
Conference paper · 2011LifeSocial.KOM: A Secure and P2P-based Solution for Online Social NetworksAbstract
The phenomenon of online social networks reaches present themselves, their interests and their social links which they use to interact with other users. We present in this paper LifeSocial.KOM, a p2p-based platform for secure online social networks which provides the functionality of common online social networks in a totally distributed and secure manner. It is plugin-based, thus extendible in its functionality, providing secure communication and access-controlled storage as well as monitored quality of service, addressing the needs of both, users and system providers. The platform operates solely on the resources of the users, eliminating the concentration of crucial operational costs for one provider. In a testbed evaluation, we show the feasibility of the approach and point out the potential of the p2p paradigm in the field of online social networks. The influence of Internet applications on daily life is continuously increasing. Starting as a pure communication platform for scientists, it revolutionized both the interaction between the people and the economy. Online social networks allow users to create profiles, link to their friends, publish photos and status updates and various forms of user-to-user interaction. Facebook has the largest user community with more than 450 Million profiles.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — Consumer Communications and Networking Conference — IEEE CCNC
- Venue in bibliography
- 2011 IEEE Consumer Communications and Networking Conference, CCNC 2011, Las Vegas, NV, 9-12 January, 2011
- DOI
- 10.1109/CCNC.2011.5766541
- Pages
- 554--558
- Publisher
- IEEE
- DBLP key
- DBLP:conf/ccnc/Graffi0SHKS11
@inproceedings{DBLP:conf/ccnc/Graffi0SHKS11, author = {Kalman Graffi and Christian Gross and Dominik Stingl and Daniel Hartung and Aleksandra Kovacevic and Ralf Steinmetz}, title = {{LifeSocial.KOM: {A} Secure and P2P-based Solution for Online Social Networks}}, booktitle = {2011 {IEEE} Consumer Communications and Networking Conference, {CCNC} 2011, Las Vegas, NV, 9-12 January, 2011}, pages = {554--558}, publisher = {{IEEE}}, year = {2011}, url = {https://doi.org/10.1109/CCNC.2011.5766541}, doi = {10.1109/CCNC.2011.5766541}, timestamp = {Tue, 27 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ccnc/Graffi0SHKS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2011--Graffi0SHKS11--LifeSocial-KOM-A-Secure-and-P2P-based-Solution-for-Online-Social-Networks.pdf} } -
Journal article · 2011A Security Framework for Wireless Mesh NetworksAbstract
The class of Wireless Mesh Networks (WMN) supports an ample set of applications including wireless community networks, radio access networks in rural or metropolitan areas, or wireless backbones for factory/process automation. Guaranteeing security is crucial for within these application scenarios. While contemporary wireless technologies, such as the IEEE 802.16 or the IEEE 802.11s standard, provide the basic protocol mechanisms for mesh networking, they lack in comprehensive security mechanisms. Additionally, novel security features of the above standards such as per-link encryption break existing security solutions that rely on overhearing of the wireless channel. We close this gap by developing a holistic approach toward securing WMNs with particular focus on the network layer. We perform a threat analysis and then develop solutions (1) guaranteeing the integrity and authenticity of routing messages, (2) to locally and globally detect misbehavior of nodes in forwarding data or routing messages even for settings that do not allow for overhearing the channel, and (3) to dynamically manage reputation of nodes throughout the network. The combination of these building blocks enables to provide for secure, self-organizing WMNs.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- Wiley — Wireless Communications and Mobile Computing — Wiley WCMC
- Venue in bibliography
- Wiley Wireless Communications and Mobile Computing
- DOI
- 10.1002/WCM.984
- Pages
- 371--391
- Volume
- 11
- Number
- 3
- DBLP key
- DBLP:journals/wicomm/MogreGHS11
@article{DBLP:journals/wicomm/MogreGHS11, author = {Parag S. Mogre and Kalman Graffi and Matthias Hollick and Ralf Steinmetz}, editor = {}, title = {{A Security Framework for Wireless Mesh Networks}}, journal = {Wiley Wireless Communications and Mobile Computing}, volume = {11}, number = {3}, pages = {371--391}, year = {2011}, url = {https://doi.org/10.1002/wcm.984}, doi = {10.1002/WCM.984}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/wicomm/MogreGHS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2011--MogreGHS11--A-Security-Framework-for-Wireless-Mesh-Networks.pdf} } -
Conference paper · 2010Towards a P2P Cloud: Reliable Resource Reservations in Unreliable P2P SystemsAbstract
The peer-to-peer paradigm shows the potential to provide the same functionality and quality like client/server based systems, but with much lower costs. However, the resources, e.g. storage space, CPU power and online time, provided by the peers are unreliable due to churn. In order to enable churn resistant reliable services using the resources in p2p systems, we propose in this paper a distributed mechanism termed P 3 R3 O.KOM . The mechanism allows to reserve, monitor and use resources provided by the unreliable p2p system and maintains long-term resource reservations through controlled redundant resource provision. Evaluation shows that using KAD measurements on the prediction of the lifetime of peers allows for 100% successful reservations under churn with very low traffic overhead. This approach marks a first step for the building of a reliable p2pbased SOA and future p2p-based clouds. 1 This work has been partially funded by the DFG research group QuaP2P, The distribution of computational efforts in form of server farms, service oriented architectures (SOA), GRIDS or cloud platforms gain importance in the presence of the increasing demand of users for resources and high-quality services for low costs. Resources like CPU power are utilized for distributed computations, bandwidth and storage space for quick distribution of data and online time for protocol purposes.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Parallel and Distributed Systems — ICPADS
- Venue in bibliography
- 16th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2010, Shanghai, China, December 8-10, 2010
- DOI
- 10.1109/ICPADS.2010.34
- Pages
- 27--34
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/icpads/GraffiSGNKS10
@inproceedings{DBLP:conf/icpads/GraffiSGNKS10, author = {Kalman Graffi and Dominik Stingl and Christian Gross and Hoang Nguyen and Aleksandra Kovacevic and Ralf Steinmetz}, title = {{Towards a {P2P} Cloud: Reliable Resource Reservations in Unreliable {P2P} Systems}}, booktitle = {16th {IEEE} International Conference on Parallel and Distributed Systems, {ICPADS} 2010, Shanghai, China, December 8-10, 2010}, pages = {27--34}, publisher = {{IEEE} Computer Society}, year = {2010}, url = {https://doi.org/10.1109/ICPADS.2010.34}, doi = {10.1109/ICPADS.2010.34}, timestamp = {Tue, 27 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icpads/GraffiSGNKS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2010--GraffiSGNKS10--Towards-a-P2P-Cloud-Reliable-Resource-Reservations-in-Unreliable-P2P-Systems.pdf} } -
Doctoral thesis · 2010Monitoring and Management of Peer-to-Peer SystemsAbstract
The peer-to-peer paradigm has had large success in content distribution and multimedia communication applications on the Internet. In a peer-to-peer network, the participating nodes create an infrastructure to provide a desired functionality and offer their resources to host an application in a distributed manner. Besides the functional requirements of an application, the non-functional requirements to achieve a high service quality are also an important part of successful peer-to-peer networks and a major challenge is to meet these requirements in networks with unreliable nodes. In contrast to traditional centralized approaches where the quality can be measured and controlled, in a distributed environment it is challenging both to capture the status and performance of the whole distributed system in one point of time and to control its general behavior. In this dissertation, we focus on the monitoring and management of peer-to-peer systems. We systematically engineer SkyEye.KOM, a fully decentralized monitoring mechanism that provides both a precise status snapshot of the peer-to-peer system and enables queries for peer capacities, such as bandwidth or storage capacities, in a large-scale peer-to-peer system. It considers individual load limits of the peers and ensures that no peer is overloaded.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- TU Darmstadt
- Venue in bibliography
- Technical University Darmstadt
- DBLP key
- DBLP:phd/de/Graffi2010a
@phdthesis{DBLP:phd/de/Graffi2010a, author = {K{\'{a}}lm{\'{a}}n Gy{\"{o}}rgy Graffi}, title = {{Monitoring and Management of Peer-to-Peer Systems}}, school = {Technical University Darmstadt}, year = {2010}, url = {http://www.dr.hut-verlag.de/978-3-86853-658-4.html}, urn = {urn:nbn:de:101:1-201012149946}, isbn = {978-3-86853-658-4}, timestamp = {Sat, 17 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/de/Graffi2010a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2010--Graffi2010a--Monitoring-and-Management-of-Peer-to-Peer-Systems.pdf} } -
Conference paper · 2010LifeSocial.KOM: A P2P-Based Platform for Secure Online Social NetworksAbstract
with additional user collaboration tools. Common functionality in online social networks are user profiles, friend lists, photo albums, user groups, live chatting and status updates. The functionality of these social apps is implemented in form of plugins (as shown in Fig. 1) which provide clear interfaces both for the plugins themselves as well as for the GUI. Additional social functionality can be added through new plugins which may either be based on already existing plugins, e.g. a multicast plugin, or create a new functionality from the scratch. The architecture is based on OSGi with individual components that can be exchanged during runtime, allowing to add new plugins or update existing ones. The plugins are hosted on our general platform for p2p applications. As p2p overlay we use FreePastry [1] for interconnecting the peers ad routing. We use PAST on FreePastry for reliable data storage, which we modified to support in-place data updates and deletion. We apply both atomic data elements (e.g. profiles, photo images, group messages) and distributed linked lists (e.g. friends list, photo albums, sends messages dispatches messages route message A:X stores objects stores data objects gives objects retrieves and caches data objects group lists, multicast lists) for managing the occurring data types in the social network.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Conference on Peer-to-Peer Computing — IEEE P2P
- Venue in bibliography
- IEEE Tenth International Conference on Peer-to-Peer Computing, P2P 2010, Delft, The Netherlands, 25-27 August 2010
- DOI
- 10.1109/P2P.2010.5569977
- Pages
- 1--2
- Publisher
- IEEE
- DBLP key
- DBLP:conf/p2p/GraffiGMKS10
@inproceedings{DBLP:conf/p2p/GraffiGMKS10, author = {Kalman Graffi and Christian Gross and Patrick Mukherjee and Aleksandra Kovacevic and Ralf Steinmetz}, title = {{LifeSocial.KOM: {A} P2P-Based Platform for Secure Online Social Networks}}, booktitle = {{IEEE} Tenth International Conference on Peer-to-Peer Computing, {P2P} 2010, Delft, The Netherlands, 25-27 August 2010}, pages = {1--2}, publisher = {{IEEE}}, year = {2010}, url = {https://doi.org/10.1109/P2P.2010.5569977}, doi = {10.1109/P2P.2010.5569977}, timestamp = {Tue, 27 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/p2p/GraffiGMKS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2010--GraffiGMKS10--LifeSocial-KOM-A-P2P-Based-Platform-for-Secure-Online-Social-Networks.pdf} } -
Conference paper · 2009Underlay Awareness in P2P Systems: Techniques and ChallengesAbstract
only less than 5% of peers in the Gnutella network choose neighbors from their own AS. From the user’s point of view, underlay awareness represents an improvement in search and download times. In addition, ISPs are increasingly limiting bandwidth of some P2P applications because of higher costs inflicted by this traffic. By using underlay aware P2P systems, there will no longer be the need for ISPs to resort to such extreme measures. Thus, underlay aware P2P systems are ISP-friendly and allow for better QoS. The literature on underlay awareness in P2P is not new, however it lacks the big-picture point of view. We propose the first survey that considers studies on underlay awareness and classifies them according to two parameters: techniques used for underlay information collection, and usage of this information for building the P2P overlay network. Hence, the contribution of this paper is threefold: we present a survey of collection and usage of underlay information with discussion on the different approaches and designs, we propose a taxonomy on how underlay information is collected; and finally, we discuss the impacts underlay awareness has on the Internet. overview of underlay awareness in P2P systems. Section 3 explains the methods used to collect underlay information. The usage of this information is discussed in Section 4.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Symposium on Parallel and Distributed Processing — IPDPS
- Venue in bibliography
- 23rd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2009, Rome, Italy, May 23-29, 2009
- DOI
- 10.1109/IPDPS.2009.5160955
- Pages
- 1--8
- Publisher
- IEEE
- DBLP key
- DBLP:conf/ipps/AbboudKGPS09
@inproceedings{DBLP:conf/ipps/AbboudKGPS09, author = {Osama Abboud and Aleksandra Kovacevic and Kalman Graffi and Konstantin Pussep and Ralf Steinmetz}, title = {{Underlay Awareness in {P2P} Systems: Techniques and Challenges}}, booktitle = {23rd {IEEE} International Symposium on Parallel and Distributed Processing, {IPDPS} 2009, Rome, Italy, May 23-29, 2009}, pages = {1--8}, publisher = {{IEEE}}, year = {2009}, url = {https://doi.org/10.1109/IPDPS.2009.5160955}, doi = {10.1109/IPDPS.2009.5160955}, timestamp = {Tue, 27 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipps/AbboudKGPS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2009--AbboudKGPS09--Underlay-Awareness-in-P2P-Systems-Techniques-and-Challenges.pdf} } -
Conference paper · 2009Practical Security in P2P-based Social NetworksAbstract
The peer-to-peer paradigm is used in more and more advanced applications. One of the next areas that promise a success for the p2p paradigm lies in the upcoming trend of social networks. However, several security issues have to be solved in p2p-based social network platforms. We present in this paper a practical solution that establishes a trust infrastructure, enables authenticated and secure communication between users in the social network and provides personalized, fine grained data access control. We implemented our solution in a p2p based platform for social networks and show that the solution is practical and lightweight both in time consumption and traffic overhead. social networks are lists. Friends lists, group membership lists, album lists and photo lists are examples for this data structure. We propose in [2] a distributed data structure based on lists, as seen in Figure 1(b). All storable data structures are reduced to storable list elements containing meta data and pointers to other lists or storable objects (SharedItems) which are identifiable by their unique object ID. Using a DHT, the objects can be looked up and retrieved. Thus complex data structures can be stored and the diverse applications of a social network are supported.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — Conference on Local Computer Networks — LCN
- Venue in bibliography
- The 34th Annual IEEE Conference on Local Computer Networks, LCN 2009, 20-23 October 2009, Zurich, Switzerland, Proceedings
- DOI
- 10.1109/LCN.2009.5355085
- Pages
- 269--272
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/lcn/GraffiMMHKS09
@inproceedings{DBLP:conf/lcn/GraffiMMHKS09, author = {Kalman Graffi and Patrick Mukherjee and Burkhard Menges and Daniel Hartung and Aleksandra Kovacevic and Ralf Steinmetz}, title = {{Practical Security in P2P-based Social Networks}}, booktitle = {The 34th Annual {IEEE} Conference on Local Computer Networks, {LCN} 2009, 20-23 October 2009, Zurich, Switzerland, Proceedings}, pages = {269--272}, publisher = {{IEEE} Computer Society}, year = {2009}, url = {https://doi.org/10.1109/LCN.2009.5355085}, doi = {10.1109/LCN.2009.5355085}, timestamp = {Tue, 27 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/lcn/GraffiMMHKS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2009--GraffiMMHKS09--Practical-Security-in-P2P-based-Social-Networks.pdf} } -
Conference paper · 2009Monitoring and Management of Structured Peer-to-Peer SystemsAbstract
The peer-to-peer paradigm shows the potential to provide the same functionality and quality like client/server based systems, but with much lower costs. In order to control the quality of peer-to-peer systems, monitoring and management mechanisms need to be applied. Both tasks are challenging in large-scale networks with autonomous, unreliable nodes. In this paper we present a monitoring and management framework for structured peer-to-peer systems. It captures the live status of a peer-to-peer network in an exhaustive statistical representation. Using principles of autonomic computing, a preset system state is approached through automated system re-configuration in the case that a quality deviation is detected. Evaluation shows that the monitoring is very precise and lightweight and that preset quality goals are reached and kept automatically.
taken from the linked PDF
Details
- Venue series
- IEEE — International Conference on Peer-to-Peer Computing — IEEE P2P
- Venue in bibliography
- Proceedings P2P 2009, Ninth International Conference on Peer-to-Peer Computing, 9-11 September 2009, Seattle, Washington, USA
- DOI
- 10.1109/P2P.2009.5284512
- Pages
- 311--320
- Publisher
- IEEE
- DBLP key
- DBLP:conf/p2p/GraffiSRKS09
@inproceedings{DBLP:conf/p2p/GraffiSRKS09, author = {Kalman Graffi and Dominik Stingl and Julius Rueckert and Aleksandra Kovacevic and Ralf Steinmetz}, title = {{Monitoring and Management of Structured Peer-to-Peer Systems}}, booktitle = {Proceedings {P2P} 2009, Ninth International Conference on Peer-to-Peer Computing, 9-11 September 2009, Seattle, Washington, {USA}}, pages = {311--320}, publisher = {{IEEE}}, year = {2009}, url = {https://doi.org/10.1109/P2P.2009.5284512}, doi = {10.1109/P2P.2009.5284512}, timestamp = {Tue, 27 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/p2p/GraffiSRKS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2009--GraffiSRKS09--Monitoring-and-Management-of-Structured-Peer-to-Peer-Systems.pdf} } -
Report · 2008Towards an Information and Efficiency Management Architecture for Peer-to-Peer Systems based on Structured OverlaysAbstract
management, security issues and many other functional layers. With the grow of application areas for Peer-to-peer applications are becoming more and the P2P paradigm, more and more mature solutions more complex, a modular p2p system design conare presented (e.g. BitTorrent [2] instead of Napster). sisting of various functional layers (e.g. FreePastry These optimized solutions often benefit from addiand add-ons) eases the development of new applitional information they gather individually, for examcations, as developers can rely on existing, efficient ple in BitTorrent each peer measure individually the components. In order to use optimized strategies in link quality to its neighbors. In replication managethese p2p functional layers, additional information on ment the replication layer is responsible for finding other peers and states in the p2p system is needed. appropriate candidates to store replicas on them. We present in this paper an architecture, applicaFuture P2P applications will combine various exble on structured P2P overlays, which enables interisting P2P functional layers. Imagine an application ested peers and parties to monitor the state of the you can search (unstructured overlay) or P2P network and further provides the functionality overlay) specific content, which of finding a queried set of peers fulfilling a requested attribute state.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- TU Darmstadt
- Venue in bibliography
- Technische Universität Darmstadt, Multimedia Communications Lab
- Number
- KOM-TR-2008-02
- DBLP key
- DBLP:tr/kom/GraffiKS08
@techreport{DBLP:tr/kom/GraffiKS08, author = {Kalman Graffi and Aleksandra Kovacevic and Ralf Steinmetz}, title = {{Towards an Information and Efficiency Management Architecture for Peer-to-Peer Systems based on Structured Overlays}}, institution = {Technische Universit{\"{a}}t Darmstadt, Multimedia Communications Lab}, type = {Technical Report}, number = {KOM-TR-2008-02}, address = {Darmstadt, Germany}, month = {mar}, year = {2008}, note = {First published: 3. March 2008. Last revision: 3. March 2008. DFG Research Group 733: Improving the Quality of Peer-to-Peer Systems. Department of Electrical Engineering and Information Technology / Department of Computer Science (Adjunct Professor)}, file = {2008--GraffiKS08--Towards-an-Information-and-Efficiency-Management-Architecture-for-Peer-to-Peer-Systems-based-on-Structured-Overlays.pdf} } -
Conference paper · 2008Towards Benchmarking of Structured Peer-to-Peer Overlays for Network Virtual EnvironmentsAbstract
Network virtual environments (NVE) are an evolving trend combining millions of users in an interactive community. A distributed NVE platform promises to lower the administration costs and to benefit from research done in the peer-to-peer (p2p) domain. In order to reuse existing mature p2p overlays for NVEs, a comparative evaluation has to be done in the same environment (e.g. resources of peers, peer behavior, churn, etc.), using appropriate test cases (scenarios) and observing relevant performance metrics. In this paper we present a benchmarking approach for p2p overlays in the context of NVEs. We define related quality attributes, scenarios, and metrics and use them to evaluate Chord and Kademlia as most popular p2p overlays and assess their suitability to NVE.
taken from the linked PDF
Details
- Venue series
- IEEE — International Conference on Parallel and Distributed Systems — ICPADS
- Venue in bibliography
- 14th International Conference on Parallel and Distributed Systems, ICPADS 2008, Melbourne, Victoria, Australia, December 8-10, 2008
- DOI
- 10.1109/ICPADS.2008.68
- Pages
- 799--804
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/icpads/KovacevicGKLS08
@inproceedings{DBLP:conf/icpads/KovacevicGKLS08, author = {Aleksandra Kovacevic and Kalman Graffi and Sebastian Kaune and Christof Leng and Ralf Steinmetz}, title = {{Towards Benchmarking of Structured Peer-to-Peer Overlays for Network Virtual Environments}}, booktitle = {14th International Conference on Parallel and Distributed Systems, {ICPADS} 2008, Melbourne, Victoria, Australia, December 8-10, 2008}, pages = {799--804}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/ICPADS.2008.68}, doi = {10.1109/ICPADS.2008.68}, timestamp = {Tue, 27 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icpads/KovacevicGKLS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2008--KovacevicGKLS08--Towards-Benchmarking-of-Structured-Peer-to-Peer-Overlays-for-Network-Virtual-Environments.pdf} } -
Conference paper · 2008SkyEye.KOM: An Information Management Over-Overlay for Getting the Oracale View on Structured P2P SystemsAbstract
In order to ease the development and maintenance of more complex P2P applications, which combine multiple P2P functionality (e.g. streaming and dependable storage), we suggest to extend structured P2P systems with a dedicated information management layer. This layer is meant to generate statistics on the whole P2P system and to enable capacity-based peer search, which helps the individual functionality layers in the P2P application to find suitable peers for layer-specific role assignment. We present in this paper SkyEye.KOM, an information management layer applicable on DHTs, which fulfills these desired functionality. leveraging the underlying DHT, easy to deploy as simple add-on to existing DHTs and efficient as it needs O(log N) hops per query and to place peer-specific information network wide accessible. Evaluation shows that SkyEye.KOM has a good query performance and that the costs for maintaining the over-overlay are very low.
taken from the linked PDF
Details
- Venue series
- IEEE — International Conference on Parallel and Distributed Systems — ICPADS
- Venue in bibliography
- 14th International Conference on Parallel and Distributed Systems, ICPADS 2008, Melbourne, Victoria, Australia, December 8-10, 2008
- DOI
- 10.1109/ICPADS.2008.8
- Pages
- 279--286
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/icpads/GraffiKXS08
@inproceedings{DBLP:conf/icpads/GraffiKXS08, author = {Kalman Graffi and Aleksandra Kovacevic and Song Xiao and Ralf Steinmetz}, title = {{SkyEye.KOM: An Information Management Over-Overlay for Getting the Oracale View on Structured {P2P} Systems}}, booktitle = {14th International Conference on Parallel and Distributed Systems, {ICPADS} 2008, Melbourne, Victoria, Australia, December 8-10, 2008}, pages = {279--286}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/ICPADS.2008.8}, doi = {10.1109/ICPADS.2008.8}, timestamp = {Tue, 27 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icpads/GraffiKXS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2008--GraffiKXS08--SkyEye-KOM-An-Information-Management-Over-Overlay-for-Getting-the-Oracale-View-on-Structured-P2P-Systems.pdf} } -
Conference paper · 2008Load Balancing for Multimedia Streaming in Heterogeneous Peer-to-Peer SystemsAbstract
Multimedia streaming of mostly user generated content is an ongoing trend, not only since the upcoming of Last.fm and YouTube. A distributed decentralized multimedia streaming architecture can spread the (traffic) costs to the user nodes, but requires to provide for load balancing and consider the heterogeneity of the participating nodes. We propose a DHT-based information gathering and analyzing architecture which controls the streaming request assignment in the system and thoroughly evaluate it in comparison to a distributed stateless strategy. We evaluated the impact of the key parameters in the allocation function which considers the capabilities of the nodes and their contribution to the system. Identifying the quality-bandwidth tradeoffs of the information gathering system, we show that with our proposed system a 53% better load balancing can be reached and the efficiency of the system is significantly improved.
taken from the linked PDF
Details
- Venue series
- ACM — Workshop on Network and Operating System Support for Digital Audio and Video — NOSSDAV
- Venue in bibliography
- Network and Operating System Support for Digital Audio and Video, 18th International Workshop, NOSSDAV 2008, Braunschweig, Germany, May 28-30, 2008, Proceedings
- DOI
- 10.1145/1496046.1496069
- Pages
- 99--104
- Publisher
- ACM
- DBLP key
- DBLP:conf/nossdav/GraffiKPKS08
@inproceedings{DBLP:conf/nossdav/GraffiKPKS08, author = {Kalman Graffi and Sebastian Kaune and Konstantin Pussep and Aleksandra Kovacevic and Ralf Steinmetz}, title = {{Load Balancing for Multimedia Streaming in Heterogeneous Peer-to-Peer Systems}}, booktitle = {Network and Operating System Support for Digital Audio and Video, 18th International Workshop, {NOSSDAV} 2008, Braunschweig, Germany, May 28-30, 2008, Proceedings}, pages = {99--104}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1496046.1496069}, doi = {10.1145/1496046.1496069}, timestamp = {Tue, 27 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/nossdav/GraffiKPKS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2008--GraffiKPKS08--Load-Balancing-for-Multimedia-Streaming-in-Heterogeneous-Peer-to-Peer-Systems.pdf} } -
Conference paper · 2008From Cells to Organisms: Long-term Guarantees on Service Provisioning in Peer-to-Peer NetworksAbstract
The peer-to-peer paradigm gained more and more impact in the last years. The reason for P2P arising now is related to the continuous development of device capabilities in the last years, like CPU power, storage space and bandwidth. However, the demand for services and resources is permanently increasing, although the peers have a variety of other resources themselves. In this paper we present the idea of a P2P system acting as a service provider using the resources of participating peers and stating guarantees on the quality of the service it provides. In order to fulfill these service level agreements, the peers confederate to a distributed supervisor of peer resources (DISPRO), monitoring the network, predicting trends on resource availabilities and deciding on resource allocation strategies. This paper discusses the challenges and a solution draft of the concept of DISPRO.
taken from the linked PDF
Details
- Venue series
- IFIP — Conference on New Technologies in Distributed Systems — NOTERE
- Venue in bibliography
- Proceedings of the 8th international conference on New technologies in distributed systems, NOTERE '08, Lyon, France, June 23-27, 2008
- DOI
- 10.1145/1416729.1416752
- Pages
- 18:1--18:6
- Publisher
- ACM
- DBLP key
- DBLP:conf/notere/GraffiKLS08
@inproceedings{DBLP:conf/notere/GraffiKLS08, author = {Kalman Graffi and Aleksandra Kovacevic and Nicolas Liebau and Ralf Steinmetz}, title = {{From Cells to Organisms: Long-term Guarantees on Service Provisioning in Peer-to-Peer Networks}}, booktitle = {Proceedings of the 8th international conference on New technologies in distributed systems, {NOTERE} '08, Lyon, France, June 23-27, 2008}, pages = {18:1--18:6}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1416729.1416752}, doi = {10.1145/1416729.1416752}, timestamp = {Tue, 27 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/notere/GraffiKLS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2008--GraffiKLS08--From-Cells-to-Organisms-Long-term-Guarantees-on-Service-Provisioning-in-Peer-to-Peer-Networks.pdf} } -
Conference paper · 2008A Distributed Platform for Multimedia CommunitiesAbstract
Online community platforms and multimedia content delivery are merging in recent years. Current platforms like Facebook and YouTube are client-server based which result in high administration costs for the provider. In contrast to that peer-to-peer systems offer scalability and low costs, but are limited in their functionality. In this paper we present a framework for peer-to-peer based multimedia online communities. We identified the key challenges for this new application of the peer-to-peer paradigm and built a plugin based, easily extendible and multifunctional framework. Further, we identified distributed linked lists as valuable data structure to implement the user profiles, friend lists, groups, photo albums and more. Our framework aims at providing the functionality of common online community platforms combined with the multimedia delivery capabilities of modern peer-to-peer systems, e.g. direct multimedia delivery and access to a distributed multimedia pool. Nowadays, social interaction over the Internet is an ongoing trend. Since the arise of blogs and the possibility to publish user generated content, the number of active users increased significantly. Once the self-presentation with blogs was established, platforms like YouTube [2] and Last.FM [3] arose, in which users can share their videos and music taste.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — International Symposium on Multimedia — IEEE ISM
- Venue in bibliography
- Tenth IEEE International Symposium on Multimedia (ISM2008), December 15-17, 2008, Berkeley, California, USA
- DOI
- 10.1109/ISM.2008.11
- Pages
- 208--213
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/ism/GraffiPMKS08
@inproceedings{DBLP:conf/ism/GraffiPMKS08, author = {Kalman Graffi and Sergey Podrajanski and Patrick Mukherjee and Aleksandra Kovacevic and Ralf Steinmetz}, title = {{A Distributed Platform for Multimedia Communities}}, booktitle = {Tenth {IEEE} International Symposium on Multimedia (ISM2008), December 15-17, 2008, Berkeley, California, {USA}}, pages = {208--213}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/ISM.2008.11}, doi = {10.1109/ISM.2008.11}, timestamp = {Tue, 27 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ism/GraffiPMKS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2008--GraffiPMKS08--A-Distributed-Platform-for-Multimedia-Communities.pdf} } -
Conference paper · 2007The Impact of the P2P Paradigm on the New Media IndustriesAbstract
In Europe 2006 was the year of Voice-over-IP (VoIP). Almost all telecom providers started to offer VoIP products in combination with a phone flat rate. However, the VoIP technology was mature since 1999. Why was the success of VoIP so many years delayed? Can the enormous success of Skype be a major reason? In this paper we try to answer which influence the peer-to-peer paradigm as technology has on established business models of the new media industries. As new media industries we understand the media and telecom industries as well as Internet Service Providers (ISPs), because these industries start to merge by offering the same products and services to their customers. In three case studies we look at the telecom industry, at the media industry, and at ISPs. For each case study we first identify a reliable set of base figures. This is an important but non-trivial task, as often figures published by companies include abstractions which influence the figures in favor of the company. Having achieved reliable base figures we model the impact of the peer-to-peer paradigm on a specific industry and try to forecast the major trends of the next one to three years.
taken from the linked PDF
Details
- Venue series
- Americas Conference on Information Systems — AMCIS
- Venue in bibliography
- Reaching New Heights. 13th Americas Conference on Information Systems, AMCIS 2007, Keystone, Colorado, USA, August 9-12, 2007
- Pages
- 255
- Publisher
- Association for Information Systems
- DBLP key
- DBLP:conf/amcis/LiebauPGKBJS07
@inproceedings{DBLP:conf/amcis/LiebauPGKBJS07, author = {Nicolas Liebau and Konstantin Pussep and Kalman Graffi and Sebastian Kaune and Andr{\'{e}} Beyer and Eric Jahn and Ralf Steinmetz}, title = {{The Impact of the {P2P} Paradigm on the New Media Industries}}, booktitle = {Reaching New Heights. 13th Americas Conference on Information Systems, {AMCIS} 2007, Keystone, Colorado, USA, August 9-12, 2007}, pages = {255}, publisher = {Association for Information Systems}, year = {2007}, url = {http://aisel.aisnet.org/amcis2007/255}, timestamp = {Thu, 10 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/amcis/LiebauPGKBJS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2007--LiebauPGKBJS07--The-Impact-of-the-P2P-Paradigm-on-the-New-Media-Industries.pdf} } -
Journal article · 2007Peer-to-Peer-Forschung - Überblick und Herausforderungen (Peer-to-Peer Research - Overview and Challenges)Abstract
Peer-to-Peer ist ein fundamentales Designprinzip und stellt einen Paradigmenwechsel für die Kommunikation in Computernetzwerken dar. In diesem Beitrag wird zunächst definiert, welche Charakteristika Peer-toPeer-Systeme ausmachen. Anhand von vier Qualitätsmerkmalen hat die Forschergruppe ,,QuaP2P” ihre Arbeitsbereiche untergliedert. Dieser Gliederung folgend wird anschließend der aktuelle Stand der Wissenschaft und Herausforderungen im Bereich Peer-to-Peer-Forschung zusammengefasst. Dies gibt dem Leser einen strukturieren Überblick, um sich mit den wesentlichen Arbeiten dieses hoch Summary Peer-to-Peer is a fundamental design principle and marks a paradigm shift for communication in computer networks. In this paper first a definition for peer-to-peer systems is given based on their characteristics. Using four quality attributes the DFG Research Group “QuaP2P” subdivided its research fields. Subsequently, the state-of-the-art in peer-topeer research and its challenges are summarized, following this classification. This will give a structured overview to the reader in order to provide him with the relevant related work when looking into this highly active research area.
taken from the linked PDF
Details
- Venue series
- it — Information Technology
- Venue in bibliography
- it Information Technology
- DOI
- 10.1524/ITIT.2007.49.5.272
- Pages
- 272--279
- Volume
- 49
- Number
- 5
- DBLP key
- DBLP:journals/it/GraffiKMBLBSL07
@article{DBLP:journals/it/GraffiKMBLBSL07, author = {Kalman Graffi and Aleksandra Kovacevic and Patrick Mukherjee and Michael Benz and Christof Leng and Dirk Bradler and Julian Schr{\"{o}}der{-}Bernhardi and Nicolas Liebau}, editor = {}, title = {{Peer-to-Peer-Forschung - {\"{U}}berblick und Herausforderungen (Peer-to-Peer Research - Overview and Challenges)}}, journal = {it Information Technology}, volume = {49}, number = {5}, pages = {272--279}, year = {2007}, url = {https://doi.org/10.1524/itit.2007.49.5.272}, doi = {10.1524/ITIT.2007.49.5.272}, timestamp = {Tue, 27 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/it/GraffiKMBLBSL07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2007--GraffiKMBLBSL07--Peer-to-Peer-Forschung-Uberblick-und-Herausforderungen-Peer-to-Peer-Research-Overview-and-Challenges.pdf} } -
Conference paper · 2007Overlay Bandwidth Management: Scheduling and Active Queue Management of Overlay FlowsAbstract
Peer-to-peer and mobile networks gained significant attention of both research community and industry. Applying the peer-to-peer paradigm in mobile networks lead to several problems regarding the bandwidth demand of peer-to-peer networks. Time-critical messages are delayed and delivered unacceptably slow. In addition to this, scarce bandwidth is wasted on messages of less priority. Therefore, the focus of this paper is on bandwidth management issues at the overlay layer and how they can be solved. We present HiPNOS.KOM, a priority based scheduling and active queue management system. It guarantees better QoS for higher prioritized messages in upper network layers of peerto-peer systems. Evaluation using the peer-to-peer simulator PeerfactSim.KOM shows that HiPNOS.KOM brings significant strategies that are used nowadays on each peer. User initiated lookups have in Kademlia 24% smaller operation duration when
taken from the linked PDF
Details
- Venue series
- IEEE — Conference on Local Computer Networks — LCN
- Venue in bibliography
- 32nd Annual IEEE Conference on Local Computer Networks (LCN 2007), 15-18 October 2007, Clontarf Castle, Dublin, Ireland, Proceedings
- DOI
- 10.1109/LCN.2007.13
- Pages
- 334--342
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/lcn/GraffiPKKLS07
@inproceedings{DBLP:conf/lcn/GraffiPKKLS07, author = {Kalman Graffi and Konstantin Pussep and Sebastian Kaune and Aleksandra Kovacevic and Nicolas Liebau and Ralf Steinmetz}, title = {{Overlay Bandwidth Management: Scheduling and Active Queue Management of Overlay Flows}}, booktitle = {32nd Annual {IEEE} Conference on Local Computer Networks {(LCN} 2007), 15-18 October 2007, Clontarf Castle, Dublin, Ireland, Proceedings}, pages = {334--342}, publisher = {{IEEE} Computer Society}, year = {2007}, url = {https://doi.org/10.1109/LCN.2007.13}, doi = {10.1109/LCN.2007.13}, timestamp = {Tue, 27 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/lcn/GraffiPKKLS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2007--GraffiPKKLS07--Overlay-Bandwidth-Management-Scheduling-and-Active-Queue-Management-of-Overlay-Flows.pdf} } -
Conference paper · 2007ECHoP2P: Emergency Call Handling Over Peer-To-Peer OverlaysAbstract
The impact of the peer-to-peer paradigm increases both in research and in industry. Still, serious applications for P2P-based systems are rare. On the other hand, Emergency Call Handling (ECH) is (or will be) a mandatory function for VoIP services. In this paper we investigate international legal and technical requirements of ECH and present ECHoP2P, a solution that fulfills these requirements. Based the functionality to determine the closest and (geographically) responsible Emergency Station to a calling peer. Further, Emergency Calls are processed with highest priority in the overlay, so that quality of service guarantees are given. We evaluated ECHoP2P thoroughly and present the quality and costs analysis, identified tradeoffs and effects of optimization parameters. ECHoP2P provides a fully evaluated solution for Emergency Call Handling and for further location-aware applications.
taken from the linked PDF
Details
- Venue series
- IEEE — International Conference on Parallel and Distributed Systems — ICPADS
- Venue in bibliography
- 13th International Conference on Parallel and Distributed Systems, ICPADS 2007, Hsinchu, Taiwan, December 5-7, 2007
- DOI
- 10.1109/ICPADS.2007.4447809
- Pages
- 1--10
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/icpads/GraffiKWS07
@inproceedings{DBLP:conf/icpads/GraffiKWS07, author = {Kalman Graffi and Aleksandra Kovacevic and Kyra Wulffert and Ralf Steinmetz}, title = {{ECHoP2P: Emergency Call Handling Over Peer-To-Peer Overlays}}, booktitle = {13th International Conference on Parallel and Distributed Systems, {ICPADS} 2007, Hsinchu, Taiwan, December 5-7, 2007}, pages = {1--10}, publisher = {{IEEE} Computer Society}, year = {2007}, url = {https://doi.org/10.1109/ICPADS.2007.4447809}, doi = {10.1109/ICPADS.2007.4447809}, timestamp = {Tue, 27 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icpads/GraffiKWS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2007--GraffiKWS07--ECHoP2P-Emergency-Call-Handling-Over-Peer-To-Peer-Overlays.pdf} } -
Conference paper · 2007Detection of Colluding Misbehaving Nodes in Mobile Ad Hoc and Wireless Mesh NetworksAbstract
Ubiquitous network connectivity and mobile communications have recently attracted remarkable attention. Wireless multihop networks such as Mobile Ad hoc Networks or Wireless Mesh Networks have been proposed to cater to the arising needs. Various security challenges persist, esp. because these networks build on the premise of node cooperation. Secure routing protocols and mechanisms to detect routing misbehavior in the direct neighborhood exist; however, collusion of misbehaving nodes has not been adequately addressed yet. We present LeakDetector, a mechanism to detect colluding malicious nodes in wireless multihop networks. In combination with proactive secure multipath routing algorithms, LeakDetector enables the calculation of the packet-loss ratio for the individual nodes. We perform an experimental analysis, which shows the excellent detection quality of LeakDetector. In a world where ubiquitous computing is emerging, broadband wireless networks address the continuously increasing demand for fast and reliable mobile network access. Networks (WMN) promise several benefits in comparison to the traditional single-hop wireless networks such as cellular networks. In MANETs and WMNs the range/capacity of the network is extended by active cooperation of the participating nodes. Nodes in the network act as routers and forward messages on behalf of the other nodes.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — Global Communications Conference — IEEE GLOBECOM
- Venue in bibliography
- Proceedings of the Global Communications Conference, 2007. GLOBECOM'07, Washington, DC, USA, 26-30 November 2007
- DOI
- 10.1109/GLOCOM.2007.966
- Pages
- 5097--5101
- Publisher
- IEEE
- DBLP key
- DBLP:conf/globecom/GraffiMHS07
@inproceedings{DBLP:conf/globecom/GraffiMHS07, author = {Kalman Graffi and Parag S. Mogre and Matthias Hollick and Ralf Steinmetz}, title = {{Detection of Colluding Misbehaving Nodes in Mobile Ad Hoc and Wireless Mesh Networks}}, booktitle = {Proceedings of the Global Communications Conference, 2007. {GLOBECOM}'07, Washington, DC, USA, 26-30 November 2007}, pages = {5097--5101}, publisher = {{IEEE}}, year = {2007}, url = {https://doi.org/10.1109/GLOCOM.2007.966}, doi = {10.1109/GLOCOM.2007.966}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/globecom/GraffiMHS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2007--GraffiMHS07--Detection-of-Colluding-Misbehaving-Nodes-in-Mobile-Ad-Hoc-and-Wireless-Mesh-Networks.pdf} } -
Conference paper · 2007AntSec, WatchAnt, and AntRep: Innovative Security Mechanisms for Wireless Mesh NetworksAbstract
Wireless Mesh Networks (WMNs) build on user nodes to form the network’s routing infrastructure. In particular, the correct forwarding behaviour of each intermediate node on a multihop path from a source node to a destination node is crucial for the functioning of the mesh network. However, current secure routing solutions and misbehaviour detection mechanisms are not sufficient and are mostly inapplicable in mesh networks based on state-of-the-art wireless technology. In particular, hopby-hop per-link encryption mechanisms break solutions that are based on the overhearing of the wireless channel, which leads to severe problems in the presence of misbehaving nodes. We present AntSec, WatchAnt, and AntRep, which together address the above security gap. AntSec guarantees integrity and authenticity of routing messages, WatchAnt detects misbehaviour in forwarding data messages as well as routing messages and in addition is able to cope with per-link encryption at the MAC layer. AntRep is a reputation management system and helps take punitive action against misbehaving nodes. AntSec, WatchAnt, and AntRep are well suited for WMNs with a quasi-static network topology.
taken from the linked PDF · the abstract is longer than the excerpt shown
Details
- Venue series
- IEEE — Conference on Local Computer Networks — LCN
- Venue in bibliography
- 32nd Annual IEEE Conference on Local Computer Networks (LCN 2007), 15-18 October 2007, Clontarf Castle, Dublin, Ireland, Proceedings
- DOI
- 10.1109/LCN.2007.102
- Pages
- 539--547
- Publisher
- IEEE Computer Society
- DBLP key
- DBLP:conf/lcn/MogreGHS07
@inproceedings{DBLP:conf/lcn/MogreGHS07, author = {Parag S. Mogre and Kalman Graffi and Matthias Hollick and Ralf Steinmetz}, title = {{AntSec, WatchAnt, and AntRep: Innovative Security Mechanisms for Wireless Mesh Networks}}, booktitle = {32nd Annual {IEEE} Conference on Local Computer Networks {(LCN} 2007), 15-18 October 2007, Clontarf Castle, Dublin, Ireland, Proceedings}, pages = {539--547}, publisher = {{IEEE} Computer Society}, year = {2007}, url = {https://doi.org/10.1109/LCN.2007.102}, doi = {10.1109/LCN.2007.102}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/lcn/MogreGHS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, file = {2007--MogreGHS07--AntSec-WatchAnt-and-AntRep-Innovative-Security-Mechanisms-for-Wireless-Mesh-Networks.pdf} } -
Report · 2006Taxonomy of Message Scheduling Strategies in Context of Peer-to-Peer ScenariosAbstract
No abstract found in the linked PDF.
Details
- Venue series
- TU Darmstadt
- Venue in bibliography
- Technische Universität Darmstadt, Multimedia Communications Lab
- Number
- KOM-TR-2007-02
- DBLP key
- DBLP:tr/kom/GraffiLS07
@techreport{DBLP:tr/kom/GraffiLS07, author = {K{\'{a}}lm{\'{a}}n Graffi and Nicolas Liebau and Ralf Steinmetz}, title = {{Taxonomy of Message Scheduling Strategies in Context of Peer-to-Peer Scenarios}}, institution = {Technische Universit{\"{a}}t Darmstadt, Multimedia Communications Lab}, type = {Technical Report}, number = {KOM-TR-2007-02}, address = {Darmstadt, Germany}, month = {dec}, year = {2006}, note = {First published: 01. December 2006. Last revision: 03. April 2007. DFG Research Group 733: Improving the Quality of Peer-to-Peer Systems. Department of Electrical Engineering and Information Technology / Department of Computer Science (Adjunct Professor)}, url = {ftp://ftp.kom.tu-darmstadt.de/pub/TR/KOM-TR-2007-02.pdf}, file = {2006--GraffiLS07--Taxonomy-of-Message-Scheduling-Strategies-in-Context-of-Peer-to-Peer-Scenarios.pdf} } -
Report · 2006Taxonomy of Active Queue Management Strategies in Context of Peer-to-Peer ScenariosAbstract
No abstract found in the linked PDF.
Details
- Venue series
- TU Darmstadt
- Venue in bibliography
- Technische Universität Darmstadt, Multimedia Communications Lab
- Number
- KOM-TR-2007-01
- DBLP key
- DBLP:tr/kom/GraffiPLS07
@techreport{DBLP:tr/kom/GraffiPLS07, author = {K{\'{a}}lm{\'{a}}n Graffi and Konstantin Pussep and Nicolas Liebau and Ralf Steinmetz}, title = {{Taxonomy of Active Queue Management Strategies in Context of Peer-to-Peer Scenarios}}, institution = {Technische Universit{\"{a}}t Darmstadt, Multimedia Communications Lab}, type = {Technical Report}, number = {KOM-TR-2007-01}, address = {Darmstadt, Germany}, month = {dec}, year = {2006}, note = {First published: 01. December 2006. Last revision: 29. March 2007. DFG Research Group 733: Improving the Quality of Peer-to-Peer Systems. Department of Electrical Engineering and Information Technology / Department of Computer Science (Adjunct Professor)}, url = {ftp://ftp.kom.tu-darmstadt.de/pub/TR/KOM-TR-2007-01.pdf}, file = {2006--GraffiPLS07--Taxonomy-of-Active-Queue-Management-Strategies-in-Context-of-Peer-to-Peer-Scenarios.pdf} } -
Master's thesis · 2006A Security Framework for Organic Mesh NetworksAbstract
No abstract found in the linked PDF.
Details
- Venue series
- TU Darmstadt
- Venue in bibliography
- Technische Universität Darmstadt, Multimedia Communications Lab
- DBLP key
- DBLP:phd/de/Graffi2006a
@mastersthesis{DBLP:phd/de/Graffi2006a, author = {Kalman Graffi}, title = {{A Security Framework for Organic Mesh Networks}}, school = {Technische Universit{\"{a}}t Darmstadt, Multimedia Communications Lab}, type = {Diploma Thesis}, address = {Darmstadt, Germany}, month = {may}, year = {2006}, note = {Advisor: Prof. Dr.-Ing. Ralf Steinmetz. Tutors: M.-Tech. Parag Mogre, Dr.-Ing. Matthias Hollick. Report Number: KOM-D-0249. Department of Electrical Engineering and Information Technology / Department of Computer Science (Adjunct Professor)}, file = {2006--Graffi06--A-Security-Framework-for-Organic-Mesh-Networks.pdf} }