On the performance of a class of multihop shuffle networks

Seung Woo Seo, Paul R. Prucnal, Hisashi Kobayashi, James B. Lim

Research output: Contribution to conferencePaper

1 Scopus citations

Abstract

A generalization of the well-known shuffle network is proposed for multihop lightwave communication. In the classical definition of a shuffle network, i.e., N = kpk where N is the number of nodes and k is the number of stages with base p, the realizable values of N are very discrete and many of the intermediate values of N are not realizable. In this paper, we propose a new definition of a shuffle network as N = nk where n is the number of nodes per stage with base p. Based on this new definition, we divide the shuffle networks into two classes: extra-stage and reduced-stage. Study results can be used to determine an optimal network topology when given a value of N.

Original languageEnglish (US)
Pages1211-1215
Number of pages5
StatePublished - Jan 1 1995
EventProceedings of the 1995 IEEE International Conference on Communications. Part 1 (of 3) - Seattle, WA, USA
Duration: Jun 18 1995Jun 22 1995

Other

OtherProceedings of the 1995 IEEE International Conference on Communications. Part 1 (of 3)
CitySeattle, WA, USA
Period6/18/956/22/95

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'On the performance of a class of multihop shuffle networks'. Together they form a unique fingerprint.

  • Cite this

    Seo, S. W., Prucnal, P. R., Kobayashi, H., & Lim, J. B. (1995). On the performance of a class of multihop shuffle networks. 1211-1215. Paper presented at Proceedings of the 1995 IEEE International Conference on Communications. Part 1 (of 3), Seattle, WA, USA, .