Effective search strategies for application-independent speedup in UDP demultiplexing

Joseph T. Dixon, Kenneth L. Calvert

Research output: Contribution to conferencePaperpeer-review

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 simulation, and executed more than 60 simulations to obtain our results.

Original languageEnglish
Pages468-474
Number of pages7
StatePublished - 1997
EventProceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97 - Las Vegas, NV, USA
Duration: Sep 22 1997Sep 25 1997

Conference

ConferenceProceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97
CityLas Vegas, NV, USA
Period9/22/979/25/97

ASJC Scopus subject areas

  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Effective search strategies for application-independent speedup in UDP demultiplexing'. Together they form a unique fingerprint.

Cite this