Project Name Design and Implementation of Deadlock Detection for Router Management System
Sally Safaa · 2014
Deadlock is one of the most serious system failures that can occur in a computer system or a network. It happen in the network system when packets cannot advance toward their destination, because they requests resources from the router that held by other packets in a cyclic way. Deadlock states have been observed in existing computer networks emphasizing the need for carefully designed routing algorithm to detect deadlocks and resolve it during the Transfer of packets from source to destination . We will solve deadlock in network system by designing a deadlock detection algorithm based on one of routing algorithms which is called Distance Vector Routing that examines the queue length status and also will count the number of hops taken by the packets to reach the final destination . As a consequence, we will reduce congestion by providing other paths for packets if they find the length queue in the router is full of packets. Also we will determine the shortest path for packets depending on fewest number of hops. This will recover the network from deadlock will also result in better network performance.