Abstract
Four packet-switched networks using shuffle-exchange interconnections and deflection routing are analyzed. The first two are well-known networks based solely on shuffle interconnections, and the other two are variations in which the negative effects of deflection are reduced. Approximate state equations are given under a uniform traffic assumption. The equations predict the distribution of packet delay and can be used in situations where packets are assigned priorities. The four networks are briefly compared to each other and to Batcher-banyan sorting networks and hypercube deflection networks.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 473-480 |
| Number of pages | 8 |
| Journal | Proceedings - IEEE INFOCOM |
| State | Published - Dec 1 1990 |
| Event | Proceedings of IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies - San Francisco, CA, USA Duration: Jun 3 1990 → Jun 4 1990 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Electrical and Electronic Engineering
Cite this
Performance of shuffle-like switching networks with deflection. / Krishna, Arvind; Hajek, Bruce.
In: Proceedings - IEEE INFOCOM, 01.12.1990, p. 473-480.Research output: Contribution to journal › Conference article
}
TY - JOUR
T1 - Performance of shuffle-like switching networks with deflection
AU - Krishna, Arvind
AU - Hajek, Bruce
PY - 1990/12/1
Y1 - 1990/12/1
N2 - Four packet-switched networks using shuffle-exchange interconnections and deflection routing are analyzed. The first two are well-known networks based solely on shuffle interconnections, and the other two are variations in which the negative effects of deflection are reduced. Approximate state equations are given under a uniform traffic assumption. The equations predict the distribution of packet delay and can be used in situations where packets are assigned priorities. The four networks are briefly compared to each other and to Batcher-banyan sorting networks and hypercube deflection networks.
AB - Four packet-switched networks using shuffle-exchange interconnections and deflection routing are analyzed. The first two are well-known networks based solely on shuffle interconnections, and the other two are variations in which the negative effects of deflection are reduced. Approximate state equations are given under a uniform traffic assumption. The equations predict the distribution of packet delay and can be used in situations where packets are assigned priorities. The four networks are briefly compared to each other and to Batcher-banyan sorting networks and hypercube deflection networks.
UR - http://www.scopus.com/inward/record.url?scp=0025535634&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0025535634&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:0025535634
SP - 473
EP - 480
JO - Proceedings - IEEE INFOCOM
JF - Proceedings - IEEE INFOCOM
SN - 0743-166X
ER -