{"id":"https://openalex.org/W2014070057","doi":"https://doi.org/10.1080/10637199508915485","title":"MODELING AND SIMULATION OF DYNAMIC LOAD BALANCING USING QUEUEING THEORY","display_name":"MODELING AND SIMULATION OF DYNAMIC LOAD BALANCING USING QUEUEING THEORY","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W2014070057","doi":"https://doi.org/10.1080/10637199508915485","mag":"2014070057"},"language":"en","primary_location":{"id":"doi:10.1080/10637199508915485","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199508915485","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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/A5109192833","display_name":"Herv\u00e9 Guyennet","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"HERV\u00c9 GUYENNET","raw_affiliation_strings":["Laboratoire d'informatique , UFR Sciences et Techniques, route de GRAY , 25030, Besancon Cedex, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'informatique , UFR Sciences et Techniques, route de GRAY , 25030, Besancon Cedex, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026852083","display_name":"Fran\u00e7ois Spies","orcid":"https://orcid.org/0000-0002-9964-2745"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"FRAN\u00c7OIS SPIES","raw_affiliation_strings":["Laboratoire d'informatique , UFR Sciences et Techniques, route de GRAY , 25030, Besancon Cedex, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'informatique , UFR Sciences et Techniques, route de GRAY , 25030, Besancon Cedex, France","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089110379","display_name":"Michel Tr\u00e9hel","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"MICHEL TR\u00c9HEL","raw_affiliation_strings":["Laboratoire d'informatique , UFR Sciences et Techniques, route de GRAY , 25030, Besancon Cedex, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'informatique , UFR Sciences et Techniques, route de GRAY , 25030, Besancon Cedex, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5109192833"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4858,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.70860826,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":"3-4","first_page":"199","last_page":"218"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing 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"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing 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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9937000274658203,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.8097032308578491},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.7595545649528503},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.5245616436004639},{"id":"https://openalex.org/keywords/simulation-software","display_name":"Simulation software","score":0.5004866123199463},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47002673149108887},{"id":"https://openalex.org/keywords/dynamic-simulation","display_name":"Dynamic simulation","score":0.4671591818332672},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.45898115634918213},{"id":"https://openalex.org/keywords/simulation-modeling","display_name":"Simulation modeling","score":0.44342225790023804},{"id":"https://openalex.org/keywords/modeling-and-simulation","display_name":"Modeling and simulation","score":0.44184964895248413},{"id":"https://openalex.org/keywords/simulation","display_name":"Simulation","score":0.3998260796070099},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3291884660720825},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1153901219367981},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07833072543144226}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8097032308578491},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.7595545649528503},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.5245616436004639},{"id":"https://openalex.org/C91757755","wikidata":"https://www.wikidata.org/wiki/Q11121294","display_name":"Simulation software","level":3,"score":0.5004866123199463},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47002673149108887},{"id":"https://openalex.org/C149808339","wikidata":"https://www.wikidata.org/wiki/Q5319019","display_name":"Dynamic simulation","level":2,"score":0.4671591818332672},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.45898115634918213},{"id":"https://openalex.org/C108215451","wikidata":"https://www.wikidata.org/wiki/Q7263963","display_name":"Simulation modeling","level":2,"score":0.44342225790023804},{"id":"https://openalex.org/C167343916","wikidata":"https://www.wikidata.org/wiki/Q6888384","display_name":"Modeling and simulation","level":2,"score":0.44184964895248413},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.3998260796070099},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3291884660720825},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1153901219367981},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07833072543144226},{"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/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10637199508915485","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199508915485","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W3502473","https://openalex.org/W69342028","https://openalex.org/W138094747","https://openalex.org/W169894901","https://openalex.org/W1538089110","https://openalex.org/W1984869672","https://openalex.org/W1994826215","https://openalex.org/W2008646959","https://openalex.org/W2015379135","https://openalex.org/W2022049964","https://openalex.org/W2039179345","https://openalex.org/W2041402579","https://openalex.org/W2070282123","https://openalex.org/W2080635191","https://openalex.org/W2084720376","https://openalex.org/W2093512919","https://openalex.org/W2143714986","https://openalex.org/W2144513575","https://openalex.org/W2152408640","https://openalex.org/W2158108291","https://openalex.org/W2162331874","https://openalex.org/W2165104827","https://openalex.org/W2166573642","https://openalex.org/W2171189596","https://openalex.org/W4238447950"],"related_works":["https://openalex.org/W2188191905","https://openalex.org/W2388836302","https://openalex.org/W2356939368","https://openalex.org/W2392121277","https://openalex.org/W2381235146","https://openalex.org/W2376060232","https://openalex.org/W4206261961","https://openalex.org/W2887246461","https://openalex.org/W3128885716","https://openalex.org/W2129865864"],"abstract_inverted_index":{"The":[0,87],"aim":[1],"of":[2,11,33,38,66,83,107,114],"this":[3,91],"article":[4],"is":[5],"to":[6,19,29],"present":[7,20,45],"an":[8],"original":[9,81],"modeling":[10,82],"dynamic":[12],"load":[13,47],"balancing,":[14],"using":[15,24,52],"qucueing":[16],"theory,":[17],"then":[18],"a":[21,78],"simulation":[22,40],"method,":[23],"QNAP":[25,54],"software":[26],"and":[27,36,56,71,80,111],"finally":[28],"show":[30],"that":[31],"results":[32,37],"the":[34,39,53,59,62,64,68,72,84,101,105,112],"model":[35,110],"are":[41,93],"identical.":[42],"First":[43],"we":[44,50,57,76,103],"six":[46],"balancing":[48],"strategies":[49],"simulate":[51],"software,":[55],"study":[58],"basic":[60],"parameters:":[61],"load,":[63],"number":[65],"nodes,":[67],"communication":[69],"speed,":[70],"overload":[73],"rate.":[74],"Then":[75],"realise":[77],"complete":[79],"\u201coptimal\u201d":[85],"strategy.":[86],"values":[88,95],"given":[89],"by":[90],"method":[92],"reference":[94],"for":[96],"other":[97],"strategies.":[98],"By":[99],"comparing":[100],"results,":[102],"demonstrate":[104],"accuracy":[106],"our":[108,115],"mathematical":[109],"precision":[113],"simulation.":[116]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}