{"title":"基于重要性抽样的MMPP/D/1队列丢包概率在线估计","authors":"Hung Nguyen Ngoc, K. Nakagawa","doi":"10.1145/3287921.3287928","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a new method to estimate the packet loss probability of the MMPP/D/1 queuing system by Importance Sampling (IS). In order to estimate rare event we do not increase the arrival rate of traffic, but we decrease service rate of queuing packet. In [5], the authors also proposed an online estimation for the tail probability of FIFO queue length. However, the authors used arrival process is a Poisson process, it is simpler than MMPP arrival process in our method. Finally, we implement our algorithm and compare accuracy and simulation time of our experiments to the Monte Carlo method (MC) and conventional IS method.","PeriodicalId":448008,"journal":{"name":"Proceedings of the 9th International Symposium on Information and Communication Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Online Estimation for Packet Loss Probability of MMPP/D/1 Queuing by Importance Sampling\",\"authors\":\"Hung Nguyen Ngoc, K. Nakagawa\",\"doi\":\"10.1145/3287921.3287928\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a new method to estimate the packet loss probability of the MMPP/D/1 queuing system by Importance Sampling (IS). In order to estimate rare event we do not increase the arrival rate of traffic, but we decrease service rate of queuing packet. In [5], the authors also proposed an online estimation for the tail probability of FIFO queue length. However, the authors used arrival process is a Poisson process, it is simpler than MMPP arrival process in our method. Finally, we implement our algorithm and compare accuracy and simulation time of our experiments to the Monte Carlo method (MC) and conventional IS method.\",\"PeriodicalId\":448008,\"journal\":{\"name\":\"Proceedings of the 9th International Symposium on Information and Communication Technology\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 9th International Symposium on Information and Communication Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3287921.3287928\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 9th International Symposium on Information and Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3287921.3287928","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Online Estimation for Packet Loss Probability of MMPP/D/1 Queuing by Importance Sampling
In this paper, we propose a new method to estimate the packet loss probability of the MMPP/D/1 queuing system by Importance Sampling (IS). In order to estimate rare event we do not increase the arrival rate of traffic, but we decrease service rate of queuing packet. In [5], the authors also proposed an online estimation for the tail probability of FIFO queue length. However, the authors used arrival process is a Poisson process, it is simpler than MMPP arrival process in our method. Finally, we implement our algorithm and compare accuracy and simulation time of our experiments to the Monte Carlo method (MC) and conventional IS method.