PECASE: Associative Overlay Networks

PECASE：关联覆盖网络

• 批准号: 0133811
• 负责人: Ion Stoica
• 金额: $ 49.79万
• 依托单位: University of California-Berkeley
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2002
• 资助国家: 美国
• 起止时间: 2002-03-01 至 2007-02-28
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0133811&HistoricalAwards=false
• 关键词: PECASE; Associative; Overlay; Networks

Proposal Title: PECASE: Associative Overlay NetworksInstitution: University of California-BerkeleyIndirection plays a fundamental role in today's Internet. Existing solutions to provide mobility, anycast and multicast at the IP layer, and to provide web caching and server load balancing at the application layer, are based on indirection. In particular, these solutions assume a physical or logical indirection point that redirects the traffic to the destination(s). For instance, mobile IP assumes a home agent that hides the end-host mobility, while IP multicast assumes a logical indirection point (address) that hides the number of receivers and their locations. Unfortunately, the fact that IP does not provide efficient support for indirection makes it difficult and complex to deploy these solutions.The proposed research addresses this problem by developing a novel network architecture around the in-direction principle. In particular, the researcher proposes to replace the point-to-point communication abstraction used in today's networks with a rendezvous-based communication abstraction: instead of explicitly sending a packet to a destination, each packet is associated with an identifier, which is then used by the receiver to get the packet. This level of indirection decouples the sender and the receiver behaviors. The fact that the receiver is moving or that there are multiple receivers getting the same packet is transparent to the sender. Similarly, the fact that the sender is moving or that there are multiple senders sending packets with the same identifier is transparent to the receiver. This decoupling allows rendezvous-based networks to provide natural support for mobility, anycast and multicast. To demonstrate the feasibility of this approach, the researcher proposes to build and deploy an overlay network, called Associative Overlay Network (AON), that implements the rendezvous-based communication abstraction.The main goal of this research is twofold. First, the researcher aims to demonstrate the power and the flexibility of AON by showing that it can support the basic communication abstractions (e.g., multicast, anycast), and that it can greatly simplify the deployment of distributed applications such as service composition and reliable multicast. Second, the researcher plans to demonstrate that AON allows a scalable and efficient implementation, while offering performance similar to the overlay network systems designed around the traditional point-to-point communication abstraction. The researcher's solution leverages the previous work on the Chord lookup system [40], which is used as a building block to implement AON. This proposal discusses several possible approaches to achieve the goals of scalability, efficiency, and robustness, and formulates the main open problems. Among these problems are providing load balancing across AON nodes, supporting large scale multicast groups, and protecting against distributed denial of service attacks.The proposed research will make significant contributions to network architectures. The rendezvous-based communication is a fundamental departure from the point-to-point communication abstraction implemented by today's Internet. The researcher hopes that this change will trigger new and exciting research in computer networks similar to the way that tuple space abstraction did in distributed systems. We plan to deploy AON locally on the Millenium testbed and on the Internet-2 testbed, making it possible for other research groups to experiment with AON and implement applications on top of it.This project was originally funded as a CAREER award, and was converted to a Presidential Early Career Award for Engineers and Scientists (PECASE) award in May 2004.

提案标题：PECASE：协会覆盖网络固定：加利福尼亚大学 - 伯克利分校在当今的互联网中起着基本作用。现有的解决方案，可在IP层提供移动性，Anycast和多播以及在应用程序层提供Web缓存和服务器负载平衡，这是基于间接的。特别是，这些解决方案假设一个物理或逻辑间接点，将流量重定向到目的地。例如，移动IP假定隐藏终端移动性的房屋代理，而IP多播则假定隐藏接收器及其位置的逻辑间接点（地址）。不幸的是，IP不能为间接提供有效的支持，这一事实使得部署这些解决方案变得困难和复杂。拟议的研究通过围绕该方向原则开发新的网络体系结构来解决此问题。特别是，研究人员提议用基于集合的通信抽象替换当今网络中使用的点对点通信抽象：而不是明确地将数据包发送到目的地，而是与标识符相关联，然后由接收器使用该数据包来获取数据包。这种间接级别将发件人和接收器行为解开。接收器正在移动或有多个接收器获得相同数据包的事实对发件人透明。同样，发件人正在移动或有多个带有相同标识符的数据包的事实是对接收器的透明的。这种去耦允许基于集合的网络为移动性，任何广播和多播提供自然支持。为了证明这种方法的可行性，研究人员建议建立和部署一个称为“关联覆盖网络（AON）”的覆盖网络，该网络实现了基于聚会的通信抽象。这项研究的主要目标是双重的。首先，研究人员旨在通过证明它可以支持基本的交流摘要（例如，多播，Anycast）来证明AON的功能和灵活性，并且可以大大简化分布式应用程序的部署，例如服务组成和可靠的多播。其次，研究人员计划证明AON允许可扩展有效的实现，同时提供的性能类似于围绕传统的点对点通信抽象设计的覆盖网络系统。研究人员的解决方案利用了和弦查找系统的先前工作[40]，该系统被用作实施AON的构件。该提案讨论了达到可伸缩性，效率和鲁棒性目标的几种可能方法，并提出了主要的开放问题。这些问题包括提供跨AON节点的负载平衡，支持大规模的多播组，并防止分布式拒绝服务攻击。拟议的研究将为网络体系结构做出重大贡献。基于集合的通信是与​​当今互联网实施的点对点交流抽象的根本性。研究人员希望，这种变化将触发计算机网络中的新的令人兴奋的研究，类似于元组抽象在分布式系统中的方式。我们计划在千年测试台和Internet-2测试台上本地部署AON，这使得其他研究小组在IT之上进行实验并实施应用程序。该项目最初是作为职业奖项资助的，并在2004年5月获得了工程师和科学家（PECASE）奖的总统早期职业奖。