Modification of the Shufflenet Connectivity Graph for Balancing the Load in the Case of Uniform Traffic

Andrea BORELLA; Franco CHIARALUCE

Copy

Andrea BORELLA, Franco CHIARALUCE, "Modification of the Shufflenet Connectivity Graph for Balancing the Load in the Case of Uniform Traffic" in IEICE TRANSACTIONS on Fundamentals, vol. E80-A, no. 2, pp. 423-426, February 1997, doi: .
Abstract: We propose a modification of the perfect shuffle connectivity graph used in optical networks, which ensures the balance of the traffic load on the WDM channels. When applied to the simple but popular case of 8 nodes, connected through a shortest path routing algorithm, it allows to increase the aggregate capacity of more than 14%.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e80-a_2_423/_p

Copy

@ARTICLE{e80-a_2_423,
author={Andrea BORELLA, Franco CHIARALUCE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Modification of the Shufflenet Connectivity Graph for Balancing the Load in the Case of Uniform Traffic},
year={1997},
volume={E80-A},
number={2},
pages={423-426},
abstract={We propose a modification of the perfect shuffle connectivity graph used in optical networks, which ensures the balance of the traffic load on the WDM channels. When applied to the simple but popular case of 8 nodes, connected through a shortest path routing algorithm, it allows to increase the aggregate capacity of more than 14%.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - Modification of the Shufflenet Connectivity Graph for Balancing the Load in the Case of Uniform Traffic
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 423
EP - 426
AU - Andrea BORELLA
AU - Franco CHIARALUCE
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 1997
AB - We propose a modification of the perfect shuffle connectivity graph used in optical networks, which ensures the balance of the traffic load on the WDM channels. When applied to the simple but popular case of 8 nodes, connected through a shortest path routing algorithm, it allows to increase the aggregate capacity of more than 14%.
ER -