DocumentCode
2407565
Title
Reconfiguration algorithm for ring networks
Author
Ganz, Aura ; Gong, W.B. ; Krishna, C.M. ; Zhai, W.
Author_Institution
Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA, USA
fYear
1992
fDate
1992
Firstpage
3221
Abstract
Networks of workstations and personal computers are an alternative to mainframe computers for many applications. For the interconnection of ring networks, different workloads, generating different traffic patterns, have different ideal interconnection patterns (also called configurations). It is useful to have systems that can be reconfigured in response to changes in the workload. A practical algorithm for the adaptive reconfiguration of ring networks is described. To determine which configuration is best for a given workload is a difficult optimization problem. A faster stochastic optimization procedure, proposed by D. Yan and H. Mukai (Proc. 28th CDC, Tampa Fl, 1989, pp.2463-2468), is used. It is shown that significant improvements are possible when the network is reconfigured to fit the prevailing traffic pattern
Keywords
optimisation; protocols; telecommunication traffic; token networks; adaptive reconfiguration; interconnection; personal computers; ring networks; stochastic optimization; traffic patterns; workstations; Application software; Computer applications; Computer networks; Delay; Local area networks; Microcomputers; Network topology; Stochastic processes; Telecommunication traffic; Workstations;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1992., Proceedings of the 31st IEEE Conference on
Conference_Location
Tucson, AZ
Print_ISBN
0-7803-0872-7
Type
conf
DOI
10.1109/CDC.1992.371234
Filename
371234
Link To Document