By Topic

A new assignment algorithm for star network topology design

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)
Petrek, J. ; Dept. of Radio & Eng., Slovak Univ. of Technol., Bratislava, Slovakia

To solve the star topology communication network design problem, the following optimization tasks must be solved: the concentrator quantity problem, the concentrator location problem and the assignment problem. The two last mentioned problems are NP-hard and the optimal solution of these problems has not been found for large networks. Algorithms looking for the optimal solution of the assignment problem (with minimal total link cost) can be used only for small networks with several hundreds of terminals. The assignment algorithm presented in this paper finds a superior solution in a reasonable time also for large networks with a few thousands of terminals. The computational results show that the algorithm is superior to "simulated annealing" and "tabu search" not only in CPU time comparison, but also is characterized by its lower gap to the optimal solution.

Published in:

Electronics, Circuits and Systems, 2002. 9th International Conference on  (Volume:2 )

Date of Conference:

2002