Queueing Systems with Random Volume Customers and their Performance Characteristics
In the paper, we consider non-classical queueing systems with non-homogeneous customers. The non-homogeneity we treat in the following sense: in systems under consideration, we characterize each customer by random capacity (volume) that can have an influence on his service time. We analyze a stochas...
Gespeichert in:
Veröffentlicht in: | Journal of Information and Organizational Sciences 2021-01, Vol.45 (1), p.21-38 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 38 |
---|---|
container_issue | 1 |
container_start_page | 21 |
container_title | Journal of Information and Organizational Sciences |
container_volume | 45 |
creator | Tikhonenko, Oleg Ziółkowski, Marcin |
description | In the paper, we consider non-classical queueing systems with non-homogeneous customers. The non-homogeneity we treat in the following sense: in systems under consideration, we characterize each customer by random capacity (volume) that can have an influence on his service time. We analyze a stochastic process having the sense of the total volume of all customers present in the system at given time instant. Such analysis for different queueing systems with unlimited or limited total volume can be used in designing of nodes of computer and communication networks while determining their buffer space capacity. We discuss basic problems of the theory of these systems and their performance characteristics. We also present some examples and results for systems with random volume customers. |
doi_str_mv | 10.31341/jios.45.1.2 |
format | Article |
fullrecord | <record><control><sourceid>ceeol_doaj_</sourceid><recordid>TN_cdi_ceeol_journals_987394</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ceeol_id>987394</ceeol_id><doaj_id>oai_doaj_org_article_9a2eb4f0db1c447184dc985bdea9f445</doaj_id><sourcerecordid>987394</sourcerecordid><originalsourceid>FETCH-LOGICAL-c388t-e031a9e4a0f70c44563eeb01407ebc9036161ba0b219357f8592febd26ba4e923</originalsourceid><addsrcrecordid>eNpVkUlPwzAQhSMEElXhxpFDJK6keEscH1HFUqkSS4GrZTuTJqGpi50I9d_jNhUIXzx6fvrmjSeKLjCaUEwZvmlq6ycsneAJOYpGOGdZIhjOjw81pZicRufeNygcilnKyChavPTQQ71exout76D18XfdVfGrWhe2jT_sqm8hnva-sy04Hwc57iqoXfwMrrSuVWsT3ivllOnA1b6rjT-LTkq18nB-uMfR-_3d2_QxmT89zKa388TQPO8SCCGUAKZQyZFhLM0ogEaYIQ7aCEQznGGtkCZY0JSXeSpICbogmVYMBKHjaDZwC6sauXF1q9xWWlXLvWDdUioXAq1ACkVAsxIVGodOPHxIYUSe6gKUKEPrwEoGVuWM-vwHGxTvDIRSkoxyxoL_avBvnP3qwXeysb1bh3El4YiKjPNsl_B6cBlnvXdQ_oIxkvutyd3WJEslljv75cEOYFd_RJFzKhj9AQ21lL8</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2703967762</pqid></control><display><type>article</type><title>Queueing Systems with Random Volume Customers and their Performance Characteristics</title><source>DOAJ Directory of Open Access Journals</source><source>Alma/SFX Local Collection</source><creator>Tikhonenko, Oleg ; Ziółkowski, Marcin</creator><creatorcontrib>Tikhonenko, Oleg ; Ziółkowski, Marcin</creatorcontrib><description>In the paper, we consider non-classical queueing systems with non-homogeneous customers. The non-homogeneity we treat in the following sense: in systems under consideration, we characterize each customer by random capacity (volume) that can have an influence on his service time. We analyze a stochastic process having the sense of the total volume of all customers present in the system at given time instant. Such analysis for different queueing systems with unlimited or limited total volume can be used in designing of nodes of computer and communication networks while determining their buffer space capacity. We discuss basic problems of the theory of these systems and their performance characteristics. We also present some examples and results for systems with random volume customers.</description><identifier>ISSN: 1846-3312</identifier><identifier>EISSN: 1846-9418</identifier><identifier>DOI: 10.31341/jios.45.1.2</identifier><language>eng</language><publisher>Varazdin: Faculty of organization and informatics, University of Zagreb</publisher><subject>buffer space capacity ; Communication networks ; Customers ; customer’s volume ; Homogeneity ; loss probability ; Marketing / Advertising ; Queuing theory ; Stochastic processes ; total volume ; volume unit loss probability</subject><ispartof>Journal of Information and Organizational Sciences, 2021-01, Vol.45 (1), p.21-38</ispartof><rights>2021. This work is published under https://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. This is sourced from HRČAK - Portal of scientific journals of Croatia.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c388t-e031a9e4a0f70c44563eeb01407ebc9036161ba0b219357f8592febd26ba4e923</citedby><orcidid>0000-0003-3087-1694 ; 0000-0001-8907-8813</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://www.ceeol.com//api/image/getissuecoverimage?id=picture_2021_63565.png</thumbnail><link.rule.ids>230,314,780,784,864,885,2102,27924,27925</link.rule.ids></links><search><creatorcontrib>Tikhonenko, Oleg</creatorcontrib><creatorcontrib>Ziółkowski, Marcin</creatorcontrib><title>Queueing Systems with Random Volume Customers and their Performance Characteristics</title><title>Journal of Information and Organizational Sciences</title><addtitle>Journal of Information and Organizational Sciences</addtitle><description>In the paper, we consider non-classical queueing systems with non-homogeneous customers. The non-homogeneity we treat in the following sense: in systems under consideration, we characterize each customer by random capacity (volume) that can have an influence on his service time. We analyze a stochastic process having the sense of the total volume of all customers present in the system at given time instant. Such analysis for different queueing systems with unlimited or limited total volume can be used in designing of nodes of computer and communication networks while determining their buffer space capacity. We discuss basic problems of the theory of these systems and their performance characteristics. We also present some examples and results for systems with random volume customers.</description><subject>buffer space capacity</subject><subject>Communication networks</subject><subject>Customers</subject><subject>customer’s volume</subject><subject>Homogeneity</subject><subject>loss probability</subject><subject>Marketing / Advertising</subject><subject>Queuing theory</subject><subject>Stochastic processes</subject><subject>total volume</subject><subject>volume unit loss probability</subject><issn>1846-3312</issn><issn>1846-9418</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>REL</sourceid><sourceid>DOA</sourceid><recordid>eNpVkUlPwzAQhSMEElXhxpFDJK6keEscH1HFUqkSS4GrZTuTJqGpi50I9d_jNhUIXzx6fvrmjSeKLjCaUEwZvmlq6ycsneAJOYpGOGdZIhjOjw81pZicRufeNygcilnKyChavPTQQ71exout76D18XfdVfGrWhe2jT_sqm8hnva-sy04Hwc57iqoXfwMrrSuVWsT3ivllOnA1b6rjT-LTkq18nB-uMfR-_3d2_QxmT89zKa388TQPO8SCCGUAKZQyZFhLM0ogEaYIQ7aCEQznGGtkCZY0JSXeSpICbogmVYMBKHjaDZwC6sauXF1q9xWWlXLvWDdUioXAq1ACkVAsxIVGodOPHxIYUSe6gKUKEPrwEoGVuWM-vwHGxTvDIRSkoxyxoL_avBvnP3qwXeysb1bh3El4YiKjPNsl_B6cBlnvXdQ_oIxkvutyd3WJEslljv75cEOYFd_RJFzKhj9AQ21lL8</recordid><startdate>20210101</startdate><enddate>20210101</enddate><creator>Tikhonenko, Oleg</creator><creator>Ziółkowski, Marcin</creator><general>Faculty of organization and informatics, University of Zagreb</general><general>Fakultet organizacije i informatike, Sveučilište u Zagrebu</general><general>Sveuciliste u Zagrebu, Fakultet Organizacije i Informatike</general><general>Fakultet organizacije i informatike Sveučilišta u Zagrebu</general><general>University of Zagreb, Faculty of organization and informatics</general><scope>AE2</scope><scope>BIXPP</scope><scope>REL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>VP8</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0003-3087-1694</orcidid><orcidid>https://orcid.org/0000-0001-8907-8813</orcidid></search><sort><creationdate>20210101</creationdate><title>Queueing Systems with Random Volume Customers and their Performance Characteristics</title><author>Tikhonenko, Oleg ; Ziółkowski, Marcin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c388t-e031a9e4a0f70c44563eeb01407ebc9036161ba0b219357f8592febd26ba4e923</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>buffer space capacity</topic><topic>Communication networks</topic><topic>Customers</topic><topic>customer’s volume</topic><topic>Homogeneity</topic><topic>loss probability</topic><topic>Marketing / Advertising</topic><topic>Queuing theory</topic><topic>Stochastic processes</topic><topic>total volume</topic><topic>volume unit loss probability</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Tikhonenko, Oleg</creatorcontrib><creatorcontrib>Ziółkowski, Marcin</creatorcontrib><collection>Central and Eastern European Online Library (C.E.E.O.L.) (DFG Nationallizenzen)</collection><collection>CEEOL: Open Access</collection><collection>Central and Eastern European Online Library - CEEOL Journals</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Hrcak: Portal of scientific journals of Croatia</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>Journal of Information and Organizational Sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Tikhonenko, Oleg</au><au>Ziółkowski, Marcin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Queueing Systems with Random Volume Customers and their Performance Characteristics</atitle><jtitle>Journal of Information and Organizational Sciences</jtitle><addtitle>Journal of Information and Organizational Sciences</addtitle><date>2021-01-01</date><risdate>2021</risdate><volume>45</volume><issue>1</issue><spage>21</spage><epage>38</epage><pages>21-38</pages><issn>1846-3312</issn><eissn>1846-9418</eissn><abstract>In the paper, we consider non-classical queueing systems with non-homogeneous customers. The non-homogeneity we treat in the following sense: in systems under consideration, we characterize each customer by random capacity (volume) that can have an influence on his service time. We analyze a stochastic process having the sense of the total volume of all customers present in the system at given time instant. Such analysis for different queueing systems with unlimited or limited total volume can be used in designing of nodes of computer and communication networks while determining their buffer space capacity. We discuss basic problems of the theory of these systems and their performance characteristics. We also present some examples and results for systems with random volume customers.</abstract><cop>Varazdin</cop><pub>Faculty of organization and informatics, University of Zagreb</pub><doi>10.31341/jios.45.1.2</doi><tpages>18</tpages><orcidid>https://orcid.org/0000-0003-3087-1694</orcidid><orcidid>https://orcid.org/0000-0001-8907-8813</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1846-3312 |
ispartof | Journal of Information and Organizational Sciences, 2021-01, Vol.45 (1), p.21-38 |
issn | 1846-3312 1846-9418 |
language | eng |
recordid | cdi_ceeol_journals_987394 |
source | DOAJ Directory of Open Access Journals; Alma/SFX Local Collection |
subjects | buffer space capacity Communication networks Customers customer’s volume Homogeneity loss probability Marketing / Advertising Queuing theory Stochastic processes total volume volume unit loss probability |
title | Queueing Systems with Random Volume Customers and their Performance Characteristics |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T18%3A52%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ceeol_doaj_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Queueing%20Systems%20with%20Random%20Volume%20Customers%20and%20their%20Performance%20Characteristics&rft.jtitle=Journal%20of%20Information%20and%20Organizational%20Sciences&rft.au=Tikhonenko,%20Oleg&rft.date=2021-01-01&rft.volume=45&rft.issue=1&rft.spage=21&rft.epage=38&rft.pages=21-38&rft.issn=1846-3312&rft.eissn=1846-9418&rft_id=info:doi/10.31341/jios.45.1.2&rft_dat=%3Cceeol_doaj_%3E987394%3C/ceeol_doaj_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2703967762&rft_id=info:pmid/&rft_ceeol_id=987394&rft_doaj_id=oai_doaj_org_article_9a2eb4f0db1c447184dc985bdea9f445&rfr_iscdi=true |