{"id":"https://openalex.org/W2012243591","doi":"https://doi.org/10.1109/infcom.2013.6566990","title":"Optimal bounds for online page migration with generalized migration costs","display_name":"Optimal bounds for online page migration with generalized migration costs","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2012243591","doi":"https://doi.org/10.1109/infcom.2013.6566990","mag":"2012243591"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2013.6566990","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2013.6566990","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 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/A5101711824","display_name":"Johannes Schneider","orcid":"https://orcid.org/0000-0002-3225-5564"},"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"]},{"id":"https://openalex.org/I4210126328","display_name":"IBM Research - Zurich","ror":"https://ror.org/02js37d36","country_code":"CH","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115","https://openalex.org/I4210126328"]}],"countries":["CH","US"],"is_corresponding":true,"raw_author_name":"Johannes Schneider","raw_affiliation_strings":["IBM Research, Switzerland","IBM Research-Zurich, Switzerland#TAB#"],"affiliations":[{"raw_affiliation_string":"IBM Research, Switzerland","institution_ids":["https://openalex.org/I4210126328"]},{"raw_affiliation_string":"IBM Research-Zurich, Switzerland#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066080641","display_name":"Stefan Schmid","orcid":"https://orcid.org/0000-0002-7798-1711"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Schmid","raw_affiliation_strings":["T-Labs, Technical University of Berlin, Germany","T-Labs., Tech. Univ. Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"T-Labs, Technical University of Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]},{"raw_affiliation_string":"T-Labs., Tech. Univ. Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101711824"],"corresponding_institution_ids":["https://openalex.org/I1341412227","https://openalex.org/I4210126328"],"apc_list":null,"apc_paid":null,"fwci":0.754,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.74874241,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1905","last_page":"1913"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T11478","display_name":"Caching and Content Delivery","score":0.9908999800682068,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9830999970436096,"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/generality","display_name":"Generality","score":0.8228095173835754},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.727907657623291},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6312322616577148},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5448980927467346},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5448898673057556},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.509194552898407},{"id":"https://openalex.org/keywords/perspective","display_name":"Perspective (graphical)","score":0.46687692403793335},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.4329224228858948},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41921183466911316},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3937002718448639},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3437011241912842},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30322015285491943},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26239195466041565},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1797730028629303},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13224324584007263}],"concepts":[{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.8228095173835754},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.727907657623291},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6312322616577148},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5448980927467346},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5448898673057556},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.509194552898407},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.46687692403793335},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4329224228858948},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41921183466911316},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3937002718448639},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3437011241912842},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30322015285491943},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26239195466041565},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1797730028629303},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13224324584007263},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcom.2013.6566990","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2013.6566990","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.307.5802","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.5802","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.net.t-labs.tu-berlin.de/~stefan/infocom13.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.8100000023841858}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W218191323","https://openalex.org/W1481347950","https://openalex.org/W1532521488","https://openalex.org/W1543614321","https://openalex.org/W1552771324","https://openalex.org/W1552828154","https://openalex.org/W1553785337","https://openalex.org/W1977879268","https://openalex.org/W1977894976","https://openalex.org/W2019137296","https://openalex.org/W2058355036","https://openalex.org/W2069121074","https://openalex.org/W2070985168","https://openalex.org/W2114538202","https://openalex.org/W2116755045","https://openalex.org/W2129764333","https://openalex.org/W4246795566","https://openalex.org/W6608634886","https://openalex.org/W6633183897","https://openalex.org/W6644917440","https://openalex.org/W6667959020"],"related_works":["https://openalex.org/W2564742953","https://openalex.org/W4213299358","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2970577745","https://openalex.org/W2583614279","https://openalex.org/W2109659895","https://openalex.org/W1930615501"],"abstract_inverted_index":{"This":[0],"paper":[1],"attends":[2],"to":[3,76],"a":[4,47,83,105],"generalized":[5],"version":[6],"of":[7,56,86,108,117],"the":[8,21,33,37,54,90,114,118],"classic":[9],"page":[10],"migration":[11,14,22,38,121],"problem":[12,42,87,122],"where":[13],"costs":[15],"are":[16,74],"not":[17],"necessarily":[18],"given":[19],"by":[20],"distance":[23],"only,":[24],"but":[25],"may":[26],"depend":[27],"on":[28,32],"prior":[29],"migrations,":[30],"or":[31],"available":[34],"bandwidth":[35],"along":[36],"path.":[39],"Interestingly,":[40],"this":[41],"cannot":[43],"be":[44],"viewed":[45],"from":[46],"Metrical":[48],"Task":[49],"System":[50],"(MTS)":[51],"perspective,":[52],"despite":[53],"generality":[55],"MTS:":[57],"The":[58],"corresponding":[59],"MTS":[60],"has":[61],"an":[62,68,78],"unbounded":[63,69],"state":[64],"space":[65],"and,":[66],"thus,":[67],"competitive":[70,115],"ratio.":[71],"Nevertheless,":[72],"we":[73,103],"able":[75],"present":[77,104],"optimal":[79],"online":[80],"algorithm":[81],"for":[82,97,113],"wide":[84],"range":[85],"variants,":[88],"improving":[89],"best":[91],"upper":[92],"bounds":[93],"known":[94],"so":[95],"far":[96],"more":[98],"specific":[99],"problems.":[100],"For":[101],"example,":[102],"tight":[106],"bound":[107],"\u0398(log":[109],"n/log":[110],"log":[111],"n)":[112],"ratio":[116],"virtual":[119],"server":[120],"introduced":[123],"recently.":[124]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}