Bibudh Lahiri 3125 Coover Hall Department of Electrical & Computer Engineering Iowa State University, Ames, Iowa (515) 451-0307 (Mobile) (515) 294-6503 (Office)

Powered byIP2Location.com

About me

I am a PhD candidate and a Graduate Research Assistant in the Electrical and Computer Engineering Department of Iowa State University, where my advisors are Dr. Srikanta Tirthapura and Dr. Yong Guan. I earned my Bachelor's degree in Computer Science & Engineering from Jadavpur University, Kolkata, India and then worked in Tata Consultancy Services at Trivandrum, Kolkata and Manchester (UK) for four years. Here are my complete CV and a brief resume.

Research Interests

In general, my research focuses on distributed data stream algorithms and their applications. Currently I am working on:

• Data stream algorithms for detecting exploit patterns from network flows
• Distributed algorithms for data aggregation and data mining in P2P and wireless sensor networks

Here are a detailed proposal for my dissertation, "Detecting Exploit Patterns from Network Flows", and a few slides on it.

Refereed Conference Publications

"Finding Correlated Heavy-Hitters over Data Streams"(pdf), Bibudh Lahiri and Srikanta Tirthapura, accepted in the 28th IEEE International Performance Computing and Communications Conference (IPCCC), 2009

This article formalizes the notion of correlated heavy-hitters (CHH) for network data streams, and proposes a deterministic, one-pass, small-space approximation algorithm that solves this problem with provable guarantees on accuracy.

"Computing Frequent Elements using Gossip" (pdf), Bibudh Lahiri and Srikanta Tirthapura, in the Proceedings of the 15th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2008 (slides in ppt)

This article proposes randomized algorithms with probabilistic guarantees for identifying the frequently occurring data elements in a distributed database using gossip as the communication primitive.

Journal Papers (under review)

"Computing Frequent Items in a Network using Gossip", Bibudh Lahiri and Srikanta Tirthapura, submitted to the Journal of Distributed Computing (JPDC)

Book Chapters (invited)

"Stream Sampling", Bibudh Lahiri and Srikanta Tirthapura, published in Encyclopedia of Database Systems, by Springer Verlag GmbH

This article explains the application of random sampling techniques for computing various aggregates on massive data streams in small space with probabilistic guarantees on accuracy.

Projects

I've worked on several research and development projects in both academia and industry in the areas of Network Monitoring, Distributed Data Mining, Sensor Networks and Business Applications.

Activities

Apart from regular research and coursework, I participated in the following professional activities:

• Editorial Board Member, Springer
• The Internet Measurement Conference ( IMC 2009 ) at Chicago, Illinois, in November 2009.
• The Fifteenth International Colloquium on Structural Information and Communication Complexity ( SIROCCO 2008 ) at Villars-sur-Ollon, Switzerland in June 2008.
• Paper review for INFOCOM 2010, SIROCCO 2009, ICDCN 2009, LCN 2008, DCOSS 2008 and ICDCN 2008
• The Twenty-Sixth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing ( PODC 2007 ) in Portland, Oregon in August 2007. Alongwith Bojian Xu, Ryan LaFortune and John McCall, I volunteered to work on the registration process.
• The workshops LOCALITY and DialM-POMC in Portland, Oregon in August 2007.
• The Graduate Research Workshop organised by the Department of Electrical & Computer Engineering, Iowa State University in April, 2007. I demonstrated a distributed directory application for tracking mobile objects in a wireless sensor network and a poster explaining the progress of our research and future directions.

Coursework

At Iowa State, I've taken courses in computer science, computer engineering, statistics and mathematics.

Trivia

My Erdös number is four, as derived from the following sequence of papers and their authors' names.

• "Disjoint Edges in Geometric Graphs" by Noga Alon and P Erdös, Discrete and Computational Geometry, 1989, vol 4
• "Tracking Join and Self-Join Sizes in Limited Storage" by Noga Alon, Phillip B. Gibbons, Yossi Matias and Mario Szegedy, PODS, 1999
• "Estimating simple functions on the union of data streams" by Phillip Gibbons and Srikanta Tirthapura, SPAA, 2001
• "Computing Frequent Elements using Gossip" by Bibudh Lahiri and Srikanta Tirthapura, SIROCCO, 2008

Personal

I suffer from an incurable genetic disorder known as wanderlust :-) ...visited a few countries (UK, Italy, Switzerland, France, Egypt, US, Colombia) in last few years. I am a photography enthusiast, and some of my recent pictures can be found in the following section. I'm a movie buff as well, and when I don't travel, I spend my leisure time watching movies. A list of my favourite movies can be found here.

Albums

The 4th of July Fireworks
The West Coast Trip

Travel

Copyright Notice

The copyrights for the above paper and article lie with the publishers. Please respect the publishers' rights.

Bibudh Lahiri
Department of Electrical & Computer Engineering
Iowa State University
3125 Coover Hall Ames, Iowa