Sciweavers

97 search results - page 6 / 20
» Scalable High Speed IP Routing Lookups
Sort
View
INFOCOM
2003
IEEE
14 years 7 hour ago
Adaptive Data Structures for IP Lookups
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...
Ioannis Ioannidis, Ananth Grama, Mikhail J. Atalla...
ICCD
2004
IEEE
76views Hardware» more  ICCD 2004»
14 years 3 months ago
Technique to Eliminate Sorting in IP Packet Forwarding Devices
This paper will present a solution to eliminate the requirements of sorting by prefix length in IP forwarding devices using Ternary Content Addressable Memories (TCAMs). This will...
Raymond W. Baldwin, Enrico Ng
SIGCOMM
2000
ACM
13 years 10 months ago
Memory-efficient state lookups with fast updates
Routers must do a best matching pre x lookup for every packet solutions for Gigabit speeds are well known. As Internet link speeds higher, we seek a scalable solution whose speed ...
Sandeep Sikka, George Varghese
CONEXT
2008
ACM
13 years 8 months ago
Efficient IP-address lookup with a shared forwarding table for multiple virtual routers
Virtual routers are a promising way to provide network services such as customer-specific routing, policy-based routing, multi-topology routing, and network virtulization. However...
Jing Fu, Jennifer Rexford
ICDCS
2008
IEEE
14 years 1 months ago
Scalable and Adaptive Metadata Management in Ultra Large-Scale File Systems
This paper presents a scalable and adaptive decentralized metadata lookup scheme for ultra large-scale file systems (≥ Petabytes or even Exabytes). Our scheme logically organiz...
Yu Hua, Yifeng Zhu, Hong Jiang, Dan Feng, Lei Tian