CAREER: Dynamic Processes and Network Algorithms

这项研究解决了网络和随机过程相交的几个问题，包括基于随机图的擦除和纠错码的设计，动态负载平衡方案的分析，以及研究万维网的大小和结构的新算法方法的发展。除了所有与网络设计和分析有关的问题外，这些问题都有一个共同的框架：它们可以嵌入到动态随机过程的模型中。因此，它们经常可以使用流体极限模型和Lyapunov分析等理论技术进行攻击。这项研究的一个主要目标是开发适当的框架来使用、改进和简化这些技术，以便它们可以更容易地应用于这些领域和其他领域。另一个主要目标是将理论与实践联系起来。例如，码的研究正被应用于可靠组播问题。延迟情况下的负载平衡模型正被应用于Web服务器系统。作为现代网络中理论工作和实际问题的一部分，PI正在计划开设一门新的研究生课程，涵盖信息检索、编码、密码学和压缩等问题。

AbstractPI: Michael MitzenmacherProposal Number: 9983832Institution: Harvard UniversityThis research addresses several problems in the intersection of networks and random processes, including the design of erasure and error-correcting codes based on random graphs, the analysis of dynamic load balancing schemes, and the development of new algorithmic approaches for studying the size and structure of the World Wide Web. These problems, besides all relating to the design and analysis of networks, share a common framework: they can be embedded into models of dynamic random processes. As such, they often can be attacked using theoretical techniques such as fluid limit models and Lyapunov analysis. A major goal of this research is to develop the proper framework for using, improving, and simplifying these techniques, so that they may be applied more easily in these and other areas.Another major goal of the proposed research is to connect theory and practice. For example, the research on codes is being applied to the problem of reliable multicast. The models for load balancing in the face of delay are being applied to systems of Web servers. As part of the effort to bridge theoretical work and practical problems in modern networks, the PI is planning a new graduate course that covers issues in information retrieval, codes, cryptography, and compression.