Your Search Results

Use this resource - and many more! - in your textbook!

AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.

Experience the freedom of customizing your course pack with AcademicPub!
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.

Algorithms for locating resources in a communication network

By: Ohayon, R.; Korach, E.; Giladi, R.;

1998 / IEEE / 0-8186-8538-7


This item was taken from the IEEE Conference ' Algorithms for locating resources in a communication network ' 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.