On Client’s Interactive Behaviour to Design Peer Selection Policies for Bittorrent-Like Protocols

Abstract

Peer-to-peer swarming protocols have been proven to be very efficient for content replication over Internet. This fact has certainly motivated proposals to adapt these protocols to meet the requirements of on-demand streaming system. The vast majority of these proposals focus on modifying the piece and peer selection policies, respectively, of the original protocols. Nonetheless, it is true that more attention has often been given to the piece selection policy rather than to the peer selection policy. Within this context, this article proposes a simple algorithm to be used as basis for peer selection policies of BitTorrent-like protocols, considering interactive scenarios. To this end, we analyze the client's interactive behaviour when accessing real multimedia systems. This analysis consists of looking into workloads of real content providers and assessing three important metrics, namely temporal dispersion, spatial dispersion and object position popularity. These metrics are then used as the main guidelines for writing the algorithm. To the best of our knowledge, this is the first time that the client's interactive behaviour is specially considered to derive an algorithm for peer selection policies. Finally, the conclusion of this article is drawn with key challenges and possible future work in this research field.

Improving BitTorrent's Peer Selection for Multimedia Content On-Demand Delivery

“…International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.6, November 2015 114 Changes on the characteristic (2) also appear in the work of Rocha & Rodrigues [21]. The rule for selecting peers prioritizes those presenting the lowest possible dispersion.…”

“…As mentioned by Rocha & Rodrigues [21], high interactive users tend to stay less time inside the swarm and consequently are likely to requests less data than peers streaming in a sequential fashion. Also, the segments of data requested are mostly dispersed over the media file, provoking a higher number of interruptions and therefore spending more time on slots for data download.…”

“…The second scheme defines that peers should be more altruistic by dynamically adjusting the number of their optimistic unchoke slots to their current QoS. Finally, the third scheme is related to the characteristic (2) as it prioritizes newcomers when performing optimistic unchokes, reducing the delay new peers may experience before starting the playback of the content.International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.6, November 2015 114 Changes on the characteristic (2) also appear in the work of Rocha & Rodrigues [21]. The rule for selecting peers prioritizes those presenting the lowest possible dispersion.…”

A new scheduling mechanism of BitTorrent streaming system based on improved PSO algorithm

“…Let N , k and t denote the total number of particles, the maximum iterations and the unchanged time of fitness value. Let j be the best particle meets formula (9). The IPSO-NPS algorithm is described as Algorithm 1.s …”

“…Currently, significant research effort has focused on the effective use of BT architecture to provide large-scale VoD services [7]- [9]. But there are still some shortcomings and deficiencies.…”