TY - GEN

T1 - Algorithms for locating resources in a communication network

AU - Giladi, R.

AU - Korach, E.

AU - Ohayon, R.

N1 - Publisher Copyright:
© 1998 IEEE.

PY - 1998/1/1

Y1 - 1998/1/1

N2 - Both data communication and telecommunication networks consist of nodes, links and network resources. Many studies deal with the design of optimal network topologies. In current methodologies, every node presents the same constraints and behavior, while in reality, the network resources vary. The research problem at stake is how to add central network resources (i.e., servers, gateways, network managers, probes, mainframes, etc.) in an optimal way, for example, such that the transmission delay will be minimized. For small networks or for a small number of resources, it is feasible to find the optimal locations of the resources by checking all the possibilities. This method cannot be applied to large networks, where a great many of resources are located. In such cases the problem turns into a difficult optimization problem that can be classified as NP-complete. We deal with both optimal and heuristics techniques to solve this problem.

AB - Both data communication and telecommunication networks consist of nodes, links and network resources. Many studies deal with the design of optimal network topologies. In current methodologies, every node presents the same constraints and behavior, while in reality, the network resources vary. The research problem at stake is how to add central network resources (i.e., servers, gateways, network managers, probes, mainframes, etc.) in an optimal way, for example, such that the transmission delay will be minimized. For small networks or for a small number of resources, it is feasible to find the optimal locations of the resources by checking all the possibilities. This method cannot be applied to large networks, where a great many of resources are located. In such cases the problem turns into a difficult optimization problem that can be classified as NP-complete. We deal with both optimal and heuristics techniques to solve this problem.

UR - http://www.scopus.com/inward/record.url?scp=85053168606&partnerID=8YFLogxK

U2 - 10.1109/ISCC.1998.702614

DO - 10.1109/ISCC.1998.702614

M3 - Conference contribution

AN - SCOPUS:85053168606

SN - 0818685387

SN - 9780818685385

T3 - Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998

SP - 637

EP - 641

BT - Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998

PB - Institute of Electrical and Electronics Engineers

T2 - 3rd IEEE Symposium on Computers and Communications, ISCC 1998

Y2 - 30 June 1998 through 2 July 1998

ER -