作者: Paria Moinzadeh , Hamid Sarbazi-Azad , Nasser Yazdani
关键词:
摘要: In large systems, economical and efficiency concerns restrict the allocation of each resource to every node in network. Therefore, it is desirable distribute copies order share them achieve a certain performance measure. this paper, we consider problem distributing resources Cube-Connected Cycles. Both adjacency distant placements are considered paper. placements, dominating sets perfect used. The proposed algorithms for use known basic hypercube graphs. these avoid additional costs needed deploying We prove that presented provide an optimum result