TC
2010
13 years 10 months ago
2010
—A dynamic multiway segment tree (DMST) is proposed for IP lookups in this paper. DMST is designed for dynamic routing tables that can dynamically insert and delete prefixes. DMS...
CN
2000
14 years 8 days ago
2000
The dominant backbone protocol implemented in the Internet is the Border Gateway Protocol (BGP). Each router implementing BGP maintains a routing table. As networks increase in si...
CN
2004
14 years 9 days ago
2004
The sizes of the BGP routing tables have increased by an order of magnitude over the last six years. This dramatic growth of the routing table can decrease the packet forwarding sp...
CN
2007
14 years 13 days ago
2007
Soft-state is a well established approach to designing robust network protocols and applications. However it is unclear how to apply soft-state approach to protocols that must mai...
CAL
2007
14 years 13 days ago
2007
—The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. ...
MASCOTS
2000
14 years 1 months ago
2000
The memory resources required by network simulations can grow quadratically with size of the simulated network. In simulations that use routing tables at each node to perform perh...
CIC
2003
14 years 1 months ago
2003
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...
FPL
2008
Springer
14 years 2 months ago
2008
Springer
Most high-speed Internet Protocol (IP) lookup implementations use tree traversal and pipelining. However, this approach results in inefficient memory utilization. Due to available...
DSOM
2003
Springer
14 years 5 months ago
2003
Springer
Building self-maintained overlay networks for message routing has recently attracted significant research interest [5–9]. All suggested solutions have a common goal: To build an...
SENSYS
2003
ACM
14 years 5 months ago
2003
ACM
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...