Sciweavers

97 search results - page 5 / 20
» Scalable High Speed IP Routing Lookups
Sort
View
TC
2010
13 years 5 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
INFOCOM
2000
IEEE
13 years 11 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd

Publication
177views
15 years 5 months ago
Terabit Switching: A Survey of Techniques and Current Products
This survey paper explains the issues in designing terabit routers and the solutions for them. The discussion includes multi-layer switching, route caching, label switching, and ef...
Amit Singhal, Raj Jain
IPPS
2007
IEEE
14 years 1 months ago
Route Table Partitioning and Load Balancing for Parallel Searching with TCAMs
With the continuous advances in optical communications technology, the link transmission speed of Internet backbone has been increasing rapidly. This in turn demands more powerful...
Dong Lin, Yue Zhang 0006, Chengchen Hu, Bin Liu, X...
ICCCN
2007
IEEE
14 years 1 months ago
Reduce IP Address Fragmentation through Allocation
— The scalability of Internet addressing and routing has been a serious issue and becomes a more urgent problem today because of driving factors like IPv6. A radical impacting el...
Mei Wang, Larry Dunn, Wei Mao, Tao Chen