Distance-d covering problems in scale-free networks with degree correlations

Details Distance-d covering problems in scale-free networks with degree correlations Distance-d covering problems in scale-free networks with degree correlations

2004-06-23

arxiv.org/abs/cond-mat/0406547v2

Physical Review E, 71, 035102(R) (2005)

Physics

Condensed Matter

Statistical Mechanics

APS format. Version to appear in Physical Review E (Rapid Communication)

Scientific paper

10.1103/PhysRevE.71.035102

A number of problems in communication systems demand the distributed allocation of network resources in order to provide better services, sampling and distribution methods. The solution to these issues is becoming more challenging due to the increasing size and complexity of communication networks. We report here on an heuristic method that allows to find near-optimal solutions to the covering problem in real communication networks. The results show that the optimal allocation of resources strongly depends on the topology of the underlying networks. Whether a centralized or distributed design is to be used relies upon the degree correlations between connected vertices.

Affiliated with

Also associated with

No associations

Rating

Distance-d covering problems in scale-free networks with degree correlations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distance-d covering problems in scale-free networks with degree correlations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distance-d covering problems in scale-free networks with degree correlations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-247332