1 / 7

Server Location Problem

Server Location Problem. Padmaja Adipudi. General Representation Of P roblem. Problem. Problem. Where in Internet is the best n locations for such connection servers, given a set of end user locations? Example of Server Location Problem. Description of Server Location Problem.

kburt
Télécharger la présentation

Server Location Problem

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Server Location Problem PadmajaAdipudi Padmaja Adipudi

  2. General Representation Of Problem Padmaja Adipudi

  3. Problem Problem • Where in Internet is the best n locations for such connection servers, given a set of end user locations? • Example of Server Location Problem Padmaja Adipudi

  4. Description of Server Location Problem • The ‘Server Location’ problem can be described as a standard problem in location theory. • The inputs given are a set of n locations and n Servers, and the final result is to assign each facility to a location. • To measure the cost of each possible assignment, there are n! of them. • The prescribed flow between each pair of facilities and the distance between their assigned locations should be multiplied, and sum over all the pairs. • The aim of the algorithm is to find the assignment that minimizes this cost. Padmaja Adipudi

  5. Mathematical Representation of Algorithm • The problem can be formulated by defining two N by N matrices. • Matrix F: whose (i,j) element represent the flow between servers i and j. • Matrix D: whose (i,j) element represent the distance between locations i and j. Optimal Cost = Padmaja Adipudi

  6. Server Location Demo Program • It was developed in Java using Java Applet, Swing classes. • This program assigns the server to a location and minimize the cost. Padmaja Adipudi

  7. References • Approximation algorithms for facility location problems By David B. Shmoys can be found at http://www.cs.cornell.edu/home/shmoys/shmoys.html • Branch & Bound Technique can be found at http://www.cs.sandia.gov/opt/survey/branch-and-bound.html Padmaja Adipudi

More Related