Bachelor Informatik
FB 2 - Technik, Informatik und Wirtschaft / Technische Hochschule Bingen
- 06721 /409-257
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
Goebel, Norbert; Krauthoff, Tobias; Graffi, Kalman et al.
Moving measurements: Measuring network characteristics of mobile cellular networks on the move.Comput. Commun. Bd. 97. 2017 S. 81 - 95
Amft, Tobias; Graffi, Kalman
Moving peers in distributed, location-based peer-to-peer overlays.ICNC. 2017 S. 906 - 911
Disterhöft, Andreas; Funke, Andreas; Graffi, Kalman
PacketSkip: Skip Graph for Multidimensional Search in Structured Peer-to-Peer Systems.SASO. 2017 S. 21 - 30
Sati, Salem; Ippisch, Andre; Graffi, Kalman
Replication probability-based routing scheme for opportunistic networks.NetSys. 2017 S. 1 - 8