{"id":"https://openalex.org/W2556475613","doi":"https://doi.org/10.1109/spcom.2016.7746696","title":"A new competitive ratio for network applications with hard performance guarantees","display_name":"A new competitive ratio for network applications with hard performance guarantees","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2556475613","doi":"https://doi.org/10.1109/spcom.2016.7746696","mag":"2556475613"},"language":"en","primary_location":{"id":"doi:10.1109/spcom.2016.7746696","is_oa":false,"landing_page_url":"https://doi.org/10.1109/spcom.2016.7746696","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Signal Processing and Communications (SPCOM)","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/A5000641105","display_name":"Han Deng","orcid":"https://orcid.org/0000-0001-9363-1722"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Han Deng","raw_affiliation_strings":["Department of ECE, Texas A&M University, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of ECE, Texas A&M University, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060672325","display_name":"I-Hong Hou","orcid":"https://orcid.org/0000-0002-1166-8773"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"I-Hong Hou","raw_affiliation_strings":["Department of ECE, Texas A&M University, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of ECE, Texas A&M University, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"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/T13553","display_name":"Age of Information Optimization","score":0.9976999759674072,"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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.9941999912261963,"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.8346923589706421},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.7614762783050537},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7538588047027588},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6208981871604919},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5770573616027832},{"id":"https://openalex.org/keywords/cloud-computing","display_name":"Cloud computing","score":0.547252357006073},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5030538439750671},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14055395126342773},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.13986462354660034},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.13918131589889526}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8346923589706421},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.7614762783050537},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7538588047027588},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6208981871604919},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5770573616027832},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.547252357006073},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5030538439750671},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14055395126342773},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.13986462354660034},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13918131589889526},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/spcom.2016.7746696","is_oa":false,"landing_page_url":"https://doi.org/10.1109/spcom.2016.7746696","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Signal Processing and Communications (SPCOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.6200000047683716}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1496647032","https://openalex.org/W1508575759","https://openalex.org/W1976495016","https://openalex.org/W1987621072","https://openalex.org/W2494559298"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W1970915793"],"abstract_inverted_index":{"Network":[0],"applications":[1],"in":[2,28,75,81],"highly":[3],"mobile":[4,83],"systems":[5],"need":[6,115],"to":[7,23,38,41,60,124],"employ":[8],"online":[9,72,79,87],"algorithms":[10,88,97,103],"that":[11,53,95,112],"do":[12],"not":[13],"rely":[14],"on":[15],"precise":[16],"predictions":[17],"about":[18],"future":[19,33],"events.":[20],"In":[21,44],"order":[22],"meet":[24],"hard":[25],"performance":[26,64,130],"guarantees":[27],"the":[29,42,55,126],"presence":[30],"of":[31,57,91,129],"unknown":[32],"events,":[34],"common":[35],"practice":[36],"is":[37],"add":[39],"redundancy":[40,58,118],"systems.":[43],"this":[45],"paper,":[46],"we":[47,109],"define":[48],"a":[49],"new":[50],"competitive":[51],"ratio":[52],"reflects":[54],"amount":[56],"needed":[59],"ensure":[61],"some":[62],"given":[63],"guarantees.":[65,131],"We":[66,93],"study":[67],"two":[68],"special":[69],"applications,":[70],"namely,":[71],"job":[73],"allocations":[74],"cloud":[76],"computing":[77],"and":[78,85],"scheduling":[80],"delayed":[82],"offloading,":[84],"propose":[86],"for":[89],"each":[90],"them.":[92],"prove":[94],"our":[96,102,113],"are":[98],"optimal.":[99],"By":[100],"comparing":[101],"with":[104],"commonly":[105,121],"used":[106,122],"other":[107],"policies,":[108],"also":[110],"show":[111],"policies":[114,123],"much":[116],"less":[117],"than":[119],"those":[120],"provide":[125],"same":[127],"degree":[128]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}