Sciweavers

482 search results - page 11 / 97
» On routing table growth
Sort
View
SIGCOMM
2000
ACM
14 years 1 days ago
FIRE: Flexible intra-AS routing environment
Current routing protocols are monolithic, specifying the algorithm used to construct forwarding tables, the metric used by the algorithm (generally some form of hop-count), and th...
Craig Partridge, Alex C. Snoeren, W. Timothy Stray...
ICOIN
2001
Springer
14 years 4 days ago
Fast Update of Forwarding Tables in Internet Router Using AS Numbers
The updates of router forwarding tables can be made faster using the Autonomous System number corresponding to a prefix as an intermediate number between the prefix and the next...
Heonsoo Lee, Seokjae Ha, Yanghee Choi
P2P
2006
IEEE
130views Communications» more  P2P 2006»
14 years 1 months ago
The Effect of Replica Placement on Routing Robustness in Distributed Hash Tables
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...
Cyrus Harvesf, Douglas M. Blough
GLOBECOM
2009
IEEE
13 years 11 months ago
Scalable Support of Interdomain Routes in a Single AS
In this paper, we show a prototype implementation for a new architecture of supporting interdomain routes. It is widely recognized that the rapid growth of Internet is forcing a sc...
Cristel Pelsser, Akeo Masuda, Kohei Shiomoto
CIC
2003
140views Communications» more  CIC 2003»
13 years 9 months ago
Magic Square: Scalable Peer-to-Peer Lookup Protocol Considering Peer's Characteristics
One of the research problems in P2P computing is to look up and store the resource efficiently. The recent algorithms developed by several research groups for the lookup problem p...
Sun-Mi Park, Il-dong Jung, Dong-joo Song, Young-su...