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

Wu, Xiao, Li, Sun (2008) A Distributed Algorithm for Finding Global Icebergs with Linked Counting Bloom Filters (ICC'08)

December 23, 2008 paper

Objective: A collection of objects are stored in multiple hosts distributively such that each host only has a partial collection. The problem is to tell the icebergs amongst these objects without using centralised server. [more]

Kumar et al (2004) Space-Code Bloom Filter for Efficient Per-Flow Traffic Measurement (INFOCOM)

December 23, 2008 paper

Objective: Perform per-flow traffic measurement (error tolerated) in a high speed with limited memory. [more]

Lu et al (2007) ElephantTrap: A low cost device for identifying large flows (IEEE SHPI)

December 22, 2008 paper

An algorithm is proposed to detect elephant flows. It assumes the flow rates are under Pareto distribution and the algorithm is as follows: [more]

Mori et al (2004) Identifying Elephant Flows Through Periodically Sampled Packets (IMC'04)

December 22, 2008 paper

Attacking the elephant and mice phenomenon (the vital few and trivial many rule) in a high speed Internet, try to determine the elephant flows. The elephant flows in this paper is defined as those who consumes more than 0.1% of link bandwidth. [more]

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]