Extended Gradient: A Modified Gradient Algorithm for Node Placement in Shufflenet Network

Node placement problem in ShuffleNets is a combinatorial optimization problem solved in [1] with the use of gradient algorithm. In this paper, first to solve the node placement problem in ShuffleNet, we describe the gradient algorithm and then illustrate it's problem and provide a solution for it named egradient. The proposed algorithm does not have the gradient algorithm's problem. The performance of e-gradient algorithm is compared with that of the gradient algorithm and the other popular mechanisms. Significant reduction of the weighted mean hop distance ( h ) is obtained with the use of the e-gradient algorithm, especially for highly skewed traffic distributions.

کلیدواژه ها:

Node placement problem ، Gradient algorithm ، ShuffleNet ، topological design ، WDM networks