You are here

Bibliography

Export 51 results:
Author Title Type [ Year(Asc)]
Filters: Keyword is distributed hash table  [Clear All Filters]
2011
Evans NS, Grothoff C. Beyond Simulation: Large-Scale Distributed Emulation of P2P Protocols. In: 4th Workshop on Cyber Security Experimentation and Test (CSET 2011). 4th Workshop on Cyber Security Experimentation and Test (CSET 2011). San Francisco, California: USENIX Association; 2011.
Furness J, Kolberg M. Considering Complex Search Techniques in DHTs under Churn. In: CCNC 2011 - IEEE Consumer Communications and Networking Conference. CCNC 2011 - IEEE Consumer Communications and Networking Conference. Las Vegas, NV, USA: IEEE Computer Society; 2011.
Evans NS. Methods for Secure Decentralized Routing in Open Networks. Network Architectures and Services, Department of Computer Science. 2011 ;Dr. rer. nat.:234.
Evans NS, Grothoff C. R5N : Randomized Recursive Routing for Restricted-Route Networks. In: 5th International Conference on Network and System Security (NSS 2011). 5th International Conference on Network and System Security (NSS 2011). Milan, Italy: IEEE; 2011.
2010
Polot B. Adapting Blackhat Approaches to Increase the Resilience of Whitehat Application Scenarios. Computer Science. 2010 ;M.S.
Locher T, Mysicka D, Schmid S, Wattenhofer RP. Poisoning the Kad network. In: ICDCN'10 - Proceedings of the 11th International Conference on Distributed Computing and Networking. ICDCN'10 - Proceedings of the 11th International Conference on Distributed Computing and Networking. Kolkata, India: Springer-Verlag; 2010. pp. 195–206. Available from: http://dl.acm.org/citation.cfm?id=2018057.2018085
2008
Saballus B, Eickhold J, Fuhrmann T. Global Accessible Objects (GAOs) in the Ambicomp Distributed Java Virtual Machine. In: Proceedings of the Second International Conference on Sensor Technologies and Applications (SENSORCOMM 2008). Proceedings of the Second International Conference on Sensor Technologies and Applications (SENSORCOMM 2008). Cap Esterel, France: IEEE Computer Society; 2008. Available from: http://i30www.ira.uka.de/research/publications/p2p/
Chen G, Qiu T, Wu F. Insight into redundancy schemes in DHTs. Journal of Supercomputing [Internet]. 2008 ;43(2):183–198. Available from: http://dl.acm.org/citation.cfm?id=1331483.1331515
Di P, Kutzner K, Fuhrmann T. Providing KBR Service for Multiple Applications. In: The 7th International Workshop on Peer-to-Peer Systems (IPTPS '08). The 7th International Workshop on Peer-to-Peer Systems (IPTPS '08). St. Petersburg, U.S.; 2008. Available from: http://i30www.ira.uka.de/research/publications/p2p/
Wang C-C, Harfoush K. Shortest-path routing in randomized DHT-based Peer-to-Peer systems. Comput. Netw. [Internet]. 2008 ;52:3307–3317. Available from: http://portal.acm.org/citation.cfm?id=1461118#
2007
Di P, Houri Y, Wei Q, Widmer J, Fuhrmann T. Application of DHT-Inspired Routing for Object Tracking. In: Proceedings of 4th IEEE International Conference on Mobile Ad-hoc and Sensor Systems. Proceedings of 4th IEEE International Conference on Mobile Ad-hoc and Sensor Systems. Pisa, Italy; 2007. Available from: http://i30www.ira.uka.de/research/publications/p2p/
Lee J, Lee H, Kang S, Kim SM, Song J. CISS: An efficient object clustering framework for DHT-based peer-to-peer applications. Comput. Netw. [Internet]. 2007 ;51:1072–1094. Available from: http://dx.doi.org/10.1016/j.comnet.2006.07.005
Binzenhöfer A, Leibnitz K. Estimating churn in structured P2P networks. In: ITC-20'07 - Proceedings of the 20th International Teletraffic Conference on Managing Traffic Performance in Converged Networks. ITC-20'07 - Proceedings of the 20th International Teletraffic Conference on Managing Traffic Performance in Converged Networks. Ottawa, Canada: Springer-Verlag; 2007. pp. 630–641. Available from: http://dl.acm.org/citation.cfm?id=1769187.1769257
Steiner M, En-Najjary T, Biersack EW. A global view of KAD. In: IMC'07 - Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement. IMC'07 - Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement. San Diego, CA, USA: ACM; 2007. pp. 117–122. Available from: http://doi.acm.org/10.1145/1298306.1298323
Amann B. Secure asynchronous change notifications for a distributed file system. Chair for Network Architectures. 2007 ;Computer Science:74.
Saballus B, Eickhold J, Fuhrmann T. Towards a Distributed Java VM in Sensor Networks using Scalable Source Routing. In: 6. Fachgespraech Sensornetzwerke der GI/ITG Fachgruppe ''Kommunikation und Verteilte Systeme''. 6. Fachgespraech Sensornetzwerke der GI/ITG Fachgruppe ''Kommunikation und Verteilte Systeme''. Aachen, Germany; 2007. pp. 47–50. Available from: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.7724
2006
Curt C, Fuhrmann T. Communication Networks On the fundamental communication abstraction supplied by P2P overlay networks. [Internet]. 2006 . Available from: http://www3.interscience.wiley.com/journal/109858517/abstract
Ghodsi A. Distributed k-ary System: Algorithms for Distributed Hash Tables. Department of Electronic, Computer, and Software Systems [Internet]. 2006 :209. Available from: http://eprints.sics.se/516/
Stutzbach D, Rejaie R. Improving Lookup Performance Over a Widely-Deployed DHT. In: INFOCOM. INFOCOM. IEEE; 2006. Available from: http://dblp.uni-trier.de/db/conf/infocom/infocom2006.html#StutzbachR06
Goodrich MT, Nelson MJ, Sun JZ. The rainbow skip graph: a fault-tolerant constant-degree distributed data structure. In: SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. New York, NY, USA: ACM; 2006. pp. 384–393.
2005
Wehrle K, Götz S, Rieche S. Distributed Hash Tables. In: Peer-to-Peer Systems and Applications. Vol. 3485. Peer-to-Peer Systems and Applications. Springer; 2005.
Godfrey BP, Stoica I. Heterogeneity and Load Balance in Distributed Hash Tables. In: IN PROC. OF IEEE INFOCOM. IN PROC. OF IEEE INFOCOM. ; 2005. Available from: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.6740
Fiat A, Saia J, Young M. Making chord robust to byzantine attacks. In: In Proc. of the European Symposium on Algorithms (ESA. In Proc. of the European Symposium on Algorithms (ESA. Springer; 2005. pp. 803–814. Available from: http://www.springerlink.com/content/422llxn7khwej72n/
Kutzner K, Fuhrmann T. Measuring Large Overlay Networks - The Overnet Example. In: Konferenzband der 14. Fachtagung Kommunikation in Verteilten Systemen (KiVS 2005). Konferenzband der 14. Fachtagung Kommunikation in Verteilten Systemen (KiVS 2005). Kaiserslautern, Germany; 2005. Available from: http://i30www.ira.uka.de/research/publications/p2p/

Pages