Fundamentally scalable routing algorithms for Internet

点击翻译按钮获取中文摘要

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.