Sciweavers

318 search results - page 31 / 64
» Understanding Route Redistribution
Sort
View
90
Voted
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
15 years 3 months ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
90
Voted
FPGA
2001
ACM
162views FPGA» more  FPGA 2001»
15 years 2 months ago
Reprogrammable network packet processing on the field programmable port extender (FPX)
A prototype platform has been developed that allows processing of packets at the edge of a multi-gigabit-per-second network switch. This system, the Field Programmable Port Extend...
John W. Lockwood, Naji Naufel, Jonathan S. Turner,...
IWCMC
2010
ACM
15 years 2 months ago
Cooperative contention-based forwarding for wireless sensor networks
Cooperative forwarding has been considered as an effective strategy for improving the geographic routing performance in wireless sensor networks (WSNs). However, we observe that ...
Long Cheng, Jiannong Cao, Canfeng Chen, Hongyang C...
108
Voted
WICON
2008
14 years 11 months ago
Towards distributed network classification for mobile ad hoc networks
Mobile ad hoc networks range from traditional MANETs where end-to-end paths exist from sources to destinations, to DTNs where no contemporaneous end-to-end paths exist and communi...
Dimitrios Antonellis, Ahmed Mansy, Konstantinos Ps...
98
Voted
CONEXT
2009
ACM
14 years 11 months ago
BUFFALO: bloom filter forwarding architecture for large organizations
In enterprise and data center networks, the scalability of the data plane becomes increasingly challenging as forwarding tables and link speeds grow. Simply building switches with...
Minlan Yu, Alex Fabrikant, Jennifer Rexford