|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
The Load-Sharing Banyan Network
December 1986 (vol. 35 no. 12)
pp. 1025-1034
| ASCII Text | x | ||
| C.-T.A. Lea, "The Load-Sharing Banyan Network," IEEE Transactions on Computers, vol. 35, no. 12, pp. 1025-1034, December, 1986. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1986.1676710, author = {C.-T.A. Lea}, title = {The Load-Sharing Banyan Network}, journal ={IEEE Transactions on Computers}, volume = {35}, number = {12}, issn = {0018-9340}, year = {1986}, pages = {1025-1034}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1986.1676710}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - The Load-Sharing Banyan Network IS - 12 SN - 0018-9340 SP1025 EP1034 EPD - 1025-1034 A1 - C.-T.A. Lea, PY - 1986 KW - self-routing networks KW - Alternate paths KW - Banyan networks KW - fault-tolerant networks KW - load-sharing Banyan networks KW - performance evaluation VL - 35 JA - IEEE Transactions on Computers ER - | |||
Banyan networks, as well as many other self-routing networks, have a simple and regular topology, and can be easily diagnosed and maintained. However, like many other self- routing networks, Banyan networks have only one path between each input and output pair. Failures of a single link or node will make many paths unavailable, and certain traffic patterns can cause severe congestion in the networks.
Index Terms:
self-routing networks, Alternate paths, Banyan networks, fault-tolerant networks, load-sharing Banyan networks, performance evaluation
Citation:
C.-T.A. Lea, "The Load-Sharing Banyan Network," IEEE Transactions on Computers, vol. 35, no. 12, pp. 1025-1034, Dec. 1986, doi:10.1109/TC.1986.1676710
Usage of this product signifies your acceptance of the Terms of Use.