Layered Peer to Peer Streaming Using Hidden Markov Models.
Journal
Emerging Directions in Embedded and Ubiquitous Computing, EUC 2007 Workshops: TRUST, WSOC, NCUS, UUWSN, USN, ESO, and SECUBIQ, Taipei, Taiwan, December 17-20, 2007, Proceedings
Pages
136-145
Date Issued
2007
Author(s)
Abstract
A fundamental problem in peer-to-peer streaming is how to select peers from a large network to request their media data. Due to the heterogeneity and the time-varying features of shared resources between peers, an adaptive method is required to select suitable peers. In this paper, we use Hidden Markov Models (HMMs) to model each peer to reflect the variation of resources. Among peers with different HMMs, the one which produces the maximum observation probability is selected as the serving peer. Through simulation results, we show that the proposed algorithm can achieve a good streaming quality and low communication overhead. In addition to these characteristics, the proposed model also comes with the fairness property. © IFIP International Federation for Information Processing 2007.
Type
conference paper