{"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.