A scheme based on network coding has been proposed for users to download linear combinations of file parts. Performance evaluation of such systems has typically been limited to comparing one system relative to another. The results obtained by the scheme give the minimal time required to fully disseminate a file of M parts from a server to N end users. A lower bound was provided which could be used as a performance benchmark for any P2P file dissemination system. A model of P2P file dissemination was analyzed and it was found that minimal makespan occurs when users have equal upload capacities. The upshare linking model is an abstract model focusing on the important features of P2P file dissemination in which each user can connect to every other user. Complicated interactions were ignored and it was assumed that the upload capacities impose the only constraints on the rates at which file file parts can be transferred.
ASJC Scopus subject areas
- Hardware and Architecture
- Computer Networks and Communications