Presentation 2012-03-09
A Reachability Ensuring Technique for A Scalable Wide-Area Routing Method
Shohei SHIMAMURA, Hiroya NAGAO, Takehiro MIYAO, Kazuyuki SHUDO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Today's EGPs are necessary that each router maintains routing information of O(N) against N ASes. It is the source of the problem of Routes Explosion in which routers run into abnormal operation due to memory overflow. This paper shows a method to reduce the amount of routing information. The method reduces space complexity by introducing the ideas of structured overlay network into EGP. Assuming that Internet is a scale-free network, the complexity is reduced from today's O(N) to O(logN) in the current results, but path length is O(NlogN). However, it is possible path length reduce to O(log^2N) with O(log^2N) routing information. Furthermore, our target is O(log N) as same as today's EGP.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Internet / routing protocol / structured overlay network
Paper # IN2011-170
Date of Issue

Conference Information
Committee IN
Conference Date 2012/3/1(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Networks (IN)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Reachability Ensuring Technique for A Scalable Wide-Area Routing Method
Sub Title (in English)
Keyword(1) Internet
Keyword(2) routing protocol
Keyword(3) structured overlay network
1st Author's Name Shohei SHIMAMURA
1st Author's Affiliation Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology()
2nd Author's Name Hiroya NAGAO
2nd Author's Affiliation Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology
3rd Author's Name Takehiro MIYAO
3rd Author's Affiliation Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology
4th Author's Name Kazuyuki SHUDO
4th Author's Affiliation Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology
Date 2012-03-09
Paper # IN2011-170
Volume (vol) vol.111
Number (no) 469
Page pp.pp.-
#Pages 6
Date of Issue