{"id":"https://openalex.org/W4251222778","doi":"https://doi.org/10.1145/1140277.1140300","title":"Bounding stationary results of Tandem networks with MAP input and PH service time distributions","display_name":"Bounding stationary results of Tandem networks with MAP input and PH service time distributions","publication_year":2006,"publication_date":"2006-06-26","ids":{"openalex":"https://openalex.org/W4251222778","doi":"https://doi.org/10.1145/1140277.1140300"},"language":"en","primary_location":{"id":"doi:10.1145/1140277.1140300","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1140277.1140300","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the joint international conference on Measurement and modeling of computer systems","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/A5022119933","display_name":"Peter Buchholz","orcid":"https://orcid.org/0000-0002-9966-7686"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Peter Buchholz","raw_affiliation_strings":["Universit\u00e4t Dortmund, Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5022119933"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.58794237,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"191","last_page":"202"},"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9692000150680542,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9675999879837036,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.7570656538009644},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6692451238632202},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.657772421836853},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6233235597610474},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5935409069061279},{"id":"https://openalex.org/keywords/layered-queueing-network","display_name":"Layered queueing network","score":0.5637394189834595},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.5610421895980835},{"id":"https://openalex.org/keywords/markovian-arrival-process","display_name":"Markovian arrival process","score":0.520287811756134},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.506641685962677},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5013852119445801},{"id":"https://openalex.org/keywords/stationary-distribution","display_name":"Stationary distribution","score":0.47509801387786865},{"id":"https://openalex.org/keywords/bulk-queue","display_name":"Bulk queue","score":0.4487324655056},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44379791617393494},{"id":"https://openalex.org/keywords/mean-value-analysis","display_name":"Mean value analysis","score":0.43358561396598816},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3601644039154053},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3430347442626953},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2686968445777893},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08830654621124268}],"concepts":[{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.7570656538009644},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6692451238632202},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.657772421836853},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6233235597610474},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5935409069061279},{"id":"https://openalex.org/C33891772","wikidata":"https://www.wikidata.org/wiki/Q6505536","display_name":"Layered queueing network","level":3,"score":0.5637394189834595},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.5610421895980835},{"id":"https://openalex.org/C192163390","wikidata":"https://www.wikidata.org/wiki/Q612061","display_name":"Markovian arrival process","level":3,"score":0.520287811756134},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.506641685962677},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5013852119445801},{"id":"https://openalex.org/C98951983","wikidata":"https://www.wikidata.org/wiki/Q7604341","display_name":"Stationary distribution","level":3,"score":0.47509801387786865},{"id":"https://openalex.org/C87950461","wikidata":"https://www.wikidata.org/wiki/Q4996486","display_name":"Bulk queue","level":3,"score":0.4487324655056},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44379791617393494},{"id":"https://openalex.org/C129978463","wikidata":"https://www.wikidata.org/wiki/Q6803663","display_name":"Mean value analysis","level":4,"score":0.43358561396598816},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3601644039154053},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3430347442626953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2686968445777893},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08830654621124268},{"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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1140277.1140300","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1140277.1140300","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the joint international conference on Measurement and modeling of computer systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1983712057","https://openalex.org/W2031305654","https://openalex.org/W2042624802","https://openalex.org/W2058634022","https://openalex.org/W2061284453","https://openalex.org/W2062573385","https://openalex.org/W2067747265","https://openalex.org/W2094055697","https://openalex.org/W2116879482","https://openalex.org/W2136694925","https://openalex.org/W2170893835","https://openalex.org/W4251973790","https://openalex.org/W6642536117","https://openalex.org/W6750968397","https://openalex.org/W7046135743"],"related_works":["https://openalex.org/W2084876786","https://openalex.org/W2036729104","https://openalex.org/W2474880244","https://openalex.org/W2970366197","https://openalex.org/W2084787362","https://openalex.org/W2074574331","https://openalex.org/W2037182076","https://openalex.org/W2126708035","https://openalex.org/W2017032363","https://openalex.org/W2321254617"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,128],"propose":[4],"a":[5,23,29,77,145],"new":[6,78],"approach":[7,79],"to":[8,82,105,123],"compute":[9],"bounds":[10,66,111,137],"on":[11,59,62],"stationary":[12],"measures":[13],"of":[14,31,65,70,85,89,96,100,132,148],"queueing":[15,41,90,149],"systems":[16,42,150],"with":[17,33,141],"an":[18,50],"input":[19],"process":[20],"described":[21],"by":[22,130],"Markovian":[24],"Arrival":[25],"Process":[26],"(MAP)":[27],"and":[28],"sequence":[30],"stations":[32],"Phase":[34],"Type":[35],"(PH)":[36],"service":[37],"time":[38],"distributions.":[39],"Such":[40],"cannot":[43],"be":[44,106,113,139],"solved":[45,107],"exactly":[46],"since":[47],"they":[48],"have":[49],"infinite":[51,71],"state":[52,98],"space":[53,99],"in":[54,151],"several":[55,133],"natural":[56],"dimensions.":[57],"Based":[58],"earlier":[60],"work":[61],"the":[63,74,83,86,94,97,101,124,152],"computation":[64],"for":[67,108,144],"specific":[68],"classes":[69],"Markov":[72,103],"chains,":[73],"paper":[75],"presents":[76],"specifically":[80],"tailored":[81],"analysis":[84],"mentioned":[87,153],"class":[88],"networks.":[91],"By":[92],"increasing":[93],"size":[95],"aggregated":[102],"chain":[104],"bound":[109],"computation,":[110],"can":[112,138],"made":[114],"arbitrarily":[115],"tight,":[116],"but":[117],"practical":[118],"limits":[119],"come":[120],"up":[121],"due":[122],"computational":[125],"complexity.":[126],"However,":[127],"show":[129],"means":[131],"examples":[134],"that":[135],"tight":[136],"derived":[140],"low":[142],"effort":[143],"large":[146],"set":[147],"class.":[154]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}