{"title":"点对点流网络中动态缓冲的各种转发描述的服务可用性","authors":"Chow-Sing Lin, Jhe-Wei Lin","doi":"10.1109/PDCAT.2013.32","DOIUrl":null,"url":null,"abstract":"In P2P systems, because the buffer space of each peer is limited, most of P2P systems employ the cache-and-relay schemes that require each peer to cache the most recent video stream it receives. As long as the initial part of the video stream remains in its buffer, the peer can then relay the cached stream to late-arriving peers in a pipelining fashion and then the loading of a server is reduced. In our previous research work, we proposed a novel caching scheme for peer-to-peer on-demand streaming, called Dynamic Buffering, which relies on the feature of Multiple Description Coding to gradually reduce the number of cached descriptions in a peer once the buffer is full. In this paper we discuss service availability of a peer with dynamic buffering for various numbers of kinds of forwarded descriptions, and provide detailed analyses on how the number of kinds of forwarded descriptions affects average service availability of a peer. In addition, the mathematical formulas of the reduction of average service availability for various numbers of kinds of forwarded descriptions is derived. Our experiment results showed that the reduction of average service availability is only related to the number of kinds of forwarded descriptions.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Service Availability for Various Forwarded Descriptions with Dynamic Buffering on Peer-to-Peer Streaming Networks\",\"authors\":\"Chow-Sing Lin, Jhe-Wei Lin\",\"doi\":\"10.1109/PDCAT.2013.32\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In P2P systems, because the buffer space of each peer is limited, most of P2P systems employ the cache-and-relay schemes that require each peer to cache the most recent video stream it receives. As long as the initial part of the video stream remains in its buffer, the peer can then relay the cached stream to late-arriving peers in a pipelining fashion and then the loading of a server is reduced. In our previous research work, we proposed a novel caching scheme for peer-to-peer on-demand streaming, called Dynamic Buffering, which relies on the feature of Multiple Description Coding to gradually reduce the number of cached descriptions in a peer once the buffer is full. In this paper we discuss service availability of a peer with dynamic buffering for various numbers of kinds of forwarded descriptions, and provide detailed analyses on how the number of kinds of forwarded descriptions affects average service availability of a peer. In addition, the mathematical formulas of the reduction of average service availability for various numbers of kinds of forwarded descriptions is derived. Our experiment results showed that the reduction of average service availability is only related to the number of kinds of forwarded descriptions.\",\"PeriodicalId\":187974,\"journal\":{\"name\":\"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDCAT.2013.32\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2013.32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Service Availability for Various Forwarded Descriptions with Dynamic Buffering on Peer-to-Peer Streaming Networks
In P2P systems, because the buffer space of each peer is limited, most of P2P systems employ the cache-and-relay schemes that require each peer to cache the most recent video stream it receives. As long as the initial part of the video stream remains in its buffer, the peer can then relay the cached stream to late-arriving peers in a pipelining fashion and then the loading of a server is reduced. In our previous research work, we proposed a novel caching scheme for peer-to-peer on-demand streaming, called Dynamic Buffering, which relies on the feature of Multiple Description Coding to gradually reduce the number of cached descriptions in a peer once the buffer is full. In this paper we discuss service availability of a peer with dynamic buffering for various numbers of kinds of forwarded descriptions, and provide detailed analyses on how the number of kinds of forwarded descriptions affects average service availability of a peer. In addition, the mathematical formulas of the reduction of average service availability for various numbers of kinds of forwarded descriptions is derived. Our experiment results showed that the reduction of average service availability is only related to the number of kinds of forwarded descriptions.