An efficient routing protocol for anonymous networks
Roman Schlegel, Duncan S. Wong · 2010
Most existing anonymous networks focus on providing strong anonymity at the price of having lower bandwidth, higher latency and degraded usability. They also often anonymize only a few specific applications. In this paper, we propose a new approach of constructing an anonymous network. The network consists of an overlay network, which provides anonymity to all applications running on top of it, and a routing protocol, which can be considered as an anonymized version of path vector routing. The protocol preserves the high performance characteristics of path vector routing and also has the added advantage of hiding the overlay network topology.