A dynamic routing method for congestion control
Saurabh Malgaonkar, Shailja Sumeet, Rajeev Vaswani, Rehan Shaikh · 2015
The mentioned dynamic network routing system is a method where the routers are dynamically controlled to reduce congestion. A counting algorithm counts the number of data packets in the network. The count of the number of data packets is analyzed and is saved in a text file. Parallel processing logic is used to achieve the scheduling process at various routers where the network traffic is frequently subjected to congestion and time delays. The present scenario is then linked with parallel architecture. The basic of parallel processing architectures and different MPI commands were studied. Scheduling algorithm is used to dynamically allocate time and different MPI functions are applied to synchronize the routers. Synchronization of the required routers is done with the help of MPI functions.