DocumentCode
770817
Title
Design of an Economical Multidrop Network Topology with Capacity Constraints
Author
Sharma, Roshan L.
Author_Institution
Rockwell Intl., Dallas, TX, USA
Volume
31
Issue
4
fYear
1983
fDate
4/1/1983 12:00:00 AM
Firstpage
590
Lastpage
591
Abstract
This paper compares several algorithms for designing economical multidrop network topologies with capacity constraints. Sharma\´s algorithms, the outside-to-inside-city approach (OICCA, which happens to be a special case of the Esau-Williams algorithm) and the Exchange algorithm (predecessor of several "greedy" algorithms), are then compared to the Esau-Williams algorithm (EWA) and to EWA plus Sharma\´s exchange algorithm for some practical network applications.
Keywords
Computer networks; Message switching; Algorithm design and analysis; Cities and towns; Clustering algorithms; Communications Society; Costs; Greedy algorithms; Iterative algorithms; Joining processes; Network topology; Telecommunication traffic;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOM.1983.1095845
Filename
1095845
Link To Document