Server Location Problem Padmaja Adipudi 10282021 Padmaja Adipudi

Server Location Problem Padmaja Adipudi 10/28/2021 Padmaja Adipudi 1

General Representation Of Problem 10/28/2021 Padmaja Adipudi 2

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 10/28/2021 Padmaja Adipudi 3

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. 10/28/2021 Padmaja Adipudi 4

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 = 10/28/2021 Padmaja Adipudi 5

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. 10/28/2021 Padmaja Adipudi 6

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