The rearrangement process in a two-stage broadcast switching network

Søren B. Jacobsen

Research output: Contribution to journalJournal articleResearchpeer-review

221 Downloads (Pure)

Abstract

The rearrangement process in the two-stage broadcast switching network presented by F.K. Hwang and G.W. Richards (ibid., vol.COM-33, no.10, p.1025-1035, Oct. 1985) is considered. By defining a certain function it is possible to calculate an upper bound on the number of connections to be moved during a rearrangement. When each inlet channel appears twice, the maximum number of connections to be moved is found. For a special class of inlet assignment patterns in the case of which each inlet channel appears three times, the maximum number of connections to be moved is also found. In the general case, an upper bound is given when the number of outlets at each second-stage switch is kept below a certain bound
Original languageEnglish
JournalI E E E Transactions on Communications
Volume36
Issue number4
Pages (from-to)484-491
ISSN0090-6778
DOIs
Publication statusPublished - 1988

Bibliographical note

Copyright: 1988 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

Fingerprint Dive into the research topics of 'The rearrangement process in a two-stage broadcast switching network'. Together they form a unique fingerprint.

Cite this