Vigoda, Eric - College of Computing, Georgia Institute of Technology

Advanced Search

Vigoda, Eric - College of Computing, Georgia Institute of Technology

Large-Scale IP Traceback in High-Speed Internet: Practical Techniques and Theoretical Foundation
Data Streaming Algorithms for Accurate and Efficient Measurement of Traffic and Flow Matrices
SpaceCode Bloom Filter for Efficient PerFlow Traffic Measurement
A Unified Proof of Minimum Time Complexity for Reaching Consensus and Uniform Consensus An Oracle-based Approach
Joint Data Streaming and Sampling Techniques for Detection of Super Sources and Destinations
Sustaining Availability of Web Services under Distributed Denial of Service Attacks
A Data Streaming Algorithm for Estimating Subpopulation Flow Size Distribution #
IP Traceback-based Intelligent Packet Filtering: A Novel Technique for Defending Against Internet DDoS Attacks
On the Computational Complexity of Maintaining GPS Clock in Packet Scheduling
Ulysses: A Robust, LowDiameter, LowLatency PeertoPeer Network
Sketch Guided Sampling --Using On-Line Estimates of Flow Size for Adaptive Data Collection
A Data Streaming Algorithm for Estimating Subpopulation Flow Size Distribution
Diagnosing Network Disruptions with Network-Wide Analysis Yiyi Huang, Nick Feamster, Anukool Lakhina, Jun (Jim) Xu
Finding Global Icebergs over Distributed Data Sets Qi (George) Zhao Mitsunori Ogihara Haixun Wang Jun (Jim) Xu
Design of a Novel Statistics Counter Architecture with Optimal Space and Time Efficiency
Space-Code Bloom Filter for Efficient Traffic Flow Measurement
On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer
On Fundamental Tradeoffs between Delay Bounds and Computational Complexity in Packet
Prefix-Preserving IP Address Anonymization: Measurement-based Security Evaluation and a New
Data Streaming Algorithms for Accurate and Efficient Measurement of Traffic and Flow Matrices
Efficient and Scalable Query Routing for Unstructured Peer-to-Peer Networks
A Unified Proof of Minimum Time Complexity for Reaching Consensus and Uniform Consensus --An Oraclebased Approach #
Data Streaming Algorithms for Estimating Entropy of Network Traffic
Robust Traffic Matrix Estimation with Imperfect Information: Making Use of Multiple Data Sources
On Fundamental Tradeoffs between Delay Bounds and Computational Complexity in Packet
On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in PeertoPeer
Ulysses: A Robust, Low-Diameter, Low-Latency Peer-to-Peer Network
PrefixPreserving IP Address Anonymization: Measurementbased Security Evaluation and a New
On the Computational Complexity of Maintaining GPS Clock in Packet Scheduling