2013 Fiscal Year Final Research Report
Fundamentally scalable routing algorithms for Internet
| 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
|
| 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.
|
