Sciweavers

85 search results - page 13 / 17
» Small Forwarding Tables for Fast Routing Lookups
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 7 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
ICN
2005
Springer
14 years 18 days ago
A Fast Path Recovery Mechanism for MPLS Networks
The major concept of the Multi-Protocol Label Switching (MPLS) network uses the Label Switch Path (LSP) technique that provides high performance in packet delivery without routing ...
Jenhui Chen, Chung-Ching Chiou, Shih-Lin Wu
CAL
2007
13 years 7 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
CCR
2007
86views more  CCR 2007»
13 years 7 months ago
An addressing independent networking structure favorable for all-optical packet switching
All-optical packet switching (AOPS) technology is essential to fully utilize the tremendous bandwidth provided by advanced optical communication techniques through forwarding pack...
Shengming Jiang
SIGCOMM
1998
ACM
13 years 11 months ago
Fast and Scalable Layer Four Switching
In Layer Four switching, the route and resources allocated to a packet are determined by the destination address as well as other header elds of the packet such as source address,...
Venkatachary Srinivasan, George Varghese, Subhash ...