You are here

Bibliography

Export 35 results:
Author Title Type [ Year(Asc)]
Filters: Keyword is routing  [Clear All Filters]
2017
Grothoff C. The GNUnet System. Informatique [Internet]. 2017 ;HDR:181. Available from: https://grothoff.org/christian/habil.pdf
2011
Grothoff C. The Free Secure Network Systems Group: Secure Peer-to-Peer Networking and Beyond. In: SysSec 2011. SysSec 2011. Amsterdam, Netherlands; 2011.
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.
Mittal P, Caesar M, Borisov N. X-Vine: Secure and Pseudonymous Routing Using Social Networks. Computer Research Repository [Internet]. 2011 ;abs/1109.0971. Available from: http://dblp.uni-trier.de/db/journals/corr/corr1109.html#abs-1109-0971
2009
Di P, Fuhrmann T. Using link-layer broadcast to improve scalable source routing. In: IWCMC '09: Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing. IWCMC '09: Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing. New York, NY, USA: ACM; 2009. pp. 466–471. Available from: http://portal.acm.org/citation.cfm?id=1582481#
2008
Spyropoulos T, Psounis K, Raghavendra CS. Efficient routing in intermittently connected mobile networks: the single-copy case. IEEE/ACM Trans. Netw. [Internet]. 2008 ;16:63–76. Available from: http://portal.acm.org/citation.cfm?id=1373458#
Smaragdakis G, Lekakis V, Laoutaris N, Bestavros A, Byers JW, Roussopoulos M. EGOIST: Overlay Routing using Selfish Neighbor Selection. In: Proceedings of ACM CoNEXT 2008. Proceedings of ACM CoNEXT 2008. Madrid, Spain; 2008.
Pizzonia M, Rimondini M. Netkit: easy emulation of complex networks on inexpensive hardware. In: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities. Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities. ICST, Brussels, Belgium, Belgium: ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering); 2008. pp. 7:1–7:10. Available from: http://dl.acm.org/citation.cfm?id=1390576.1390585
Moe MEG. Quantification of Anonymity for Mobile Ad Hoc Networks. In: Proceedings of the 4th International Workshop on Security and Trust Management (STM 08). Proceedings of the 4th International Workshop on Security and Trust Management (STM 08). Trondheim, Norway: Elsevier Science Publishers B. V. Amsterdam, The Netherlands, The Netherlands; 2008. pp. 25–36. Available from: http://portal.acm.org/citation.cfm?id=1619033
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#
Smaragdakis G, Laoutaris N, Michiardi P, Bestavros A, Byers JW, Roussopoulos M. Swarming on Optimized Graphs for n-way Broadcast. In: Proceedings of IEEE INFOCOM 2008. Proceedings of IEEE INFOCOM 2008. Phoenix, AZ; 2008.
2007
Stathopoulos T, Heidemann J, Lukac M, Estrin D, Kaiser WJ. End-to-end routing for dualradio sensor networks. In: In INFOCOM. In INFOCOM. ; 2007. pp. 2252–2260. Available from: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.8984
Laoutaris N, Smaragdakis G, Bestavros A, Byers JW. Implications of Selfish Neighbor Selection in Overlay Networks. In: Proceedings of IEEE INFOCOM 2007. Proceedings of IEEE INFOCOM 2007. Anchorage, AK; 2007. Available from: www.cs.bu.edu/techreports/pdf/2006-019-selfish-neighbor-selection.pdf
Wang Y, Singhal M. On improving the efficiency of truthful routing in MANETs with selfish nodes. Pervasive Mob. Comput. [Internet]. 2007 ;3:537–559. Available from: http://portal.acm.org/citation.cfm?id=1290327#
Evans NS, GauthierDickey C, Grothoff C. Routing in the Dark: Pitch Black. In: 23rd Annual Computer Security Applications Conference (ACSAC 2007). 23rd Annual Computer Security Applications Conference (ACSAC 2007). IEEE Computer Society; 2007. pp. 305–314. Available from: http://grothoff.org/christian/pitchblack.pdf
Sherr M, Thau B, Blaze M. Towards application-aware anonymous routing. In: In Second USENIX Workshop on Hot Topics in Security (HotSec. In Second USENIX Workshop on Hot Topics in Security (HotSec. USENIX Association Berkeley, CA, USA; 2007. Available from: http://portal.acm.org/citation.cfm?id=1361423
2006
Mühlbauer W, Feldmann A, Maennel O, Roughan M, Uhlig S. Building an AS-topology model that captures route diversity. SIGCOMM Comput. Commun. Rev. [Internet]. 2006 ;36(4):195–206. Available from: http://portal.acm.org/citation.cfm?id=1159937#
Rahman SMM, Inomata A, Okamoto T, Mambo M. E.: Anonymous Secure Communication in Wireless Mobile Ad-hoc Networks. In: In: Proceedings of the First International Conference on Ubiquitous Convergence Technology. In: Proceedings of the First International Conference on Ubiquitous Convergence Technology. Springer; 2006. pp. 131–140. Available from: http://www.springerlink.com/content/g6334148068w1254/
2005
Widmer J. ABSTRACT Network Coding for Efficient Communication in Extreme Networks. [Internet]. 2005 . Available from: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.5368
Wang Y, Jain S, Martonosi M, Fall K. Erasure-coding based routing for opportunistic networks. In: ACM Press; 2005. pp. 229–236. Available from: http://doi.acm.org/10.1145/1080139.1080140
Feldman M, Chuang J, Stoica I, Shenker S. Hidden-action in multi-hop routing. In: EC'05. Proceedings of the 6th ACM Conference on Electronic Commerce. EC'05. Proceedings of the 6th ACM Conference on Electronic Commerce. Vancouver, Canada: ACM; 2005. pp. 117–126. Available from: http://doi.acm.org/10.1145/1064009.1064022
Tatara K, Hori Yoshiaki, Sakurai K. Query Forwarding Algorithm Supporting Initiator Anonymity in GNUnet. In: Parallel and Distributed Systems, 2005. Proceedings. 11th International Conference on. Vol. 2. Parallel and Distributed Systems, 2005. Proceedings. 11th International Conference on. ; 2005. pp. 235-239.
Perlman R. Routing with Byzantine robustness. [Internet]. 2005 . Available from: http://portal.acm.org/citation.cfm?id=1698181#

Pages