Fundamentally scalable routing algorithms for Internet

Research Project

Project/Area Number	24650025
Research Category	Grant-in-Aid for Challenging Exploratory Research
Allocation Type	Single-year Grants
Research Field	Computer system/Network
Research Institution	Tokyo Institute of Technology
Principal Investigator	SHUDO Kazuyuki 東京工業大学, 情報理工学(系)研究科, 准教授 (90308271)
Project Period (FY)	2012-04-01 – 2014-03-31
Project Status	Completed (Fiscal Year 2013)
Budget Amount *help	¥3,770,000 (Direct Cost: ¥2,900,000、Indirect Cost: ¥870,000) Fiscal Year 2013: ¥2,210,000 (Direct Cost: ¥1,700,000、Indirect Cost: ¥510,000) Fiscal Year 2012: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Keywords	ネットワークアーキテクチャ / オーバレイネットワーク / インターネット / ルーティング / インターネットルーティング
Research Abstract	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.

Report

(3 results)