A Data Reception Method to Reduce Interruption Time in P2P Streaming Environments

Hierarchical Architecture for Peer-to-Peer Video on Demand Systems with the Notion of Dynamic Swarms

“…Each peer divides the set of unacquired pieces into high priority set and low priority set by the closeness to the PP, and conducts a piece selection in the following two steps: 1) select one set with a certain probability, and 2) select a piece from the selected set according to the rarest first rule [2]. Although the piece selection rule adopted in BiToS is widely used in the literature [21], it is pointed out that in order to attain a satisfactory performance, the selection of pieces from the high priority set should be conducted so that both of the rareness and the closeness to the PP (within the high priority set) are taken into account [12].…”

“…A similar idea has been proposed in [1] so that the set of neighbors is dynamically divided into high priority group and low priority group, and in selecting the target of upload, it first selects a group with a certain probability and then selects requests in the descending order of the criticalness of the deadline. Appropriate selection of uploaders is also considered in the literature [12], [19]. In the method proposed in [19], each peer keeps the number of un-responded requests for each neighbor, and issues a request to a neighbor with the least un-responded requests.…”

“…Since any of previous schemes [1], [12], [15], [18], [19] concerned with match making do not use the overlay of SPs, we cannot directly compare them with the proposed scheme. Recall that the key idea of the proposed scheme is that: 1) it explicitly uses the data structure reflecting the difference of the status of piece acquisition, and 2) it explicitly conducts match making between requests and uploaders by using a hierarchical approach.…”

Adaptive Prefetching Scheme for Peer-to-Peer Video-on-Demand Systems with a Media Server

“…A remarkable feature of BiToS is that it does not rely on any media server, while techniques proposed there are also applicable to P2P VoDs with a media server. The piece selection rule in BiToS was further refined by many researchers; e.g., Zhou et al [11] proposed a mixed strategy consisting of several known rules and Sakashita et al [8] proposed a rule based on the rarity and the urgency of pieces. The reader should note that those piece selection rules can be used with our proposed scheme in a combined manner, since the objective of our scheme is to reduce the load of a media server rather than the increase of the efficiency of piece exchanges.…”

A Cost-Effective Buffer Map Notification Scheme for P2P VoDs Supporting VCR Operations

“…For example, to enhance the fluidity of fast-forward (and fast-backward) operations, the size of each piece must be much smaller than conventional P2P VoDs, and the support of the seek operation, which allows users to jump to arbitrary chapters in the video file, violates the assumption behind conventional P2P VoDs such that each peer tries to collect as many pieces close to the current playback position as possible [14], [16]. In each of the above two cases, precise identification of the buffer map of the neighbors would play a crucial role in efficiently supporting VCR function.…”