Dr. Do Young Eun has been awarded $366,928 by the National Science Foundation for research on NeTS: Small: Distributed and Efficient Randomized Algorithms for Large Networks.

The award will run from August 1st, 2012 to July 31st, 2015.

Research Abstract

Designing efficient and distributed algorithms has been central to almost all large networked systems. Examples include crawling-based sampling of large online social networks, statistical estimation or inference from massive scale of networked data, efficient searching algorithms in unstructured peer-to-peer networks, randomized routing and duty-cycling algorithm for better performance-energy tradeoff in wireless sensor networks, and distributed scheduling algorithms leading to maximal
throughput and smaller delay in multihop wireless networks, to list a few. Except for small-sized, static networks for which centralized design is not much of an issue, virtually all large networks necessarily demand distributed algorithms for inherent lack of global information and also randomized algorithms for autonomous load balancing and their resilience/robustness against possible points of failure/attacks, yet often with close-to-optimal performance.