Balanced Neighbor Selection for BitTorrent-Like Networks

  • Sándor Laki
  • Tamás Lukovszki
Conference paper

DOI: 10.1007/978-3-642-40450-4_56

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8125)
Cite this paper as:
Laki S., Lukovszki T. (2013) Balanced Neighbor Selection for BitTorrent-Like Networks. In: Bodlaender H.L., Italiano G.F. (eds) Algorithms – ESA 2013. ESA 2013. Lecture Notes in Computer Science, vol 8125. Springer, Berlin, Heidelberg

Abstract

In this paper we propose a new way of constructing the evolving graph in BitTorrent (BT) as new peers join the system one by one. The maximum degree in the constructed graph will be O(1) while the diameter will remain O(ln n), with high probability, where n is the number of nodes. Considering a randomized upload policy, we prove that the distribution of b blocks on the overlay generated by our neighbor selection strategy takes O(b + ln n) phases only, with high probability, which is optimal up to a constant factor. It improves the previous upper bound of O(b + (ln n)2) by Arthur and Panigrahy (SODA’06). Besides theoretical analysis, thorough simulations have been done to validate our algorithm and demonstrate its applicability in the BT network.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Sándor Laki
    • 1
  • Tamás Lukovszki
    • 1
  1. 1.Faculty of InformaticsEötvös Loránd UniversityBudapestHungary

Personalised recommendations