Dissecting BitTorrent: Five Months in a Torrent's Lifetime

By M. Izal, Guillaume Urvoy-Keller, Ernst W. Biersack, Pascal Felber, Anwar Al Hamra, L. Garcés-Erice. Passive and Active Network Measurement Conference, 2004

584 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/91693e4f4a2443ccadb925f584951b17ccbc419e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Should internet service providers fear peer-assisted content distribution? (2005, methodology): “As reported in [9] the user-population exhibits clear flash-crowd behavior.”
An architecture for exploiting multi-core processors to parallelize network intrusion prevention (2007, unknown): “It has already been largely evaluated through analysis of large scale utilization [13, 11], analytical modeling [15] or simulation [2].”
Understanding churn in peer-to-peer networks (2006, methodology): “Although the Red Hat log has been studied by other researchers [4,11,13], to our knowledge these gaps have not been previously reported.”
Analyzing and Improving a BitTorrent Networks Performance Mechanisms (2006, methodology): “To derive realistic arrival patterns, we use the tracker log for the Redhat 9 distribution torrent [3].”
The Bittorrent P2P File-Sharing System: Measurements and Analysis (2005, methodology): “In [7], the log of a Bittorrent tracker is analysed; it shows for a single file the flashcrowd effect and download speed.”
Network coding for large scale content distribution (2005, background): “Rateless codes generate a practically infinite number of encoded packets, but they require slightly more thank packets for reconstruction.”
Rarest first and choke algorithms are enough (2006, methodology): “Our work differs from [14] in that we provide a thorough measurement-based analysis of the rarest first and choke algorithms.”
Improving Traffic Locality in BitTorrent via Biased Neighbor Selection (2006, methodology): “In the following discussion, we refer to the BitTorrent network using uniform random neighbor selection as “regular BitTorrent”, and the BitTorrent network using biased neighbor selection as “biased BitTorrent”.”
A Measurement Study of a Large-Scale P2P IPTV System (2007, methodology): “One important lesson learned from this study is that mesh-pull architectures are more correctly viewed as variations on BitTorrent rather than variations on tree-push architectures such as End-System Multicast (ESM) [4].”
A tool for the generation of realistic network workload for emerging networking scenarios (2012, methodology): “[62] M.”