[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[GNUnet-SVN] r28811 - msh/doc
|
From: |
gnunet |
|
Subject: |
[GNUnet-SVN] r28811 - msh/doc |
|
Date: |
Fri, 23 Aug 2013 14:25:37 +0200 |
Author: harsha
Date: 2013-08-23 14:25:37 +0200 (Fri, 23 Aug 2013)
New Revision: 28811
Added:
msh/doc/related_work.bib
Modified:
msh/doc/msh.tex
Log:
- added introduction, limitations and bibliography
Modified: msh/doc/msh.tex
===================================================================
--- msh/doc/msh.tex 2013-08-23 12:20:16 UTC (rev 28810)
+++ msh/doc/msh.tex 2013-08-23 12:25:37 UTC (rev 28811)
@@ -1,4 +1,4 @@
-\documentclass[10pt, a4paper, onecolumn]{article}
+\documentclass[10pt, a4paper, onecolumn, twosided]{article}
\usepackage[utf8]{inputenc}
\usepackage{color}
@@ -20,15 +20,48 @@
Such hosts are commonly found in High Performance Computing (HPC) systems
such
as compute clusters or supercomputers.
- The motivation for this project is that often in such systems \texttt{ssh} is
- either unavailable or restricted for users due to security reasons. As a
- result, hosts in these systems cannot be used for non MPI applications such
as
- network emulators or testbeds which rely on \texttt{ssh} to establish
- connections among the hosts. \texttt{msh} aims to solve this problem by
+ The motivation for this project is that often in such systems Secure-Shell
+ (SSH) is either unavailable or restricted for users due to security reasons.
+ As a result, hosts in these systems cannot be used for non MPI applications
+ such as network emulators or testbeds which rely on SSH to establish
+ connections among the hosts. MSH aims to solve this problem by
providing an alternative remote shell which can be used by these applications
- instead of \texttt{ssh}.
+ instead of SSH.
\end{abstract}
+
+\section{Introduction}
+Large scale network experimentation of distributed systems is achieved by
+distributing the experiment across multiple physical nodes~\cite{dpeersim,
wids,
+ netlab, cset2011evans, totakura2013ms}. These tools coordinate the
experiment
+among the hosts by establishing SSH connections to run remote commands on the
+available hosts.
+
+A limiting factor in scaling network experiments in the availability of
+computing power and underlying network. This requirement for resources can be
+addressed by running network experiments on High Performance Computing (HPC)
+systems which are made up of many hosts interconnected with a high speed and
+high bandwidth network.
+
+The usage of HPC systems poses some new challenges: since HPC systems are used
+by multiple users simultaneously, they allocate exclusive resources
dynamically.
+The user has to determine these dynamically allocated resources before starting
+the experiment on these resources. The \textit{de-facto} standard for remote
+command execution, SSH, is increasingly made unavailable or restricted on HPC
+systems~\cite{supermuc} to prevent users from accessing resources which are not
+allocated to them. While such restriction does not effect the intended usage
of
+HPC systems which is to run parallel programs with Message Passing Interface
+(MPI) for communications, it presents users to use network experimentation
tools
+which rely on remote command execution.
+
+To overcome these challenges we propose, MSH, a new remote command execution
+system which uses MPI for determining node allocation and addressing. Our aims
+are: to provide MSH as a substitute for SSH for remote command execution; to
+make MSH behave similar to SSH such that the network experimentation tools do
+not have to be heavily modified; to determine the dynamically allocated
+resources on the HPC system and, finally, to be able to run network experiments
+on HPC systems.
+
\section{Architecture}
MSH consists of two components: the \texttt{mshd} daemon and the \texttt{msh}
@@ -93,23 +126,23 @@
from \texttt{msh} and \texttt{mshd} to each other respectively.
\end{enumerate}
-\section{Addressing}
+\section{Resource Discovery and Addressing}
\label{sec:addressing}
-While using \texttt{msh} remote hosts are addressed with their IP addresses.
-However, as the real communication is done through MPI, a mapping between the
IP
-addresses of all the hosts where the instances run and the instances' MPI ids
-has to be determined. This mapping is given to the application as a file from
-which the application can refer by IP address the host for executing a remote
-command.
+One of our aims is to determine the resources which are dynamically allocated
to
+us and provide their details to the experimentation tools. Since we intend to
+use MSH as a substitute for SSH, we provide the resources' IP addresses so that
+the tools can refer to these resources by IP addresses.
-The mapping is determined by having each instance verify the IP addresses of
all
-instances running on the allocated hosts. The verification proceeds in rounds
-where each instance verifies IP addresses of several instances. At the
-beginning of each round, every instance opens a socket bound to a random port
-and all available IP addresses on its host and sends the IP addresses to the
-instances for verification. The set of instances $n$ to be contacted is
-determined by the current round $r$ and the round width $R$ such that
+The mapping between the allocated hosts and their IP addresses is determined by
+having each \texttt{mshd} instance verify the IP addresses of all other
+\texttt{mshd} instances running on the allocated hosts. The verification
+proceeds in rounds where each instance verifies IP addresses of several
+instances. At the beginning of each round, every instance opens a socket bound
+to a random port and all available IP addresses on its host and sends the IP
+addresses to the instances for verification. The set of instances $n$ to be
+contacted is determined by the current round $r$ and the round width $R$ such
+that
\begin{center}
$ n = \{i\in I | (r.R + 1) \le i \le (r.R + r)\} $
\end{center}
@@ -131,5 +164,14 @@
tree reduction). The reduction is made by intersecting the reported IP
addresses for an instance.
+\section{Limitations}
+MSH does not have terminal handling capabilities. This means that applications
+such as \texttt{screen}, \texttt{less}, \texttt{vim} which require terminal
+(\texttt{tty}) support do not work through MSH. This also means that there is
+no support for sending control character sequences such as \texttt{Control+C}
to
+the remote command.
+\bibliographystyle{plain}
+\bibliography{related_work}
+
\end{document}
Added: msh/doc/related_work.bib
===================================================================
--- msh/doc/related_work.bib (rev 0)
+++ msh/doc/related_work.bib 2013-08-23 12:25:37 UTC (rev 28811)
@@ -0,0 +1,1447 @@
address@hidden {totakura2013ms,
+ title = {Large Scale Distributed Evaluation of Peer-to-Peer Protocols},
+ volume = {Master of Science},
+ year = {2013},
+ month = {06/2013},
+ pages = {76},
+ school = {Technische Universit\"at M\"unchen},
+ type = {Masters },
+ address = {Garching bei M\"unchen},
+ abstract = {Evaluations of P2P protocols during the
system{\textquoteright}s design and implementation phases are commonly done
through simulation and emulation respectively. While the current
state-of-the-art simulation allows evaluations with many millions of peers
through the use of abstractions, emulation still lags behind as it involves
executing the real implementation at some parts of the system. This difference
in scales can make it hard to relate the evaluations made created with
simulation and emulation during the design and implementation phases and can
results in a limited evaluation of the implementation, which may cause severe
problems after deployment.
+
+In this thesis, we build upon an existing emulator for P2P applications to
push the scales offered by emulation towards the limits set by simulation. Our
approach distributes and co-ordinates the emulation across many hosts. Large
deployments are possible by deploying hundreds or thousands of peers on each
host.
+
+To address the varying needs of an experimenter and the range of available
hardware, we make our approach scalable such that it can easily be adapted to
run evaluations on a single machine or a large group of hosts. Specifically,
the system automatically adjusts the number of overlapping operations to the
available resources efficiently using a feedback mechanism, thus relieving the
experimenter from the hassles of manual tuning.
+
+We specifically target HPC systems like compute clusters and supercomputers
and demonstrate how such systems can be used for large scale emulations by
evaluating two P2P applications with deployment sizes up to 90k peers on a
supercomputer.},
+ keywords = {emulation, GNUnet, large scale testing, protocol
evaluation, testbed},
+ author = {Totakura, Sree Harsha}
+}
+
address@hidden:conf/tridentcom/AlbrechtH10,
+ author = {Jeannie R. Albrecht and Danny Yuxing Huang},
+ title = {Managing Distributed Applications Using Gush},
+ booktitle = {TRIDENTCOM},
+ year = {2010},
+ pages = {401-411},
+ bibsource = {DBLP, http://dblp.uni-trier.de},
+ crossref = {DBLP:conf/tridentcom/2010},
+ ee = {http://dx.doi.org/10.1007/978-3-642-17851-1_31},
+ file = {:gush.pdf:PDF}
+}
+
address@hidden:conf/acsac/EvansGG07,
+ author = {Nathan S. Evans and Chris GauthierDickey and Christian Grothoff},
+ title = {Routing in the Dark: Pitch Black},
+ booktitle = {ACSAC},
+ year = {2007},
+ pages = {305-314},
+ bibsource = {DBLP, http://dblp.uni-trier.de},
+ crossref = {DBLP:conf/acsac/2007},
+ ee = {http://doi.ieeecomputersociety.org/10.1109/ACSAC.2007.36},
+ file = {:RoutingintheDark.pdf:PDF}
+}
+
address@hidden:conf/tridentcom/HermenierR12,
+ author = {Fabien Hermenier and Robert Ricci},
+ title = {How to Build a Better Testbed: Lessons from a Decade of Network
Experiments
+ on Emulab},
+ booktitle = {TRIDENTCOM},
+ year = {2012},
+ pages = {287-304},
+ bibsource = {DBLP, http://dblp.uni-trier.de},
+ crossref = {DBLP:conf/tridentcom/2012},
+ ee = {http://dx.doi.org/10.1007/978-3-642-35576-9_24},
+ file = {:how-to-build-a-better-testbed.pdf:PDF}
+}
+
address@hidden,
+ author = {Mike Hibler and Robert Ricci and Leigh Stoller and Jonathon Duerig
+ and Shashi Guruprasad and Tim Stack and Kirk Webb and Jay Lepreau},
+ title = {Large-scale Virtualization in the Emulab Network Testbed},
+ booktitle = {USENIX Annual Technical Conference},
+ year = {2008},
+ pages = {113-128},
+ bibsource = {DBLP, http://dblp.uni-trier.de},
+ crossref = {DBLP:conf/usenix/2008},
+ ee =
{http://www.usenix.org/events/usenix08/tech/fullpapers/hibler/hibler.pdf},
+ file = {:emulab_virtualisation.pdf:PDF}
+}
+
address@hidden:conf/tridentcom/NguyenRKFMB10,
+ author = {Hung X. Nguyen and Matthew Roughan and Simon Knight and Nick
Falkner
+ and Olaf Maennel and Randy Bush},
+ title = {How to Build Complex, Large-Scale Emulated Networks},
+ booktitle = {TRIDENTCOM},
+ year = {2010},
+ pages = {3-18},
+ bibsource = {DBLP, http://dblp.uni-trier.de},
+ crossref = {DBLP:conf/tridentcom/2010},
+ ee = {http://dx.doi.org/10.1007/978-3-642-17851-1_1},
+ file = {:AutoNetkit.pdf:PDF}
+}
+
address@hidden:conf/tridentcom/PeralaPML10,
+ author = {Pekka H. J. Per{\"a}l{\"a} and Jori P. Paananen and Milton
Mukhopadhyay
+ and Jukka-Pekka Laulajainen},
+ title = {A Novel Testbed for P2P Networks},
+ booktitle = {TRIDENTCOM},
+ year = {2010},
+ pages = {69-83},
+ bibsource = {DBLP, http://dblp.uni-trier.de},
+ crossref = {DBLP:conf/tridentcom/2010},
+ ee = {http://dx.doi.org/10.1007/978-3-642-17851-1_5},
+ file = {:A Novel Testbed for P2P Networks.pdf:PDF}
+}
+
address@hidden,
+ author = {Albrecht, J. and Tuttle, C. and Snoeren, A.C. and Vahdat, A.},
+ title = {PlanetLab application management using Plush},
+ journal = {ACM SIGOPS Operating Systems Review},
+ year = {2006},
+ volume = {40},
+ pages = {33--40},
+ number = {1},
+ file = {:plush.pdf:PDF},
+ publisher = {ACM}
+}
+
address@hidden,
+ title = {InfiniBand Architecture Specification: Release 1.0},
+ publisher = {InfiniBand Trade Association},
+ year = {2000},
+ author = {InfiniBand Trade Association}
+}
+
address@hidden,
+ title = {Handbook of simulation},
+ publisher = {Wiley Online Library},
+ year = {1998},
+ author = {Banks, Jerry and others}
+}
+
address@hidden,
+ author = {Barab{\'a}si, Albert-L{\'a}szl{\'o} and Albert, R{\'e}ka},
+ title = {Emergence of scaling in random networks},
+ journal = {science},
+ year = {1999},
+ volume = {286},
+ pages = {509--512},
+ number = {5439},
+ file = {:emergence_of_scaling_in_random_networks.pdf:PDF},
+ publisher = {American Association for the Advancement of Science}
+}
+
address@hidden,
+ author = {Barham, Paul and Dragovic, Boris and Fraser, Keir and Hand, Steven
+ and Harris, Tim and Ho, Alex and Neugebauer, Rolf and Pratt, Ian
+ and Warfield, Andrew},
+ title = {Xen and the art of virtualization},
+ journal = {ACM SIGOPS Operating Systems Review},
+ year = {2003},
+ volume = {37},
+ pages = {164--177},
+ number = {5},
+ publisher = {ACM}
+}
+
address@hidden,
+ author = {Baumgart, I. and Heep, B. and Krause, S.},
+ title = {OverSim: A Flexible Overlay Network Simulation Framework},
+ booktitle = {IEEE Global Internet Symposium, 2007},
+ year = {2007},
+ pages = {79-84},
+ doi = {10.1109/GI.2007.4301435},
+ file = {:OverSim_2007.pdf:PDF},
+ keywords = {graphical user interfaces;peer-to-peer
computing;protocols;OMNeT++;OverSim;flexible
+ overlay network simulation framework;generic lookup mechanism;overlay
+ protocols;peer-to- peer networks;peer-to-peer protocols;Access
protocols;Application
+ software;Computational modeling;Costs;Discrete event
simulation;Java;Next
+ generation networking;Object oriented modeling;Peer to peer
computing;Testing}
+}
+
address@hidden,
+ author = {Benzel, T. and Braden, R. and Kim, D. and Neuman, C. and Joseph,
+ A. and Sklower, K. and Ostrenga, R. and Schwab, S.},
+ title = {Experience with DETER: a testbed for security research},
+ booktitle = {Testbeds and Research Infrastructures for the Development of
Networks
+ and Communities, 2006. TRIDENTCOM 2006. 2nd International Conference
+ on},
+ year = {2006},
+ pages = {10 pp.-388},
+ doi = {10.1109/TRIDNT.2006.1649172},
+ issn = {Not Applica},
+ keywords = {security of data;telecommunication security;DETER;malicious
code;security
+ research;Computer science;Computer security;Data
security;Hardware;Information
+ security;Internet;Protection;System testing;Telecommunication
traffic;Traffic
+ control}
+}
+
address@hidden,
+ author = {Bolze, Raphaël and Cappello, Franck and Caron, Eddy and Daydé,
Michel
+ and Desprez, Frédéric and Jeannot, Emmanuel and Jégou, Yvon and Lanteri,
+ Stephane and Leduc, Julien and Melab, Noredine and Mornet, Guillaume
+ and Namyst, Raymond and Primet, Pascale and Quetier, Benjamin and
+ Richard, Olivier and Talbi, El-Ghazali and Touche, Iréa},
+ title = {Grid'5000: A Large Scale And Highly Reconfigurable Experimental Grid
+ Testbed},
+ journal = {International Journal of High Performance Computing Applications},
+ year = {2006},
+ volume = {20},
+ pages = {481-494},
+ number = {4},
+ abstract = {Large scale distributed systems such as Grids are difficult to
study
+ from theoretical models and simulators only. Most Grids deployed
+ at large scale are production platforms that are inappropriate research
+ tools because of their limited reconfiguration, control and monitoring
+ capabilities. In this paper, we present Grid'5000, a 5000 CPU
nation-wide
+ infrastructure for research in Grid computing. Grid'5000 is designed
+ to provide a scientific tool for computer scientists similar to the
+ large-scale instruments used by physicists, astronomers, and biologists.
+ We describe the motivations, design considerations, architecture,
+ control, and monitoring infrastructure of this experimental platform.
+ We present configuration examples and performance results for the
+ reconfiguration subsystem.},
+ doi = {10.1177/1094342006070078},
+ eprint = {http://hpc.sagepub.com/content/20/4/481.full.pdf+html},
+ url = {http://hpc.sagepub.com/content/20/4/481.abstract}
+}
+
address@hidden,
+ author = {Chertov, Roman and Fahmy, Sonia and Shroff, Ness B.},
+ title = {Fidelity of network simulation and emulation: A case study of
TCP-targeted
+ denial of service attacks},
+ journal = {ACM Trans. Model. Comput. Simul.},
+ year = {2009},
+ volume = {19},
+ pages = {4:1--4:29},
+ number = {1},
+ month = jan,
+ acmid = {1456649},
+ address = {New York, NY, USA},
+ articleno = {4},
+ doi = {10.1145/1456645.1456649},
+ file = {:fidelity_sim_emu.pdf:PDF},
+ issn = {1049-3301},
+ issue_date = {December 2008},
+ keywords = {Simulation, TCP, congestion control, denial of service attacks,
emulation,
+ low-rate TCP-targeted attacks, testbeds},
+ numpages = {29},
+ publisher = {ACM},
+ url = {http://doi.acm.org/10.1145/1456645.1456649}
+}
+
address@hidden,
+ author = {Chun, Brent and Culler, David and Roscoe, Timothy and Bavier, Andy
+ and Peterson, Larry and Wawrzoniak, Mike and Bowman, Mic},
+ title = {PlanetLab: an overlay testbed for broad-coverage services},
+ journal = {SIGCOMM Comput. Commun. Rev.},
+ year = {2003},
+ volume = {33},
+ pages = {3--12},
+ number = {3},
+ month = jul,
+ acmid = {956995},
+ address = {New York, NY, USA},
+ doi = {10.1145/956993.956995},
+ issn = {0146-4833},
+ issue_date = {July 2003},
+ numpages = {10},
+ publisher = {ACM},
+ url = {http://doi.acm.org/10.1145/956993.956995}
+}
+
address@hidden,
+ author = {Clarke, Ian and Sandberg, Oskar and Wiley, Brandon and Hong,
TheodoreW.},
+ title = {Freenet: A Distributed Anonymous Information Storage and Retrieval
+ System},
+ booktitle = {Designing Privacy Enhancing Technologies},
+ publisher = {Springer Berlin Heidelberg},
+ year = {2001},
+ editor = {Federrath, Hannes},
+ volume = {2009},
+ series = {Lecture Notes in Computer Science},
+ pages = {46-66},
+ doi = {10.1007/3-540-44702-4_4},
+ file = {:freenet.pdf:PDF},
+ isbn = {978-3-540-41724-8},
+ language = {English},
+ url = {http://dx.doi.org/10.1007/3-540-44702-4_4}
+}
+
address@hidden,
+ author = {Cohen, Bram},
+ title = {The BitTorrent protocol specification},
+ year = {2008},
+ publisher = {BITTORRENT}
+}
+
address@hidden,
+ author = {Dagum, L. and Menon, R.},
+ title = {OpenMP: an industry standard API for shared-memory programming},
+ journal = {Computational Science Engineering, IEEE},
+ year = {1998},
+ volume = {5},
+ pages = {46-55},
+ number = {1},
+ doi = {10.1109/99.660313},
+ issn = {1070-9924},
+ keywords = {application program interfaces;parallel programming;shared memory
+ systems;software portability;software reviews;software
standards;Fortran;Fortran
+ 90;Fortran 95;Fortran compiler;OpenMP;X3H5
concepts;allocatables;callable
+ runtime library;callable runtime library routines;coarse grain
parallelism;compiler
+ directives;environment variables;industry standard API;pointers;shared
+ memory parallelism;shared memory programming;ANSI
standards;Coherence;Computer
+ architecture;Hardware;Message passing;Parallel processing;Parallel
+ programming;Power system modeling;Scalability;Software systems}
+}
+
address@hidden,
+ author = {Dingledine, R and Mathewson, N and Syverson, P},
+ title = {TOR: the onion router. Tor Project/EFF},
+ howpublished = {\url{https://www.torproject.org/}}
+}
+
address@hidden,
+ author = {Tien Tuan Anh Dinh and Lees, M. and Theodoropoulos, G. and Minson,
+ R.},
+ title = {Large Scale Distributed Simulation of p2p Networks},
+ booktitle = {Parallel, Distributed and Network-Based Processing, 2008. PDP
2008.
+ 16th Euromicro Conference on},
+ year = {2008},
+ pages = {499-507},
+ doi = {10.1109/PDP.2008.67},
+ file = {:dpeersim.pdf:PDF},
+ keywords = {discrete event simulation;peer-to-peer computing;Chord p2p
protocol;PeerSim;large
+ scale distributed simulation;p2p networks;parallel discrete event
+ simulation techniques;Algorithm design and analysis;Analytical
models;Computational
+ modeling;Discrete event simulation;Large-scale systems;Network
servers;Peer
+ to peer computing;Protocols;Robustness;Scalability;Distributed;Large
+ Scale;Parallel;Simulation}
+}
+
address@hidden:2007:ESL:1272980.1272986,
+ author = {Eger, Kolja and Ho\ssfeld, Tobias and Binzenh\"{o}fer, Andreas and
+ Kunzmann, Gerald},
+ title = {Efficient simulation of large-scale p2p networks: packet-level vs.
+ flow-level simulations},
+ booktitle = {Proceedings of the second workshop on Use of P2P, GRID and
agents
+ for the development of content networks},
+ year = {2007},
+ series = {UPGRADE '07},
+ pages = {9--16},
+ address = {New York, NY, USA},
+ publisher = {ACM},
+ acmid = {1272986},
+ doi = {10.1145/1272980.1272986},
+ file = {:p2p_sim_flow_level_vs_packet_level.pdf:PDF},
+ isbn = {978-1-59593-718-6},
+ keywords = {BitTorrent, content distribution, peer-to-peer, simulation},
+ location = {Monterey, California, USA},
+ numpages = {8},
+ url = {http://doi.acm.org/10.1145/1272980.1272986}
+}
+
address@hidden,
+ author = {Erdos, Paul and R{\'e}nyi, Alfr{\'e}d},
+ title = {On the evolution of random graphs},
+ journal = {Bull. Inst. Internat. Statist},
+ year = {1961},
+ volume = {38},
+ pages = {343--347},
+ number = {4}
+}
+
address@hidden:2003:LPB:945506.945507,
+ author = {Eugster, P. Th. and Guerraoui, R. and Handurukande, S. B. and
Kouznetsov,
+ P. and Kermarrec, A.-M.},
+ title = {Lightweight probabilistic broadcast},
+ journal = {ACM Trans. Comput. Syst.},
+ year = {2003},
+ volume = {21},
+ pages = {341--374},
+ number = {4},
+ month = nov,
+ acmid = {945507},
+ address = {New York, NY, USA},
+ doi = {10.1145/945506.945507},
+ issn = {0734-2071},
+ issue_date = {November 2003},
+ keywords = {Broadcast, buffering, garbage collection, gossip, noise,
randomization,
+ reliability, scalability},
+ numpages = {34},
+ publisher = {ACM},
+ url = {http://doi.acm.org/10.1145/945506.945507}
+}
+
address@hidden,
+ author = {Evans, N.S. and Grothoff, C.},
+ title = {R5n: Randomized recursive routing for restricted-route networks},
+ booktitle = {Network and System Security (NSS), 2011 5th International
Conference
+ on},
+ year = {2011},
+ pages = {316--321},
+ organization = {IEEE},
+ file = {:r5n.pdf:PDF}
+}
+
address@hidden,
+ author = {Evans, Nathan and Polot, Bartlomiej and Grothoff, Christian},
+ title = {Efficient and secure decentralized network size estimation},
+ booktitle = {NETWORKING 2012},
+ publisher = {Springer},
+ year = {2012},
+ pages = {304--317}
+}
+
address@hidden,
+ author = {Nathan S. Evans},
+ title = {Methods for Secure Decentralized Routing in Open Networks},
+ school = {Technische Universit{\"a}t M{\"u}nchen},
+ year = {2011},
+ address = {Garching bei M{\"u}nchen},
+ month = {08/2011},
+ abstract = { The contribution of this thesis is the study and improvement of
secure,
+ decentralized, robust routing algorithms for open networks including
+ ad-hoc networks and peer-to-peer (P2P) overlay networks. The main
+ goals for our secure routing algorithm are openness, efficiency,
+ scalability and resilience to various types of attacks. Common P2P
+ routing algorithms trade-off decentralization for security; for instance
+ by choosing whether or not to require a centralized authority to
+ allow peers to join the network. Other algorithms trade scalability
+ for security, for example employing random search or flooding to
+ prevent certain types of attacks. Our design attempts to meet our
+ security goals in an open system, while limiting the performance
+ penalties incurred.
+
+ The first step we took towards designing our routing algorithm was
+ an analysis of the routing algorithm in Freenet. This algorithm is
+ relevant because it achieves efficient (order O(log n)) routing in
+ realistic network topologies in a fully decentralized open network.
+ However, we demonstrate why their algorithm is not secure, as malicious
+ participants are able to severely disrupt the operation of the network.
+ The main difficulty with the Freenet routing algorithm is that for
+ performance it relies on information received from untrusted peers.
+ We also detail a range of proposed solutions, none of which we found
+ to fully fix the problem.
+
+ A related problem for efficient routing in sparsely connected networks
+ is the difficulty in sufficiently populating routing tables. One
+ way to improve connectivity in P2P overlay networks is by utilizing
+ modern NAT traversal techniques. We employ a number of standard NAT
+ traversal techniques in our approach, and also developed and
experimented
+ with a novel method for NAT traversal based on ICMP and UDP hole
+ punching. Unlike other NAT traversal techniques ours does not require
+ a trusted third party.
+
+ Another technique we use in our implementation to help address the
+ connectivity problem in sparse networks is the use of distance vector
+ routing in a small local neighborhood. The distance vector variant
+ used in our system employs onion routing to secure the resulting
+ indirect connections. Materially to this design, we discovered a
+ serious vulnerability in the Tor protocol which allowed us to use
+ a DoS attack to reduce the anonymity of the users of this extant
+ anonymizing P2P network. This vulnerability is based on allowing
+ paths of unrestricted length for onion routes through the network.
+ Analyzing Tor and implementing this attack gave us valuable knowledge
+ which helped when designing the distance vector routing protocol
+ for our system.
+
+ Finally, we present the design of our new secure randomized routing
+ algorithm that does not suffer from the various problems we discovered
+ in previous designs. Goals for the algorithm include providing
efficiency
+ and robustness in the presence of malicious participants for an open,
+ fully decentralized network without trusted authorities. We provide
+ a mathematical analysis of the algorithm itself and have created
+ and deployed an implementation of this algorithm in GNUnet. In this
+ thesis we also provide a detailed overview of a distributed emulation
+ framework capable of running a large number of nodes using our full
+ code base as well as some of the challenges encountered in creating
+ and using such a testing framework. We present extensive experimental
+ results showing that our routing algorithm outperforms the dominant
+ DHT design in target topologies, and performs comparably in other
+ scenarios.},
+ attachments = {https://gnunet.org/sites/default/files/NET-2011-08-1.pdf},
+ file = {:NET-2011-08-1.pdf:PDF},
+ isbn = {3-937201-26-2},
+ issn = {1868-2642},
+ keywords = {DHT, Freenet, GNUnet, NAT, R5N, Tor},
+ pages = {234},
+ volume = {Dr. rer. nat.}
+}
+
address@hidden,
+ author = {Nathan S. Evans and Christian Grothoff},
+ title = {Beyond Simulation: Large-Scale Distributed Emulation of P2P
Protocols},
+ booktitle = {4th Workshop on Cyber Security Experimentation and Test (CSET
2011)},
+ year = {2011},
+ address = {San Francisco, California},
+ organization = {USENIX Association},
+ publisher = {USENIX Association},
+ abstract = {This paper presents details on the design and implementation of a
+ scalable framework for evaluating peer-to-peer protocols. Unlike
+ systems based on simulation, emulation-based systems enable the
experimenter
+ to obtain data that reflects directly on the concrete implementation
+ in much greater detail. This paper argues that emulation is a better
+ model for experiments with peer-to-peer protocols since it can provide
+ scalability and high flexibility while eliminating the cost of moving
+ from experimentation to deployment. We discuss our unique experience
+ with large-scale emulation using the GNUnet peer-to-peer framework
+ and provide experimental results to support these claims. },
+ file = {:cset2011.pdf:PDF},
+ keywords = {DHT, emulation, GNUnet, scalability, security analysis}
+}
+
address@hidden,
+ author = {Nathan S. Evans and Polot, Bartlomiej and Christian Grothoff},
+ title = {Efficient and Secure Decentralized Network Size Estimation, Tech
+ Report},
+ year = {2012},
+ month = {05/2012},
+ abstract = {The size of a Peer-to-Peer (P2P) network is an important
parameter
+ for performance tuning of P2P routing algorithms. This paper introduces
+ and evaluates a new efficient method for participants in an unstructured
+ P2P network to establish the size of the overall network. The presented
+ method is highly efficient, propagating information about the current
+ size of the network to all participants using O(|E|) operations where
+ |E| is the number of edges in the network. Afterwards, all nodes
+ have the same network size estimate, which can be made arbitrarily
+ accurate by averaging results from multiple rounds of the protocol.
+ Security measures are included which make it prohibitively expensive
+ for a typical active participating adversary to significantly manipulate
+ the estimates. This paper includes experimental results that demonstrate
+ the viability, efficiency and accuracy of the protocol.},
+ address = {Garching bei Muenchen},
+ attachments = {https://gnunet.org/sites/default/files/nse-techreport.pdf},
+ file = {:nse2012.pdf:PDF},
+ institution = {Technische Universitaet Muenchen},
+ keywords = {GNUnet, network security, network size estimation, peer-to-peer
networking}
+}
+
address@hidden,
+ author = {Fall, Kevin and Varadhan, Kannan},
+ title = {The network simulator (ns-2)},
+ journal = {URL: http://www. isi. edu/nsnam/ns},
+ year = {2007}
+}
+
address@hidden,
+ author = {Freire, ClaudioDaniel and Quereilhac, Alina and Turletti, Thierry
+ and Dabbous, Walid},
+ title = {Automated Deployment and Customization of Routing Overlays on
Planetlab},
+ booktitle = {Testbeds and Research Infrastructure. Development of Networks
and
+ Communities},
+ publisher = {Springer Berlin Heidelberg},
+ year = {2012},
+ editor = {Korakis, Thanasis and Zink, Michael and Ott, Maximilian},
+ volume = {44},
+ series = {Lecture Notes of the Institute for Computer Sciences, Social
Informatics
+ and Telecommunications Engineering},
+ pages = {240-255},
+ doi = {10.1007/978-3-642-35576-9_21},
+ isbn = {978-3-642-35575-2},
+ keywords = {networking; overlays; PlanetLab; NEPI},
+ url = {http://dx.doi.org/10.1007/978-3-642-35576-9_21}
+}
+
address@hidden,
+ author = {Zihui Ge and Figueiredo, D.R. and Jaiswal, S. and Kurose, J. and
+ Towsley, D.},
+ title = {Modeling peer-peer file sharing systems},
+ booktitle = {INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE
Computer
+ and Communications. IEEE Societies},
+ year = {2003},
+ volume = {3},
+ pages = {2188-2198 vol.3},
+ doi = {10.1109/INFCOM.2003.1209239},
+ file = {:modelling_p2p_file_sharing.pdf:PDF},
+ issn = {0743-166X},
+ keywords = {Internet;distributed processing;file organisation;query
processing;centralized
+ indexing;distributed indexing;distributed network applications;file
+ sharing systems;flooded queries;freeloaders;hashing directed
queries;mathematical
+ models;peer-peer network;performance degradation;spare capacity;system
+ throughput;Application software;Availability;Computer
science;Degradation;Indexing;Mathematical
+ model;Network servers;Peer to peer computing;System
performance;Throughput}
+}
+
address@hidden,
+ author = {Thomas J. Giuli and Mary Baker},
+ title = {Narses: A Scalable Flow-Based Network Simulator},
+ journal = {CoRR},
+ year = {2002},
+ volume = {cs.PF/0211024},
+ bibsource = {DBLP, http://dblp.uni-trier.de},
+ ee = {http://arxiv.org/abs/cs.PF/0211024},
+ file = {:Narses_a_scalable_flow_based_network_simulator.pdf:PDF}
+}
+
address@hidden,
+ title = {Using MPI-: Portable Parallel Programming with the Message Passing
+ Interface},
+ publisher = {MIT press},
+ year = {1999},
+ author = {Gropp, William and Lusk, Ewing L and Skjellum, Anthony},
+ volume = {1}
+}
+
address@hidden,
+ author = {Gupta, Diwaker and Vishwanath, Kashi Venkatesh and McNett, Marvin
+ and Vahdat, Amin and Yocum, Ken and Snoeren, Alex and Voelker, Geoffrey
+ M.},
+ title = {DieCast: Testing Distributed Systems with an Accurate Scale Model},
+ journal = {ACM Trans. Comput. Syst.},
+ year = {2011},
+ volume = {29},
+ pages = {4:1--4:48},
+ number = {2},
+ month = may,
+ acmid = {1963560},
+ address = {New York, NY, USA},
+ articleno = {4},
+ doi = {10.1145/1963559.1963560},
+ file = {:diecast.pdf:PDF},
+ issn = {0734-2071},
+ issue_date = {May 2011},
+ keywords = {Virtualization, Xen, network emulation},
+ numpages = {48},
+ publisher = {ACM},
+ url =
{http://static.usenix.org/event/nsdi08/tech/full_papers/gupta/gupta_html/}
+}
+
address@hidden,
+ author = {Gupta, Diwaker and Yocum, Kenneth and McNett, Marvin and Snoeren,
+ Alex C. and Vahdat, Amin and Voelker, Geoffrey M.},
+ title = {To infinity and beyond: time warped network emulation},
+ booktitle = {Proceedings of the twentieth ACM symposium on Operating systems
principles},
+ year = {2005},
+ series = {SOSP '05},
+ pages = {1--2},
+ address = {New York, NY, USA},
+ publisher = {ACM},
+ acmid = {1118605},
+ doi = {10.1145/1095810.1118605},
+ file = {:emulation_timewrap.pdf:PDF},
+ isbn = {1-59593-079-5},
+ location = {Brighton, United Kingdom},
+ numpages = {2},
+ url = {http://doi.acm.org/10.1145/1095810.1118605}
+}
+
address@hidden,
+ author = {Gupta, Indranil and Birman, Ken and Linga, Prakash and Demers, Al
+ and Van Renesse, Robbert},
+ title = {Kelips: Building an efficient and stable P2P DHT through increased
+ memory and background overhead},
+ booktitle = {Peer-to-Peer Systems II},
+ publisher = {Springer},
+ year = {2003},
+ pages = {160--169},
+ file = {:kelips.pdf:PDF}
+}
+
address@hidden,
+ author = {Gupta, Rajiv},
+ title = {The fuzzy barrier: a mechanism for high speed synchronization of
+ processors},
+ booktitle = {ACM SIGARCH Computer Architecture News},
+ year = {1989},
+ volume = {17},
+ number = {2},
+ pages = {54--63},
+ organization = {ACM}
+}
+
address@hidden,
+ author = {Handigol, N. and Heller, B. and Jeyakumar, V. and Lantz, B. and
McKeown,
+ N.},
+ title = {Reproducible network experiments using container based emulation},
+ journal = {Proc. CoNEXT},
+ year = {2012},
+ __markedentry = {[harsha:1]},
+ file = {:mininet-hifi.pdf:PDF}
+}
+
address@hidden,
+ author = {Qi He and Ammar, M. and Riley, G. and Raj, H. and Fujimoto, R.},
+ title = {Mapping peer behavior to packet-level details: a framework for
packet-level
+ simulation of peer-to-peer systems},
+ booktitle = {Modeling, Analysis and Simulation of Computer Telecommunications
+ Systems, 2003. MASCOTS 2003. 11th IEEE/ACM International Symposium
+ on},
+ year = {2003},
+ pages = {71-78},
+ doi = {10.1109/MASCOT.2003.1240644},
+ file = {:p2p_sim_framework.pdf:PDF},
+ issn = {1526-7539},
+ keywords = {discrete event simulation;parallel processing;performance
evaluation;transport
+ protocols;Gnutella protocol;Gnutella system performance;discrete-event
+ simulation;network simulator;packet-level simulation;parallelization
+ techniques;peer-to-peer system;underlying network
characteristic;Computational
+ modeling;Network servers;Network topology;Peer to peer
computing;Proposals;Protocols;Telecommunication
+ computing;Telecommunication traffic;Throughput;Traffic control}
+}
+
address@hidden,
+ author = {Herrmann, Michael and Grothoff, Christian},
+ title = {Privacy-Implications of Performance-Based Peer Selection by
Onion-Routers:
+ A Real-World Case Study Using I2P},
+ booktitle = {Privacy Enhancing Technologies},
+ publisher = {Springer Berlin Heidelberg},
+ year = {2011},
+ editor = {Fischer-Hübner, Simone and Hopper, Nicholas},
+ volume = {6794},
+ series = {Lecture Notes in Computer Science},
+ pages = {155-174},
+ doi = {10.1007/978-3-642-22263-4_9},
+ isbn = {978-3-642-22262-7},
+ url = {http://dx.doi.org/10.1007/978-3-642-22263-4_9}
+}
+
address@hidden,
+ author = {Isdal, Tomas and Piatek, Michael and Krishnamurthy, Arvind and
Anderson,
+ Thomas},
+ title = {Privacy-preserving P2P data sharing with OneSwarm},
+ booktitle = {ACM SIGCOMM Computer Communication Review},
+ year = {2010},
+ volume = {40},
+ number = {4},
+ pages = {111--122},
+ organization = {ACM},
+ file = {:oneswarm.pdf:PDF}
+}
+
address@hidden,
+ author = {Jansen, Rob and Hooper, Nicholas},
+ title = {Shadow: Running Tor in a box for accurate and efficient
experimentation},
+ institution = {DTIC Document},
+ year = {2011}
+}
+
address@hidden,
+ author = {Kangasharju, Jussi and Schmidt, Uwe and Bradler, Dirk and
Schr\"{o}der-Bernhardi,
+ Julian},
+ title = {ChunkSim: simulating peer-to-peer content distribution},
+ booktitle = {Proceedings of the 2007 spring simulaiton multiconference -
Volume
+ 1},
+ year = {2007},
+ series = {SpringSim '07},
+ pages = {25--32},
+ address = {San Diego, CA, USA},
+ publisher = {Society for Computer Simulation International},
+ acmid = {1404599},
+ file = {:chunksim.pdf:PDF},
+ isbn = {1-56555-312-8},
+ keywords = {BitTorrent, content distribution, peer-to-peer},
+ location = {Norfolk, Virginia},
+ numpages = {8},
+ url = {http://dl.acm.org/citation.cfm?id=1404595.1404599}
+}
+
address@hidden,
+ author = {Kashyap, Vivek},
+ title = {IP over InfiniBand (IPoIB) Architecture},
+ year = {2006},
+ howpublished = {\url{https://tools.ietf.org/html/rfc4392}}
+}
+
address@hidden,
+ author = {Knight, Simon and Jaboldinov, Askar and Maennel, Olaf and Phillips,
+ Iain and Roughan, Matthew},
+ title = {AutoNetkit: simplifying large scale, open-source network
experimentation},
+ journal = {SIGCOMM Comput. Commun. Rev.},
+ year = {2012},
+ volume = {42},
+ pages = {97--98},
+ number = {4},
+ month = aug,
+ acmid = {2377699},
+ address = {New York, NY, USA},
+ doi = {10.1145/2377677.2377699},
+ file = {:autonetkit-small.pdf:PDF},
+ issn = {0146-4833},
+ issue_date = {October 2012},
+ keywords = {automated configuration, emulation, network management},
+ numpages = {2},
+ publisher = {ACM},
+ url = {http://doi.acm.org/10.1145/2377677.2377699}
+}
+
address@hidden,
+ author = {Kostoulas, D. and Psaltoulis, D. and Gupta, I. and Birman, K. and
+ Al Demers},
+ title = {Decentralized Schemes for Size Estimation in Large and Dynamic
Groups},
+ booktitle = {Network Computing and Applications, Fourth IEEE International
Symposium
+ on},
+ year = {2005},
+ pages = {41-48},
+ doi = {10.1109/NCA.2005.15},
+ keywords = {grid computing;peer-to-peer computing;decentralized
algorithm;distributed
+ system;dynamic group;grid system;group size estimation;large-scale
+ group;nonfaulty process;peer-to-peer system;probabilistic
accuracy;scalable
+ per-process overhead;statistic collection problem;Algorithm design
+ and analysis;Computer science;Delay estimation;Global
communication;Large-scale
+ systems;Multicast algorithms;Peer to peer
computing;Protocols;Routing;Statistical
+ distributions}
+}
+
address@hidden,
+ author = {Kotilainen, N. and Vapa, M. and Keltanen, T. and Auvinen, A. and
+ Vuori, J.},
+ title = {P2PRealm - peer-to-peer network simulator},
+ booktitle = {Computer-Aided Modeling, Analysis and Design of Communication
Links
+ and Networks, 2006 11th International Workshop on},
+ year = {2006},
+ pages = {93-99},
+ doi = {10.1109/CAMAD.2006.1649724},
+ file = {:p2prealm.pdf:PDF},
+ keywords = {Java;neural nets;peer-to-peer computing;Java native
interface;P2PRealm;P2PStudio
+ network visualization tool;neural networks;peer-to-peer network
simulator;Computational
+ modeling;Crawlers;Data structures;Information
technology;Monitoring;Neural
+ networks;Peer to peer computing;Protocols;Visualization;Workstations}
+}
+
address@hidden,
+ author = {Lantz, Bob and Heller, Brandon and McKeown, Nick},
+ title = {A network in a laptop: rapid prototyping for software-defined
networks},
+ booktitle = {Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in
Networks},
+ year = {2010},
+ series = {Hotnets-IX},
+ pages = {19:1--19:6},
+ address = {New York, NY, USA},
+ publisher = {ACM},
+ acmid = {1868466},
+ articleno = {19},
+ doi = {10.1145/1868447.1868466},
+ file = {:mininet.pdf:PDF},
+ isbn = {978-1-4503-0409-2},
+ keywords = {emulation, open-flow, rapid prototyping, software defined
networking,
+ virtualization},
+ location = {Monterey, California},
+ numpages = {6},
+ url = {http://doi.acm.org/10.1145/1868447.1868466}
+}
+
address@hidden,
+ author = {Leber, Mike},
+ title = {Global IPv6 Deployment Progress Report},
+ journal = {Hurricane Electric,[Online]},
+ year = {2009},
+ howpublished = {\url{http://bgp.he.net/ipv6-progress-report.cgi}}
+}
+
address@hidden,
+ author = {Leiserson, C.E.},
+ title = {Fat-trees: Universal networks for hardware-efficient
supercomputing},
+ journal = {Computers, IEEE Transactions on},
+ year = {1985},
+ volume = {C-34},
+ pages = {892-901},
+ number = {10},
+ doi = {10.1109/TC.1985.6312192},
+ issn = {0018-9340},
+ keywords = {computer networks;finite element analysis;parallel
processing;trees
+ (mathematics);fat trees;finite-element analysis;general-purpose parallel
+ supercomputer;hardware size;hardware-efficient
supercomputing;simultaneous
+ communication;three-dimensional VLSI model;universal
networks;universality
+ theorem;Channel capacity;Hardware;Program
processors;Routing;Switches;Wires;Fat-trees;VLSI
+ theory;interconnection networks;parallel supercomputing;routing
networks;universality}
+}
+
address@hidden,
+ author = {Jinyang Li and Stribling, J. and Morris, R. and Kaashoek, M.F. and
+ Gil, T.M.},
+ title = {A performance vs. cost framework for evaluating DHT design tradeoffs
+ under churn},
+ booktitle = {INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer
and
+ Communications Societies. Proceedings IEEE},
+ year = {2005},
+ volume = {1},
+ pages = {225-236 vol. 1},
+ doi = {10.1109/INFCOM.2005.1497894},
+ file = {:p2psim_structured_DHT.pdf:PDF},
+ issn = {0743-166X},
+ keywords = {bandwidth allocation;file organisation;maintenance
engineering;routing
+ protocols;table lookup;telecommunication traffic;distributed hash
+ tables;lookup traffic;maintenance traffic;network bandwidth;performance
+ versus cost framework;proactive flooding;routing protocols;routing
+ table stabilization;stabilization protocols;Artificial
intelligence;Bandwidth;Computer
+ science;Costs;Delay;Floods;Gas insulated transmission
lines;Laboratories;Routing
+ protocols;Telecommunication traffic}
+}
+
address@hidden,
+ author = {Shiding Lin and Aimin Pan and Rui Guo and Zheng Zhang},
+ title = {Simulating large-scale P2P systems with the WiDS toolkit},
+ booktitle = {Modeling, Analysis, and Simulation of Computer and
Telecommunication
+ Systems, 2005. 13th IEEE International Symposium on},
+ year = {2005},
+ pages = {415-424},
+ doi = {10.1109/MASCOTS.2005.63},
+ file = {:p2p_simulation_with_wids_toolkit.pdf:PDF},
+ issn = {1526-7539},
+ keywords = {large-scale systems;logic simulation;peer-to-peer
computing;protocols;relaxation
+ theory;workstation clusters;SMR;WiDS toolkit;commodity PC
cluster;critical
+ optimization;distributed protocol;large-scale P2P system;logical
+ time window;lookahead scheme;simulation engine;slow message
relaxation;trade
+ simulation accuracy;Debugging;Discrete event
simulation;Engines;Large-scale
+ systems;Libraries;Logic testing;Production;Protocols;Runtime;Switches}
+}
+
address@hidden,
+ author = {Makris, Nikos and Keranidis, Stratos and Giatsios, Dimitris and
Korakis,
+ Thanasis and Koutsopoulos, Iordanis and Tassiulas, Leandros and
Rakotoarivelo,
+ Thierry and Parmentelat, Thierry},
+ title = {Cross-Testbed Experimentation Using the Planetlab-NITOS Federation},
+ booktitle = {Testbeds and Research Infrastructure. Development of Networks
and
+ Communities},
+ publisher = {Springer Berlin Heidelberg},
+ year = {2012},
+ editor = {Korakis, Thanasis and Zink, Michael and Ott, Maximilian},
+ volume = {44},
+ series = {Lecture Notes of the Institute for Computer Sciences, Social
Informatics
+ and Telecommunications Engineering},
+ pages = {373-376},
+ doi = {10.1007/978-3-642-35576-9_34},
+ isbn = {978-3-642-35575-2},
+ url = {http://dx.doi.org/10.1007/978-3-642-35576-9_34}
+}
+
address@hidden,
+ author = {Manku, Gurmeet Singh and Bawa, Mayank and Raghavan, Prabhakar and
+ others},
+ title = {Symphony: Distributed hashing in a small world},
+ booktitle = {Proceedings of the 4th USENIX Symposium on Internet Technologies
+ and Systems},
+ year = {2003},
+ volume = {4},
+ pages = {10--10},
+ file = {:symphony.pdf:PDF}
+}
+
address@hidden:2006:PCS:1146381.1146402,
+ author = {Massouli{\'e}, Laurent and Le Merrer, Erwan and Kermarrec,
Anne-Marie
+ and Ganesh, Ayalvadi},
+ title = {Peer counting and sampling in overlay networks: random walk
methods},
+ booktitle = {Proceedings of the twenty-fifth annual ACM symposium on
Principles
+ of distributed computing},
+ year = {2006},
+ series = {PODC '06},
+ pages = {123--132},
+ address = {New York, NY, USA},
+ publisher = {ACM},
+ acmid = {1146402},
+ doi = {10.1145/1146381.1146402},
+ isbn = {1-59593-384-0},
+ keywords = {expander graphs, peer-to-peer systems, random walks, sampling},
+ location = {Denver, Colorado, USA},
+ numpages = {10},
+ url = {http://doi.acm.org/10.1145/1146381.1146402}
+}
+
address@hidden,
+ author = {Maymounkov, Petar and Mazieres, David},
+ title = {Kademlia: A peer-to-peer information system based on the xor
metric},
+ booktitle = {Peer-to-Peer Systems},
+ publisher = {Springer},
+ year = {2002},
+ pages = {53--65},
+ file = {:kademlia.pdf:PDF}
+}
+
address@hidden,
+ author = {Montresor, A. and Jelasity, M.},
+ title = {PeerSim: A scalable P2P simulator},
+ booktitle = {Peer-to-Peer Computing, 2009. P2P '09. IEEE Ninth International
Conference
+ on},
+ year = {2009},
+ pages = {99-100},
+ doi = {10.1109/P2P.2009.5284506},
+ file = {:PeerSim.pdf:PDF},
+ keywords = {peer-to-peer computing;PeerSim;peer-to-peer system;scalable P2P
simulator;Discrete
+ event simulation;Engines;Java;Monitoring;Peer to peer
computing;Protocols;Scalability;Testing;Topology;Writing}
+}
+
address@hidden,
+ author = {Naicken, S. and Livingston, B. and Basu, A. and Rodhetbhai, S. and
+ Wakeman, I. and Chalmers, D.},
+ title = {The state of peer-to-peer simulators and simulations},
+ journal = {SIGCOMM Comput. Commun. Rev.},
+ year = {2007},
+ volume = {37},
+ pages = {95--98},
+ number = {2},
+ month = mar,
+ acmid = {1232932},
+ address = {New York, NY, USA},
+ doi = {10.1145/1232919.1232932},
+ file = {:TheStateOfP2PSimulatorsAndSimulations.pdf:PDF},
+ issn = {0146-4833},
+ issue_date = {April 2007},
+ keywords = {peer-to-peer, simulator evaluation, simulator usage},
+ numpages = {4},
+ publisher = {ACM},
+ url = {http://doi.acm.org/10.1145/1232919.1232932}
+}
+
address@hidden,
+ author = {Nakamoto, Satoshi},
+ title = {Bitcoin: A peer-to-peer electronic cash system},
+ journal = {Consulted},
+ year = {2008},
+ volume = {1},
+ pages = {2012}
+}
+
address@hidden,
+ author = {Nussbaum, Lucas and Richard, Olivier},
+ title = {Lightweight emulation to study peer-to-peer systems},
+ journal = {Concurrency and Computation: Practice and Experience},
+ year = {2008},
+ volume = {20},
+ pages = {735--749},
+ number = {6},
+ doi = {10.1002/cpe.1242},
+ file = {:p2plab-cpe.pdf:PDF},
+ issn = {1532-0634},
+ keywords = {peer-to-peer, evaluation, emulation, network, virtualization,
BitTorrent},
+ publisher = {John Wiley \& Sons, Ltd.},
+ url = {http://dx.doi.org/10.1002/cpe.1242}
+}
+
address@hidden,
+ author = {Pizzonia, Maurizio and Rimondini, Massimo},
+ title = {Netkit: easy emulation of complex networks on inexpensive hardware},
+ booktitle = {Proceedings of the 4th International Conference on Testbeds and
research
+ infrastructures for the development of networks \& communities},
+ year = {2008},
+ series = {TridentCom '08},
+ pages = {7:1--7:10},
+ address = {ICST, Brussels, Belgium, Belgium},
+ publisher = {ICST (Institute for Computer Sciences, Social-Informatics and
Telecommunications
+ Engineering)},
+ acmid = {1390585},
+ articleno = {7},
+ file = {:netkit.pdf:PDF},
+ isbn = {978-963-9799-24-0},
+ keywords = {network emulation, routing, user-mode Linux, virtual
laboratories},
+ location = {Innsbruck, Austria},
+ numpages = {10},
+ url = {http://dl.acm.org/citation.cfm?id=1390576.1390585}
+}
+
address@hidden,
+ author = {Pujol-Ahullo, J. and Garcia-Lopez, P.},
+ title = {PlanetSim: An extensible simulation tool for peer-to-peer networks
+ and services},
+ booktitle = {Peer-to-Peer Computing, 2009. P2P '09. IEEE Ninth International
Conference
+ on},
+ year = {2009},
+ pages = {85-86},
+ doi = {10.1109/P2P.2009.5284504},
+ file = {:planetsim.pdf:PDF},
+ keywords = {Java;discrete event simulation;peer-to-peer
computing;Java;PlanetSim
+ tool;discrete event-based simulation framework;peer-to-peer overlay
+ network;Analytical models;Computational modeling;Computer
simulation;Discrete
+ event simulation;Documentation;Java;Peer to peer
computing;Protocols;Statistics;Testing;Java;event-based;peer-to-peer;simulator}
+}
+
address@hidden,
+ author = {Rhea, Sean and Godfrey, Brighten and Karp, Brad and Kubiatowicz,
+ John and Ratnasamy, Sylvia and Shenker, Scott and Stoica, Ion and
+ Yu, Harlan},
+ title = {OpenDHT: a public DHT service and its uses},
+ journal = {SIGCOMM Comput. Commun. Rev.},
+ year = {2005},
+ volume = {35},
+ pages = {73--84},
+ number = {4},
+ month = aug,
+ acmid = {1080102},
+ address = {New York, NY, USA},
+ doi = {10.1145/1090191.1080102},
+ file = {:openDHT.pdf:PDF},
+ issn = {0146-4833},
+ issue_date = {October 2005},
+ keywords = {distributed hash table, peer-to-peer, resource allocation},
+ numpages = {12},
+ publisher = {ACM},
+ url = {http://doi.acm.org/10.1145/1090191.1080102}
+}
+
address@hidden,
+ author = {Ritter, Jordan},
+ title = {Why gnutella can’t scale. no, really},
+ year = {2001}
+}
+
address@hidden,
+ author = {Rodriguez, A. and Killian, C. and Bhat, S. and Kostic, D. and
Vahdat,
+ A.},
+ title = {{MACEDON: Methodology for Automatically Creating, Evaluating, and
+ Designing Overlay Networks",}},
+ booktitle = {Proc. of the 1st USENIX/ACM Symposium on Networked Systems
Design
+ and Implementation (NSDI)},
+ year = {\# 2004},
+ month = mar,
+ abstract = {{Currently, researchers designing and implementing largescale
overlay
+ services employ disparate techniques at each stage in the production
+ cycle: design, implementation, experimentation, and evaluation. As
+ a result, complex and tedious tasks are often duplicated leading
+ to ine\#ective resource use and di\#culty in fairly comparing competing
+ algorithms. In this paper, we present MACEDON, an infrastructure
+ that provides facilities to: i) specify distributed algorithms in
+ a concise domainspecific...}},
+ citeulike-article-id = {217372},
+ citeulike-linkout-0 = {http://citeseer.ist.psu.edu/rodriguez04macedon.html},
+ citeulike-linkout-1 = {http://citeseer.lcs.mit.edu/rodriguez04macedon.html},
+ citeulike-linkout-2 = {http://citeseer.ifi.unizh.ch/rodriguez04macedon.html},
+ citeulike-linkout-3 =
{http://citeseer.comp.nus.edu.sg/rodriguez04macedon.html},
+ file = {:macedon.pdf:PDF},
+ keywords = {2004, distributed, nsdi, overlays},
+ posted-at = {2005-06-02 23:45:16},
+ priority = {0},
+ url = {http://citeseer.ist.psu.edu/rodriguez04macedon.html}
+}
+
address@hidden,
+ author = {Rossi, D. and Veglia, P. and Sammarco, M. and Larroca, F.},
+ title = {ModelNet-TE: An emulation tool for the study of P2P and traffic
engineering
+ interaction dynamics},
+ journal = {Peer-to-Peer Networking and Applications},
+ year = {2012},
+ pages = {1--19},
+ file = {:modelnet-si-ppna11.pdf:PDF},
+ publisher = {Springer}
+}
+
address@hidden,
+ author = {Rowstron, Antony and Druschel, Peter},
+ title = {Pastry: Scalable, decentralized object location, and routing for
+ large-scale peer-to-peer systems},
+ booktitle = {Middleware 2001},
+ year = {2001},
+ pages = {329--350},
+ organization = {Springer},
+ file = {:pastry.pdf:PDF}
+}
+
address@hidden,
+ author = {Sakumoto, Y. and Asai, R. and Ohsaki, H. and Imase, M.},
+ title = {Design and Implementation of Flow-Level Simulator for Performance
+ Evaluation of Large Scale Networks},
+ booktitle = {Modeling, Analysis, and Simulation of Computer and
Telecommunication
+ Systems, 2007. MASCOTS '07. 15th International Symposium on},
+ year = {2007},
+ pages = {166-172},
+ doi = {10.1109/MASCOTS.2007.17},
+ file = {:Sakumoto07_MASCOTS.pdf:PDF},
+ issn = {1526-7539},
+ keywords = {Acceleration;Analytical models;Computational modeling;Computer
simulation;Differential
+ equations;Discrete event simulation;Information
science;Internet;Large-scale
+ systems;Mathematical analysis}
+}
+
address@hidden,
+ author = {Kazuyuki Shudo and Yoshio Tanaka and Satoshi Sekiguchi},
+ title = {Overlay Weaver: An overlay construction toolkit },
+ journal = {Computer Communications },
+ year = {2008},
+ volume = {31},
+ pages = {402 - 412},
+ number = {2},
+ note = {<ce:title>Special Issue: Foundation of Peer-to-Peer
Computing</ce:title>
+ },
+ doi = {10.1016/j.comcom.2007.08.002},
+ file = {:overlayweaver.pdf:PDF},
+ issn = {0140-3664},
+ keywords = {Overlay network},
+ url = {http://www.sciencedirect.com/science/article/pii/S0140366407002939}
+}
+
address@hidden,
+ author = {Spring, Neil and Peterson, Larry and Bavier, Andy and Pai, Vivek},
+ title = {Using PlanetLab for network research: myths, realities, and best
+ practices},
+ journal = {SIGOPS Oper. Syst. Rev.},
+ year = {2006},
+ volume = {40},
+ pages = {17--24},
+ number = {1},
+ month = jan,
+ acmid = {1113368},
+ address = {New York, NY, USA},
+ doi = {10.1145/1113361.1113368},
+ issn = {0163-5980},
+ issue_date = {January 2006},
+ numpages = {8},
+ publisher = {ACM},
+ url = {http://doi.acm.org/10.1145/1113361.1113368}
+}
+
address@hidden,
+ author = {Stoica, Ion and Morris, Robert and Liben-Nowell, David and Karger,
+ David R and Kaashoek, M Frans and Dabek, Frank and Balakrishnan,
+ Hari},
+ title = {Chord: a scalable peer-to-peer lookup protocol for internet
applications},
+ journal = {Networking, IEEE/ACM Transactions on},
+ year = {2003},
+ volume = {11},
+ pages = {17--32},
+ number = {1},
+ file = {:chord.pdf:PDF},
+ publisher = {IEEE}
+}
+
address@hidden:2006:UCP:1177080.1177105,
+ author = {Stutzbach, Daniel and Rejaie, Reza},
+ title = {Understanding churn in peer-to-peer networks},
+ booktitle = {Proceedings of the 6th ACM SIGCOMM conference on Internet
measurement},
+ year = {2006},
+ series = {IMC '06},
+ pages = {189--202},
+ address = {New York, NY, USA},
+ publisher = {ACM},
+ acmid = {1177105},
+ doi = {10.1145/1177080.1177105},
+ file = {:understanding_churn.pdf:PDF},
+ isbn = {1-59593-561-4},
+ keywords = {Gnutella, bitTorrent, churn, kad, peer-to-peer, session length,
uptime},
+ location = {Rio de Janeriro, Brazil},
+ numpages = {14},
+ url = {http://doi.acm.org/10.1145/1177080.1177105}
+}
+
address@hidden,
+ author = {Maximilian Szengel},
+ title = {Decentralized Evaluation of Regular Expressions for Capability
Discovery
+ in Peer-to-Peer Networks},
+ school = {Technische Universitaet Muenchen},
+ year = {2012},
+ type = {Masters},
+ address = {Garching bei Muenchen},
+ month = {11/2012},
+ abstract = {This thesis presents a novel approach for decentralized
evaluation
+ of regular expressions for capability discovery in DHT-based overlays.
+ The system provides support for announcing capabilities expressed
+ as regular expressions and discovering participants offering adequate
+ capabilities.
+
+ The idea behind our approach is to convert regular expressions into
+ finite automatons and store the corresponding states and transitions
+ in a DHT. We show how locally constructed DFA are merged in the DHT
+ into an NFA without the knowledge of any NFA already present in the
+ DHT and without the need for any central authority. Furthermore we
+ present options of optimizing the DFA.
+
+ There exist several possible applications for this general approach
+ of decentralized regular expression evaluation. However, in this
+ thesis we focus on the application of discovering users that are
+ willing to provide network access using a specified protocol to a
+ particular destination.
+
+ We have implemented the system for our proposed approach and conducted
+ a simulation. Moreover we present the results of an emulation of
+ the implemented system in a cluster.},
+ file = {:szengel2012ms.pdf:PDF},
+ howpublished = {\url{https://www.gnunet.org/szengel2012ms}},
+ keywords = {DFA, DHT, GNUnet, NFA, regular expressions, search},
+ pages = {100},
+ volume = {M.S.}
+}
+
address@hidden,
+ author = {Tang, Peiyi and Yew, Pen-Chung},
+ title = {Processor self-scheduling for multiple-nested parallel loops},
+ booktitle = {Proceedings of the 1986 international conference on parallel
processing},
+ year = {1986},
+ pages = {528--535}
+}
+
address@hidden,
+ author = {Vahdat, Amin and Yocum, Ken and Walsh, Kevin and Mahadevan, Priya
+ and Kosti\'{c}, Dejan and Chase, Jeff and Becker, David},
+ title = {Scalability and accuracy in a large-scale network emulator},
+ journal = {SIGOPS Oper. Syst. Rev.},
+ year = {2002},
+ volume = {36},
+ pages = {271--284},
+ number = {SI},
+ month = dec,
+ acmid = {844154},
+ address = {New York, NY, USA},
+ doi = {10.1145/844128.844154},
+ file = {:modelnet-osdi02.pdf:PDF},
+ issn = {0163-5980},
+ issue_date = {Winter 2002},
+ numpages = {14},
+ publisher = {ACM},
+ url = {http://doi.acm.org/10.1145/844128.844154}
+}
+
address@hidden,
+ author = {Varga, Andr{\'a}s and others},
+ title = {The OMNeT++ discrete event simulation system},
+ booktitle = {Proceedings of the European Simulation Multiconference
(ESM’2001)},
+ year = {2001},
+ volume = {9},
+ organization = {sn},
+ file = {:OMNet++.pdf:PDF}
+}
+
address@hidden,
+ author = {Vishwanath, K.V. and Gupta, D. and Vahdat, A. and Yocum, K.},
+ title = {ModelNet: Towards a datacenter emulation environment},
+ booktitle = {Peer-to-Peer Computing, 2009. P2P '09. IEEE Ninth International
Conference
+ on},
+ year = {2009},
+ pages = {81-82},
+ doi = {10.1109/P2P.2009.5284497},
+ file = {:modelnet-timedilation.pdf:PDF},
+ keywords = {computer centres;computer networks;protocols;virtual
machines;ModelNet;complex
+ network load;data center emulation environment;high-capacity
networks;large-scale
+ experimentation;multicore architectures;network emulator;network
+ protocols;sophisticated infrastructure
software;virtualization;Application
+ software;Complex networks;Computer architecture;Computer
networks;Emulation;Large-scale
+ systems;Multicore processing;Next generation
networking;Protocols;Testing}
+}
+
address@hidden,
+ author = {Weing{\"a}rtner, Elias and Schmidt, Florian and Vom Lehn, Hendrik
+ and Heer, Tobias and Wehrle, Klaus},
+ title = {Slicetime: A platform for scalable and accurate network emulation},
+ booktitle = {Proceedings of the 8th USENIX conference on Networked systems
design
+ and implementation},
+ year = {2011},
+ pages = {19--19},
+ organization = {USENIX Association},
+ file = {:slicetime.pdf:PDF}
+}
+
address@hidden,
+ author = {White, Brian and Lepreau, Jay and Stoller, Leigh and Ricci, Robert
+ and Guruprasad, Shashi and Newbold, Mac and Hibler, Mike and Barb,
+ Chad and Joglekar, Abhijeet},
+ title = {An integrated experimental environment for distributed systems and
+ networks},
+ journal = {SIGOPS Oper. Syst. Rev.},
+ year = {2002},
+ volume = {36},
+ pages = {255--270},
+ number = {SI},
+ month = dec,
+ acmid = {844152},
+ address = {New York, NY, USA},
+ doi = {10.1145/844128.844152},
+ file = {:emulab.pdf:PDF},
+ issn = {0163-5980},
+ issue_date = {Winter 2002},
+ numpages = {16},
+ publisher = {ACM},
+ review = {combines simulation, emulation and live networks. Netlab is a
descendant
+ of Emulab},
+ url = {http://doi.acm.org/10.1145/844128.844152}
+}
+
address@hidden,
+ author = {Zeilemaker, N. and Capota, M. and Bakker, A. and Pouwelse, J.},
+ title = {Tribler: Search and stream},
+ booktitle = {Peer-to-Peer Computing (P2P), 2011 IEEE International Conference
+ on},
+ year = {2011},
+ pages = {164-165},
+ doi = {10.1109/P2P.2011.6038729},
+ issn = {2161-3559},
+ keywords = {media streaming;peer-to-peer computing;public domain
software;security
+ of data;video on demand;P2P technology;Tribler;content
publishing;content
+ searching;content sharing;content streaming;live streaming;open-source
+ software;spam prevention;video on demand;Graphical user interfaces;Open
+ source software;Peer to peer computing;Protocols;Publishing;Video
+ on demand}
+}
+
address@hidden,
+ author = {Zhao, Ben Y and Huang, Ling and Stribling, Jeremy and Rhea, Sean
+ C and Joseph, Anthony D and Kubiatowicz, John D},
+ title = {Tapestry: A resilient global-scale overlay for service deployment},
+ journal = {Selected Areas in Communications, IEEE Journal on},
+ year = {2004},
+ volume = {22},
+ pages = {41--53},
+ number = {1},
+ file = {:tapestry.pdf:PDF},
+ publisher = {IEEE}
+}
+
address@hidden:conf/usenix/2008,
+ title = {2008 USENIX Annual Technical Conference, Boston, MA, USA, June
22-27,
+ 2008. Proceedings},
+ year = {2008},
+ editor = {Rebecca Isaacs and Yuanyuan Zhou},
+ publisher = {USENIX Association},
+ bibsource = {DBLP, http://dblp.uni-trier.de},
+ booktitle = {USENIX Annual Technical Conference},
+ isbn = {978-1-931971-59-1}
+}
+
address@hidden:conf/tridentcom/2012,
+ title = {Testbeds and Research Infrastructure. Development of Networks and
+ Communities - 8th International ICST Conference, TridentCom 2012,
+ Thessanoliki, Greece, June 11-13, 2012, Revised Selected Papers},
+ year = {2012},
+ editor = {Thanasis Korakis and Michael Zink and Maximilian Ott},
+ volume = {44},
+ series = {Lecture Notes of the Institute for Computer Sciences, Social
Informatics
+ and Telecommunications Engineering},
+ publisher = {Springer},
+ bibsource = {DBLP, http://dblp.uni-trier.de},
+ booktitle = {TRIDENTCOM},
+ ee = {http://dx.doi.org/10.1007/978-3-642-35576-9},
+ isbn = {978-3-642-35575-2}
+}
+
address@hidden:conf/tridentcom/2010,
+ title = {Testbeds and Research Infrastructures. Development of Networks and
+ Communities - 6th International ICST Conference, TridentCom 2010,
+ Berlin, Germany, May 18-20, 2010, Revised Selected Papers},
+ year = {2011},
+ editor = {Thomas Magedanz and Anastasius Gavras and Huu-Thanh Nguyen and
Jeffrey
+ S. Chase},
+ volume = {46},
+ series = {Lecture Notes of the Institute for Computer Sciences, Social
Informatics
+ and Telecommunications Engineering},
+ publisher = {Springer},
+ bibsource = {DBLP, http://dblp.uni-trier.de},
+ booktitle = {TRIDENTCOM},
+ ee = {http://dx.doi.org/10.1007/978-3-642-17851-1},
+ isbn = {978-3-642-17850-4}
+}
+
address@hidden,
+ title = {Infiniband cluster at LRR-TUM},
+ howpublished = {\url{http://www.lrr.in.tum.de/Par/arch/infiniband/}}
+}
+
address@hidden,
+ title = {NITOS Wireless Testbed - Network Implementation Testbed Laboratory},
+ howpublished = {\url{http://nitlab.inf.uth.gr/NITlab/index.php/testbed}},
+ owner = {totakura},
+ timestamp = {2013.06.03},
+ url = {http://nitlab.inf.uth.gr/NITlab/index.php/testbed}
+}
+
address@hidden,
+ title = {SuperMUC: Petascale System at Leibniz-Rechenzentrum},
+ howpublished = {\url{https://www.lrz.de/services/compute/supermuc/}},
+ year = {2012},
+ url = {https://www.lrz.de/services/compute/supermuc/}
+}
+
address@hidden:conf/acsac/2007,
+ title = {23rd Annual Computer Security Applications Conference (ACSAC 2007),
+ December 10-14, 2007, Miami Beach, Florida, USA},
+ year = {2007},
+ publisher = {IEEE Computer Society},
+ bibsource = {DBLP, http://dblp.uni-trier.de},
+ booktitle = {ACSAC}
+}
+
| [Prev in Thread] |
Current Thread |
[Next in Thread] |
- [GNUnet-SVN] r28811 - msh/doc,
gnunet <=