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

Publish Year: 1384
نوع سند: مقاله کنفرانسی
زبان: English
View: 1,121

This Paper With 6 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

ACCSI11_181

تاریخ نمایه سازی: 5 آذر 1390

Abstract:

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.

Authors

Mohammad Hossien Yaghmaee

Computer Department, Ferdowsi University of Mashad Iran Telecommunication Research Center (ITRC

Ali Akbar Neghabi

Azad university of Sabzevar, Sabzevar, IRAN