Packet Level Algorithms Computer Science数据包级算法计算机科学.pptVIP

Packet Level Algorithms Michael Mitzenmacher Goals of the Talk Consider algorithms/data structures for measurement/monitoring schemes at the router level. Focus on packets, flows. Emphasis on my recent work, future plans. “Applied theory”. Less on experiments, more on design/analysis of data structures for applications. Hash-based schemes Bloom filters and variants. Vision Three-pronged research data. Low: Efficient hardware implementations of relevant algorithms and data structures. Medium: New, improved data structures and algorithms for old and new applications. High: Distributed infrastructure supporting monitoring and measurement schemes. Background / Building Blocks Multiple-choice hashing Bloom filters Multiple Choices: d-left Hashing Split hash table into d equal subtables. To insert, choose a bucket uniformly for each subtable. Place item in a cell in the least loaded bucket, breaking ties to the left. Properties of d-left Hashing Analyzable using both combinatorial methods and differential equations. Maximum load very small: O(log log n). Differential equations give very, very accurate performance estimates. Maximum load is extremely close to average load for small values of d. Example of d-left hashing Consider 3-left performance. Example of d-left hashing Consider 4-left performance with average load of 6, using differential equations. Review: Bloom Filters Given a set S = {x1,x2,x3,…xn} on a universe U, want to answer queries of the form: Bloom filter provides an answer in “Constant” time (time to hash). Small amount of space. But with some probability of being wrong. Alternative to hashing with interesting tradeoffs. Bloom Filters False Positive Probability Pr(specific bit of filter is 0) is If r is fraction of 0 bits in the filter then false positive probability is Approximations valid as r is concentrated around E[r]. Martingale argument suffices. Find optimal at k = (ln 2)m/n by calculus. So optimal fpp is about (0.6185)m/n Example Ha