New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice
By Cristian Estan, George Varghese. TOCS, 2003
598 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/1a5bff15fdffa1205c0b1e6aa101158915dd8e87
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- S. Muthu Muthukrishnan
- Anna C. Gilbert
- Piotr Indyk
- Michael M. Mitzenmacher
- D. Agrawal
- A. El Abbadi
- Ahmed Metwally
- Qun Huang
In Computer Networks and Communications
- S. Muthu Muthukrishnan
- Michael M. Mitzenmacher
- Changhoon Kim
- Anirudh Sivaraman
- Mohammad Alizadeh
- Anna C. Gilbert
- Piotr Indyk
- Hari Balakrishnan
Citations in the corpus
- Efficient Computation of Frequent and Top-k Elements in Data Streams (2005, methodology): “The bound of Theorem 3 is tighter than those guaranteed by the algorithms in [18, 35, 39].”
- Data streams: algorithms and applications (2005, background): “This is reminiscent of robust approximation, but there is a technical distinction: the O ( k polylog(n)) facility solution does not seem to have the robustness property.”
- Less hashing, same performance: Building a better Bloom filter (2006, background): “filters keep function values associated with set elements (thereby offering more than set membership) [5], Count-Min sketches [6] and multistage filters [ 12 ] track counts associated with items, and approximate concurrent state machines track the dynamically changing state of a changing set of item”
- An Overview of IP Flow-Based Intrusion Detection (2010, unknown): “[33] that accurately accounts for large flows.”
- Sparse Recovery Using Sparse Matrices (2010, background): “, [18] and [30] for more information about using data stream algorithms for network measurement.”
- Packet Transactions: High-Level Programming for Line-Rate Switches (2015, background): “Examples include active queue management [53, 52, 67, 74, 76], scheduling [88], congestion control with switch feedback [64, 93, 60, 28], network measurement [98, 51, 50], security [34], and traffic load balancing [27].”
- SketchVisor: Robust Network Measurement for Software Packet Processing (2017, background): “[48] combine flow sampling and sample-and-hold [19] as primitives for various measurement applications.”