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