We propose and analyze a recipient-anonymous stochastic routing model to study fundamental trade-off between anonymity delay. An agent wants quickly reach goal vertex in network through sequence of actions, whereas an overseeing adversary observes the agent’s entire trajectory tries identify among those vertices traversed. are interested understanding probability that can correctly (anonymity) ...

The routing algorithms can be classi®ed into source, distributed and hierarchical routing. Source routing algorithms are conceptually simple, but they suffer from scalability problem. Distributed routing algorithms are more scalable, but loops may occur, which make the routing to fail. Hierarchical routing has been used to cope with the scalability problems of source routing in large internetwo...