Sciweavers

Share
TC
2010
8 years 7 months ago
Dynamic Multiway Segment Tree for IP Lookups and the Fast Pipelined Search Engine
—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...
Yeim-Kuan Chang, Yung-Chieh Lin, Cheng-Chien Su
CN
2000
126views more  CN 2000»
8 years 9 months ago
Cartesian routing
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...
Larry Hughes, Omid Banyasad, Evan J. Hughes
CN
2004
119views more  CN 2004»
8 years 9 months ago
On characterizing BGP routing table growth
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...
Tian Bu, Lixin Gao, Donald F. Towsley
CN
2007
96views more  CN 2007»
8 years 9 months ago
Persistent detection and recovery of state inconsistencies
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...
Lan Wang, Daniel Massey, Lixia Zhang
CAL
2007
8 years 9 months ago
Logic-Based Distributed Routing for NoCs
—The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. ...
José Flich, José Duato
MASCOTS
2000
8 years 10 months ago
Stateless Routing in Network Simulations
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...
George F. Riley, Mostafa H. Ammar, Richard Fujimot...
CIC
2003
140views Communications» more  CIC 2003»
8 years 10 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...
FPL
2008
Springer
107views Hardware» more  FPL 2008»
8 years 10 months ago
Scalable high-throughput SRAM-based architecture for IP-lookup using FPGA
Most high-speed Internet Protocol (IP) lookup implementations use tree traversal and pipelining. However, this approach results in inefficient memory utilization. Due to available...
Hoang Le, Weirong Jiang, Viktor K. Prasanna
DSOM
2003
Springer
9 years 2 months ago
An Epidemic Protocol for Managing Routing Tables in Very Large Peer-to-Peer Networks
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...
Spyros Voulgaris, Maarten van Steen
SENSYS
2003
ACM
9 years 2 months 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
books