Large-scale, highly dynamic networks are increasingly dominant in the real world. Distributed algorithms that are robust, efficient, and secure are required. An important goal is to solve fundamental distributed computing problems with provable guarantees, under strong models. We have developed models, algorithms, and techniques that work even under a high amount of dynamism - however it requires properties, such as good expansion. A agenda for future work is to build on current framework to design even stronger algorithms that work with minimal assumptions.
展开▼
