{"id":"https://openalex.org/W2131183268","doi":"https://doi.org/10.1109/ictel.2008.4652683","title":"Retrial queueing model with time-phased batch arrivals","display_name":"Retrial queueing model with time-phased batch arrivals","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2131183268","doi":"https://doi.org/10.1109/ictel.2008.4652683","mag":"2131183268"},"language":"en","primary_location":{"id":"doi:10.1109/ictel.2008.4652683","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ictel.2008.4652683","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 International Conference on Telecommunications","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/A5046286231","display_name":"Sergey Dudin","orcid":"https://orcid.org/0000-0002-9439-8755"},"institutions":[{"id":"https://openalex.org/I291386647","display_name":"Belarusian State University","ror":"https://ror.org/021036w13","country_code":"BY","type":"education","lineage":["https://openalex.org/I291386647"]}],"countries":["BY"],"is_corresponding":true,"raw_author_name":"Sergey Dudin","raw_affiliation_strings":["Department of Applied Mathematics and Computer Science, Belarusian State University, Minsk, Belarus","Dept. of Appl. Math. & Comput. Sci., Belarusian State Univ., Minsk"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Computer Science, Belarusian State University, Minsk, Belarus","institution_ids":["https://openalex.org/I291386647"]},{"raw_affiliation_string":"Dept. of Appl. Math. & Comput. Sci., Belarusian State Univ., Minsk","institution_ids":["https://openalex.org/I291386647"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002317744","display_name":"Alexander Babitsky","orcid":null},"institutions":[{"id":"https://openalex.org/I291386647","display_name":"Belarusian State University","ror":"https://ror.org/021036w13","country_code":"BY","type":"education","lineage":["https://openalex.org/I291386647"]}],"countries":["BY"],"is_corresponding":false,"raw_author_name":"Alexander Babitsky","raw_affiliation_strings":["Department of Applied Mathematics and Computer Science, Belarusian State University, Minsk, Belarus","Dept. of Appl. Math. & Comput. Sci., Belarusian State Univ., Minsk"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Computer Science, Belarusian State University, Minsk, Belarus","institution_ids":["https://openalex.org/I291386647"]},{"raw_affiliation_string":"Dept. of Appl. Math. & Comput. Sci., Belarusian State Univ., Minsk","institution_ids":["https://openalex.org/I291386647"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046286231"],"corresponding_institution_ids":["https://openalex.org/I291386647"],"apc_list":null,"apc_paid":null,"fwci":0.4878,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.74415522,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"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.9836000204086304,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9610999822616577,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/markovian-arrival-process","display_name":"Markovian arrival process","score":0.7123990654945374},{"id":"https://openalex.org/keywords/exponential-distribution","display_name":"Exponential distribution","score":0.711154580116272},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7089844942092896},{"id":"https://openalex.org/keywords/batch-processing","display_name":"Batch processing","score":0.6968176960945129},{"id":"https://openalex.org/keywords/poisson-distribution","display_name":"Poisson distribution","score":0.5613216757774353},{"id":"https://openalex.org/keywords/queueing-system","display_name":"Queueing system","score":0.5447753667831421},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.5263487100601196},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5227560997009277},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.49354374408721924},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.48234885931015015},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43342775106430054},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4110603332519531},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20360329747200012},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16212105751037598},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10808289051055908}],"concepts":[{"id":"https://openalex.org/C192163390","wikidata":"https://www.wikidata.org/wiki/Q612061","display_name":"Markovian arrival process","level":3,"score":0.7123990654945374},{"id":"https://openalex.org/C55350006","wikidata":"https://www.wikidata.org/wiki/Q237193","display_name":"Exponential distribution","level":2,"score":0.711154580116272},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7089844942092896},{"id":"https://openalex.org/C172658912","wikidata":"https://www.wikidata.org/wiki/Q661613","display_name":"Batch processing","level":2,"score":0.6968176960945129},{"id":"https://openalex.org/C100906024","wikidata":"https://www.wikidata.org/wiki/Q205692","display_name":"Poisson distribution","level":2,"score":0.5613216757774353},{"id":"https://openalex.org/C2986422491","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing system","level":3,"score":0.5447753667831421},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.5263487100601196},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5227560997009277},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.49354374408721924},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.48234885931015015},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43342775106430054},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4110603332519531},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20360329747200012},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16212105751037598},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10808289051055908},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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},{"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/ictel.2008.4652683","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ictel.2008.4652683","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 International Conference on Telecommunications","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":11,"referenced_works":["https://openalex.org/W1597950499","https://openalex.org/W1861796145","https://openalex.org/W1968661925","https://openalex.org/W1978082286","https://openalex.org/W2013429768","https://openalex.org/W2046650903","https://openalex.org/W2157261855","https://openalex.org/W2610166414","https://openalex.org/W3134957306","https://openalex.org/W4249296667","https://openalex.org/W6635943973"],"related_works":["https://openalex.org/W4400956004","https://openalex.org/W2294359397","https://openalex.org/W2115248066","https://openalex.org/W2000223540","https://openalex.org/W2154452441","https://openalex.org/W1922545131","https://openalex.org/W4311030272","https://openalex.org/W2131183268","https://openalex.org/W1907672713","https://openalex.org/W4205205970"],"abstract_inverted_index":{"A":[0],"novel":[1],"retrial":[2],"multi-server":[3],"queueing":[4],"model":[5],"with":[6],"batch":[7,18,23,38],"arrival":[8,19,58],"of":[9,36,52,67,79,82,86,100],"customers":[10,35,91],"is":[11,48,54,63,77,95],"considered.":[12],"In":[13],"contrast":[14],"to":[15],"the":[16,26,34,55,74,83,87,93,98,101],"standard":[17],"when":[20],"a":[21,37],"whole":[22],"arrives":[24],"into":[25,73],"system":[27,75,94],"at":[28],"one":[29,41],"epoch,":[30],"we":[31],"assume":[32],"that":[33],"arrive":[39],"one-by":[40],"in":[42,92],"exponentially":[43,49],"distributed":[44],"times.":[45],"Service":[46],"time":[47],"distributed.":[50],"Flow":[51],"batches":[53,89],"stationary":[56],"Poisson":[57],"process.":[59],"Batch":[60],"size":[61],"distribution":[62,85],"geometric.":[64],"The":[65],"number":[66,88],"batches,":[68],"which":[69],"can":[70],"be":[71],"admitted":[72],"simultaneously,":[76],"subject":[78],"control.":[80],"Analysis":[81],"joint":[84],"and":[90],"implemented":[96],"using":[97],"tool":[99],"multi-dimensional":[102],"asymptotically":[103],"quasi-Toeplitz":[104],"Markov":[105],"chains.":[106]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}