Sciweavers

482 search results - page 10 / 97
» On routing table growth
Sort
View
BROADNETS
2007
IEEE
14 years 2 months ago
Scheduling routing table calculations to achieve fast convergence in OSPF protocol
Fast convergence to topology changes is a key requirement in modern routing infrastructure while reducing the protocol CPU overhead continues to be as important as before. In this...
Mukul Goyal, Weigao Xie, Mohd Soperi, Seyed H. Hos...
P2P
2007
IEEE
153views Communications» more  P2P 2007»
14 years 1 months ago
On Routing in Distributed Hash Tables
There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are ...
Fabius Klemm, Sarunas Girdzijauskas, Jean-Yves Le ...
SENSYS
2003
ACM
14 years 28 days ago
Model-based compression in wireless ad hoc networks
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak
EUROMICRO
2004
IEEE
13 years 11 months ago
Multi-Homing Tunnel Broker
A proper support for communications has to provide fault tolerance capabilities such as the preservation of established connections in case of failures. Multi-homing addresses thi...
Marcelo Bagnulo, Juan Fco. Rodríguez-Hervel...
COMCOM
2002
82views more  COMCOM 2002»
13 years 7 months ago
High-performance IP routing table lookup
Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must
Pi-Chung Wang, Chia-Tai Chan, Yaw-Chung Chen