Design of an Economical Multidrop Network Topology with Capacity Constraints

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.