DocumentCode :
2797821
Title :
Load balancing properties of networks
Author :
Sherwani, Naveed A. ; Boals, Alfred ; Abuelyaman, Eltayeb ; Gidwani, Roshan ; Ali, Hesham H.
Author_Institution :
Dept. of Comput. Sci., Western Michigan Univ., Kalamazoo, MI, USA
fYear :
1990
fDate :
12-14 Aug 1990
Firstpage :
331
Abstract :
The authors investigate load balancing properties of various existing networks using the concept of load balancing graphs. In particular, they present load balancing properties for butterfly, three-dimensional mesh, pyramid, and cube connected cycle networks. They show that in these networks it is difficult to re-distribute the load in case of a node failure. This is due to the fact that the communication distance between nodes that replace a failed node is quite large. This result emphasizes the need to develop new fault tolerant networks with better load balancing properties
Keywords :
graph theory; multiprocessor interconnection networks; telecommunication networks; 3D mesh networks; butterfly networks; cube connected cycle networks; fault tolerant networks; load balancing properties; node failure; pyramid networks; three-dimensional mesh; Computer networks; Computer science; Concurrent computing; Delay; Fault tolerance; Load management; Load modeling; Mathematical model; Mathematics; Telephony;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 1990., Proceedings of the 33rd Midwest Symposium on
Conference_Location :
Calgary, Alta.
Print_ISBN :
0-7803-0081-5
Type :
conf
DOI :
10.1109/MWSCAS.1990.140720
Filename :
140720
Link To Document :
بازگشت