The Device Placement Location (DPL) is concerned with locating the placemeat of the
corresponding electronic device within certain existing user locations.. It considers. the cost
parameter of the device placement location and routing users. This paper measures the reliability
of the DPL and assigning the users to the DPL by implementing the DPLRC & DPLRC
algorithms. In fact, our models ire similar in spirit to [26]. However, there is a striking difference
between them In this paper, the users are assigned to .the.device locations only after measuring the
network reliahility. The DPLRC algorithm is applied to minimize the cost of placing the devices
and maximize the reliability of users that are assigned to the device locations. The DPLRD
algorithm is used to maximiie the reliability of placing the devices and the demands of the users
that are assigned to device locations. We have used the Hao-Orlin algorithm to measure the
network reliahility. 'It is implemented to run this algorithm in 0 (nm log (nZ/m)) time. All the three
algorithms mentioned above have been analyzed and designed by the use of UML. They are
implemented by the use of C#.NET 2005 programming language. We discuss the relationship
between the nodes, edges, and the effectiveness of the cost on the increase in the DPLs with the
aid of tradeoff curves and tables. We also look at the performance of the algorithms by measuring
the CPU time taken to find the DPLs. The results of this paper demonstrates that the number of the
DPLs and the users assigned vary according to the total number of nodes, edges and the minimum
cost thresholds.