Bachelor Informatik
FB 2 - Technik, Informatik und Wirtschaft / Technische Hochschule Bingen
- 06721 /409-257
Ippisch, Andre; Sati, Salem; Graffi, Kalman
Optimal Replication Based on Optimal Path Hops for Opportunistic Networks.AINA. 2018 S. 251 - 258
Al-Aaridhi, Raed; Dlikman, Iakov; Masinde, Newton et al.
Search Algorithms for Distributed Data Structures in P2P Networks.ISNCC. 2018 S. 1 - 8
Duque Anton, Simon; Fraunholz, Daniel; Krummacker, Dennis et al.
The Dos and Don'ts of Industrial Network SimulationProceedings of the 2nd International Symposium on Computer Science and Intelligent Control. ACM 2018 S. 1 - 8
Ippisch, Andre; Kuper, Tobias; Graffi, Kalman
Time and Space in Android-Based Opportunistic Networks.AINA. 2018 S. 244 - 250
Al-Aaridhi, Raed; Yuksektepe, Ahmed; Graffi, Kalman
Access control for secure distributed data structures in Distributed Hash Tables.LANMAN. 2017 S. 1 - 3
Disterhöft, Andreas; Graffi, Kalman
CapSearch: Capacity-Based Search in Highly Dynamic Peer-to-Peer Networks.AINA. 2017 S. 621 - 630
Ippisch, Andre; Sati, Salem; Graffi, Kalman
Device to device communication in mobile Delay Tolerant networks.DS-RT. 2017 S. 91 - 98
Sati, Salem; Ippisch, Andre; Graffi, Kalman
Dynamic replication control strategy for Opportunistic Networks.ICNC. 2017 S. 1017 - 1023
Ippisch, Andre; Graffi, Kalman
Infrastructure Mode Based Opportunistic Networks on Android Devices.AINA. 2017 S. 454 - 461
Disterhöft, Andreas; Graffi, Kalman
Minicamp: Prototype for Partial Participation in Structured Peer-to-Peer Monitoring Protocols.LCN. 2017 S. 203 - 206