Analysis of peer-to-peer file dissemination amongst users of different upload capacities

J. Mundinger; R. R. Weber; G. Weiss

doi:10.1145/1168134.1168138

Analysis of peer-to-peer file dissemination amongst users of different upload capacities

J. Mundinger, R. R. Weber, G. Weiss

Department of Statistics

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	5-6
Number of pages	2
Journal	Performance Evaluation Review
Volume	34
Issue number	2
DOIs	https://doi.org/10.1145/1168134.1168138
State	Published - Sep 2006

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1145/1168134.1168138

Cite this

@article{a2984ad6760f42719bf50c62d678227b,

title = "Analysis of peer-to-peer file dissemination amongst users of different upload capacities",

abstract = "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.",

author = "J. Mundinger and Weber, {R. R.} and G. Weiss",

year = "2006",

month = sep,

doi = "10.1145/1168134.1168138",

language = "English",

volume = "34",

pages = "5--6",

journal = "Performance Evaluation Review",

issn = "0163-5999",

publisher = "Association for Computing Machinery (ACM)",

number = "2",

}

TY - JOUR

T1 - Analysis of peer-to-peer file dissemination amongst users of different upload capacities

AU - Mundinger, J.

AU - Weber, R. R.

AU - Weiss, G.

PY - 2006/9

Y1 - 2006/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33750337026&partnerID=8YFLogxK

U2 - 10.1145/1168134.1168138

DO - 10.1145/1168134.1168138

M3 - Article

AN - SCOPUS:33750337026

SN - 0163-5999

VL - 34

SP - 5

EP - 6

JO - Performance Evaluation Review

JF - Performance Evaluation Review

IS - 2

ER -

Analysis of peer-to-peer file dissemination amongst users of different upload capacities

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this