In real life we have one entry for multiple tasks, like police officer job that can vary from regulating traffic to other duties like keeping the peace, law enforcement, protection of people and property, etc.By applying the same concept on routers, we developed in this paper -using Graph Theory-a new routing method that adds the task of security while dispatching messages, so as to get around attacks based on sniffing like MitM.To validate the proposal, simulation was made to confirm that this new way of processing has no major impact on router performances while calculating routes and dispatching messages.

No abstract

In this paper, we focus on attacks based on sniffing like MitM, and how to counter them from the network layer perspective. We've already developed an algorithm called pathfinder that allows us to forward segments from same packets via different paths. Doing so, we'll ensure that an attacker will not be able to get hands on the entire message being transmitted. So, in this paper, we'll start by recalling the first version of pathfinder algorithm, followed by an introduction to the newest release that allows us to handle hundreds of nodes in the same network, finally we'll put this algorithm under test by simulating a sniffing attack with Wireshark. The simulation proves, in addition to its efficiency to handle a great number of nodes, that this new way of routing will help facing a lot of attacks based on sniffing, and other type of attacks like DoS.

Abstract