{"id":"https://openalex.org/W2091468941","doi":"https://doi.org/10.1109/tit.1983.1056638","title":"Mean sojourn times in Markov queueing networks: Little's formula revisited","display_name":"Mean sojourn times in Markov queueing networks: Little's formula revisited","publication_year":1983,"publication_date":"1983-03-01","ids":{"openalex":"https://openalex.org/W2091468941","doi":"https://doi.org/10.1109/tit.1983.1056638","mag":"2091468941"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1983.1056638","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056638","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","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/A5037722916","display_name":"Frederick J. Beutler","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"F. Beutler","raw_affiliation_strings":["Computer, Information, and Control Engineering Program, University of Michigan, Ann Arbor, MI, USA","[Computer, Information, and Control Engineering Program, University of Michigan, Ann Arbor, MI, USA]"],"affiliations":[{"raw_affiliation_string":"Computer, Information, and Control Engineering Program, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"[Computer, Information, and Control Engineering Program, University of Michigan, Ann Arbor, MI, USA]","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037722916"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":1.453,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.83574007,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"29","issue":"2","first_page":"233","last_page":"241"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":1.0,"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":1.0,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9839000105857849,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9714000225067139,"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/markov-chain","display_name":"Markov chain","score":0.5517105460166931},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.5108928084373474},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4894818067550659},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4254203736782074},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.401762992143631},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37869691848754883},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35069799423217773},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3489464521408081},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33923864364624023},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.2186271846294403},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.15623006224632263},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11057916283607483}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5517105460166931},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.5108928084373474},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4894818067550659},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4254203736782074},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.401762992143631},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37869691848754883},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35069799423217773},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3489464521408081},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33923864364624023},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.2186271846294403},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.15623006224632263},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11057916283607483}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1983.1056638","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056638","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","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":21,"referenced_works":["https://openalex.org/W89566378","https://openalex.org/W1480112088","https://openalex.org/W1978006658","https://openalex.org/W1990510774","https://openalex.org/W2003436900","https://openalex.org/W2012238637","https://openalex.org/W2013566131","https://openalex.org/W2034172416","https://openalex.org/W2078373035","https://openalex.org/W2094055697","https://openalex.org/W2097645820","https://openalex.org/W2157995737","https://openalex.org/W2165641460","https://openalex.org/W2319456649","https://openalex.org/W2324732480","https://openalex.org/W2753933954","https://openalex.org/W3015733514","https://openalex.org/W4214821620","https://openalex.org/W4237138370","https://openalex.org/W4251758116","https://openalex.org/W4253999117"],"related_works":["https://openalex.org/W1660242800","https://openalex.org/W2980963558","https://openalex.org/W2077211377","https://openalex.org/W1006270037","https://openalex.org/W2379651310","https://openalex.org/W2113019827","https://openalex.org/W1541249122","https://openalex.org/W2413828414","https://openalex.org/W2115248066","https://openalex.org/W2367222340"],"abstract_inverted_index":{"It":[0,131],"is":[1,52,132,139,211],"commonly":[2],"supposed":[3],"that,":[4],"<tex":[5,15,23,41,64,93,105,114,135,158,163,189,196,221,227,234,239],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[6,16,24,42,65,94,106,115,136,159,164,190,197,222,228,235,240],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">L=\\lambdaW</tex>":[7],"applies":[8],"to":[9,125,145,183],"\"almost":[10],"any\"":[11],"queueing":[12,59,207],"system":[13,39],"with":[14,92,181],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\\lambda</tex>":[17],"some":[18,44,214],"average":[19,31,45],"customer":[20,111,156],"entrance":[21,150],"rate,":[22],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">L</tex>":[25],"the":[26,33,38,47,74,110,118,184,203,219],"asymptotic":[27,185],"expectation":[28],"or":[29,179,232],"time":[30,172],"of":[32,35,46,68,86,129,148,188,195,205,233],"number":[34],"customers":[36],"in":[37,121],"and":[40,83,88,154,162],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">W</tex>":[43,165],"sojourn":[48],"time.":[49],"This":[50],"formula":[51],"studied":[53],"for":[54,226,238],"irreducible":[55],"positive":[56],"recurrent":[57],"Markov":[58,103,206],"systems":[60],"whose":[61],"state":[62],"vector":[63],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">Z</tex>":[66,95,191],"consists":[67],"entries":[69],"representing":[70],"queue":[71],"lengths":[72],"at":[73],"respective":[75],"service":[76,89,119],"stations;":[77],"blocking,":[78],"finite":[79],"capacities,":[80],"batch":[81,152],"arrivals,":[82,153],"variable":[84],"rates":[85],"arrival":[87],"are":[90,99,200],"consistent":[91],".":[96,192,243],"Sojourn":[97],"times":[98],"defined":[100],"inan":[101],"augmented":[102],"model":[104],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">Y=(Z,U)</tex>":[107],",":[108,161,231],"where":[109],"marking":[112],"process":[113],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">U</tex>":[116],"describes":[117],"discipline":[120],"sufficiently":[122],"general":[123],"terms":[124],"include":[126],"most":[127],"possibilities":[128],"interest.":[130],"shown":[133,212],"that":[134],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">L=\\lambda":[137,198,241],"W</tex>":[138,199,230,242],"universally":[140],"applicable,":[141],"if":[142],"properly":[143],"interpreted":[144],"take":[146,218],"account":[147],"state-varying":[149],"rates,":[151],"multiple":[155],"classes.":[157],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">L,\\lambda</tex>":[160],"may":[166,217],"each":[167],"be":[168],"equivalently":[169],"viewed":[170],"as":[171,210],"averages,":[173],"means":[174],"over":[175],"a":[176],"regeneration":[177],"cycle,":[178],"expectations":[180],"respect":[182],"probability":[186],"structure":[187],"Indeterminate":[193],"forms":[194],"possible":[201],"within":[202],"scope":[204],"networks":[208],"(MQN);":[209],"by":[213],"examples,":[215],"these":[216],"form":[220],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\\infty":[223],"\\times":[224],"0</tex>":[225],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\\lambda":[229],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\\infty=":[236],"\\infty</tex>":[237]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}