ESPN: Efficient server placement in probabilistic networks with budget constraint

Proceedings - IEEE INFOCOM

Volumn , Issue , 2011, Pages 1269-1277

  Yang, Dejun ^a   Fang, Xi ^a   Xue, Guoliang ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET CONSTRAINT; CANDIDATE LOCATIONS; EFFICIENT APPROXIMATION ALGORITHMS; GUARANTEED PERFORMANCE; MULTIHOP; NP-HARD; OPTIMAL ALGORITHM; PROBABILISTIC NETWORK; SERVER PLACEMENTS; SINGLE-HOP; WIRELESS COMMUNICATION NETWORK;

BUDGET CONTROL; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; HEURISTIC ALGORITHMS; OPTIMIZATION; TELECOMMUNICATION NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 79960850418     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5934908     Document Type: Conference Paper

References (24)

1. A.L. Barabasi and R. Albert; Emergence of scaling in random networks; Science, Vol.286(1999), pp. 509-512.
2. F.J. Berchmans, W-K. Hon, A.C.Y. Huang, C-S. Liu, E. Lo and D.K.Y. Yau; Optimizing link assignment to enhance service in probabilistic network; SECON'10, pp. 235-243.
3. A. Cerpa, J.L. Wong, L. Kuang, M. Potkonjak, and D. Estrin. Statiscal model of lossy links in wireless sensor networks; IPSN'05, pp. 81-88.
4. P. Crescenzi and V. Kann; A compendium of NP optimization problems; . http://www.csc.kth.se/-viggo/wwwcompendium/,1998
5. M. Faloutsos, P. Faloutsos and C. Faloutsos; On power-law relationships of the Internet topology; SIGCOMM'99, pp. 251-262.
6. C.M. Grinstead and J.L. Snell; Introduction to probability; American Mathematical Society, 1997.
7. S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt and L. Zhang; On the placement of Internet instrumentation; INFOCOM'00, pp. 295-304.
8. S. Jamin, C. Jin, A.R. Kurc, D. Raz and Y. Shavitt; Constrained mirror placement on the Internet; INFOCOM'01, pp. 31-40.
9. X.H. Jia, D.Y. Li, X.D. Hu, H.J. Huang and D.Z. Du; Optimal placement of proxies of replicated Web servers in the Internet; WISE'00, pp. 55-59.
10. D. Kempe, J. Kleinberg and E. Tardos; Maximizing the spread of influence through a social network; SIGKDD'03, pp. 137-146.
11. S. Khuller, A. Moss and J. Naor; The budgeted maximum coverage problem; Information Processing Letters, vol.70 (1999), pp. 39-45.
12. K. Kim and K.G. Shin; On accurate measurement of link quality in multi-hop wireless mesh networks; MOBICOM'06, pp. 38-49.
13. A. Krause and C. Guestrin; A note on the budgeted maximization of submodular functions; Technical Report. CMU-CALD-05-103, 2005.
14. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriensen and N. Glance; Cost-effective outbreak detection in networks; SIGKDD'07, pp. 420-429.
15. B. Li, M.J. Golin, G.F. Italiano and X. Deng; On the optimal placement of web proxies in the Internet; INFOCOM'99, pp. 1282-1290.
16. G. Nemhauser, L. Wolsey and M. Fisher; An analysis of the approximations for maximizing submodular set functions; Mathematical Programming, 1978.
17. L. Qiu, V.N. Padmanabhan and G.M. Voelker; On the placement of Web server replicas; INFOCOM'01, pp. 1587-1596.
18. P. Radoslavov, R. Govindan and D. Estrin; Topology-informed Internet replica placement; Proceedings of the Sixth International Workshop on Web Caching and Content Distribution (WCW'01).
19. S. Roy, H. Pucha, Z. Zhang, Y.C. Hu and L. Qiu; On the placement of infrastructure overlay nodes; IEEE/ACM Trans. on Networking, Vol.14(2009), pp. 1298-1311.
20. S. Shi and J. Turner; Placing servers in overlay networks; SPECTS'02.
21. X. Tang and J. Xu; On replica placement for QoS-aware content distribution; INFOCOM'04, pp. 806-815.
22. V. Vazirani; Approximation algorithms; Springer, 2001.
23. A. Woo, T. Tong and D. Culler; Taming the underlying challenges of reliable multihop routing in sensor networks; SENSYS'03, pp. 14-27.
24. H. Zhang, A, Arora and P. Sinha; Learn on the fly: data-driven link estimation and routing in sensor network backbones; INFOCOM'06, pp. 1-12.