{"id":"https://openalex.org/W1995469408","doi":"https://doi.org/10.1109/infcom.2011.5935150","title":"Scheduling for end-to-end deadline-constrained traffic with reliability requirements in multi-hop networks","display_name":"Scheduling for end-to-end deadline-constrained traffic with reliability requirements in multi-hop networks","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W1995469408","doi":"https://doi.org/10.1109/infcom.2011.5935150","mag":"1995469408"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2011.5935150","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2011.5935150","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Proceedings IEEE INFOCOM","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/A5083709921","display_name":"Ruogu Li","orcid":"https://orcid.org/0000-0002-4456-919X"},"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":"Ruogu Li","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Ohio State Uinversity, Columbus, OH, USA","Department of Electrical and Computer Engineering at The Ohio State University, Columbus, 43210, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Ohio State Uinversity, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering at The Ohio State University, Columbus, 43210, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076974020","display_name":"Atilla Ery\u0131lmaz","orcid":"https://orcid.org/0000-0001-5560-5806"},"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":"Atilla Eryilmaz","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Ohio State Uinversity, Columbus, OH, USA","Department of Electrical and Computer Engineering at The Ohio State University, Columbus, 43210, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Ohio State Uinversity, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering at The Ohio State University, Columbus, 43210, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":null,"first_page":"3065","last_page":"3073"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9998999834060669,"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.9998999834060669,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9993000030517578,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9979000091552734,"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.8182123899459839},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.6203956604003906},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6168947815895081},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.603308916091919},{"id":"https://openalex.org/keywords/end-to-end-principle","display_name":"End-to-end principle","score":0.542452871799469},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49698594212532043},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.4906059801578522},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4753651022911072},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4247593879699707},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3518080711364746}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8182123899459839},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.6203956604003906},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6168947815895081},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.603308916091919},{"id":"https://openalex.org/C74296488","wikidata":"https://www.wikidata.org/wiki/Q2527392","display_name":"End-to-end principle","level":2,"score":0.542452871799469},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49698594212532043},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.4906059801578522},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4753651022911072},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4247593879699707},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3518080711364746},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcom.2011.5935150","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2011.5935150","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.722.7304","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.722.7304","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/%7Eeryilmaz/papers/DeadlineConstrainedMultiHop.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6399999856948853,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1572996156","https://openalex.org/W1977953306","https://openalex.org/W1984181498","https://openalex.org/W1985441584","https://openalex.org/W2004279685","https://openalex.org/W2055148782","https://openalex.org/W2083715455","https://openalex.org/W2088792715","https://openalex.org/W2098254860","https://openalex.org/W2100609801","https://openalex.org/W2104259309","https://openalex.org/W2105177639","https://openalex.org/W2111781120","https://openalex.org/W2117363591","https://openalex.org/W2120344179","https://openalex.org/W2123893388","https://openalex.org/W2153945693","https://openalex.org/W2154968665","https://openalex.org/W2159494247","https://openalex.org/W2160721090","https://openalex.org/W2161337811","https://openalex.org/W2163634514","https://openalex.org/W2165768656","https://openalex.org/W2166280723","https://openalex.org/W2167264214","https://openalex.org/W2170880416","https://openalex.org/W2171028981","https://openalex.org/W2296319761","https://openalex.org/W4250589301","https://openalex.org/W4296180618","https://openalex.org/W6678533281","https://openalex.org/W6683112175","https://openalex.org/W6685133211"],"related_works":["https://openalex.org/W17155033","https://openalex.org/W3207760230","https://openalex.org/W1496222301","https://openalex.org/W4312814274","https://openalex.org/W1590307681","https://openalex.org/W2536018345","https://openalex.org/W4285370786","https://openalex.org/W2296488620","https://openalex.org/W2358353312","https://openalex.org/W2046926799"],"abstract_inverted_index":{"We":[0,145],"attack":[1],"the":[2,25,38,42,46,51,60,65,111,122,152,181],"challenging":[3],"problem":[4,72],"of":[5,41,113,154,156,184,187,198,201],"designing":[6],"a":[7,18,30,34,70,79,92,133,141],"scheduling":[8],"policy":[9],"for":[10,29,73,85],"end-to-end":[11,26],"deadline-constrained":[12],"traffic":[13,90],"with":[14],"reliability":[15],"requirements":[16],"in":[17,91,98,115],"multi-hop":[19,31,93],"network.":[20],"It":[21],"is":[22],"well-known":[23],"that":[24,56,67,106,170,180],"delay":[27],"performance":[28,153,175,193],"flow":[32],"has":[33],"complex":[35],"dependence":[36],"on":[37,69,121,132,140],"high-order":[39],"statistics":[40],"arrival":[43],"process":[44],"and":[45,137,163],"algorithm":[47],"itself.":[48],"Thus,":[49],"neither":[50],"earlier":[52],"optimization":[53],"based":[54,131,139,168],"approaches":[55],"aim":[57],"to":[58,101,109,150,159,164,196],"meet":[59],"long-term":[61],"throughput":[62],"demands,":[63],"nor":[64],"solutions":[66,158,190,203],"focus":[68],"similar":[71],"single-hop":[74],"flows":[75],"directly":[76],"apply.":[77],"Moreover,":[78],"dynamic":[80,182],"programming-based":[81],"approach":[82],"becomes":[83],"intractable":[84],"such":[86],"multi-time":[87],"scale":[88],"Quality-of-Service(QoS)-constrained":[89],"environment.":[94],"This":[95],"motivates":[96],"us":[97,108],"this":[99],"work":[100],"develop":[102],"an":[103],"alternative":[104,128],"model":[105],"enables":[107],"exploit":[110],"degree":[112],"freedom":[114],"choosing":[116],"appropriate":[117],"service":[118,185],"discipline.":[119],"Based":[120],"new":[123],"model,":[124],"we":[125],"propose":[126],"two":[127],"solutions,":[129],"first":[130],"Lyapunov-drift":[134],"minimization":[135],"approach,":[136],"second":[138],"novel":[142],"relaxed":[143],"optimization-formulation.":[144],"provide":[146],"extensive":[147],"numerical":[148],"results":[149,178],"compare":[151],"both":[155,197],"these":[157,199],"throughput-optimal":[160],"back-pressure-type":[161],"schedulers":[162,169],"longest":[165],"waiting":[166],"time":[167],"have":[171],"provably":[172],"optimal":[173],"asymptotic":[174],"characteristics.":[176],"Our":[177],"reveal":[179],"choice":[183],"discipline":[186],"our":[188],"proposed":[189],"yields":[191],"substantial":[192],"improvements":[194],"compared":[195],"types":[200],"traditional":[202],"under":[204],"non-asymptotic":[205],"conditions.":[206]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}