PPT-An Optimal Algorithm for Finding Heavy Hitters

Author : briana-ranney | Published Date : 2018-03-01

David Woodruff IBM Almaden Based on works with Vladimir Braverman Stephen R Chestnut Nikita Ivkin Jelani Nelson and Zhengyu Wang Streaming Model Stream of

Presentation Embed Code

Download Presentation

Download Presentation The PPT/PDF document "An Optimal Algorithm for Finding Heavy H..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

An Optimal Algorithm for Finding Heavy Hitters: Transcript

David Woodruff IBM Almaden Based on works with Vladimir Braverman Stephen R Chestnut Nikita Ivkin Jelani Nelson and Zhengyu Wang Streaming Model Stream of elements a 1 a. Xiaohua. Li and . Jeong. . Kyun. Lee. Department of Electrical and Computer Engineering . State University of New York at Binghamton . {xli,jlee54}@binghamton.edu . Major contributions. Develop efficient algorithm to construct optimal multi-hop path in arbitrarily large wireless networks. Li . Tak. Sing(. 李德成. ). Lectures 20-22. 1. Section 4.3.3 Well-founded orders. Well-founded. A . poset. is said to be well-founded if every descending chain of elements is finite. In this case, the partial order is called a well-founded order.. Vladimir . Braverman. . (JHU). Stephen R. . Chestnut . (ETH). Nikita . Ivkin. . (JHU). David P. . Woodruff . (IBM). Streaming Model. Stream of elements a. 1. , …, a. m. . in . [n] = {1, …, n. Abhilasha Seth. CSCE 669. Replacement Paths. G = (V,E) - directed graph with positive edge weights. ‘s’, ‘t’ - specified vertices. π. (s, t) - shortest path between them. Replacement Paths:. David Woodruff . IBM . Almaden. J. oint works with Arnab Bhattacharyya, Vladimir . Braverman. , Stephen R. Chestnut, . Palash. . Dey. Nikita . Ivkin. , Jelani Nelson, and . Zhengyu. Wang. Streaming Model. Take My yoke upon you, and learn from Me, for I am gentle and humble in heart; and you shall find rest for your souls. . For My yoke is easy, and My load is light.. Matthew 11:28-30, NASB. “Come Unto Me”. Omid Alipourfard. , Masoud Moshref, Minlan Yu. {. alipourf. , . moshrefj. , . minlanyu. }@. usc.edu. Software Switches are Popular. Data centers. : . “Use the cloud to manage the cloud”. Load balancer and Firewall on VMs. Vibhaalakshmi Sivaraman. Srinivas Narayana, Ori . RottenSTREICH. , MUTHU . MuthuKRSISHNAN. , JENNIFER REXFORD. 1. Heavy Hitter Flows. Flows above a certain threshold of total packets. “Top-. k. ” flows by size. David Woodruff . IBM . Almaden. J. oint works with Arnab Bhattacharyya, Vladimir . Braverman. , Stephen R. Chestnut, . Palash. . Dey. Nikita . Ivkin. , Jelani Nelson, and . Zhengyu. Wang. Streaming Model. By: Bill Walker. Naches Valley High School. Goal. .400 hitter. Expectations for the Players. Middle school to freshman. Freshman to JV. JV to Varsity. Varsity to All-league. All-league to All-State. All-State to college. David Woodruff . IBM . Almaden. J. oint works with Arnab Bhattacharyya, Vladimir . Braverman. , Stephen R. Chestnut, . Palash. . Dey. Nikita . Ivkin. , Jelani Nelson, and . Zhengyu. Wang. Streaming Model. Greedy algorithms, coin changing problem. Haidong. . Xue. Summer 2012, at GSU. What is a greedy algorithm?. Greedy algorithm. : “an algorithm always makes the choice that looks best at the moment”. Vibhaalakshmi Sivaraman. Srinivas Narayana, Ori . RottenSTREICH. , MUTHU . MuthuKRSISHNAN. , JENNIFER REXFORD. 1. Heavy Hitter Flows. Flows above a certain threshold of total packets. “Top-. k. ” flows by size. Or how to be 1-competitive with any set of strategies. Slides courtesy of . Avrim. Blum . Plan. Online Algorithms. Game Theory. Using “expert” advice. We solicit . N. “experts” for their advice. (Will the market go up or down?).

Download Document

Here is the link to download the presentation.
"An Optimal Algorithm for Finding Heavy Hitters"The content belongs to its owner. You may download and print it for personal use, without modification, and keep all copyright notices. By downloading, you agree to these terms.