Optimal server scheduling in hybrid P2P networks

B. Zhang, S.C. Borst, M.I. Reiman

Research output: Contribution to journalArticleAcademicpeer-review

5 Citations (Scopus)

Abstract

We consider the server scheduling problem in hybrid P2P networks in the context of a fluid model. Specifically, we examine how to allocate the limited amount of server upload capacity among competing swarms over time in order to optimize the download performance experienced by users. For sufficiently high user churn rate, we prove that it is optimal to allocate the full server capacity at all times, and that it does not matter exactly how the capacity is distributed among competing swarms as long as no upload capacity is unnecessarily left unused. While it may seem obvious that it is optimal to allocate the full server capacity, we show that this is not always the case surprisingly enough when the user churn rate is not high. In that case, throttling the server capacity slows down downloads in the short run, but also boosts the future peer upload capacity, and may thus lead to higher download speeds in the long term.
Original languageEnglish
Pages (from-to)1259-1272
JournalPerformance Evaluation
Volume67
Issue number11
DOIs
Publication statusPublished - 2010

Fingerprint Dive into the research topics of 'Optimal server scheduling in hybrid P2P networks'. Together they form a unique fingerprint.

  • Cite this