A large hierarchical network star-star topology design algorithm

✍ Scribed by Petrek, Jozef ;Sledt, Volker

• Publisher: John Wiley and Sons
• Year: 2001
• Tongue: English
• Weight: 958 KB
• Volume: 12
• Category: Article
• ISSN: 1124-318X
• DOI: 10.1002/ett.4460120607

✦ Synopsis

Abstract

The hierarchical communication network design includes solving problems like the concentrator quantity problem, the concentrator location problem and the assignment problem. Many algorithms have been proposed to solve these particular problems. The two latter problems are NP—hard and no optimal solution of these problems has been found for large networks. In this paper we present a high complexity algorithm for star—star network topology design which solves all three problems for several hierarchy levels simultaneously and finds a superior solution in a reasonable time even for large networks with a few thousand terminals due to a new and quick assignment algorithm. The computational results showed that our assignment algorithm is superior to “Simulated annealing” and “Tabu search”.