R. Albert, Statistical mechanics of complex networks, Reviews of Modern Physics, vol.74, issue.1, 2001.
DOI : 10.1103/RevModPhys.74.47

P. Alimonti and T. Calamoneri, Improved approximations of independent dominating set in bounded degree graphs, Workshop on Graph-Theoretic Concepts in Computer Science, pp.2-16, 1996.
DOI : 10.1007/3-540-62559-3_2

Y. Chen, R. H. Katz, and J. D. Kubiatowicz, Dynamic replica placement for scalable content delivery. In Peer-to-Peer Systems: First International Workshop, IPTPS'02), pp.306-318, 2002.

P. Druschel and A. Rowstron, PAST: a large-scale, persistent peer-to-peer storage utility, Proceedings Eighth Workshop on Hot Topics in Operating Systems, p.75, 2001.
DOI : 10.1109/HOTOS.2001.990064

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness, 1990.

G. H. Fletcher, H. A. Sheth, and K. Borner, Unstructured Peer-to-Peer Networks: Topological Properties and Search Performance, 2004.
DOI : 10.1007/11574781_2

S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt et al., On the placement of Internet instrumentation, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), pp.295-304, 2000.
DOI : 10.1109/INFCOM.2000.832199

L. Jia, R. Rajaraman, and T. Suel, An efficient distributed algorithm for constructing small dominating sets, Distributed Computing, vol.15, issue.4, pp.193-205, 2002.
DOI : 10.1007/s00446-002-0078-0

X. Jia, D. Li, X. Hu, and D. Du, Optimal placement of proxies of replicated Web servers in the Internet, Proceedings of the First International Conference on Web Information Systems Engineering, pp.329-339, 2001.
DOI : 10.1109/WISE.2000.882375

F. Kuhn and R. Wattenhofer, Constant-time distributed dominating set approximation, Distributed Computing, vol.33, issue.4, pp.303-310, 2005.
DOI : 10.1007/s00446-004-0112-5

Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, Search and replication in unstructured peer-to-peer networks, Proc. 2002 ACM SIGMETRICS conference, 2002.

L. Qiu, V. N. Padmanabhan, and G. M. Voelker, On the placement of web server replicas, 20th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings (INFOCOM'01, pp.1587-1596, 2001.

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, A scalable content-addressable network, SIGCOMM '01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pp.161-172, 2001.

I. T. Antony, P. Rowstron, and . Druschel, Pastry: Scalable, decentralized object location , and routing for large-scale peer-to-peer systems, Middleware '01: Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg, pp.329-350, 2001.

I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, SIGCOMM '01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pp.149-160, 2001.

D. Stutzbach and R. Rejaie, Understanding churn in peer-to-peer networks, Proceedings of the 6th ACM SIGCOMM on Internet measurement , IMC '06, 2006.
DOI : 10.1145/1177080.1177105

M. Szymaniak, G. Pierre, and M. Van-steen, Latency-driven replica placement, Proceedings of the Symposium on Applications and the Internet, pp.399-405, 2005.

C. Yang and J. Wu, Dominating-set-based searching in peer-to-peer networks, Grid and Cooperative Computing, pp.332-339, 2003.