{"id":"https://openalex.org/W2124035620","doi":"https://doi.org/10.1002/net.3230220606","title":"Scheduling file transfers in fully connected networks","display_name":"Scheduling file transfers in fully connected networks","publication_year":1992,"publication_date":"1992-10-01","ids":{"openalex":"https://openalex.org/W2124035620","doi":"https://doi.org/10.1002/net.3230220606","mag":"2124035620"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230220606","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220606","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5031973172","display_name":"Pedro I. Rivera\u2010Vega","orcid":null},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Pedro I. Rivera\u2010Vega","raw_affiliation_strings":["Computer and Information Sciences Department University of Florida Gainesville, Florida 32611"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer and Information Sciences Department University of Florida Gainesville, Florida 32611","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111528015","display_name":"Ravi Varadarajan","orcid":null},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ravi Varadarajan","raw_affiliation_strings":["Computer and Information Sciences Department University of Florida Gainesville, Florida 32611"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer and Information Sciences Department University of Florida Gainesville, Florida 32611","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027462416","display_name":"Shamkant B. Navathe","orcid":"https://orcid.org/0000-0002-6666-0031"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shamkant B. Navathe","raw_affiliation_strings":["Computer and Information Sciences Department University of Florida Gainesville, Florida 32611"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer and Information Sciences Department University of Florida Gainesville, Florida 32611","institution_ids":["https://openalex.org/I33213144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5031973172"],"corresponding_institution_ids":["https://openalex.org/I33213144"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.26472831,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":"6","first_page":"563","last_page":"588"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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.9997000098228455,"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.9994000196456909,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.7511156797409058},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6268206834793091},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5942939519882202},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5864627361297607},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5082663893699646},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4671223759651184},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44091659784317017},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38238444924354553},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20043644309043884}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7511156797409058},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6268206834793091},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5942939519882202},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5864627361297607},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5082663893699646},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4671223759651184},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44091659784317017},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38238444924354553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20043644309043884},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230220606","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220606","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1984939896","https://openalex.org/W1988357027","https://openalex.org/W1997370889","https://openalex.org/W2011039300","https://openalex.org/W2035404925","https://openalex.org/W2043560882","https://openalex.org/W2047680997","https://openalex.org/W2055748234","https://openalex.org/W2071513795","https://openalex.org/W2107997203","https://openalex.org/W2114446783","https://openalex.org/W2157529519","https://openalex.org/W2550348129","https://openalex.org/W2732454385","https://openalex.org/W4253576536","https://openalex.org/W6664701667"],"related_works":["https://openalex.org/W2195904091","https://openalex.org/W2381415338","https://openalex.org/W2365404242","https://openalex.org/W2370319203","https://openalex.org/W4241844845","https://openalex.org/W2365866555","https://openalex.org/W2023863393","https://openalex.org/W2910919598","https://openalex.org/W4281297310","https://openalex.org/W2350876336"],"abstract_inverted_index":{"Abstract":[0],"We":[1,28,50,139],"consider":[2],"the":[3,37,60,74,108,111,167,171],"problem":[4,32,58],"of":[5,9,110,151],"transferring":[6],"a":[7,16,79,103,142,164],"set":[8],"files":[10],"from":[11,166],"their":[12,21],"given":[13],"locations":[14,24],"in":[15,25,47,59,100,113,170],"fully":[17],"connected":[18],"network":[19],"to":[20,55,82,98,148],"respective":[22],"target":[23],"minimum":[26,152],"time.":[27],"show":[29],"that":[30,39,86,124,146,162],"this":[31,57],"is":[33,64,105,125],"NP\u2010hard":[34],"even":[35],"with":[36],"restriction":[38],"no":[40],"file":[41],"uses":[42],"more":[43,71],"than":[44],"two":[45],"edges":[46],"its":[48],"route.":[49],"present":[51,120,158],"an":[52,121,159],"efficient":[53,160],"algorithm":[54,145,161],"solve":[56],"case":[61],"when":[62],"there":[63],"only":[65],"one":[66,69],"source":[67],"and":[68,131],"or":[70,89],"destinations.":[72],"For":[73,116,154],"general":[75],"case,":[76],"we":[77,119,157],"propose":[78,141],"two\u2010phase":[80],"approach":[81],"find":[83],"two\u2010edge":[84,94],"schedules":[85],"are":[87,96],"optimal":[88],"close\u2010to\u2010optimal.":[90],"In":[91],"Phase":[92,101,117,155],"I,":[93,118],"routes":[95,150],"assigned":[97],"files;":[99],"II,":[102,156],"schedule":[104,165],"determined":[106],"for":[107,136],"use":[109],"links":[112],"these":[114],"routes.":[115],"exact":[122],"solution":[123,168],"based":[126],"on":[127],"integer":[128],"programming":[129],"formulation":[130],"also":[132,140],"give":[133],"theoretical":[134],"bounds":[135],"approximate":[137],"solution.":[138],"route":[143],"assignment":[144],"attempts":[147],"assign":[149],"congestion.":[153],"constructs":[163],"obtained":[169],"first":[172],"phase.":[173]},"counts_by_year":[],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}