Title:
Effective Search Strategies for Application-Independent Speedup in UDP Demultiplexing
Effective Search Strategies for Application-Independent Speedup in UDP Demultiplexing
Author(s)
Dixon, Joseph T.
Calvert, Kenneth L.
Calvert, Kenneth L.
Advisor(s)
Editor(s)
Collections
Supplementary to
Permanent Link
Abstract
We present UDP datagram demultiplexing techniques that can yield potentially
substantial application-independent performance gains over BSD-derived UDP
implementations. Our demultiplexing strategies exploit local host and UDP
implementation features -- (1) how UDP processes connection-less datagrams,
(2) local host application as client or server, and (3) local host
application "density" -- resulting in straight-forward hash-based search
strategies that caused demultiplexing speedups as high as 24-to-1 over BSD's
one-behind cache. Furthermore, while past researchers have shown that
cache-based schemes yield little performance benefit for UDP, we show that
cache-based implementations can actually degrade demultiplexing performance.
Finally, we recommend simple, non-protocol altering local host modifications
for existing and future UDP implementations. We used four server traffic
traces and eight algorithms in our trace-driven simulations, and executed
more than 60 simulations to obtain our results.
Sponsor
Date Issued
1997
Extent
276318 bytes
Resource Type
Text
Resource Subtype
Technical Report