Efficient packet demultiplexing for multiple endpoints and large messages

  • Authors:
  • Masanobu Yuhara;Brian N. Bershad;Chris Maeda;J. Eliot B. Moss

  • Affiliations:
  • Fujitsu Laboratories Ltd., Kawasaki, Japan;Department of Computer Science and Engineering, University of Washington, Seattle, WA;School of Computer Science, Carnegie Mellon University, Pittsburgh, PA;Dept. of Computer Science, University of Massachusetts, Amherst, MA

  • Venue:
  • WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes a new packet filter mechanism that efficiently dispatches incoming network packets to one of multiple endpoints, for example address spaces. Earlier packet filter systems iteratively applied each installed filter against every incoming packet, resulting in high processing overhead whenever multiple filters existed. Our new packet filter provides an associative match function that enables similar but not identical filters to be combined together into a single filter. The filter mechanism, which we call the Mach Packet Filter (MPF), has been implemented for the Mach 3.0 operating system and is being used to support endpoint-based protocol processing, whereby each address space implements its own suite of network protocols. With large numbers of registered endpoints, MPF outperforms the earlier BSD Packet Filter (BPF) by over a factor of four. MPF also allows a filter program to dispatch fragmented packets, which was quite difficult with previous filter mechanisms.