Optimal Layouts of Virtual Paths in Complete Binary Tree Networks
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E85-A No.4 pp.914-917
- Publication Date
- 2002/04/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Graphs and Networks
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Suguru AMITANI, Toshinori YAMADA, Shuichi UENO, "Optimal Layouts of Virtual Paths in Complete Binary Tree Networks" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 4, pp. 914-917, April 2002, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_4_914/_p
Copy
@ARTICLE{e85-a_4_914,
author={Suguru AMITANI, Toshinori YAMADA, Shuichi UENO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Optimal Layouts of Virtual Paths in Complete Binary Tree Networks},
year={2002},
volume={E85-A},
number={4},
pages={914-917},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Optimal Layouts of Virtual Paths in Complete Binary Tree Networks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 914
EP - 917
AU - Suguru AMITANI
AU - Toshinori YAMADA
AU - Shuichi UENO
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2002
AB - 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.
ER -
English
