The search functionality is under construction.
The search functionality is under construction.

A Simulation Experiment on Optimality of Path Length for Hierarchical Routing Schemes

Kenji ISHIDA, Jun'ichi MIYAO, Noriyoshi YOSHIDA

  • Full Text Views

    0

  • Cite this

Summary :

We present comparative analysis of average behavior based on path length for hierarchical routing schemes. The analyzed schemes are K-scheme (by Kamoun et al.), G-scheme (by Garcia et al.), and I-scheme (by the authors). The analysis is performed by simulation experiments. The results show that I-scheme is superior to both K- and G-schemes, and that K-scheme is better than G-scheme with respect to path length. Additionally, a path length obtained by I-scheme is about 20% longer than the optimal one on the average.

Publication
IEICE TRANSACTIONS on transactions Vol.E72-E No.1 pp.4-6
Publication Date
1989/01/25
Publicized
Online ISSN
DOI
Type of Manuscript
LETTER
Category
Graphs and Networks

Authors

Keyword