Implementation and testing of pressure like routing protocol

Efficient routing in packet networks, such as the Internet, is one of the central challenges in networking. This research is intended to experiment with novel ideas and techniques for routing in computer networks. The central idea is to consider the amount of packets waiting in a router as representing pressure. Routing decisions are then made based on the natural notion that packets flow from high-pressure locations to low pressure locations. In the present research we present the implementation and testing of the pressure like routing algorithm in a simulated network. The study showed good performance of the protocol itself, but better results were achieved when boosting the routing tables by the Shortest Path First Algorithm. Such implementation we called Enhanced Algorithm in which we use hybrid routing protocol to achieve the best out looked performance. However, it has not been tested in practice.