An ant-colony approach for the design of optimal chunk scheduling policies in live peer-to-peer networks

Peer-to-peer networks are self-organised communities over the internet infrastructure, in which peers are both clients and servers. The global resources of a peer-to-peer network increase proportionally with the population, promoting scalability. Peers are organised covering neighbouring-strategies and chunk-scheduling policies that determine the success of the cooperation scheme. In this paper, we address the design of chunk-scheduling policies in a cooperative scenario, assuming a complete mesh-topology under regime. All users wish to display a video channel with no cuts and low buffering times. We propose an in-depth analysis of this cooperative system, and develop the best chunk scheduling policy so far, found via a sophisticated ant-colony-based exploration. We introduce the new policy into a real platform. There, users wait five seconds to start watching following our new policy versus minutes in previous policies, with acceptable number of cuts.

[1]  György Dán,et al.  Delay and playout probability trade-off in mesh-based peer-to-peer streaming with delayed buffer map updates , 2010, Peer Peer Netw. Appl..

[2]  J. Deneubourg,et al.  Trails and U-turns in the Selection of a Path by the Ant Lasius niger , 1992 .

[3]  Rayadurgam Srikant,et al.  Modeling and performance analysis of BitTorrent-like peer-to-peer networks , 2004, SIGCOMM 2004.

[4]  Christian Blum,et al.  Ant colony optimization: Introduction and recent trends , 2005 .

[5]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[6]  Gerardo Rubino,et al.  GoalBit: the first free and open source peer-to-peer streaming network , 2009, LANC.

[7]  Vikraman Arvind,et al.  Algorithmic Problems for Metrics on Permutation Groups , 2008, SOFSEM.

[8]  Haibin Duan,et al.  Experimental study of the adjustable parameters in basic ant colony optimization algorithm , 2007, 2007 IEEE Congress on Evolutionary Computation.

[9]  Demetris Zeinalipour-Yazti,et al.  A Quantitative Analysis of the Gnutella Network Trac , 2002 .

[10]  G. Veciana,et al.  Fairness, incentives and performance in peer-to-peer networks , 2003 .

[11]  Thomas Stützle,et al.  Ant colony optimization , 2006, IEEE Computational Intelligence Magazine.

[12]  Franco Robledo Amoza,et al.  Systematic procedure for improving continuity and latency on a P2P streaming protocol , 2009, 2009 IEEE Latin-American Conference on Communications.

[13]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[14]  Franco Robledo,et al.  A Cooperative Network Game Efficiently Solved via an Ant Colony Optimization Approach , 2010, ANTS Conference.

[15]  Tayuan Huang,et al.  Metrics on Permutations, a Survey , 2004 .

[16]  Gustavo de Veciana,et al.  Service capacity of peer to peer networks , 2004, IEEE INFOCOM 2004.

[17]  John C. S. Lui,et al.  A Simple Model for Analyzing P2P Streaming Protocols , 2007, 2007 IEEE International Conference on Network Protocols.

[18]  Gerardo Rubino,et al.  A COP for cooperation in a P2P streaming protocol , 2009, 2009 International Conference on Ultra Modern Telecommunications & Workshops.

[19]  Ralf Steinmetz,et al.  Enabling resilient P2P video streaming: survey and analysis , 2011, Multimedia Systems.

[20]  John C. S. Lui,et al.  Exploring the optimal chunk selection policy for data-driven P2P streaming systems , 2009, 2009 IEEE Ninth International Conference on Peer-to-Peer Computing.

[21]  Marco Dorigo.  Ant colony optimization , 2004, Scholarpedia.

[22]  Temel Öncan,et al.  A comparative analysis of several asymmetric traveling salesman problem formulations , 2009, Comput. Oper. Res..

[23]  David E. Culler,et al.  PlanetLab: an overlay testbed for broad-coverage services , 2003, CCRV.