{"id":"https://openalex.org/W2044237613","doi":"https://doi.org/10.1145/1540530.1540531","title":"Reduction of closed queueing networks for efficient simulation","display_name":"Reduction of closed queueing networks for efficient simulation","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2044237613","doi":"https://doi.org/10.1145/1540530.1540531","mag":"2044237613"},"language":"en","primary_location":{"id":"doi:10.1145/1540530.1540531","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1540530.1540531","pdf_url":null,"source":{"id":"https://openalex.org/S38703467","display_name":"ACM Transactions on Modeling and Computer Simulation","issn_l":"1049-3301","issn":["1049-3301","1558-1195"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Modeling and Computer Simulation","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/A5025965169","display_name":"John Shortle","orcid":"https://orcid.org/0000-0001-9856-0820"},"institutions":[{"id":"https://openalex.org/I162714631","display_name":"George Mason University","ror":"https://ror.org/02jqj7156","country_code":"US","type":"education","lineage":["https://openalex.org/I162714631"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"John F. Shortle","raw_affiliation_strings":["George Mason University, Fairfax, VA"],"affiliations":[{"raw_affiliation_string":"George Mason University, Fairfax, VA","institution_ids":["https://openalex.org/I162714631"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074618910","display_name":"Brian L. Mark","orcid":"https://orcid.org/0000-0002-4030-5592"},"institutions":[{"id":"https://openalex.org/I162714631","display_name":"George Mason University","ror":"https://ror.org/02jqj7156","country_code":"US","type":"education","lineage":["https://openalex.org/I162714631"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brian L. Mark","raw_affiliation_strings":["George Mason University, Fairfax, VA"],"affiliations":[{"raw_affiliation_string":"George Mason University, Fairfax, VA","institution_ids":["https://openalex.org/I162714631"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001102227","display_name":"Donald Gross","orcid":"https://orcid.org/0000-0003-1344-4092"},"institutions":[{"id":"https://openalex.org/I162714631","display_name":"George Mason University","ror":"https://ror.org/02jqj7156","country_code":"US","type":"education","lineage":["https://openalex.org/I162714631"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Donald Gross","raw_affiliation_strings":["George Mason University, Fairfax, VA"],"affiliations":[{"raw_affiliation_string":"George Mason University, Fairfax, VA","institution_ids":["https://openalex.org/I162714631"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025965169"],"corresponding_institution_ids":["https://openalex.org/I162714631"],"apc_list":null,"apc_paid":null,"fwci":0.4905,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.72801864,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"19","issue":"3","first_page":"1","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9889000058174133,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.7408503293991089},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.6961495876312256},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5917087197303772},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.5863116383552551},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.560279905796051},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5447157621383667},{"id":"https://openalex.org/keywords/layered-queueing-network","display_name":"Layered queueing network","score":0.4680962562561035},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3450169265270233},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3383561074733734},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.32287847995758057},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2702774107456207},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2611253261566162}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7408503293991089},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.6961495876312256},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5917087197303772},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.5863116383552551},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.560279905796051},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5447157621383667},{"id":"https://openalex.org/C33891772","wikidata":"https://www.wikidata.org/wiki/Q6505536","display_name":"Layered queueing network","level":3,"score":0.4680962562561035},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3450169265270233},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3383561074733734},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.32287847995758057},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2702774107456207},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2611253261566162},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1540530.1540531","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1540530.1540531","pdf_url":null,"source":{"id":"https://openalex.org/S38703467","display_name":"ACM Transactions on Modeling and Computer Simulation","issn_l":"1049-3301","issn":["1049-3301","1558-1195"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Modeling and Computer Simulation","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.554.5674","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.554.5674","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://napl.gmu.edu/pubs/JPapers/ShortleMarkGross-TOMACS09.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3507801512","display_name":null,"funder_award_id":"IIS-0325074","funder_id":"https://openalex.org/F4320337389","funder_display_name":"Division of Information and Intelligent Systems"}],"funders":[{"id":"https://openalex.org/F4320337389","display_name":"Division of Information and Intelligent Systems","ror":"https://ror.org/053a2cp42"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W78171367","https://openalex.org/W108513215","https://openalex.org/W1488584612","https://openalex.org/W1882807670","https://openalex.org/W1939573755","https://openalex.org/W1975578970","https://openalex.org/W1975585577","https://openalex.org/W1981174774","https://openalex.org/W1984096017","https://openalex.org/W2000936130","https://openalex.org/W2004910138","https://openalex.org/W2007018477","https://openalex.org/W2008075858","https://openalex.org/W2018798709","https://openalex.org/W2018934112","https://openalex.org/W2040592489","https://openalex.org/W2044237613","https://openalex.org/W2047968172","https://openalex.org/W2051626388","https://openalex.org/W2051693911","https://openalex.org/W2055491565","https://openalex.org/W2057808525","https://openalex.org/W2066866933","https://openalex.org/W2085857497","https://openalex.org/W2091505994","https://openalex.org/W2117369804","https://openalex.org/W2122615518","https://openalex.org/W2124637492","https://openalex.org/W2126252419","https://openalex.org/W2147837310","https://openalex.org/W2152530926","https://openalex.org/W2154647457","https://openalex.org/W2158666653","https://openalex.org/W2165821883","https://openalex.org/W2166323094","https://openalex.org/W2170818004","https://openalex.org/W4212922449","https://openalex.org/W4236213891","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1498845059","https://openalex.org/W22997922","https://openalex.org/W1556909862","https://openalex.org/W3083042886","https://openalex.org/W2284190755","https://openalex.org/W2556507906","https://openalex.org/W1976149253","https://openalex.org/W2025487488","https://openalex.org/W2182383417","https://openalex.org/W2012135824"],"abstract_inverted_index":{"This":[0],"article":[1],"gives":[2],"several":[3],"methods":[4],"for":[5,114,175],"approximating":[6],"a":[7,12,76,128,137],"closed":[8],"queueing":[9],"network":[10,46,112,167],"with":[11,30,34],"smaller":[13],"one.":[14],"The":[15,38,70,97,141],"objective":[16],"is":[17,41,144,168,180],"to":[18,42,84,171],"reduce":[19],"the":[20,24,45,55,64,86,92,106,111,125,146,151,157,166,178],"simulation":[21],"time":[22],"of":[23,52,68,79,91,94,131,154,156],"network.":[25,108],"We":[26,58,109],"consider":[27],"Jackson-like":[28],"networks":[29],"Markovian":[31],"routing":[32],"and":[33,54,89,100,116,174],"general":[35],"service":[36,158],"distributions.":[37],"basic":[39],"idea":[40],"first":[43],"divide":[44],"into":[47,75,88],"two":[48],"parts\u2014the":[49],"core":[50,65,95,98],"nodes":[51,66,72,99,176],"interest":[53],"remaining":[56,71],"nodes.":[57,96],"suppose":[59],"that":[60,145],"only":[61],"metrics":[62],"at":[63],"are":[67,73,103,160],"interest.":[69],"collapsed":[74],"reduced":[77,107],"set":[78,93],"nodes,":[80],"in":[81,105],"an":[82],"effort":[83],"approximate":[85],"flows":[87],"out":[90],"their":[101],"interactions":[102],"preserved":[104],"test":[110,124,132],"reductions":[113,126,147],"accuracy":[115],"speed.":[117],"By":[118],"randomly":[119],"generating":[120],"sample":[121],"networks,":[122,133],"we":[123],"on":[127,136],"large":[129],"variety":[130],"rather":[134],"than":[135],"few":[138],"specific":[139],"cases.":[140],"main":[142],"conclusion":[143],"work":[148],"well":[149],"when":[150],"squared":[152],"coefficients":[153],"variation":[155],"distributions":[159],"not":[161,169,181],"all":[162],"small":[163],"(that":[164],"is,":[165],"close":[170],"being":[172],"deterministic)":[173],"where":[177],"utilization":[179],"too":[182,185],"high":[183],"or":[184],"low.":[186]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}