### 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 = kp^{k} 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 language | English (US) |
---|---|

Pages | 1211-1215 |

Number of pages | 5 |

State | Published - Jan 1 1995 |

Event | Proceedings of the 1995 IEEE International Conference on Communications. Part 1 (of 3) - Seattle, WA, USA Duration: Jun 18 1995 → Jun 22 1995 |

### Other

Other | Proceedings of the 1995 IEEE International Conference on Communications. Part 1 (of 3) |
---|---|

City | Seattle, WA, USA |

Period | 6/18/95 → 6/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

*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, .