Optimal Layouts of Virtual Paths in Complete Binary Tree Networks

スポンサーリンク

概要

• 論文の詳細を見る

• It is a fundamental problem to construct a virtual path layout minimizing the hop number as a function of the congestion for a communication network. It is known that we can construct a virtual path layout with asymptotically optimal hop number for a mesh of trees network, butterfly network, cube-connected-cycles network, de Bruijn network, shuffle-exchange network, and complete binary tree network. The paper shows a virtual path layout with minimum hop number for a complete binary tree network. A generalization to complete k-ary tree networks is also mentioned.

• 社団法人電子情報通信学会の論文
• 2002-04-01

著者

• Yamada Toshinori

  Graduate School Of Science And Engineering Tokyo Institute Of Technology

• UENO Shuichi

  Graduate School of Science and Engineering, Tokyo Institute of Technology

• AMITANI Suguru

  Graduate School of Science and Engineering, Tokyo Institute of Technology

• Amitani Suguru

  Graduate School Of Science And Engineering Tokyo Institute Of Technology

• Ueno Shuichi

  Graduate School Of Science And Engineering Tokyo Institute Of Technology

関連論文

• On the Orthogonal Drawing of Outerplanar Graphs(Graphs and Networks)
• Optimal Layouts of Virtual Paths in Complete Binary Tree Networks
• A New Floating-Probe for Measurement of Insulated Plasma Produced by Radio-Frequency Power

スポンサーリンク