Performance analysis of mixed polling schemes with multiple classes of self-similar traffic input to build comprehensive SLAs

M. Iftikhar, M. Imran, Ghazi Al-Naymat, M. Alnuem, H. Mathkour
{"title":"Performance analysis of mixed polling schemes with multiple classes of self-similar traffic input to build comprehensive SLAs","authors":"M. Iftikhar, M. Imran, Ghazi Al-Naymat, M. Alnuem, H. Mathkour","doi":"10.1109/LCNW.2013.6758543","DOIUrl":null,"url":null,"abstract":"Solitary polling technique is not a better choice to get rid of multiple queuing problems for getting enhanced performance against single server. Enhanced and reliable performance upon multi queued traffic can be achieved through the utilization of right selection of joint polling schemes. The complexity of polling design is directly proportional to its performance. Exhaustive polling scheme is outperformed by limited service polling policy but under average load of traffic both contain same mean transfer delay. Several polling methods are the part of literature but the question of their optimal utilization in joint manners against multiple queue buffers is still open. In this paper, we build a complete analytical framework for mixed exhaustive and limited service polling model based on G/M/1 queuing system. We build the Markov chain and extract the closed form expressions of packet delay for multiple classes of self-similar traffic. We further experimentally implement four queues model with different arrangements of mixed polling schemes to conclude the most optimal joint polling model for modern 4G wireless network through analyzing the co-relation between delay and Hurst parameter.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"38th Annual IEEE Conference on Local Computer Networks - Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCNW.2013.6758543","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Solitary polling technique is not a better choice to get rid of multiple queuing problems for getting enhanced performance against single server. Enhanced and reliable performance upon multi queued traffic can be achieved through the utilization of right selection of joint polling schemes. The complexity of polling design is directly proportional to its performance. Exhaustive polling scheme is outperformed by limited service polling policy but under average load of traffic both contain same mean transfer delay. Several polling methods are the part of literature but the question of their optimal utilization in joint manners against multiple queue buffers is still open. In this paper, we build a complete analytical framework for mixed exhaustive and limited service polling model based on G/M/1 queuing system. We build the Markov chain and extract the closed form expressions of packet delay for multiple classes of self-similar traffic. We further experimentally implement four queues model with different arrangements of mixed polling schemes to conclude the most optimal joint polling model for modern 4G wireless network through analyzing the co-relation between delay and Hurst parameter.
基于多类自相似流量输入的混合轮询方案性能分析
孤立轮询技术并不是解决多个队列问题以获得针对单个服务器的增强性能的更好选择。通过正确选择联合轮询方案,可以提高多队列业务的可靠性能。轮询设计的复杂性与其性能成正比。穷举轮询方案优于有限服务轮询策略,但在平均流量负载下,两者的平均传输延迟相同。几种轮询方法是文献的一部分,但它们在联合方式下对多个队列缓冲区的最佳利用问题仍然是开放的。本文建立了基于G/M/1排队系统的混合穷举有限服务轮询模型的完整分析框架。我们建立了马尔可夫链,并提取了多类自相似流量的包延迟的封闭形式表达式。我们进一步实验实现了四种不同排列方式的混合轮询队列模型,通过分析时延与Hurst参数的相互关系,得出了现代4G无线网络最优的联合轮询模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信