{"id":"https://openalex.org/W1568023593","doi":"https://doi.org/10.1137/110845239","title":"Minimum Congestion Mapping in a Cloud","display_name":"Minimum Congestion Mapping in a Cloud","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1568023593","doi":"https://doi.org/10.1137/110845239","mag":"1568023593"},"language":"en","primary_location":{"id":"doi:10.1137/110845239","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110845239","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/a7f17457-f6b1-45ce-b0c1-083dc3b9dabc","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["Stochastics W&I"],"affiliations":[{"raw_affiliation_string":"Stochastics W&I","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112633887","display_name":"Kang-Won Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kang-Won Lee","raw_affiliation_strings":["IBM, ,"],"affiliations":[{"raw_affiliation_string":"IBM, ,","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051270969","display_name":"Viswanath Nagarajan","orcid":"https://orcid.org/0000-0002-9514-5581"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Viswanath Nagarajan","raw_affiliation_strings":["Industrial and Operations Engineering"],"affiliations":[{"raw_affiliation_string":"Industrial and Operations Engineering","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040514677","display_name":"Murtaza Zafer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Murtaza Zafer","raw_affiliation_strings":["Nyansa Inc"],"affiliations":[{"raw_affiliation_string":"Nyansa Inc","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8192,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.85183558,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"44","issue":"3","first_page":"819","last_page":"843"},"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.9991999864578247,"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.9991999864578247,"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/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.6826319694519043},{"id":"https://openalex.org/keywords/cloud-computing","display_name":"Cloud computing","score":0.6572830080986023},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5461174845695496},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.47543099522590637},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44382524490356445},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3582645058631897},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.341680109500885},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33973732590675354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3299717307090759},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12300387024879456}],"concepts":[{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.6826319694519043},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.6572830080986023},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5461174845695496},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.47543099522590637},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44382524490356445},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3582645058631897},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.341680109500885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33973732590675354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3299717307090759},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12300387024879456},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1137/110845239","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110845239","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/a7f17457-f6b1-45ce-b0c1-083dc3b9dabc","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/a7f17457-f6b1-45ce-b0c1-083dc3b9dabc","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Lee, K-W, Nagarajan, V & Zafer, M 2015, 'Minimum congestion mapping in a cloud', SIAM Journal on Computing, vol. 44, no. 3, pp. 819-843. https://doi.org/10.1137/110845239","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:716160","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=716160","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.369.6895","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.369.6895","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:716160","is_oa":false,"landing_page_url":"http://repository.tue.nl/716160","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:797335","is_oa":false,"landing_page_url":"http://repository.tue.nl/797335","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0097-5397","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/5527502b-ad8b-4421-ae60-0611e056ba7f","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/5527502b-ad8b-4421-ae60-0611e056ba7f","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2011, San Jose CA, USA, June 6-8, 2011), 267 - 276","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:tue:oai:pure.tue.nl:publications/a7f17457-f6b1-45ce-b0c1-083dc3b9dabc","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/a7f17457-f6b1-45ce-b0c1-083dc3b9dabc","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 44(3), 819 - 843. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/a7f17457-f6b1-45ce-b0c1-083dc3b9dabc","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/a7f17457-f6b1-45ce-b0c1-083dc3b9dabc","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Lee, K-W, Nagarajan, V & Zafer, M 2015, 'Minimum congestion mapping in a cloud', SIAM Journal on Computing, vol. 44, no. 3, pp. 819-843. https://doi.org/10.1137/110845239","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.4000000059604645,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1982810715","https://openalex.org/W2022191808","https://openalex.org/W2049143039","https://openalex.org/W2062657914","https://openalex.org/W2088844265","https://openalex.org/W2105684878","https://openalex.org/W2114298221","https://openalex.org/W2150148016","https://openalex.org/W2156867662","https://openalex.org/W4253864964"],"related_works":["https://openalex.org/W986318368","https://openalex.org/W2000785801","https://openalex.org/W2384410913","https://openalex.org/W2352878646","https://openalex.org/W2004734601","https://openalex.org/W2130149817","https://openalex.org/W2990194547","https://openalex.org/W1480123525","https://openalex.org/W2620865396","https://openalex.org/W2547038763"],"abstract_inverted_index":{"We":[0,69,77,141],"study":[1],"a":[2,22,37,81,87,174,188],"basic":[3],"resource":[4,57],"allocation":[5],"problem":[6,147],"that":[7,79],"arises":[8],"in":[9,127],"cloud":[10,18],"computing":[11],"environments.":[12],"The":[13,48],"physical":[14,67,92,129],"network":[15,130],"of":[16,39,73,125,152],"the":[17,56,66,71,75,91,98,117,123,128,134,144,180],"is":[19,36,122,133],"represented":[20],"as":[21],"graph":[23,93],"with":[24,41],"vertices":[25],"representing":[26],"servers":[27],"and":[28,44,51,55,131,157],"edges":[29],"corresponding":[30],"to":[31,65,90,136],"communication":[32,46],"links.":[33],"A":[34],"workload":[35,62,89,138],"set":[38],"processes":[40],"processing":[42],"requirements":[43],"mutual":[45],"requirements.":[47],"workloads":[49],"arrive":[50],"depart":[52],"over":[53],"time,":[54],"allocator":[58],"must":[59],"map":[60],"each":[61],"upon":[63],"arrival":[64],"network.":[68],"consider":[70,143],"objective":[72],"minimizing":[74],"congestion.":[76],"show":[78],"solving":[80,97],"subproblem":[82],"(\\sf":[83],"SingleMap)":[84],"about":[85],"mapping":[86],"single":[88],"essentially":[94],"suffices":[95],"for":[96,106,116,148],"general":[99,118],"problem.":[100],"In":[101],"particular,":[102],"an":[103,110,165],"$\\alpha$-approximation":[104],"algorithm":[105,115,171,191],"\\sf":[107,145],"SingleMap":[108,146],"gives":[109],"$O(\\alpha":[111],"\\log":[112,169],"nD)$":[113],"competitive":[114],"problem,":[119],"where":[120],"$n$":[121],"number":[124],"nodes":[126],"$D$":[132],"maximum":[135],"minimum":[137],"duration":[139],"ratio.":[140],"then":[142],"two":[149],"natural":[150],"classes":[151],"workloads,":[153],"namely":[154],"depth-$d$":[155,161],"trees":[156],"complete-graph":[158],"workloads.":[159],"For":[160,183],"trees,":[162],"we":[163,186],"give":[164,187],"$n^{O(d)}$":[166],"time":[167],"$O(d^2":[168],"(nd))$-approximation":[170],"based":[172],"on":[173],"strong":[175],"LP":[176],"relaxation":[177],"inspired":[178],"by":[179],"Sherali--Adams":[181],"hierarchy.":[182],"complete":[184],"graphs,":[185],"polylogarithmic":[189],"approximation":[190],"using":[192],"R\u00e4cke":[193],"decompositions.":[194]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}