Fast Optimal Replica Placement with Exhaustive Search Using Dynamically Reconfigurable Processor

<table>Probability of approximate ratio of the greedy algorithm, where the number of nodes is 32, and the average node degree is 3, the cost of a link is uniformly distributed between 1 and 15, and the number of simulations are 5000.</table>

Journal of Computer Networks and Communications

fig3

Figure 3

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