Approximation analysis of QoS metrics in a finite capacity queue for real-time communication

Masaaki Takano, K. Iida
{"title":"Approximation analysis of QoS metrics in a finite capacity queue for real-time communication","authors":"Masaaki Takano, K. Iida","doi":"10.1109/PACRIM.2011.6032964","DOIUrl":null,"url":null,"abstract":"Real-time communication services such as VoIP, IPTV, and streaming video continue to spread rapidly. Delay and packet loss strongly affects the quality of service of realtime communication services, though, so analyzing these performance metrics is essential. Such analysis is difficult, however, because of (1) the convolution of multiple arriving flows, which means we cannot use the memory-less property, and (2) the finite buffer size in routers. Therefore, we cannot obtain exact formulas for these metrics. In this paper, we propose an approximation analysis of nD/D/1/K. Through simulation experiments, we have investigated the effectiveness of this method.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2011.6032964","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Real-time communication services such as VoIP, IPTV, and streaming video continue to spread rapidly. Delay and packet loss strongly affects the quality of service of realtime communication services, though, so analyzing these performance metrics is essential. Such analysis is difficult, however, because of (1) the convolution of multiple arriving flows, which means we cannot use the memory-less property, and (2) the finite buffer size in routers. Therefore, we cannot obtain exact formulas for these metrics. In this paper, we propose an approximation analysis of nD/D/1/K. Through simulation experiments, we have investigated the effectiveness of this method.
实时通信有限容量队列中QoS指标的逼近分析
VoIP、IPTV、流媒体视频等实时通信业务持续快速发展。延迟和丢包严重影响实时通信服务的服务质量,因此分析这些性能指标是必要的。然而,这样的分析是困难的,因为(1)多个到达流的卷积,这意味着我们不能使用无内存属性,以及(2)路由器中的有限缓冲区大小。因此,我们无法得到这些度量的精确公式。本文提出了nD/D/1/K的近似分析。通过仿真实验,验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信