{"id":"https://openalex.org/W1983113805","doi":"https://doi.org/10.1109/infcom.2013.6567052","title":"Online packet scheduling with hard deadlines in multihop communication networks","display_name":"Online packet scheduling with hard deadlines in multihop communication networks","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W1983113805","doi":"https://doi.org/10.1109/infcom.2013.6567052","mag":"1983113805"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2013.6567052","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2013.6567052","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/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":["Ohio State University"],"affiliations":[{"raw_affiliation_string":"Ohio State University","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":"C. Emre Koksal","raw_affiliation_strings":["Ohio State University"],"affiliations":[{"raw_affiliation_string":"Ohio State University","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":["Ohio State University"],"affiliations":[{"raw_affiliation_string":"Ohio State University","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":2.1621,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.8813509,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"24","issue":null,"first_page":"2463","last_page":"2471"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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/T10772","display_name":"Distributed systems and fault tolerance","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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.831792950630188},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.6920925378799438},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6343984603881836},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6201589107513428},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5683032870292664},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5678418278694153},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5485178232192993},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.45337292551994324},{"id":"https://openalex.org/keywords/packet-forwarding","display_name":"Packet forwarding","score":0.4473084509372711},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.44561928510665894},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31565749645233154},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.25972387194633484},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.22934284806251526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11644935607910156}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.831792950630188},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6920925378799438},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6343984603881836},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6201589107513428},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5683032870292664},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5678418278694153},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5485178232192993},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.45337292551994324},{"id":"https://openalex.org/C120317029","wikidata":"https://www.wikidata.org/wiki/Q874048","display_name":"Packet forwarding","level":3,"score":0.4473084509372711},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.44561928510665894},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31565749645233154},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25972387194633484},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.22934284806251526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11644935607910156},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcom.2013.6567052","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2013.6567052","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.723.4118","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.723.4118","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.ece.ohio-state.edu/%7Ekoksal/papers/mao_kok_shr_infocom13.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6299999952316284,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"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/W1700014370","https://openalex.org/W1879402272","https://openalex.org/W2023171863","https://openalex.org/W2042122291","https://openalex.org/W2055148782","https://openalex.org/W2056459334","https://openalex.org/W2072906481","https://openalex.org/W2086627596","https://openalex.org/W2091399149","https://openalex.org/W2109488193","https://openalex.org/W2109672207","https://openalex.org/W2116967158","https://openalex.org/W2121084552","https://openalex.org/W2122599730","https://openalex.org/W2130929918","https://openalex.org/W2138964463","https://openalex.org/W2139739478","https://openalex.org/W2149260276","https://openalex.org/W2154881985","https://openalex.org/W2155652863","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/W2109659895","https://openalex.org/W1930615501"],"abstract_inverted_index":{"The":[0],"problem":[1,94],"of":[2,95,109,194,228],"online":[3,57,166],"job":[4],"or":[5],"packet":[6,36,100,196],"scheduling":[7,37,58,101],"with":[8,75,159,236],"hard":[9,248],"deadlines":[10,77],"has":[11],"been":[12],"studied":[13],"extensively":[14],"in":[15,25,61,72,102,125],"the":[16,26,33,62,93,106,110,126,132,140,144,156,179,192,220,226,233],"single":[17],"hop":[18,41],"setting,":[19],"whereas":[20],"it":[21,171],"is":[22,172,178,200,217,232],"notoriously":[23],"difficult":[24],"multihop":[27,63,69],"setting.":[28,64],"This":[29],"difficulty":[30],"stems":[31],"from":[32],"fact":[34],"that":[35,112,131,170,211,216],"decisions":[38,47],"at":[39,81],"each":[40,195],"influences":[42],"and":[43,51,78,82,99,129,168,197],"are":[44,83],"influenced":[45],"by":[46],"on":[48,122,240],"other":[49],"hops":[50],"only":[52,188],"a":[53,67,164,237,241],"few":[54],"provably":[55],"efficient":[56],"algorithms":[59],"exist":[60],"We":[65,91,119,153],"consider":[66],"general":[68,157,203,252],"network":[70,253],"topology":[71,128,158],"which":[73],"packets":[74,111],"various":[76],"weights":[79,108],"arrive":[80],"destined":[84],"to":[85,104,219,247],"different":[86],"nodes":[87],"through":[88],"given":[89],"routes.":[90],"study":[92],"joint":[96],"admission":[97],"control":[98],"order":[103],"maximize":[105],"cumulative":[107],"reach":[113],"their":[114,117],"destinations":[115],"within":[116],"deadlines.":[118],"first":[120,137,234],"focus":[121],"uplink":[123],"transmissions":[124],"tree":[127],"show":[130,169,210],"well":[133],"known":[134],"earliest":[135],"deadline":[136,249],"algorithm":[138,147,167,187,213,235],"achieves":[139,214],"same":[141],"performance":[142,215],"as":[143],"optimal":[145,222],"off-line":[146,223],"for":[148,202,251],"any":[149],"feasible":[150],"arrival":[151,204],"pattern.":[152],"then":[154],"address":[155],"multiple":[160],"source-destination":[161],"pairs,":[162],"develop":[163],"simple":[165],"O(PM":[173],"log":[174],"PM)-competitive":[175],"where":[176],"PM":[177],"maximum":[180],"route":[181,193],"length":[182],"among":[183],"all":[184],"packets.":[185],"Our":[186],"requires":[189],"information":[190],"along":[191],"our":[198,212,229],"result":[199],"valid":[201],"samples.":[205],"Via":[206],"numerical":[207],"results,":[208],"we":[209],"comparable":[218],"non-causal":[221],"algorithm.":[224],"To":[225],"best":[227],"knowledge,":[230],"this":[231],"provable":[238],"(based":[239],"sample-path":[242],"construction)":[243],"competitive":[244],"ratio,":[245],"subject":[246],"constraints":[250],"topologies.":[254]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}