{"id":"https://openalex.org/W2783146841","doi":"https://doi.org/10.1109/tnsm.2018.2794300","title":"Bandwidth Reservation Strategies for Scheduling Maximization in Dedicated Networks","display_name":"Bandwidth Reservation Strategies for Scheduling Maximization in Dedicated Networks","publication_year":2018,"publication_date":"2018-01-15","ids":{"openalex":"https://openalex.org/W2783146841","doi":"https://doi.org/10.1109/tnsm.2018.2794300","mag":"2783146841"},"language":"en","primary_location":{"id":"doi:10.1109/tnsm.2018.2794300","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnsm.2018.2794300","pdf_url":null,"source":{"id":"https://openalex.org/S173527311","display_name":"IEEE Transactions on Network and Service Management","issn_l":"1932-4537","issn":["1932-4537","2373-7379"],"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 Transactions on Network and Service Management","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/A5082903815","display_name":"Liudong Zuo","orcid":"https://orcid.org/0000-0001-9360-1064"},"institutions":[{"id":"https://openalex.org/I290598920","display_name":"California State University, Dominguez Hills","ror":"https://ror.org/04pyvbw03","country_code":"US","type":"education","lineage":["https://openalex.org/I290598920"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Liudong Zuo","raw_affiliation_strings":["Computer Science Department, California State University, Dominguez Hills, Carson, CA, USA"],"raw_orcid":"https://orcid.org/0000-0001-9360-1064","affiliations":[{"raw_affiliation_string":"Computer Science Department, California State University, Dominguez Hills, Carson, CA, USA","institution_ids":["https://openalex.org/I290598920"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006863048","display_name":"Michelle Zhu","orcid":"https://orcid.org/0000-0003-1715-4041"},"institutions":[{"id":"https://openalex.org/I166088655","display_name":"Montclair State University","ror":"https://ror.org/01nxc2t48","country_code":"US","type":"education","lineage":["https://openalex.org/I166088655"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michelle M. Zhu","raw_affiliation_strings":["Department of Computer Science, Montclair State University, Montclair, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Montclair State University, Montclair, NJ, USA","institution_ids":["https://openalex.org/I166088655"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054307870","display_name":"Chase Q. Wu","orcid":"https://orcid.org/0000-0002-8218-1209"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chase Q. Wu","raw_affiliation_strings":["Department of Computer Science, New Jersey Institute of Technology, Newark, NJ, USA"],"raw_orcid":"https://orcid.org/0000-0002-8218-1209","affiliations":[{"raw_affiliation_string":"Department of Computer Science, New Jersey Institute of Technology, Newark, NJ, USA","institution_ids":["https://openalex.org/I118118575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8432,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.91099928,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"15","issue":"2","first_page":"544","last_page":"554"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","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/T10138","display_name":"Network Traffic and Congestion Control","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/T10829","display_name":"Interconnection Networks and Systems","score":0.9994999766349792,"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.9991999864578247,"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.8689490556716919},{"id":"https://openalex.org/keywords/reservation","display_name":"Reservation","score":0.6980496644973755},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6323579549789429},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.5758824348449707},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5235930681228638},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"Bandwidth allocation","score":0.4971182644367218},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.42904597520828247},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4248626232147217},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3687071204185486},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2880149483680725}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8689490556716919},{"id":"https://openalex.org/C2777632111","wikidata":"https://www.wikidata.org/wiki/Q1937518","display_name":"Reservation","level":2,"score":0.6980496644973755},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6323579549789429},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.5758824348449707},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5235930681228638},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.4971182644367218},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.42904597520828247},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4248626232147217},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3687071204185486},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2880149483680725},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tnsm.2018.2794300","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnsm.2018.2794300","pdf_url":null,"source":{"id":"https://openalex.org/S173527311","display_name":"IEEE Transactions on Network and Service Management","issn_l":"1932-4537","issn":["1932-4537","2373-7379"],"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 Transactions on Network and Service Management","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.5699999928474426}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1573006368","https://openalex.org/W1723291864","https://openalex.org/W1731982387","https://openalex.org/W1753531140","https://openalex.org/W1765857080","https://openalex.org/W1971489996","https://openalex.org/W1980524747","https://openalex.org/W2002018671","https://openalex.org/W2005571178","https://openalex.org/W2008901000","https://openalex.org/W2026803050","https://openalex.org/W2078691346","https://openalex.org/W2089304955","https://openalex.org/W2104621693","https://openalex.org/W2118803908","https://openalex.org/W2139354007","https://openalex.org/W2155979530","https://openalex.org/W2188020495","https://openalex.org/W2549798722","https://openalex.org/W2682134399","https://openalex.org/W3145128584","https://openalex.org/W4231448636","https://openalex.org/W4246219036","https://openalex.org/W4285719527","https://openalex.org/W4301187028","https://openalex.org/W6637586778","https://openalex.org/W6740432994"],"related_works":["https://openalex.org/W2379215383","https://openalex.org/W2271928667","https://openalex.org/W1994860013","https://openalex.org/W246884077","https://openalex.org/W3210156514","https://openalex.org/W2387553833","https://openalex.org/W2131387076","https://openalex.org/W2055754719","https://openalex.org/W2050221934","https://openalex.org/W2061645957"],"abstract_inverted_index":{"Bandwidth":[0],"reservation":[1,38],"has":[2],"been":[3],"increasingly":[4],"used":[5,102],"in":[6,22,40,47,103],"high-performance":[7],"networks":[8,106],"to":[9,25,44,63,73,85],"provide":[10],"quality":[11],"of":[12,61,71],"service":[13],"for":[14],"various":[15],"applications":[16],"ranging":[17],"from":[18],"real-time":[19],"multimedia":[20],"communication":[21],"early":[23],"years":[24],"big":[26],"data":[27,62],"transfer":[28],"more":[29],"recently.":[30],"In":[31],"this":[32],"paper,":[33],"we":[34],"consider":[35],"multiple":[36],"bandwidth":[37],"requests":[39,72],"a":[41,48,98],"batch":[42],"awaiting":[43],"be":[45,64,74],"scheduled":[46],"dedicated":[49],"network,":[50],"and":[51,66,82,93],"formulate":[52],"two":[53,90],"scheduling":[54,99,124],"maximization":[55],"problems:":[56],"1)":[57],"maximize":[58,68],"the":[59,69,116,127],"amount":[60],"transferred":[65],"2)":[67],"number":[70],"scheduled.":[75],"We":[76,87],"prove":[77],"both":[78],"problems":[79],"are":[80],"NP-complete":[81],"very":[83],"difficult":[84],"approximate.":[86],"then":[88],"design":[89],"heuristic":[91,118],"algorithms":[92,119],"evaluate":[94],"their":[95],"performance":[96,125],"against":[97],"algorithm":[100],"widely":[101],"real":[104],"production":[105],"through":[107],"extensive":[108],"simulation-based":[109],"experiments.":[110],"The":[111],"experimental":[112],"results":[113],"show":[114],"that":[115],"proposed":[117],"achieve":[120],"significantly":[121],"better":[122],"overall":[123],"than":[126],"existing":[128],"algorithm.":[129]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}