File Sharing-Based Heuristics for Flow Assignment in P2P Systems

In recent years peer-to-peer (P2P) systems gain much attention. Growing popularity in P2P based protocol implementations for file sharing purposes caused that the P2P traffic exceeds Web traffic, once of the dominant traffic on the Internet. In fact of that, the use of P2P systems introduce many new problems related to traffic engineering or network optimization. In accordance to our previous works and defined linear models of flows and routing in system based on P2P architecture, this paper concerns on simulations of file sharing services in overlay-concept P2P network. Corresponding to bittorrent-based systems behaviour, in this work we consider different strategies for content distribution applications. We demonstrate the effectiveness of 5 modeled algorithms. Experimentation results compare transfer cost minimization in functions of seed location, "last peer" location and number of seeds in given mesh P2P topologies. For problem instances of small size we provide results with CPLEX solver.