congestion estimation of router input ports innetwork-on-chip for efficient virtual allocation

Effective and congestion-aware routing is vital to the performance of network-onchip. the efficient routing algorithm undoubtedly relies on the considered selection strategy. if the routing function returns a number of more than one permissible output ports, a selection function is exploited to choose the best output port to reduce packets latency. in this paper, we introduce a new selection strategy that can be used in any adaptive routing algorithm. the intended selection function is named modified-neighbor-on-path, the purpose of that is handling the condition of hesitation happening when the routing function provides a set of acceptable output ports. in fact, number of inquiries that each router has sent to its neighbors in determined past cycles is a new parameter that can be combined with number of free slots of adjacent nodes in the latest selection function named neighbor-on-path. performance analysis is performed by using exact simulation tools under different traffic scenarios. outcomes show how the proposed selection function applied to west-first and north-last routing algorithms outperforms in average delay up to 20 percent on maximum and an acceptable improvement in total energy consumption.