{"id":"https://openalex.org/W2083907623","doi":"https://doi.org/10.1109/glocomw.2013.6825183","title":"Fast bandwidth allocation policies for persistent data ferrying","display_name":"Fast bandwidth allocation policies for persistent data ferrying","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2083907623","doi":"https://doi.org/10.1109/glocomw.2013.6825183","mag":"2083907623"},"language":"en","primary_location":{"id":"doi:10.1109/glocomw.2013.6825183","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocomw.2013.6825183","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Globecom Workshops (GC 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/A5005510460","display_name":"Anthony J. Carfang","orcid":null},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anthony J. Carfang","raw_affiliation_strings":["Research and Engineering Center for Unmanned Vehicles, University of Colorado, Boulder, USA","Research and Engineering Center for Unmanned Vehicles, University of Colorado Boulder, 80309, USA"],"affiliations":[{"raw_affiliation_string":"Research and Engineering Center for Unmanned Vehicles, University of Colorado, Boulder, USA","institution_ids":["https://openalex.org/I188538660"]},{"raw_affiliation_string":"Research and Engineering Center for Unmanned Vehicles, University of Colorado Boulder, 80309, USA","institution_ids":["https://openalex.org/I188538660"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021878663","display_name":"Eric W. Frew","orcid":"https://orcid.org/0000-0003-3686-089X"},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eric W. Frew","raw_affiliation_strings":["Aerospace Engineering, University of Colorado, Boulder, USA","Aerospace Engineering at the University of Colorado Boulder, 80309, USA"],"affiliations":[{"raw_affiliation_string":"Aerospace Engineering, University of Colorado, Boulder, USA","institution_ids":["https://openalex.org/I188538660"]},{"raw_affiliation_string":"Aerospace Engineering at the University of Colorado Boulder, 80309, USA","institution_ids":["https://openalex.org/I188538660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005510460"],"corresponding_institution_ids":["https://openalex.org/I188538660"],"apc_list":null,"apc_paid":null,"fwci":1.1822,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81824032,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1355","last_page":"1360"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.9965999722480774,"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/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.9965999722480774,"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.9954000115394592,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/knapsack-problem","display_name":"Knapsack problem","score":0.9167169332504272},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7447596788406372},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"Bandwidth allocation","score":0.7316319346427917},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.6741160750389099},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.6353671550750732},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.628661036491394},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5550883412361145},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5088448524475098},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4833073616027832},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4665743112564087},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.44248852133750916},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.41665709018707275},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3609015941619873},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20229756832122803},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16387856006622314},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14734774827957153}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9167169332504272},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7447596788406372},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.7316319346427917},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.6741160750389099},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.6353671550750732},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.628661036491394},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5550883412361145},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5088448524475098},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4833073616027832},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4665743112564087},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.44248852133750916},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.41665709018707275},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3609015941619873},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20229756832122803},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16387856006622314},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14734774827957153}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocomw.2013.6825183","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocomw.2013.6825183","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Globecom Workshops (GC Wkshps)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W291003596","https://openalex.org/W1832849348","https://openalex.org/W1964398944","https://openalex.org/W1964833750","https://openalex.org/W1967853313","https://openalex.org/W1968063578","https://openalex.org/W1981406081","https://openalex.org/W1999251738","https://openalex.org/W2000036636","https://openalex.org/W2033137461","https://openalex.org/W2033208731","https://openalex.org/W2043116524","https://openalex.org/W2109556560","https://openalex.org/W2121338560","https://openalex.org/W2126135931","https://openalex.org/W2159898272","https://openalex.org/W2320498762","https://openalex.org/W2327327018","https://openalex.org/W4236127247"],"related_works":["https://openalex.org/W2393014972","https://openalex.org/W2357796514","https://openalex.org/W2357595179","https://openalex.org/W2169800510","https://openalex.org/W2351136238","https://openalex.org/W3171554204","https://openalex.org/W3199776955","https://openalex.org/W3112089036","https://openalex.org/W2167807475","https://openalex.org/W2022992791"],"abstract_inverted_index":{"The":[0,91,120],"persistent":[1],"data":[2,134],"ferrying":[3],"problem":[4,38,52],"has":[5],"a":[6,23,41,56,68],"naturally":[7],"cascaded":[8],"structure":[9],"between":[10],"vehicle":[11],"and":[12,43,86],"communication":[13,47],"dynamics,":[14],"allowing":[15],"the":[16,34,46,49,74,89,101,109,117,126,132],"bandwidth":[17,36,50,78],"optimization":[18,26],"to":[19,67,130],"be":[20],"encapsulated":[21],"within":[22,106],"path":[24,42],"planning":[25],"problem.":[27,70,136],"This":[28],"work":[29],"analyzes":[30],"policies":[31,80],"that":[32,63,100],"solve":[33,131],"inner":[35],"allocation":[37,51,79,111],"quickly.":[39],"Given":[40],"properties":[44],"about":[45],"environment,":[48],"is":[53],"formulated":[54],"as":[55],"binary":[57],"integer":[58],"linear":[59],"program.":[60],"We":[61,71],"show":[62],"it":[64],"becomes":[65],"equivalent":[66],"knapsack":[69,103],"theoretically":[72],"analyze":[73],"performance":[75,92],"of":[76,83,88,108,116,122],"several":[77],"in":[81,112],"terms":[82],"computation":[84,118],"effort":[85],"throughput":[87],"solution.":[90],"characteristics":[93],"are":[94],"then":[95],"validated":[96],"through":[97],"simulation,":[98],"showing":[99],"greedy":[102],"solution":[104],"achieves":[105],"99%":[107],"optimal":[110],"less":[113],"than":[114],"2%":[115],"time.":[119],"quickness":[121],"this":[123],"policy":[124],"reduces":[125],"computational":[127],"complexity":[128],"needed":[129],"full":[133],"ferry":[135]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}