Fast Optimal Replica Placement with Exhaustive Search Using Dynamically Reconfigurable Processor

<table>The optimal solution, where the distance constraint <svg height="16.5625" id="M27" style="vertical-align:-3.50804pt" version="1.1" viewbox="0 0 56.962502 16.5625" width="56.962502" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.138)"><path d="M474 429q-19 -69 -47 -222l-65 -347q-8 -49 0 -60t49 -16l26 -3l-4 -26l-246 -12l4 25l17 3q37 6 50 20.5t23 60.5l67 321h-2q-65 -79 -150 -138q-69 -47 -104 -47q-28 0 -48.5 32t-20.5 81q0 78 35 148t90 117q67 57 161 77q23 5 58 5q43 0 90 -15zM387 387
q-30 16 -75 16q-58 0 -92 -27q-49 -39 -78.5 -112t-29.5 -136q0 -34 8.5 -52.5t21.5 -18.5q40 0 109.5 63.5t103.5 115.5q16 53 32 151z" id="x1D45E"></path></g><g transform="matrix(.017,-0,0,-.017,8.409,12.138)"><path d="M300 -147l-18 -23q-106 71 -159 185.5t-53 254.5v1q0 139 53 252.5t159 186.5l18 -24q-74 -62 -115.5 -173.5t-41.5 -242.5q0 -130 41.5 -242.5t115.5 -174.5z" id="x28"></path></g><g transform="matrix(.017,-0,0,-.017,14.29,12.138)"><path d="M515 96q-37 -44 -84.5 -76t-71.5 -32q-12 0 -18 7t-6 34t10 75l19 89h-2q-87 -113 -181 -176q-43 -29 -83 -29q-46 0 -46 63q0 31 9 67l52 222q7 36 -1 36q-10 0 -76 -50l-13 24q47 45 92 71.5t67 26.5q18 0 21 -16.5t-8 -65.5l-56 -242q-16 -67 13 -67q41 0 114 74
t114 146l32 145l74 26h11q-52 -199 -80 -347q-8 -39 6 -39q7 0 32 17.5t47 39.5z" id="x1D462"></path></g><g transform="matrix(.017,-0,0,-.017,23.436,12.138)"><path d="M275 270q0 -296 -211 -440l-19 23q75 62 116.5 174t41.5 243t-42 243t-116 173l19 24q211 -144 211 -440z" id="x29"></path></g><g transform="matrix(.017,-0,0,-.017,34.026,12.138)"><path d="M535 323h-483v50h483v-50zM535 138h-483v50h483v-50z" id="x3D"></path></g><g transform="matrix(.017,-0,0,-.017,48.73,12.138)"><path d="M249 635q70 0 116 -43t46 -105q0 -46 -28 -80q-22 -25 -80 -64q62 -35 97 -75t35 -99q0 -81 -63 -131t-135 -50q-83 0 -137.5 45.5t-54.5 123.5q0 52 45 95q29 28 89 64q-109 62 -109 155q0 66 50.5 115t128.5 49zM238 603q-42 0 -67.5 -31t-25.5 -72q0 -50 32.5 -79.5
t98.5 -62.5q61 48 61 124q0 59 -29.5 90t-69.5 31zM248 20q46 0 76.5 33.5t30.5 89.5q0 50 -39 85.5t-110 71.5q-81 -54 -81 -137q0 -67 35.5 -105t87.5 -38z" id="x38"></path></g>
</svg>. The number of replica servers is 2.</table>

Journal of Computer Networks and Communications

fig2

Figure 2

Figure 2: Fast Optimal Replica Placement with Exhaustive Search Using Dynamically Reconfigurable Processor 