• DocumentCode
    1886143
  • Title

    Disconnecting to connect: Understanding optimistic disconnection in BitTorrent

  • Author

    Lehmann, Matheus B. ; Müller, Lucas F. ; Antunes, Rodolfo S. ; Barcellos, Marinho P.

  • Author_Institution
    Inst. of Inf., Fed. Univ. of Rio Grande do Sul, Porto Alegre, Brazil
  • fYear
    2012
  • fDate
    3-5 Sept. 2012
  • Firstpage
    138
  • Lastpage
    148
  • Abstract
    The significance of BitTorrent motivated various studies focused on modeling and evaluating the protocol characteristics and its current implementations in the Internet. So far, however, no work has investigated Optimistic Disconnect (OD), an ad hoc connection management mechanism widely employed in BitTorrent agents. OD allows a peer to search for “better” neighbors in the swarm by disconnecting peers from the current neighborhood and connecting to others. This paper presents an extensive experimental evaluation to study and quantify potential benefits of OD, such as average download time and topology robustness. We evaluate different scenarios and the impact of factors such as average peer reachability and arrival pattern. We found that OD generally improves the overall performance of the swarm (in up to 30% in the evaluated scenarios), while improving the robustness of its topology.
  • Keywords
    Internet; ad hoc networks; computer network management; peer-to-peer computing; protocols; reachability analysis; telecommunication network topology; BitTorrent agents; Internet; OD; ad hoc connection management mechanism; arrival pattern; average download time; average peer reachability; disconnecting peers; optimistic disconnection; protocol characteristics; topology robustness; Internet; Measurement; Network topology; Peer to peer computing; Proposals; Robustness; Topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Peer-to-Peer Computing (P2P), 2012 IEEE 12th International Conference on
  • Conference_Location
    Tarragona
  • Print_ISBN
    978-1-4673-2860-9
  • Electronic_ISBN
    978-1-4673-2861-6
  • Type

    conf

  • DOI
    10.1109/P2P.2012.6335793
  • Filename
    6335793