Algorithms for locating resources in a communication network

R. Giladi, E. Korach, R. Ohayon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages637-641
Number of pages5
ISBN (Print)0818685387, 9780818685385
DOIs
StatePublished - 1 Jan 1998
Event3rd IEEE Symposium on Computers and Communications, ISCC 1998 - Athens, Greece
Duration: 30 Jun 19982 Jul 1998

Publication series

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

Conference

Conference3rd IEEE Symposium on Computers and Communications, ISCC 1998
Country/TerritoryGreece
CityAthens
Period30/06/982/07/98

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Safety, Risk, Reliability and Quality

Fingerprint

Dive into the research topics of 'Algorithms for locating resources in a communication network'. Together they form a unique fingerprint.

Cite this