{"id":"https://openalex.org/W2151661412","doi":"https://doi.org/10.1109/infcom.2011.5935174","title":"Cost effective resource allocation of overlay routing relay nodes","display_name":"Cost effective resource allocation of overlay routing relay nodes","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W2151661412","doi":"https://doi.org/10.1109/infcom.2011.5935174","mag":"2151661412"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2011.5935174","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2011.5935174","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":"article","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/A5020891994","display_name":"Rami Cohen","orcid":"https://orcid.org/0000-0002-9152-8446"},"institutions":[{"id":"https://openalex.org/I4210167297","display_name":"IBM Research - Haifa","ror":"https://ror.org/05rw9t746","country_code":"IL","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115","https://openalex.org/I4210167297"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Rami Cohen","raw_affiliation_strings":["IBM Research - Haifa, Israel","IBM Research, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Research - Haifa, Israel","institution_ids":["https://openalex.org/I4210167297"]},{"raw_affiliation_string":"IBM Research, Haifa, Israel","institution_ids":["https://openalex.org/I4210167297"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105124259","display_name":"Danny Raz","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Danny Raz","raw_affiliation_strings":["Computer Science Department, Technion, IIT, Israel","Computer Science Department, Technion-Israel Institute of Technology, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Technion, IIT, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Computer Science Department, Technion-Israel Institute of Technology, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3045,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81297598,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"3236","last_page":"3244"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9987999796867371,"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.9980999827384949,"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/computer-science","display_name":"Computer science","score":0.7912434339523315},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7130637168884277},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6937623620033264},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6587085127830505},{"id":"https://openalex.org/keywords/overlay","display_name":"Overlay","score":0.6456891298294067},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6304349899291992},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5788882970809937},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5162915587425232},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5073174834251404},{"id":"https://openalex.org/keywords/overlay-network","display_name":"Overlay network","score":0.5043164491653442},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5001859664916992},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.47461214661598206},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.44432199001312256},{"id":"https://openalex.org/keywords/relay","display_name":"Relay","score":0.4252418279647827},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.30087175965309143},{"id":"https://openalex.org/keywords/the-internet","display_name":"The Internet","score":0.2588661015033722}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7912434339523315},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7130637168884277},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6937623620033264},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6587085127830505},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.6456891298294067},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6304349899291992},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5788882970809937},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5162915587425232},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5073174834251404},{"id":"https://openalex.org/C169851745","wikidata":"https://www.wikidata.org/wiki/Q1331985","display_name":"Overlay network","level":3,"score":0.5043164491653442},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5001859664916992},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.47461214661598206},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.44432199001312256},{"id":"https://openalex.org/C2778156585","wikidata":"https://www.wikidata.org/wiki/Q174053","display_name":"Relay","level":3,"score":0.4252418279647827},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.30087175965309143},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.2588661015033722},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infcom.2011.5935174","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2011.5935174","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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W65584354","https://openalex.org/W1501204926","https://openalex.org/W1522559342","https://openalex.org/W1572977974","https://openalex.org/W1780466844","https://openalex.org/W1985977780","https://openalex.org/W2000660986","https://openalex.org/W2008951620","https://openalex.org/W2011039300","https://openalex.org/W2036732598","https://openalex.org/W2100415265","https://openalex.org/W2104042270","https://openalex.org/W2115164075","https://openalex.org/W2134529269","https://openalex.org/W2143996311","https://openalex.org/W2144553078","https://openalex.org/W2145721479","https://openalex.org/W2147497995","https://openalex.org/W2156323105","https://openalex.org/W2167776925","https://openalex.org/W2168249744","https://openalex.org/W2168618039","https://openalex.org/W2170888255","https://openalex.org/W2481666560","https://openalex.org/W3006245486","https://openalex.org/W3023699522","https://openalex.org/W4255102269","https://openalex.org/W4285719527","https://openalex.org/W6631304100","https://openalex.org/W6638167631","https://openalex.org/W6651371874","https://openalex.org/W6684785597","https://openalex.org/W6684901892","https://openalex.org/W6722192857"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W4253436398","https://openalex.org/W2068473861","https://openalex.org/W1538003338","https://openalex.org/W2364686261","https://openalex.org/W2556128816","https://openalex.org/W3125210154","https://openalex.org/W2351878639","https://openalex.org/W3046124320","https://openalex.org/W2607223747"],"abstract_inverted_index":{"Overlay":[0],"routing":[1,14,30,58,134,154],"in":[2,136,187],"a":[3,48,80,140,159],"very":[4],"attractive":[5],"scheme":[6,106,181],"that":[7,55,73,139,178],"allows":[8],"improving":[9],"certain":[10],"properties":[11,59,93],"of":[12,22,36,51,94,104,144,170,192],"the":[13,16,20,23,32,43,56,87,95,101,105,109,131,137,166,180],"without":[15],"need":[17],"to":[18,42,152,162],"change":[19],"standards":[21],"current":[24,132],"underlying":[25],"routing.":[26],"However,":[27],"deploying":[28],"overlay":[29,37,52,193],"requires":[31],"placement":[33,191],"and":[34,78,124],"maintenance":[35],"infrastructure.":[38],"This":[39],"gives":[40],"rise":[41],"following":[44],"optimization":[45,69],"problem:":[46],"find":[47],"minimal":[49],"set":[50],"nodes":[53],"such":[54],"required":[57],"are":[60,150],"satisfied.":[61],"In":[62],"this":[63,68],"paper":[64],"we":[65,125],"rigorously":[66],"study":[67],"problem.":[70],"We":[71,99,175],"show":[72],"it":[74],"is":[75,121],"NP":[76],"hard":[77],"derive":[79],"non-trivial":[81],"approximation":[82,88],"algorithm":[83],"for":[84,182],"it,":[85],"where":[86],"ratio":[89],"depends":[90],"on":[91],"specific":[92],"problem":[96],"at":[97],"hand.":[98],"examine":[100],"practical":[102],"aspects":[103],"by":[107,173],"evaluating":[108],"gain":[110],"one":[111,120],"can":[112],"get":[113],"over":[114,155],"two":[115],"real":[116],"scenarios.":[117],"The":[118],"first":[119],"BGP":[122,133],"routing,":[123],"show,":[126],"using":[127,179],"up-to-date":[128],"data":[129],"reflecting":[130],"policy":[135],"Internet,":[138],"relative":[141],"small":[142],"number":[143],"less":[145],"than":[146],"100":[147],"relay":[148],"servers":[149],"sufficient":[151],"enable":[153],"shorter":[156],"paths":[157,172],"from":[158],"single":[160],"source":[161],"all":[163],"ASes,":[164],"reducing":[165],"average":[167],"path":[168],"length":[169],"inflated":[171],"40%.":[174],"also":[176],"demonstrate":[177],"TCP":[183],"performance":[184],"improvement,":[185],"results":[186],"an":[188],"almost":[189],"optimal":[190],"nodes.":[194]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}