TY - JOUR
T1 - Placement of network resources in communication networks
AU - Giladi, Ran
AU - Korach, Ephraim
AU - Ohayon, Rony
N1 - Funding Information:
This research was partially supported by the Paul Ivanier Center for Robotics Research & Production Management, Ben-Gurion University of the Negev.
PY - 2003/10/7
Y1 - 2003/10/7
N2 - Data communication and telecommunication networks consist of nodes, links and network resources. Many studies have dealt with the design of optimal network topologies. In current methodologies, every node presents the same constraints and behavior, however, in reality, the network resources vary. The research problem at stake here is how to add central network resources (i.e., servers, gateways, network managers, probes, mainframes, etc.) in an optimal way. For small networks or for a small number of resources, it is feasible to solve the problem by checking all the possibilities of locating the resources and choosing the optimal location. However, this method cannot be applied for large networks, where a great many of resources are located. In such cases, we confront a difficult optimization problem that is classified as NPcomplete. In this study we deal with optimal and heuristics techniques in order to solve this kind of problem.
AB - Data communication and telecommunication networks consist of nodes, links and network resources. Many studies have dealt with the design of optimal network topologies. In current methodologies, every node presents the same constraints and behavior, however, in reality, the network resources vary. The research problem at stake here is how to add central network resources (i.e., servers, gateways, network managers, probes, mainframes, etc.) in an optimal way. For small networks or for a small number of resources, it is feasible to solve the problem by checking all the possibilities of locating the resources and choosing the optimal location. However, this method cannot be applied for large networks, where a great many of resources are located. In such cases, we confront a difficult optimization problem that is classified as NPcomplete. In this study we deal with optimal and heuristics techniques in order to solve this kind of problem.
KW - Complexity
KW - Delay
KW - Simulated annealing
KW - Topology
KW - Traffic
UR - http://www.scopus.com/inward/record.url?scp=0041888227&partnerID=8YFLogxK
U2 - 10.1016/S1389-1286(03)00259-7
DO - 10.1016/S1389-1286(03)00259-7
M3 - Article
AN - SCOPUS:0041888227
SN - 1389-1286
VL - 43
SP - 195
EP - 209
JO - Computer Networks
JF - Computer Networks
IS - 2
ER -