使用隐马尔可夫模型建模P2P-TV流量

M. A. Garcia, Ana Paula Couto da Silva
{"title":"使用隐马尔可夫模型建模P2P-TV流量","authors":"M. A. Garcia, Ana Paula Couto da Silva","doi":"10.1109/INFCOMW.2009.5072165","DOIUrl":null,"url":null,"abstract":"We propose the use of discrete-time Hidden Markov model (DT-HMM) for representing the P2P-TV traffic. The objective is to develop synthetic traffic generators; or, in other terms, we aim at defining models whose generated synthetic traces are as much as possible “similar” to the real traces. Following the definition presented in [3], a Hidden-Markov model is a doubly embedded stochastic process with an underlying stochastic process that is not observable (it is hidden), but can only be observed through another stochastic process that produces a sequence of observations. In each state of the chain there is a different pattern of bitrate generation. The Hidden-Markov chain is derived by means of a training phase, during which the best fitting with the real trace is looked for. We refer the reader to [3] for a formal presentation of the DT-HMM.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Modeling P2P-TV Traffic Using Hidden Markov Models\",\"authors\":\"M. A. Garcia, Ana Paula Couto da Silva\",\"doi\":\"10.1109/INFCOMW.2009.5072165\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose the use of discrete-time Hidden Markov model (DT-HMM) for representing the P2P-TV traffic. The objective is to develop synthetic traffic generators; or, in other terms, we aim at defining models whose generated synthetic traces are as much as possible “similar” to the real traces. Following the definition presented in [3], a Hidden-Markov model is a doubly embedded stochastic process with an underlying stochastic process that is not observable (it is hidden), but can only be observed through another stochastic process that produces a sequence of observations. In each state of the chain there is a different pattern of bitrate generation. The Hidden-Markov chain is derived by means of a training phase, during which the best fitting with the real trace is looked for. We refer the reader to [3] for a formal presentation of the DT-HMM.\",\"PeriodicalId\":252414,\"journal\":{\"name\":\"IEEE INFOCOM Workshops 2009\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM Workshops 2009\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOMW.2009.5072165\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM Workshops 2009","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2009.5072165","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

我们建议使用离散时间隐马尔可夫模型(DT-HMM)来表示P2P-TV流量。目标是发展合成交通发电机;或者,换句话说,我们的目标是定义模型,其生成的合成轨迹尽可能与真实轨迹“相似”。根据[3]给出的定义,隐马尔可夫模型是一个双重嵌入的随机过程,其底层随机过程是不可观察的(它是隐藏的),但只能通过另一个产生一系列观察值的随机过程来观察。在链的每个状态中都有不同的比特率生成模式。隐马尔可夫链是通过一个训练阶段推导出来的,在这个阶段中,寻找与真实轨迹最拟合的隐马尔可夫链。我们建议读者参考[3]以获得DT-HMM的正式表示。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Modeling P2P-TV Traffic Using Hidden Markov Models
We propose the use of discrete-time Hidden Markov model (DT-HMM) for representing the P2P-TV traffic. The objective is to develop synthetic traffic generators; or, in other terms, we aim at defining models whose generated synthetic traces are as much as possible “similar” to the real traces. Following the definition presented in [3], a Hidden-Markov model is a doubly embedded stochastic process with an underlying stochastic process that is not observable (it is hidden), but can only be observed through another stochastic process that produces a sequence of observations. In each state of the chain there is a different pattern of bitrate generation. The Hidden-Markov chain is derived by means of a training phase, during which the best fitting with the real trace is looked for. We refer the reader to [3] for a formal presentation of the DT-HMM.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信