Fundamentally scalable routing algorithms for Internet

我们引入对等，特别是结构化覆盖相关的思想到路由的广域网为代表的互联网。覆盖的想法可能从根本上实现可扩展的互联网路由。设N为节点数。我们设计的一个算法实现了O（log 2N）的信息，每个节点必须存储，而现有的算法要求每个节点存储O（N）的信息。我们还开发了一个模拟器，并研究了在网络交换机/路由器中实现的可能性。

We introduce peer-to-peer, especially structured overlay related ideas into routing on wide-area networks represented by Internet. Overlay ideas possiblly enable fundamentally scalable Internet routing. Let N be the number of nodes. An algorithm we designed achieves O(log2 N) information that each node has to store though existing algorithms require each node to store O(N) information. We also developed a simulator and examined the possibility of implementation in a network switch / router.