Generalized Optimal Channel Graphs for Slip Connections in a Class of Link Systems

Kenzo TAKAGI

Generalized Optimal Channel Graphs for Slip Connections in a Class of Link Systems

Kenzo TAKAGI

Full Text Views

0

Cite this

Summary :

A method to obtain optimal channel graphs (least blocking probability) is described, for a class of 4-stage link systems without parallel" limitation. Slip notation, introduced to classify and identify channel graphs effectively, makes their comparison tractable. General blocking probability calculation procedure is obtained for this purpose. Generalized optimums are concretely determined for a range of small link sizes, and assured by the comparison with every non-slip type. Former parallel" optimums are proved to be inferior, but practically sufficient according to numerical results. Necessary conditions for generalized optimums are shown based on a theorem.

Publication: IEICE TRANSACTIONS on transactions Vol.E63-E No.11 pp.807-814

Publication Date: 1980/11/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Switching Systems

Authors

Kenzo TAKAGI

Keyword

Cite this

Copy

Kenzo TAKAGI, "Generalized Optimal Channel Graphs for Slip Connections in a Class of Link Systems" in IEICE TRANSACTIONS on transactions, vol. E63-E, no. 11, pp. 807-814, November 1980, doi: .
Abstract: A method to obtain optimal channel graphs (least blocking probability) is described, for a class of 4-stage link systems without parallel" limitation. Slip notation, introduced to classify and identify channel graphs effectively, makes their comparison tractable. General blocking probability calculation procedure is obtained for this purpose. Generalized optimums are concretely determined for a range of small link sizes, and assured by the comparison with every non-slip type. Former parallel" optimums are proved to be inferior, but practically sufficient according to numerical results. Necessary conditions for generalized optimums are shown based on a theorem.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e63-e_11_807/_p

Copy

@ARTICLE{e63-e_11_807,
author={Kenzo TAKAGI, },
journal={IEICE TRANSACTIONS on transactions},
title={Generalized Optimal Channel Graphs for Slip Connections in a Class of Link Systems},
year={1980},
volume={E63-E},
number={11},
pages={807-814},
abstract={A method to obtain optimal channel graphs (least blocking probability) is described, for a class of 4-stage link systems without parallel" limitation. Slip notation, introduced to classify and identify channel graphs effectively, makes their comparison tractable. General blocking probability calculation procedure is obtained for this purpose. Generalized optimums are concretely determined for a range of small link sizes, and assured by the comparison with every non-slip type. Former parallel" optimums are proved to be inferior, but practically sufficient according to numerical results. Necessary conditions for generalized optimums are shown based on a theorem.},
keywords={},
doi={},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - Generalized Optimal Channel Graphs for Slip Connections in a Class of Link Systems
T2 - IEICE TRANSACTIONS on transactions
SP - 807
EP - 814
AU - Kenzo TAKAGI
PY - 1980
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E63-E
IS - 11
JA - IEICE TRANSACTIONS on transactions
Y1 - November 1980
AB - A method to obtain optimal channel graphs (least blocking probability) is described, for a class of 4-stage link systems without parallel" limitation. Slip notation, introduced to classify and identify channel graphs effectively, makes their comparison tractable. General blocking probability calculation procedure is obtained for this purpose. Generalized optimums are concretely determined for a range of small link sizes, and assured by the comparison with every non-slip type. Former parallel" optimums are proved to be inferior, but practically sufficient according to numerical results. Necessary conditions for generalized optimums are shown based on a theorem.
ER -