DocumentCode
3501302
Title
Hierarchical distributed system network design with cost-performance tradeoffs
Author
Sharma, Nita ; Agrawal, Dharma P.
Author_Institution
nCUBE Corp., Foster City, CA, USA
fYear
1993
fDate
20-23 Jul 1993
Firstpage
336
Lastpage
343
Abstract
Design of a large distributed system (DS) is becoming increasing important and with its added popularity, it is crucial to define its topology based on some objective function. This paper introduces a reliability-based systematic approach for defining the topology of a DS network in a hierarchical form, given the traffic requirements, a set of cluster topologies and the cost constraints. The authors scheme first identifies a group of permissible inter-cluster links which yields the maximum network reliability to cost ratio and then selects the gateways within each cluster for balancing the traffic through the inter-cluster links and the node degrees within each cluster. The usefulness of their method lies in a simultaneous consideration of the cost and the network reliability. Some examples are included to illustrate their design procedure
Keywords
distributed processing; performance evaluation; cost-performance tradeoffs; gateways; hierarchical distributed system network design; inter-cluster links; maximum network reliability; reliability-based systematic approach; Algorithm design and analysis; Cities and towns; Clustering algorithms; Computer network reliability; Costs; Decision support systems; Degradation; Network topology; Telecommunication network reliability; Telecommunication traffic;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Distributed Computing, 1993., Proceedings the 2nd International Symposium on
Conference_Location
Spokane, WA
Print_ISBN
0-8186-3900-8
Type
conf
DOI
10.1109/HPDC.1993.263826
Filename
263826
Link To Document