N log N dual shuffle-exchange network with error-correcting routing

The parallels between the design philosophies of switching and transmission systems are established, and it is argued that error-correcting routing in switching is analogous to error-correcting coding in transmission. Based on a novel error-correcting and self-routing algorithm, it is shown by analy...

Full description

Saved in:
Bibliographic Details
Published in[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications pp. 262 - 268 vol.1
Main Authors Liew, S.C., Lee, T.T.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1992
Subjects
Algorithm design and analysis
Analytical models
Bit error rate
Communication switching
Communication systems
Error correction
Packet switching
Routing
Switches
Switching systems
Online AccessGet full text

Cover

More Information
Summary:The parallels between the design philosophies of switching and transmission systems are established, and it is argued that error-correcting routing in switching is analogous to error-correcting coding in transmission. Based on a novel error-correcting and self-routing algorithm, it is shown by analysis and simulation that the dual shuffle-exchange network can achieve the Shannon's lower bound N log N on switch complexity with arbitrarily small packet-loss probability.< >
ISBN:078030599X
9780780305991
DOI:10.1109/ICC.1992.268251