突发MMPP流量下的综合调度方案建模

Lei Liu, X. Jin, G. Min
{"title":"突发MMPP流量下的综合调度方案建模","authors":"Lei Liu, X. Jin, G. Min","doi":"10.1109/WAINA.2009.155","DOIUrl":null,"url":null,"abstract":"Contemporary communication networks are expected to support multimedia services which require differentiated Quality-of-Services (QoS). To this end, many traffic scheduling schemes have been proposed and extensively studied. Recently, a hybrid scheduling discipline which integrates priority queueing and Generalized Processor Sharing (GPS) has been emerging as a promising scheme for QoS differentiation. In this paper, we present an analytical performance model for the integrated scheduling system under Markov Modulated Poisson Processes (MMPPs), which can qualitatively model the time-varying arrival rate and capture the important correlation between the inter-arrival times. We decompose the complex system into a group of single-server single-queue (SSSQ) systems at two steps. The first step is to divide the priority queueing level into a SSSQ system and a GPS system. At the second step, we adopt a bounding approach to decompose the GPS system into two SSSQ systems and derive the performance bounds for their queue length distributions. The comparison between analytical and simulation results validates the accuracy of the analytical model.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Modelling an Integrated Scheduling Scheme under Bursty MMPP Traffic\",\"authors\":\"Lei Liu, X. Jin, G. Min\",\"doi\":\"10.1109/WAINA.2009.155\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Contemporary communication networks are expected to support multimedia services which require differentiated Quality-of-Services (QoS). To this end, many traffic scheduling schemes have been proposed and extensively studied. Recently, a hybrid scheduling discipline which integrates priority queueing and Generalized Processor Sharing (GPS) has been emerging as a promising scheme for QoS differentiation. In this paper, we present an analytical performance model for the integrated scheduling system under Markov Modulated Poisson Processes (MMPPs), which can qualitatively model the time-varying arrival rate and capture the important correlation between the inter-arrival times. We decompose the complex system into a group of single-server single-queue (SSSQ) systems at two steps. The first step is to divide the priority queueing level into a SSSQ system and a GPS system. At the second step, we adopt a bounding approach to decompose the GPS system into two SSSQ systems and derive the performance bounds for their queue length distributions. The comparison between analytical and simulation results validates the accuracy of the analytical model.\",\"PeriodicalId\":159465,\"journal\":{\"name\":\"2009 International Conference on Advanced Information Networking and Applications Workshops\",\"volume\":\"75 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Advanced Information Networking and Applications Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WAINA.2009.155\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Advanced Information Networking and Applications Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WAINA.2009.155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

现代通信网络期望支持需要差异化服务质量(QoS)的多媒体业务。为此,人们提出了许多交通调度方案,并进行了广泛的研究。近年来,一种将优先级队列和通用处理器共享(GPS)相结合的混合调度方法成为一种很有前途的QoS区分方案。本文建立了马尔可夫调制泊松过程(MMPPs)下综合调度系统的分析性能模型,该模型可以定性地模拟时变的到达率,并捕捉到到达时间之间的重要相关性。我们分两步将复杂系统分解为一组单服务器单队列(SSSQ)系统。第一步是将优先级排队级别划分为SSSQ系统和GPS系统。第二步,我们采用边界方法将GPS系统分解为两个SSSQ系统,并推导出它们的队列长度分布的性能边界。分析结果与仿真结果的对比验证了分析模型的准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Modelling an Integrated Scheduling Scheme under Bursty MMPP Traffic
Contemporary communication networks are expected to support multimedia services which require differentiated Quality-of-Services (QoS). To this end, many traffic scheduling schemes have been proposed and extensively studied. Recently, a hybrid scheduling discipline which integrates priority queueing and Generalized Processor Sharing (GPS) has been emerging as a promising scheme for QoS differentiation. In this paper, we present an analytical performance model for the integrated scheduling system under Markov Modulated Poisson Processes (MMPPs), which can qualitatively model the time-varying arrival rate and capture the important correlation between the inter-arrival times. We decompose the complex system into a group of single-server single-queue (SSSQ) systems at two steps. The first step is to divide the priority queueing level into a SSSQ system and a GPS system. At the second step, we adopt a bounding approach to decompose the GPS system into two SSSQ systems and derive the performance bounds for their queue length distributions. The comparison between analytical and simulation results validates the accuracy of the analytical model.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信