Analysis of steady-state and transient delay in discrete-time single-arrival and batch-arrival systems
We perform an analysis of the transient delay in a discrete-time FIFO buffer with batch arrivals. As transient delay is an ambiguous concept, we first discuss different possible definitions of the term (delay of the kth customer, delay of a customer arriving at time t, etc.). In this paper, we focus...
Gespeichert in:
Veröffentlicht in: | Applied mathematics and computation 2014-08, Vol.240, p.62-71 |
---|---|
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 | 71 |
---|---|
container_issue | |
container_start_page | 62 |
container_title | Applied mathematics and computation |
container_volume | 240 |
creator | Walraevens, J. Claeys, D. Bruneel, H. |
description | We perform an analysis of the transient delay in a discrete-time FIFO buffer with batch arrivals. As transient delay is an ambiguous concept, we first discuss different possible definitions of the term (delay of the kth customer, delay of a customer arriving at time t, etc.). In this paper, we focus on the analysis of the delay of a customer arriving in slot t, also sometimes called virtual delay in single-arrival systems. It turns out that the modeling in batch-arrival systems is more intricate. In analysis, we relate transient delay to transient unfinished work and characterize the latter. Some time-dependent as well as limiting steady-state delay measures are calculated. We also study a variation that is related to active probing measurements. A substantial part of the article finally focuses on some fundamental differences between alternative definitions of transient delay. |
doi_str_mv | 10.1016/j.amc.2014.04.071 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1551088274</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0096300314006110</els_id><sourcerecordid>1551088274</sourcerecordid><originalsourceid>FETCH-LOGICAL-c373t-82f6d6a4c1ea3b7b8c8cbc10f822bdcd4bbe964ac4f1b59a35e7baf11b8cc0c43</originalsourceid><addsrcrecordid>eNp9kElLA0EQhRtRMC4_wNscvUzsmj14CsENAl703FR312iHWWJXJzD_3o4Rj8KDguJ9j6onxA3IOUio7jZz7M08k1DMZVQNJ2IGTZ2nZVUsTsVMykWV5lLm5-KCeSOlrCsoZqJdDthN7DgZ24QDoZ1SDhgowcEmwePAjoaQWOpwStyQWMfGU6A0uJ4SdsNHRyl67_bY_TAag_n82_AUQ3u-EmctdkzXv_NSvD8-vK2e0_Xr08tquU5NXuchbbK2shUWBghzXevGNEYbkG2TZdoaW2hNi6pAU7SgywXmJdUaW4DoNNIU-aW4PeZu_fi1Iw6qj_dS1-FA444VlCXIpsnqgxWOVuNHZk-t2nrXo58USHXoVG1U7FQdOlUyqobI3B8Zij_sHXnFJtZjyDpPJig7un_ob6S4geo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1551088274</pqid></control><display><type>article</type><title>Analysis of steady-state and transient delay in discrete-time single-arrival and batch-arrival systems</title><source>Access via ScienceDirect (Elsevier)</source><creator>Walraevens, J. ; Claeys, D. ; Bruneel, H.</creator><creatorcontrib>Walraevens, J. ; Claeys, D. ; Bruneel, H.</creatorcontrib><description>We perform an analysis of the transient delay in a discrete-time FIFO buffer with batch arrivals. As transient delay is an ambiguous concept, we first discuss different possible definitions of the term (delay of the kth customer, delay of a customer arriving at time t, etc.). In this paper, we focus on the analysis of the delay of a customer arriving in slot t, also sometimes called virtual delay in single-arrival systems. It turns out that the modeling in batch-arrival systems is more intricate. In analysis, we relate transient delay to transient unfinished work and characterize the latter. Some time-dependent as well as limiting steady-state delay measures are calculated. We also study a variation that is related to active probing measurements. A substantial part of the article finally focuses on some fundamental differences between alternative definitions of transient delay.</description><identifier>ISSN: 0096-3003</identifier><identifier>EISSN: 1873-5649</identifier><identifier>DOI: 10.1016/j.amc.2014.04.071</identifier><language>eng</language><publisher>Elsevier Inc</publisher><subject>Arrivals ; Buffers ; Computation ; Constraining ; Delay ; Generating functions ; Mathematical models ; Queueing theory ; Transient analysis ; Virtual delay</subject><ispartof>Applied mathematics and computation, 2014-08, Vol.240, p.62-71</ispartof><rights>2014 Elsevier Inc.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c373t-82f6d6a4c1ea3b7b8c8cbc10f822bdcd4bbe964ac4f1b59a35e7baf11b8cc0c43</citedby><cites>FETCH-LOGICAL-c373t-82f6d6a4c1ea3b7b8c8cbc10f822bdcd4bbe964ac4f1b59a35e7baf11b8cc0c43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.amc.2014.04.071$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids></links><search><creatorcontrib>Walraevens, J.</creatorcontrib><creatorcontrib>Claeys, D.</creatorcontrib><creatorcontrib>Bruneel, H.</creatorcontrib><title>Analysis of steady-state and transient delay in discrete-time single-arrival and batch-arrival systems</title><title>Applied mathematics and computation</title><description>We perform an analysis of the transient delay in a discrete-time FIFO buffer with batch arrivals. As transient delay is an ambiguous concept, we first discuss different possible definitions of the term (delay of the kth customer, delay of a customer arriving at time t, etc.). In this paper, we focus on the analysis of the delay of a customer arriving in slot t, also sometimes called virtual delay in single-arrival systems. It turns out that the modeling in batch-arrival systems is more intricate. In analysis, we relate transient delay to transient unfinished work and characterize the latter. Some time-dependent as well as limiting steady-state delay measures are calculated. We also study a variation that is related to active probing measurements. A substantial part of the article finally focuses on some fundamental differences between alternative definitions of transient delay.</description><subject>Arrivals</subject><subject>Buffers</subject><subject>Computation</subject><subject>Constraining</subject><subject>Delay</subject><subject>Generating functions</subject><subject>Mathematical models</subject><subject>Queueing theory</subject><subject>Transient analysis</subject><subject>Virtual delay</subject><issn>0096-3003</issn><issn>1873-5649</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNp9kElLA0EQhRtRMC4_wNscvUzsmj14CsENAl703FR312iHWWJXJzD_3o4Rj8KDguJ9j6onxA3IOUio7jZz7M08k1DMZVQNJ2IGTZ2nZVUsTsVMykWV5lLm5-KCeSOlrCsoZqJdDthN7DgZ24QDoZ1SDhgowcEmwePAjoaQWOpwStyQWMfGU6A0uJ4SdsNHRyl67_bY_TAag_n82_AUQ3u-EmctdkzXv_NSvD8-vK2e0_Xr08tquU5NXuchbbK2shUWBghzXevGNEYbkG2TZdoaW2hNi6pAU7SgywXmJdUaW4DoNNIU-aW4PeZu_fi1Iw6qj_dS1-FA444VlCXIpsnqgxWOVuNHZk-t2nrXo58USHXoVG1U7FQdOlUyqobI3B8Zij_sHXnFJtZjyDpPJig7un_ob6S4geo</recordid><startdate>20140801</startdate><enddate>20140801</enddate><creator>Walraevens, J.</creator><creator>Claeys, D.</creator><creator>Bruneel, H.</creator><general>Elsevier Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20140801</creationdate><title>Analysis of steady-state and transient delay in discrete-time single-arrival and batch-arrival systems</title><author>Walraevens, J. ; Claeys, D. ; Bruneel, H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c373t-82f6d6a4c1ea3b7b8c8cbc10f822bdcd4bbe964ac4f1b59a35e7baf11b8cc0c43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Arrivals</topic><topic>Buffers</topic><topic>Computation</topic><topic>Constraining</topic><topic>Delay</topic><topic>Generating functions</topic><topic>Mathematical models</topic><topic>Queueing theory</topic><topic>Transient analysis</topic><topic>Virtual delay</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Walraevens, J.</creatorcontrib><creatorcontrib>Claeys, D.</creatorcontrib><creatorcontrib>Bruneel, H.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Applied mathematics and computation</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Walraevens, J.</au><au>Claeys, D.</au><au>Bruneel, H.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Analysis of steady-state and transient delay in discrete-time single-arrival and batch-arrival systems</atitle><jtitle>Applied mathematics and computation</jtitle><date>2014-08-01</date><risdate>2014</risdate><volume>240</volume><spage>62</spage><epage>71</epage><pages>62-71</pages><issn>0096-3003</issn><eissn>1873-5649</eissn><abstract>We perform an analysis of the transient delay in a discrete-time FIFO buffer with batch arrivals. As transient delay is an ambiguous concept, we first discuss different possible definitions of the term (delay of the kth customer, delay of a customer arriving at time t, etc.). In this paper, we focus on the analysis of the delay of a customer arriving in slot t, also sometimes called virtual delay in single-arrival systems. It turns out that the modeling in batch-arrival systems is more intricate. In analysis, we relate transient delay to transient unfinished work and characterize the latter. Some time-dependent as well as limiting steady-state delay measures are calculated. We also study a variation that is related to active probing measurements. A substantial part of the article finally focuses on some fundamental differences between alternative definitions of transient delay.</abstract><pub>Elsevier Inc</pub><doi>10.1016/j.amc.2014.04.071</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0096-3003 |
ispartof | Applied mathematics and computation, 2014-08, Vol.240, p.62-71 |
issn | 0096-3003 1873-5649 |
language | eng |
recordid | cdi_proquest_miscellaneous_1551088274 |
source | Access via ScienceDirect (Elsevier) |
subjects | Arrivals Buffers Computation Constraining Delay Generating functions Mathematical models Queueing theory Transient analysis Virtual delay |
title | Analysis of steady-state and transient delay in discrete-time single-arrival and batch-arrival systems |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T20%3A54%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Analysis%20of%20steady-state%20and%20transient%20delay%20in%20discrete-time%20single-arrival%20and%20batch-arrival%20systems&rft.jtitle=Applied%20mathematics%20and%20computation&rft.au=Walraevens,%20J.&rft.date=2014-08-01&rft.volume=240&rft.spage=62&rft.epage=71&rft.pages=62-71&rft.issn=0096-3003&rft.eissn=1873-5649&rft_id=info:doi/10.1016/j.amc.2014.04.071&rft_dat=%3Cproquest_cross%3E1551088274%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1551088274&rft_id=info:pmid/&rft_els_id=S0096300314006110&rfr_iscdi=true |