Date Added: Aug 2011
Efficient and reliable communication is essential for achieving high performance in a networked computing environment. Limited network resources bring about unavoidable competition among in-flight packets, resulting in network congestion and, possibly, deadlock. The effectiveness of deadlock handling mechanisms in a network often determines the upper bound in the throughput and utilization that the network can deliver. The proposed mechanism is based on increasing the scheduling priority of packets involved in congestion and providing necessary resources for those packets to make forward progress. Simulation results show that the proposed technique not only disperses network congestion effectively but also contributes to achieving high network performance.