∫ntegrabℓε ∂iﬀerentiαℓs · unorganised notes, code, and writings of random topics

Papagiannaki et al (2001) On the Feasibility of Identifying Elephants in Internet Backbone Traffic (Sprint TR)

December 22, 2008 paper

Objective: Identify elephant flows from all the flows, given the elephants and mice phenomenon (or mass-count disparity in statistics term) happens in the Internet. [more]

Griffiths, Livingood, Woundy (2008) Comcast's ISP Experiences In a Recent P4P Technical Trial (Internet Draft)

November 25, 2008 paper

P4P study by Comcast and Yale. [more]

Piatek et al (2007) Do incentives build robustness in BitTorrent? (NSDI'07)

November 24, 2008 paper

Free riders is a problem of P2P. In BT, peer list are unstructured and random, nothing to do for new arrival or departure of peers. The size of the active swarms is proportional to square root of upload capacity. [more]

Bram Cohen (2003) Incentives Build Robustness in BitTorrent (IPTPS'03)

November 18, 2008 paper

Problems of P2P download: Peers usually connects only for a few minutes and the fairness (i.e. upload rate proportional to download rate). [more]

Estan & Varghese (2002) New Directions in Traffic Measurement and Accounting (SIGCOMM and UCSD CD TR 699)

November 13, 2008 paper

Generalised flow: Identified by a function of the header field values, so that it is not constrained to 5-tuples. [more]