An alternative to guarantee anonymity in overlay networksmay be achieved by building a multi-hop path between the origin andthe destination. However, one hop in the overlay network can consistof multiple Internet Protocol (IP) hops. Therefore, the length of theoverlay multi-hop path must be reduced in order to maintain a goodbalance between the cost and the benefit provided by the anonymityfacility. Unfortunately, the simple Time-To-Live (TTL) algorithm cannotbe directly applied here since its use could reveal valuable informationto break anonymity. In this paper, a new mechanism which reduces thelength of the overlay multi-hop paths is presented. The anonymity levelis evaluated by means of simulation and good results are reported
展开▼
