Sciweavers

376 search results - page 38 / 76
» Hardware-Assisted Fast Routing
Sort
View
141
Voted
TON
2008
125views more  TON 2008»
15 years 2 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
ICNP
2003
IEEE
15 years 7 months ago
RR-TCP: A Reordering-Robust TCP with DSACK
TCP performs poorly on paths that reorder packets significantly, where it misinterprets out-of-order delivery as packet loss. The sender responds with a fast retransmit though no...
Ming Zhang, Brad Karp, Sally Floyd, Larry L. Peter...
104
Voted
GLOBECOM
2007
IEEE
15 years 8 months ago
OBIG: the Architecture of an Output Buffered Switch with Input Groups for Large Switches
—Large, fast switches require novel approaches to architecture and scheduling. In this paper, we propose the Output Buffered Switch with Input Groups (OBIG). We present simulatio...
Wladek Olesinski, Hans Eberle, Nils Gura
GISCIENCE
2010
Springer
166views GIS» more  GISCIENCE 2010»
15 years 2 months ago
Periodic Multi-labeling of Public Transit Lines
We designed and implemented a simple and fast heuristic for placing multiple labels along edges of a planar network. As a testbed, realworld data from Google Transit is taken: our ...
Valentin Polishchuk, Arto Vihavainen
140
Voted
SLIP
2005
ACM
15 years 8 months ago
A 3-D FPGA wire resource prediction model validated using a 3-D placement and routing tool
The interconnection architecture of FPGAs such as switches dominates performance of FPGAs. Three-dimensional integration of FPGAs overcomes interconnect limitations by allowing in...
Young-Su Kwon, Payam Lajevardi, Anantha P. Chandra...