Node placement optimization in ShuffleNets

@article{Yeung1998NodePO,
  title={Node placement optimization in ShuffleNets},
  author={Kwan Lawrence Yeung and Tak-Shing Peter Yum},
  journal={IEEE/ACM Trans. Netw.},
  year={1998},
  volume={6},
  pages={319-324}
}
Node placement problem in ShuffleNets is a combinatorial optimization problem. In this paper an efficient node placement algorithm, called the gradient algorithm, is proposed. A communication cost function between a node pair is defined and the gradient algorithm places the node pairs one by one, based on the gradient of the cost function. Then two lower bounds on the traffic weighted mean internodal distanceh are proposed. The performance of the gradient algorithm is compared to the lower… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 20 extracted citations

An Holistic Framework for Regular Virtual Topology Design

IEEE/ACM Transactions on Networking • 2007
View 4 Excerpts
Highly Influenced

A survey of topologies and performance measures for large-scale networks

IEEE Communications Surveys & Tutorials • 2004
View 7 Excerpts
Highly Influenced

The optimal joint sequence design in the feedback-based two-stage switch

2014 IEEE International Conference on Communications (ICC) • 2014
View 2 Excerpts

Load-Balanced Optical Switch for High-Speed Router Design

Journal of Lightwave Technology • 2010
View 1 Excerpt

References

Publications referenced by this paper.

Algorithms for optimized node placement in shufflenet based multihop lightwave networks

inProc. IEEE INFOCOM’93, 1993, pp. 557–564. • 1993
View 7 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…