Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
469542 | Computers & Mathematics with Applications | 2009 | 11 Pages |
In this paper, using the chromatic properties of power graphs we propose a new approach for placing resources in symmetric networks. Our novel placement scheme guarantees a perfect placement when such a solution is feasible in the topology, while in general it answers the question of kk-resource placement at a distance dd where each non-resource node is able to access kk resource nodes within at most dd hops away. We define a quasi-perfect graph as a graph whose clique number and chromatic number are equal. We derive important properties of quasi-perfect graphs and use them to find a solution for the resource placement problem. We have also applied the proposed method to find a distant resource placement in the popular hypercube network as an example. We have also considered the problem of sparse resource placement.