{"id":"https://openalex.org/W2097377786","doi":"https://doi.org/10.1109/infcom.2011.5934908","title":"ESPN: Efficient server placement in probabilistic networks with budget constraint","display_name":"ESPN: Efficient server placement in probabilistic networks with budget constraint","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W2097377786","doi":"https://doi.org/10.1109/infcom.2011.5934908","mag":"2097377786"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2011.5934908","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2011.5934908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048130147","display_name":"Dejun Yang","orcid":"https://orcid.org/0000-0002-1811-4423"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dejun Yang","raw_affiliation_strings":["CSE Department, Arizona State University, Tempe, AZ, USA","CSE Dept. at Arizona State University, Tempe, 85287, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CSE Department, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"CSE Dept. at Arizona State University, Tempe, 85287, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010754242","display_name":"Xi Fang","orcid":"https://orcid.org/0000-0002-3783-2041"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xi Fang","raw_affiliation_strings":["CSE Department, Arizona State University, Tempe, AZ, USA","CSE Dept. at Arizona State University, Tempe, 85287, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CSE Department, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"CSE Dept. at Arizona State University, Tempe, 85287, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026230689","display_name":"Guoliang Xue","orcid":"https://orcid.org/0000-0002-5833-8894"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guoliang Xue","raw_affiliation_strings":["CSE Department, Arizona State University, Tempe, AZ, USA","CSE Dept. at Arizona State University, Tempe, 85287, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CSE Department, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"CSE Dept. at Arizona State University, Tempe, 85287, USA","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"286","issue":null,"first_page":"1269","last_page":"1277"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.8261120319366455},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7769118547439575},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7584967613220215},{"id":"https://openalex.org/keywords/budget-constraint","display_name":"Budget constraint","score":0.5989487171173096},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5753599405288696},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5696448087692261},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5413435101509094},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5177447199821472},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.5126947164535522},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4861399829387665},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4360523223876953},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.43091660737991333},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.41213753819465637},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.38498759269714355},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3720490336418152},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32799553871154785},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2737501263618469},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12883982062339783},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11863258481025696}],"concepts":[{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.8261120319366455},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7769118547439575},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7584967613220215},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.5989487171173096},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5753599405288696},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5696448087692261},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5413435101509094},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5177447199821472},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.5126947164535522},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4861399829387665},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4360523223876953},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.43091660737991333},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.41213753819465637},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.38498759269714355},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3720490336418152},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32799553871154785},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2737501263618469},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12883982062339783},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11863258481025696},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C133425853","wikidata":"https://www.wikidata.org/wiki/Q60571","display_name":"Neoclassical economics","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcom.2011.5934908","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2011.5934908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.713.3418","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.713.3418","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://optimization.asu.edu/papers/XUE-CNF-2011-INFOCOM2011-ESPN.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1486987106","https://openalex.org/W1566959760","https://openalex.org/W1680189815","https://openalex.org/W1824518693","https://openalex.org/W1976969221","https://openalex.org/W2008620264","https://openalex.org/W2013892720","https://openalex.org/W2059778857","https://openalex.org/W2061820396","https://openalex.org/W2080379754","https://openalex.org/W2113718002","https://openalex.org/W2117441298","https://openalex.org/W2120909192","https://openalex.org/W2132987358","https://openalex.org/W2134156042","https://openalex.org/W2134529269","https://openalex.org/W2141403143","https://openalex.org/W2162954928","https://openalex.org/W2167776925","https://openalex.org/W2168249744","https://openalex.org/W2169458211","https://openalex.org/W2481666560","https://openalex.org/W2611804663","https://openalex.org/W2751555667","https://openalex.org/W4205747222","https://openalex.org/W4235904988","https://openalex.org/W4249318479","https://openalex.org/W6629222065","https://openalex.org/W6644524268","https://openalex.org/W6678066767","https://openalex.org/W6679418958","https://openalex.org/W6680246161","https://openalex.org/W6684901892"],"related_works":["https://openalex.org/W2092530219","https://openalex.org/W2388464034","https://openalex.org/W2533125852","https://openalex.org/W2140460949","https://openalex.org/W2105580438","https://openalex.org/W2057435755","https://openalex.org/W3121798572","https://openalex.org/W2018782216","https://openalex.org/W2374100080","https://openalex.org/W1901237831"],"abstract_inverted_index":{"The":[0],"notion":[1],"of":[2,30,47,75,102,118,127,138,147],"probabilistic":[3,34],"network":[4],"has":[5],"been":[6],"used":[7],"to":[8,37,42,54,97,151],"characterize":[9],"the":[10,28,44,63,67,72,100,113,115,130,134,145,152],"unpredictable":[11],"environment":[12],"in":[13,27,33,61,112],"wireless":[14],"communication":[15],"networks":[16,35],"or":[17],"other":[18,156],"unstable":[19],"networks.":[20],"In":[21],"this":[22,59,76],"paper,":[23],"we":[24],"are":[25,105],"interested":[26],"problem":[29,60,77],"placing":[31,123],"servers":[32,125],"subject":[36],"budget":[38,109],"constraint,":[39],"so":[40],"as":[41],"maximize":[43],"expected":[45],"number":[46],"servable":[48],"clients":[49],"that":[50,80],"can":[51],"successfully":[52],"connect":[53],"a":[55],"server.":[56],"We":[57,70],"study":[58],"both":[62,85],"single-hop":[64],"model":[65],"and":[66,78,155],"multi-hop":[68],"model.":[69],"discuss":[71],"computational":[73],"complexity":[74],"show":[79],"it":[81],"is":[82,110],"NP-hard":[83],"under":[84],"models.We":[86],"then":[87],"develop":[88],"efficient":[89],"approximation":[90],"algorithms,":[91],"which":[92],"produce":[93],"solutions":[94],"provably":[95],"close":[96],"optimal.":[98],"If":[99],"costs":[101],"candidate":[103],"locations":[104],"uniform,":[106],"when":[107],"extra":[108],"available":[111],"future,":[114],"progressive":[116],"feature":[117],"our":[119,148],"algorithms":[120,149],"allows":[121],"for":[122],"additional":[124],"instead":[126],"relocating":[128],"all":[129],"servers,":[131],"while":[132],"retaining":[133],"guaranteed":[135],"performance.":[136],"Results":[137],"extensive":[139],"experiments":[140],"on":[141],"different":[142],"topologies":[143],"confirm":[144],"performance":[146],"compared":[150],"optimal":[153],"algorithm":[154],"heuristic":[157],"algorithms.":[158]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}