Sciweavers

6 search results - page 1 / 2
» Building Scalable Virtual Routers with Trie Braiding
Sort
View
INFOCOM
2010
IEEE
13 years 3 months ago
Building Scalable Virtual Routers with Trie Braiding
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
ICNP
2009
IEEE
13 years 11 months ago
Scalable IP Lookups using Shape Graphs
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
ICPADS
2002
IEEE
13 years 9 months ago
Experiences in Building a Scalable Distributed Network Emulation System
Network emulation systems are widely used to explore the behavior of network protocols and to test and evaluate protocol implementations and applications. The major problem of net...
Pei Zheng, Lionel M. Ni
CONEXT
2008
ACM
13 years 6 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
IPPS
2007
IEEE
13 years 10 months ago
Speculative Flow Control for High-Radix Datacenter Interconnect Routers
High-radix switches are desirable building blocks for large computer interconnection networks, because they are more suitable to convert chip I/O bandwidth into low latency and lo...
Cyriel Minkenberg, Mitchell Gusat