Title :
Network resources location
Author :
Ohayon, R. ; Giladi, R. ; Korach, E.
Author_Institution :
Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel
Abstract :
There are many studies dealing with the design of optimal communication network topologies. However, in the current methodologies, every user or node presents the same constrains and behavior, while in reality networks resources have different characteristics than any other user or node. The greedy algorithm is offered for locating-central network resources on a communication network. The algorithm is generic and can be applied to various LANs and WANs. The proposed method gives the network manager analytical tools to deal with the issue of how to locate central resources in networks. The algorithm was compared to an optimal solution where possible, to lower bound, and to the results of simulated annealing
Keywords :
local area networks; network topology; simulated annealing; wide area networks; LAN; WAN; central resources location; communication network topologies; generic algorithm; greedy algorithm; lower bound; network node; network resources location; optimal communication network design; optimal solution; simulated annealing results; Communication networks; Costs; Data communication; Delay; Greedy algorithms; Local area networks; Resource management; Simulated annealing; Telecommunication traffic; Traffic control;
Conference_Titel :
Electrical and Electronics Engineers in Israel, 1996., Nineteenth Convention of
Conference_Location :
Jerusalem
Print_ISBN :
0-7803-3330-6
DOI :
10.1109/EEIS.1996.566879
