Recirculating Shuffle-Exchange Interconnection ATM Switching Network Based on a Priority Control Algorithm


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 7, No. 6, pp. 1949-1955, Jun. 2000
10.3745/KIPSTE.2000.7.6.1949,   PDF Download:

Abstract

This paper proposes a multistage interconnection ATM switching network without internal blocking. The first is recirculating shuffle-exchange network improved on hardware complexity. The next is connected to Rank network with tree structure. In this network, after the packets transferred to the same output ports are given each priority, only a packet with highest priority is sent to the next, an the others are recirculated to the first. Rearrangeability through decomposition and composition algorithm is applied for the transferred packets in hanyan network and all they arrive at a final destinations. To analyze throughput, waiting time and packet loss ratio according tothe size of buffer, the probabilities are modeled by a binomial distribution of packet arrival.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
B. S. Park, "Recirculating Shuffle-Exchange Interconnection ATM Switching Network Based on a Priority Control Algorithm," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 6, pp. 1949-1955, 2000. DOI: 10.3745/KIPSTE.2000.7.6.1949.

[ACM Style]
Byoung Soo Park. 2000. Recirculating Shuffle-Exchange Interconnection ATM Switching Network Based on a Priority Control Algorithm. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 6, (2000), 1949-1955. DOI: 10.3745/KIPSTE.2000.7.6.1949.