{"id":"https://openalex.org/W1976495016","doi":"https://doi.org/10.1109/tnet.2014.2363136","title":"Optimal Online Scheduling With Arbitrary Hard Deadlines in Multihop Communication Networks","display_name":"Optimal Online Scheduling With Arbitrary Hard Deadlines in Multihop Communication Networks","publication_year":2014,"publication_date":"2014-11-05","ids":{"openalex":"https://openalex.org/W1976495016","doi":"https://doi.org/10.1109/tnet.2014.2363136","mag":"1976495016"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2014.2363136","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2014.2363136","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-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/A5090056299","display_name":"Zhoujia Mao","orcid":null},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zhoujia Mao","raw_affiliation_strings":["Electrical and Computer Engineering, The Ohio State University, Columbus, Ohio, United States","Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH and Oracle Corporation, Santa Clara, CA#TAB#"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, The Ohio State University, Columbus, Ohio, United States","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH and Oracle Corporation, Santa Clara, CA#TAB#","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030047891","display_name":"C. Emre Koksal","orcid":"https://orcid.org/0000-0001-8463-4446"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Can Emre Koksal","raw_affiliation_strings":["Electrical and Computer Engineering, The Ohio State University, Columbus, Ohio, United States","[Dept. of Electrical and Computer, Engineering, The Ohio State University, Columbus, OH]"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, The Ohio State University, Columbus, Ohio, United States","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"[Dept. of Electrical and Computer, Engineering, The Ohio State University, Columbus, OH]","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035752536","display_name":"Ness B. Shroff","orcid":"https://orcid.org/0000-0002-4606-6879"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ness B. Shroff","raw_affiliation_strings":["ECE and CSE, The Ohio State University, Columbus, Ohio, United States","Departments of Electrical and Computer Engineering, and Computer Science and Engineering, The Ohio State University, Columbus, OH"],"affiliations":[{"raw_affiliation_string":"ECE and CSE, The Ohio State University, Columbus, Ohio, United States","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"Departments of Electrical and Computer Engineering, and Computer Science and Engineering, The Ohio State University, Columbus, OH","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090056299"],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":4.7046,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.9503522,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"24","issue":"1","first_page":"177","last_page":"189"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","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/T12288","display_name":"Optimization and Search Problems","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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.998199999332428,"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.9976000189781189,"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/computer-science","display_name":"Computer science","score":0.8173154592514038},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.7383580207824707},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6637057662010193},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6211767196655273},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5241658687591553},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4889622926712036},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.4614390730857849},{"id":"https://openalex.org/keywords/telecommunications-link","display_name":"Telecommunications link","score":0.45140185952186584},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39969196915626526},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3865257501602173},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.20694100856781006},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.18073150515556335},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13538503646850586}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8173154592514038},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.7383580207824707},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6637057662010193},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6211767196655273},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5241658687591553},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4889622926712036},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4614390730857849},{"id":"https://openalex.org/C138660444","wikidata":"https://www.wikidata.org/wiki/Q5607897","display_name":"Telecommunications link","level":2,"score":0.45140185952186584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39969196915626526},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3865257501602173},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20694100856781006},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.18073150515556335},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13538503646850586},{"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/tnet.2014.2363136","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2014.2363136","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5400000214576721,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G8727939366","display_name":null,"funder_award_id":"CNS-1012700","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W194244820","https://openalex.org/W1278573221","https://openalex.org/W1504289907","https://openalex.org/W1539914310","https://openalex.org/W1565113225","https://openalex.org/W1583737895","https://openalex.org/W1879402272","https://openalex.org/W1976495016","https://openalex.org/W2023171863","https://openalex.org/W2042122291","https://openalex.org/W2086627596","https://openalex.org/W2091399149","https://openalex.org/W2109488193","https://openalex.org/W2116967158","https://openalex.org/W2121084552","https://openalex.org/W2138964463","https://openalex.org/W2139739478","https://openalex.org/W2149260276","https://openalex.org/W2179080494","https://openalex.org/W2262960161","https://openalex.org/W3163474831","https://openalex.org/W6607920450","https://openalex.org/W6628197185","https://openalex.org/W6685348266"],"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/W2007005516","https://openalex.org/W2129881384"],"abstract_inverted_index":{"The":[0],"problem":[1,95],"of":[2,96,110,204,261],"online":[3,54,166,234],"packet":[4,33,101],"scheduling":[5,34,55,102],"with":[6,76,159,269],"hard":[7,281],"deadlines":[8,78],"has":[9],"been":[10],"studied":[11],"extensively":[12],"in":[13,22,58,73,103,126],"the":[14,23,30,59,94,107,111,127,133,140,144,156,189,202,231,253,259,266],"single-hop":[15],"setting,":[16],"whereas":[17],"it":[18,171],"is":[19,172,188,210,230,250,265],"notoriously":[20],"difficult":[21],"multihop":[24,60,65],"setting.":[25,61],"This":[26],"difficulty":[27],"stems":[28],"from":[29],"fact":[31],"that":[32,113,132,170,219,244,249],"decisions":[35,44],"at":[36,82],"each":[37,205],"hop":[38],"influence":[39],"and":[40,48,69,79,83,100,130,168,207],"are":[41,84],"influenced":[42],"by":[43],"on":[45,123,273],"other":[46],"hops,":[47],"only":[49,198],"a":[50,64,164,270,274],"few":[51],"provably":[52],"efficient":[53],"algorithms":[56],"exist":[57],"We":[62,92,120,153],"consider":[63],"wired":[66],"network":[67,286],"(interference-free":[68],"full":[70],"duplex":[71],"transmissions)":[72],"which":[74],"packets":[75,112],"various":[77],"weights":[80,109],"arrive":[81],"destined":[85],"to":[86,105,252,280],"different":[87],"nodes":[88],"through":[89],"given":[90],"routes.":[91],"study":[93],"joint":[97],"admission":[98],"control":[99],"order":[104],"maximize":[106],"cumulative":[108],"reach":[114],"their":[115,118],"destinations":[116],"within":[117],"deadlines.":[119],"first":[121,267],"focus":[122],"uplink":[124],"transmissions":[125],"tree":[128],"topology":[129,158],"show":[131,169,218,243],"well-known":[134],"Earliest":[135],"Deadline":[136],"First":[137],"algorithm":[138,147,197,235,246,268],"achieves":[139,247],"same":[141],"performance":[142,248],"as":[143],"optimal":[145,255],"offline":[146,256],"for":[148,212,284],"any":[149,233],"feasible":[150],"arrival":[151,214],"pattern.":[152],"then":[154],"address":[155],"general":[157,213,285],"multiple":[160],"source-destination":[161],"pairs,":[162],"develop":[163],"simple":[165],"algorithm,":[167],"O(P":[173,220],"<sub":[174,179,185,221,226],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[175,180,186,222,227],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">M</sub>":[176,181,187,223,228],"log":[177,224],"P":[178,184,225],")-competitive,":[182],"where":[183],"maximum":[190],"route":[191,203],"length":[192],"among":[193],"all":[194],"packets.":[195],"Our":[196],"requires":[199],"information":[200],"along":[201],"packet,":[206],"our":[208,245,262],"result":[209],"valid":[211],"samples.":[215],"Moreover,":[216],"we":[217,241],")-competitive":[229],"best":[232,260],"can":[236],"do.":[237],"Via":[238],"numerical":[239],"results,":[240],"also":[242],"comparable":[251],"noncausal":[254],"algorithm.":[257],"To":[258],"knowledge,":[263],"this":[264],"provable":[271],"(based":[272],"sample-path":[275],"construction)":[276],"competitive":[277],"ratio,":[278],"subject":[279],"deadline":[282],"constraints":[283],"topologies.":[287]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}