{"id":"https://openalex.org/W1524762955","doi":"https://doi.org/10.1109/mascot.2004.1348255","title":"A new recursive algorithm for computing generating functions in closed multi-class queueing networks","display_name":"A new recursive algorithm for computing generating functions in closed multi-class queueing networks","publication_year":2004,"publication_date":"2004-11-08","ids":{"openalex":"https://openalex.org/W1524762955","doi":"https://doi.org/10.1109/mascot.2004.1348255","mag":"1524762955"},"language":"en","primary_location":{"id":"doi:10.1109/mascot.2004.1348255","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mascot.2004.1348255","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings.","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/A5080155994","display_name":"Peter G. Harrison","orcid":"https://orcid.org/0000-0002-7378-1405"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"P.G. Harrison","raw_affiliation_strings":["Department of Computing, South Kensington Campus, Imperial College London, London, UK","Dept. of Comput., Imperial Coll., London, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computing, South Kensington Campus, Imperial College London, London, UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Dept. of Comput., Imperial Coll., London, UK","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089412106","display_name":"Ting Ting Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ting Ting Lee","raw_affiliation_strings":["Department of Computing, South Kensington Campus, Imperial College London, London, UK","Dept. of Comput., Imperial Coll., London, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computing, South Kensington Campus, Imperial College London, London, UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Dept. of Comput., Imperial Coll., London, UK","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080155994"],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":null,"apc_paid":null,"fwci":0.4712,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69927997,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"231","last_page":"238"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9998999834060669,"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.9998999834060669,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9847999811172485,"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.9757000207901001,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6476295590400696},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.634643018245697},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.572770357131958},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5486118793487549},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5406067371368408},{"id":"https://openalex.org/keywords/convolution","display_name":"Convolution (computer science)","score":0.5167093276977539},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.5042885541915894},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4836660325527191},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4505772888660431},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.4365713596343994},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4301326274871826},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41172724962234497},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.347496896982193},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.18642809987068176},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12603414058685303}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6476295590400696},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.634643018245697},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.572770357131958},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5486118793487549},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5406067371368408},{"id":"https://openalex.org/C45347329","wikidata":"https://www.wikidata.org/wiki/Q5166604","display_name":"Convolution (computer science)","level":3,"score":0.5167093276977539},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.5042885541915894},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4836660325527191},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4505772888660431},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.4365713596343994},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4301326274871826},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41172724962234497},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.347496896982193},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.18642809987068176},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12603414058685303},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mascot.2004.1348255","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mascot.2004.1348255","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1556096280","https://openalex.org/W1569289540","https://openalex.org/W1967379724","https://openalex.org/W1972256986","https://openalex.org/W1975062652","https://openalex.org/W1978006658","https://openalex.org/W2018157348","https://openalex.org/W2023980590","https://openalex.org/W2037400252","https://openalex.org/W2045201245","https://openalex.org/W2060840612","https://openalex.org/W2077095314","https://openalex.org/W2090767492","https://openalex.org/W2094055697","https://openalex.org/W2104110349","https://openalex.org/W2115525458","https://openalex.org/W2164149587","https://openalex.org/W2765179630"],"related_works":["https://openalex.org/W170547082","https://openalex.org/W2136735429","https://openalex.org/W2587876411","https://openalex.org/W2358332176","https://openalex.org/W4229950834","https://openalex.org/W4301044568","https://openalex.org/W1587123803","https://openalex.org/W2128075414","https://openalex.org/W2065302945","https://openalex.org/W2390514042"],"abstract_inverted_index":{"We":[0],"obtain":[1],"an":[2],"algorithm":[3,102],"that":[4,153],"implements":[5],"a":[6,36,46,54,68,82,131,157],"recursive":[7],"generating":[8,33,43],"function":[9,34],"(RGF)":[10],"for":[11,53,121],"computing":[12],"the":[13,27,32,42,64,95,99,108,122,128,146],"normalising":[14,65],"constant":[15],"in":[16,39,150,156],"closed,":[17],"multi-class,":[18],"product-form":[19],"queueing":[20],"networks":[21,129,152],"with":[22],"multiple,":[23],"load-independent":[24],"servers":[25],"of":[26,35,41,45,48,67,70,98,113,136,160],"same":[28],"load.":[29],"It":[30],"expresses":[31],"q-class":[37],"network":[38,56],"terms":[40],"functions":[44],"set":[47],"(q-1)-class":[49],"networks.":[50,73],"The":[51],"result":[52],"multi-class":[55],"can":[57],"therefore":[58],"be":[59,118],"deduced":[60],"hierarchically":[61],"by":[62],"finding":[63],"constants":[66],"collection":[69],"single":[71],"class":[72],"A":[74],"storage":[75,92],"management":[76],"scheme":[77],"is":[78,103],"devised,":[79],"based":[80],"on":[81],"depth-first":[83],"recursion":[84],"tree":[85],"traversal,":[86],"to":[87,117,133],"optimise":[88],"both":[89],"time":[90,111],"and":[91,94,110,124],"requirements":[93,112],"numerical":[96],"precision":[97],"resulting":[100],"RGF":[101,114,141],"investigated.":[104],"In":[105],"two-class":[106],"networks,":[107],"space":[109],"are":[115,154],"shown":[116],"smaller":[119],"than":[120,145],"convolution":[123],"RECAL":[125],"algorithms":[126],"when":[127],"contain":[130],"moderate":[132],"large":[134],"number":[135],"customers.":[137],"With":[138],"more":[139],"classes,":[140],"gives":[142],"better":[143],"performance":[144],"other":[147],"two":[148],"methods":[149],"many-node":[151],"organised":[155],"few":[158],"groups":[159],"several":[161],"identical":[162],"nodes.":[163]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}