{"id":"https://openalex.org/W2078442928","doi":"https://doi.org/10.1109/infcomw.2014.6849241","title":"Bounded delay scheduling with packet dependencies","display_name":"Bounded delay scheduling with packet dependencies","publication_year":2014,"publication_date":"2014-04-01","ids":{"openalex":"https://openalex.org/W2078442928","doi":"https://doi.org/10.1109/infcomw.2014.6849241","mag":"2078442928"},"language":"en","primary_location":{"id":"doi:10.1109/infcomw.2014.6849241","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcomw.2014.6849241","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","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/A5042514888","display_name":"Michael Markovitch","orcid":null},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michael Markovitch","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beer-Sheva, Southern, IL","Department of Communication Systems Engineering Ben-Gurion University of the Negev, Beer-Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beer-Sheva, Southern, IL","institution_ids":[]},{"raw_affiliation_string":"Department of Communication Systems Engineering Ben-Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035893556","display_name":"Gabriel Scalosub","orcid":"https://orcid.org/0000-0003-4142-0549"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Gabriel Scalosub","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beer-Sheva, Southern, IL","Department of Communication Systems Engineering Ben-Gurion University of the Negev, Beer-Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beer-Sheva, Southern, IL","institution_ids":[]},{"raw_affiliation_string":"Department of Communication Systems Engineering Ben-Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5192,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.90632542,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"257","last_page":"262"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9991000294685364,"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.9990000128746033,"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/goodput","display_name":"Goodput","score":0.963794469833374},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8256803154945374},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.7999234199523926},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.641984760761261},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6010825634002686},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5999860167503357},{"id":"https://openalex.org/keywords/frame","display_name":"Frame (networking)","score":0.5876306891441345},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5533716678619385},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.42790278792381287},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28057944774627686},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.21172848343849182},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19748809933662415},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.15483784675598145},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.103732168674469}],"concepts":[{"id":"https://openalex.org/C94022561","wikidata":"https://www.wikidata.org/wiki/Q1172393","display_name":"Goodput","level":4,"score":0.963794469833374},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8256803154945374},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.7999234199523926},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.641984760761261},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6010825634002686},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5999860167503357},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.5876306891441345},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5533716678619385},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.42790278792381287},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28057944774627686},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.21172848343849182},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19748809933662415},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.15483784675598145},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.103732168674469},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"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/infcomw.2014.6849241","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcomw.2014.6849241","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1540047495","https://openalex.org/W1552828154","https://openalex.org/W1964235381","https://openalex.org/W1982865788","https://openalex.org/W2000013497","https://openalex.org/W2060752575","https://openalex.org/W2075737586","https://openalex.org/W2095073910","https://openalex.org/W2113656557","https://openalex.org/W2117151435","https://openalex.org/W2131222530","https://openalex.org/W2132569943","https://openalex.org/W2150364988","https://openalex.org/W2153070105","https://openalex.org/W2165659786","https://openalex.org/W2953001314","https://openalex.org/W3151741126","https://openalex.org/W4255654664","https://openalex.org/W6671051459"],"related_works":["https://openalex.org/W2153070105","https://openalex.org/W3122648061","https://openalex.org/W2465058241","https://openalex.org/W4300171866","https://openalex.org/W2078442928","https://openalex.org/W2953001314","https://openalex.org/W1540747310","https://openalex.org/W1587547257","https://openalex.org/W4300767678","https://openalex.org/W2099834050"],"abstract_inverted_index":{"A":[0],"common":[1,81],"situation":[2],"occurring":[3],"when":[4],"dealing":[5],"with":[6,61,130],"multimedia":[7,30,84],"traffic":[8,46,60,129],"is":[9,47,104],"having":[10,20,51],"large":[11],"data":[12],"frames":[13,113],"fragmented":[14],"into":[15],"smaller":[16],"IP":[17],"packets,":[18],"and":[19,86,133,177],"these":[21],"packets":[22,35],"sent":[23],"independently":[24],"through":[25],"the":[26,41,56,95,106,110,122,146,165],"network.":[27],"For":[28],"real-time":[29,83],"traffic,":[31],"dropping":[32],"even":[33],"few":[34],"of":[36,58,99,112,124,127,167],"a":[37,68,142,159,168],"frame":[38,43],"may":[39],"render":[40],"entire":[42],"useless.":[44],"Such":[45,78],"usually":[48],"modeled":[49],"as":[50,148,150],"inter-packet":[52,131],"dependencies.":[53],"We":[54,116,140,162],"study":[55,117,170],"problem":[57,123],"scheduling":[59],"such":[62,102],"dependencies,":[63,132],"where":[64],"each":[65],"packet":[66],"has":[67],"deadline":[69],"by":[70,94],"which":[71,171],"it":[72],"should":[73],"arrive":[74],"at":[75],"its":[76],"destination.":[77],"deadlines":[79],"are":[80,87,155,185],"for":[82,121,145],"applications,":[85],"derived":[88],"from":[89,182],"stringent":[90],"delay":[91],"constraints":[92],"posed":[93],"application.":[96],"The":[97],"figure":[98],"merit":[100],"in":[101,188],"environments":[103],"maximizing":[105,125],"system's":[107],"goodput,":[108],"namely,":[109],"number":[111],"successfully":[114],"delivered.":[115],"deterministic":[118],"online":[119],"algorithms":[120],"goodput":[126],"delay-bounded":[128],"use":[134],"competitive":[135,143],"analysis":[136,184],"to":[137,158],"evaluate":[138],"performance.":[139],"present":[141,164],"algorithm":[144],"problem,":[147],"well":[149],"matching":[151],"lower":[152],"bounds":[153],"that":[154,179],"tight":[156],"up":[157],"constant":[160],"factor.":[161],"further":[163,172],"results":[166],"simulation":[169],"validates":[173],"our":[174,183],"algorithmic":[175],"approach":[176],"shows":[178],"insights":[180],"arising":[181],"indeed":[186],"manifested":[187],"practice.":[189]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}