Discrete-time Analysis of Multicomponent GI/GI/1 Queueing Networks

Stefan Geissler, Stanislav Lange, T. Hossfeld, P. Tran-Gia
{"title":"Discrete-time Analysis of Multicomponent GI/GI/1 Queueing Networks","authors":"Stefan Geissler, Stanislav Lange, T. Hossfeld, P. Tran-Gia","doi":"10.14279/TUJ.ECEASST.80.1127","DOIUrl":null,"url":null,"abstract":"In this work, we provide initial insights regarding the error introduced into multicomponent queueing systems by assuming the departure processes of arbitrary GI/GI/1-oo queues to be renewal processes. To this end, we compute the sojourn time distribution as well as departure distributions of a linear chain of queueing components and compare the results to a simulation of the same system. By applying the renewal approximation, potential autocorrelations of the departure processes are lost. We investigate the magnitude of this error regarding both the sojourn time as well as interdeparture time distributions for a broad set of parameters. Although more indepth studies are needed, our results show that both distributions can be closely approximated, which allows the application of the model to asses the performance of real world NFV function chains.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14279/TUJ.ECEASST.80.1127","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this work, we provide initial insights regarding the error introduced into multicomponent queueing systems by assuming the departure processes of arbitrary GI/GI/1-oo queues to be renewal processes. To this end, we compute the sojourn time distribution as well as departure distributions of a linear chain of queueing components and compare the results to a simulation of the same system. By applying the renewal approximation, potential autocorrelations of the departure processes are lost. We investigate the magnitude of this error regarding both the sojourn time as well as interdeparture time distributions for a broad set of parameters. Although more indepth studies are needed, our results show that both distributions can be closely approximated, which allows the application of the model to asses the performance of real world NFV function chains.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多组分GI/GI/1排队网络的离散时间分析
在这项工作中,我们通过假设任意GI/GI/1-oo队列的出发过程是更新过程,对多组件排队系统中引入的错误提供了初步的见解。为此,我们计算了排队组件线性链的逗留时间分布和出发分布,并将结果与同一系统的模拟进行了比较。通过应用更新近似,失去了偏离过程的潜在自相关性。我们研究了关于逗留时间和间隔时间分布的这种误差的大小。虽然还需要更深入的研究,但我们的研究结果表明,这两种分布都可以接近,这使得该模型可以应用于评估现实世界NFV功能链的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Information Management for Multi-Agent Systems Towards SCION-enabled IXPs: The SCION Peering Coordinator Demonstration: A cloud-control system equipped with intrusion detection and mitigation Demo: Traffic Splitting for Tor - A Defense against Fingerprinting Attacks Preface and Table of Contents
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1