“School of Computer Science”
Back to Papers HomeBack to Papers of School of Computer Science
| Paper IPM / Computer Science / 11022 |
|
||||||
| Abstract: | |||||||
|
In large systems, economical and efficiency concerns restrict the allocation of each resource to every node in the network. Therefore, it is desirable to distribute copies of resource in order to share them and achieve a certain performance measure. In this paper, we consider the problem of distributing resources in Cube-Connected Cycles. Both adjacency and distant placements are considered in this paper. In adjacency placements, dominating sets and perfect dominating sets are used. The proposed algorithms for distant placements use known placements for basic hypercube graphs. Therefore, in these placements we avoid the additional costs needed for deploying the network. We prove that the presented algorithms provide an optimum result for Cube-Connected Cycles.
Download TeX format |
|||||||
| back to top | |||||||
