By Topic

Design of an Economical Multidrop Network Topology with Capacity Constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Sharma, R. ; Rockwell Intl., Dallas, TX, USA

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.

Published in:

Communications, IEEE Transactions on  (Volume:31 ,  Issue: 4 )