Sciweavers

214 search results - page 4 / 43
» Packet Reordering in Network Processors
Sort
View
ICNP
2003
IEEE
15 years 2 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...
CF
2004
ACM
15 years 3 months ago
A first glance at Kilo-instruction based multiprocessors
The ever increasing gap between processor and memory speed, sometimes referred to as the Memory Wall problem [42], has a very negative impact on performance. This mismatch will be...
Marco Galluzzi, Valentin Puente, Adrián Cri...
MASCOTS
2007
14 years 11 months ago
Improving the Performance of Passive Network Monitoring Applications using Locality Buffering
—In this paper, we present a novel approach for improving the performance of a large class of CPU and memory intensive passive network monitoring applications, such as intrusion ...
Antonis Papadogiannakis, Demetres Antoniades, Mich...
LCN
2003
IEEE
15 years 2 months ago
Implementation of Resilient Packet Ring Nodes Using Network Processors
Network processors offer a new flexibility for network applications and reduce the time to market for data processing systems. In this paper, we describe the changed development p...
Andreas Kirstädter, Axel Hof, Walter Meyer, E...
SIGMETRICS
2011
ACM
182views Hardware» more  SIGMETRICS 2011»
14 years 12 days ago
Fine-grained latency and loss measurements in the presence of reordering
Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate ...
Myungjin Lee, Sharon Goldberg, Ramana Rao Kompella...