Dynamic Estimation Algorithm for Markovian Model for Packet Loss

Islam Amro
{"title":"Dynamic Estimation Algorithm for Markovian Model for Packet Loss","authors":"Islam Amro","doi":"10.1109/EUROSIM.2013.106","DOIUrl":null,"url":null,"abstract":"In this Paper, we worked on the modeling of packet loss in EUMEDConnect Network (network connects 6 Arab countries) from the Palestinian side. This research exploited a data set of 72 hours. each country was expressed by a randomly selected 12-hour dataset, each dataset was divided into two-hour segments, each segment was modeled as a binary time series. From the 36 segments, 26 segments were found stationary. For Stationary segments, the research investigated the segment correlation and used it as a modeling reference. 11 segments were modeled using Bernoulli model, 12 segments were modeled using 2-state Markov chain and 5 segments showed k-th order Markov chain tendencies with orders 2, 3, 8, 27, 38. The models were built under 0.05 threshold in average filter condition of stationary and with confidence of 95% for lag dependency selection. After modeling each segment independently, an average loss model for each country was calculated using its modeled segments. confidence of these models were 95%. Afterward, we suggested a cumulative modeling algorithm through making a higher segmentation on shorter intervals less than 2 hours and give expectation for the models value for a given segment dynamically and cumulatively, this was achieved with error less than 0.001 for single segment.","PeriodicalId":386945,"journal":{"name":"2013 8th EUROSIM Congress on Modelling and Simulation","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 8th EUROSIM Congress on Modelling and Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EUROSIM.2013.106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this Paper, we worked on the modeling of packet loss in EUMEDConnect Network (network connects 6 Arab countries) from the Palestinian side. This research exploited a data set of 72 hours. each country was expressed by a randomly selected 12-hour dataset, each dataset was divided into two-hour segments, each segment was modeled as a binary time series. From the 36 segments, 26 segments were found stationary. For Stationary segments, the research investigated the segment correlation and used it as a modeling reference. 11 segments were modeled using Bernoulli model, 12 segments were modeled using 2-state Markov chain and 5 segments showed k-th order Markov chain tendencies with orders 2, 3, 8, 27, 38. The models were built under 0.05 threshold in average filter condition of stationary and with confidence of 95% for lag dependency selection. After modeling each segment independently, an average loss model for each country was calculated using its modeled segments. confidence of these models were 95%. Afterward, we suggested a cumulative modeling algorithm through making a higher segmentation on shorter intervals less than 2 hours and give expectation for the models value for a given segment dynamically and cumulatively, this was achieved with error less than 0.001 for single segment.
丢包马尔可夫模型的动态估计算法
在本文中,我们从巴勒斯坦方面研究了EUMEDConnect网络(连接6个阿拉伯国家的网络)中的丢包建模。这项研究利用了72小时的数据集。每个国家用随机选取的12小时数据集表示,每个数据集被分成两个小时的片段,每个片段被建模为二进制时间序列。在36个片段中,发现26个片段是静止的。对于平稳段,研究了段间的相关性,并将其作为建模参考。11段采用Bernoulli模型建模,12段采用2态马尔可夫链建模,5段表现为k阶马尔可夫链趋势,阶数分别为2、3、8、27、38。在平稳的平均滤波条件下,在0.05的阈值下建立模型,对滞后依赖选择的置信度为95%。在对每个部分独立建模之后,使用其建模的部分计算每个国家的平均损失模型。这些模型的置信度为95%。之后,我们提出了一种累积建模算法,通过在小于2小时的较短间隔内进行更高的分割,并动态地和累积地给出给定段的模型值的期望,这在单个段的误差小于0.001的情况下实现了。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信