Jayaram, M. & Cytron, R. K. (1995). Efficient demultiplexing of network packets by automatic parsing. Tech. Rep. WUCS-95-21, Washington University, Department of Computer Science, One Brookings Drive, St. Louise, MO.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....efficiently demultiplexing incoming packets to application endpoints [13] A number of schemes to implement fast and efficient packet filters are available. These include the BSD Packet Filter (BPF) 12] the Mach Packet Filter (MPF) 21] PathFinder [1] demultiplexing based on automatic parsing [11], and the Dynamic Packet Filter (DPF) 3] Most existing demultiplexing strategies are implemented within the OS kernel. However, to optimally reduce ORB endsystem demultiplexing overhead requires a vertically integrated architecture that extends from the OS kernel to the application servants. ....

Mahesh Jayaram and Ron Cytron. Efficient Demultiplexing of Network Packets by Automatic Parsing. In Proceedings of the Workshop on Compiler Support for System Software (WCSSS 96), University of Arizona, Tucson, AZ, February 1996.

....specification language for Pathfinder focuses on performance, sacrificing some expressive power in the process. Cytron et al. have described a language for specifying protocols using context free grammars: they propose using tools such as yacc to compile such specifications into executable code [4]; however, they do not argue convincingly either for the need for the full generality of context free grammars, or for the practicality (with regards to speed) of the code that might be generated from their specifications. We use an approach that is fundamentally different from these. We start ....

R. K. Cytron and M. Jayaram, "Efficient Demultiplexing of Network Packets by Automatic Parsing", Proc. Workshop on Compiler Support for Systems Software, August 1996.

....criterion on a network packet is specified as byte code operations involving offset computations and comparisons that amount to a predicate on the packet contents. Recent systems have chosen other filter representations, most notably, grammar like descriptions in Pathfinder [2] and Jayaram Cytron [12]. Unlike previous systems, in which the filter specification hard codes the knowledge of a packet s layout, we propose to use refinement on types to automatically generate a low level specification. We first describe, using the packet description language, specifications that we are interested ....

....[15] BPF [14] MPF [21] DPF [9] and PathFinder [2] Of these, only MPF and PathFinder support efficient composition of filters, and they do so by looking for common prefixes in a low level representation rather than by using the layer structure of protocol stacks. Work by Jayaram and Cytron [12] applies context free grammars to packet filters in an attempt to gain composability and allow the specification of variable length fields. The generality of their approach forced them to use LR parsers to create recognizers for packets. Furthermore, since their language is a string of bits, ....

Mahesh Jayaram and Ron K. Cytron. Efficient demultiplexing of network packets by automatic parsing. In Proceedings of the Workshop on Compiler Support for System Software (WCSSS), 1996.

....efficiently demultiplexing incoming packets to application endpoints [41] A number of schemes to implement fast and efficient packet filters are available. These include the BSD Packet Filter (BPF) 42] the Mach Packet Filter (MPF) 43] PathFinder [44] demultiplexing based on automatic parsing [45], and the Dynamic Packet Filter (DPF) 40] As mentioned before, most existing demultiplexing strategies are implemented within the OS kernel. However, to optimally reduce ORB endsystem demultiplexing overhead requires a vertically integrated architecture that extends from the OS kernel to the ....

M. Jayaram and R. Cytron, "Efficient Demultiplexing of Network Packets by Automatic Parsing," in Proceedings of the Workshop on Compiler Support for System Software (WCSSS 96), (University of Arizona, Tucson, AZ), February 1996.

.... and was amenable to hardware implementation [2] and DPF enhanced Pathfinder s core model with dynamic code generation (DCG) to exploit runtime knowledge for even greater performance [7] An alternative approach to the imperative style of packet filtering was explored by Jayaram and Cytron [13]. A filter specification takes the form of a set of rules written as a context free grammar. An LR parser then interprets the grammar on the fly for each processed packet. More recent work on packet classification for layer four switching has focused on table based representations of predicate ....

....instruction) are known, we may perform constant folding to turn the instruction into a load immediate of a constant value. These optimizations play an important role in minimizing the computation performed. Consider the following example of unoptimized BPF code for the filter tcp[13] 7 = 0 : lh [12] r0 jne r0, #ETHERTYPE IP, L19 lb [23] r1 jne r1, #IPPROTO TCP, L19 lh [20] r2 and r2, 0x1fff, r3 jne r3, 0x0, L19 L7: li #13, r4 lb [14] r5 and r5, 0xf, r6 lsh r6, 0x2, r7 L11: add r4, r7, r8 L12: lb [r8 14] r9 L13: li #7, r10 and r9, r10, r11 L15: li #0, r12 L16: sub ....

Mahesh Jayaram and Ron K. Cytron. Efficient demultiplexing of network packets by automatic parsing. In Proceedings of the Workshop on Compiler Support for System Software (WCSSS), Tucson, AZ, February 1996.

....efficiently demultiplexing incoming packets to application endpoints [38] A number of schemes to implement fast and efficient packet filters are available. These include the BSD Packet Filter (BPF) 39] the Mach Packet Filter (MPF) 40] PathFinder [41] demultiplexing based on automatic parsing [42], and the Dynamic Packet Filter (DPF) 37] As mentioned before, most existing demultiplexing strategies are implemented within the OS kernel. However, to optimally reduce ORB endsystem demultiplexing overhead requires a vertically integrated architecture that extends from the OS kernel to the ....

M. Jayaram and R. Cytron, "Efficient Demultiplexing of Network Packets by Automatic Parsing," in Proceedings of the Workshop on Compiler Support for System Software (WCSSS 96), (University of Arizona, Tucson, AZ), February 1996.

....efficiently demultiplexing incoming packets to application endpoints [11] A number of schemes to implement fast and efficient packet filters are available. These include the BSD Packet Filter (BPF) 10] the Mach Packet Filter (MPF) 17] PathFinder [1] demultiplexing based on automatic parsing [9], and the Dynamic Packet Filter (DPF) 3] However, related work on demultiplexingdeals with lower layers of the protocol stack (transport layer and below) as opposed to the CORBA middleware. In addition, most of these demultiplexing strategies are implemented within the OS kernel. To optimally ....

Mahesh Jayaram and Ron Cytron. Efficient Demultiplexing of Network Packets by Automatic Parsing. Department of Computer Science TR-95-21, Washington University in St. Louis, July 1995.

....methods for cache and use outlining Table 2: Summary of Optimizations ber of schemes to implement fast and efficient packet filters are available. These include the BSD Packet Filter (BPF) 16] the Mach Packet Filter (MPF) 25] PathFinder [2] demultiplexing based on automatic parsing [15], and the Dynamic Packet Filter (DPF) 7] However, related work on demultiplexing deals with lower layers of the protocol stack (transport layer and below) as opposed to the CORBA middleware. In addition, most of these demultiplexing strategies are implemented within the OS kernel. 5 Concluding ....

Mahesh Jayaram and Ron Cytron. Efficient Demultiplexing of Network Packets by Automatic Parsing. In Proceedings of the Workshop on Compiler Support for System Software (WCSSS 96), University of Arizona, Tucson, AZ, February 1996.

....strategies is available at URL http: www.cs.wustl.edu schmidt GLOBECOM 97.ps.gz schemes to implement fast and efficient packet filters are available. These include the BSD Packet Filter (BPF) 12] the Mach Packet Filter (MPF) 20] PathFinder [1] demultiplexing based on automatic parsing [11], and the Dynamic Packet Filter (DPF) 3] Most existing demultiplexing strategies are implemented within the OS kernel. However, to optimally reduce ORB endsystem demultiplexing overhead requires a vertically integrated architecture that extends from the OS kernel to the application servants. ....

Mahesh Jayaram and Ron Cytron. Efficient Demultiplexing of Network Packets by Automatic Parsing. In Proceedings of the Workshop on Compiler Support for System Software (WCSSS 96), University of Arizona, Tucson, AZ, February 1996.

....efficiently demultiplexing incoming packets to application endpoints [33] A number of schemes to implement fast and efficient packet filters are available. These include the BSD Packet Filter (BPF) 34] the Mach Packet Filter (MPF) 35] PathFinder [36] demultiplexing based on automatic parsing [37], and the Dynamic Packet Filter (DPF) 31] As mentioned before, most existing demultiplexing strategies are implemented within the OS kernel. However, to optimally reduce ORB endsystem demultiplexing overhead requires a vertically integrated architecture that extends from the OS kernel to the ....

M. Jayaram and R. Cytron, "Efficient Demultiplexing of Network Packets by Automatic Parsing," in Proceedings of the Workshop on Compiler Support for System Software (WCSSS 96), (University of Arizona, Tucson, AZ), February 1996.

....efficiently demultiplexing incoming packets to application endpoints [35] A number of schemes to implement fast and efficient packet filters are available. These include the BSD Packet Filter (BPF) 36] the Mach Packet Filter (MPF) 37] PathFinder [38] demultiplexing based on automatic parsing [39], and the Dynamic Packet Filter (DPF) 34] As mentioned before, most existing demultiplexing strategies are implemented within the OS kernel. However, to optimally reduce ORB endsystem demultiplexing overhead requires a vertically integrated architecture that extends from the OS kernel to the ....

M. Jayaram and R. Cytron, "Efficient Demultiplexing of Network Packets by Automatic Parsing," in Proceedings of the Workshop on Compiler Support for System Software (WCSSS 96), (University of Arizona, Tucson, AZ), February 1996.

....filter composition: Different filter composition techniques have been investigated to achieve an efficient composition and detection of composite events. MPF [28] presented a filter composition algorithm for primitive events in the packet filtering environment. Deterministic Finite Automata [12, 6] and Petri Nets [5] discussed in Section 3.2) are alternatives for composition of composite events. # Efficient Internal Representation: As discussed in Section 3.2, the internal representation has a major impact on the performance of event filtering. For example, different arrangements of DAG ....

....A related optimization involves the use of automated compiler parsing and code generation techniques. In this approach, a finite automaton is created based upon combining a set of context free grammars that describe the composite filter expressions. A novel technique known as skip ahead parsing [12] is used to eliminate unnecessary access to data fields during the parsing operations. An advantage of this approach is that the generated code may be optimized using highly efficient compiler optimization technology. The drawback to using compilation tactics is the relatively high latency ....

Mahesh Jayaram, Ron K. Cytron, Douglas C. Schmidt, and George Varghese. Efficient Demultiplexing of Network Packets by Automatic Parsing. In Submitted to the ACM SIGPLAN '95 Conferenceon ProgrammingLanguage Design and Implementation. ACM, 1994.

....include parallel processing of composite filters, trie based filter composition, and context free grammar based filter composition using skip ahead parsing. Existing work has investigated several of these optimization techniques in the context of communication protocols [21] and packet filtering [12, 22]. However, there appears to be no comprehensive comparative study investigatingall three techniques in the context of DMP applications. ffl Parallel processing of composite filters: We are using shared memory multiprocessors (e.g. a 20 CPU SPARCcenter 2000) to improve event filtering ....

....A related optimization involves the use of automated compiler parsing and code generation techniques. In this approach, a finite automaton is created by combining a set of context free grammars that describe the composite filter expressions. A novel technique known as skip ahead parsing [22] is used to eliminate unnecessary access to data fields within a message. An advantage of this approach is that the generated code may be optimized using compiler optimization techniques. One drawback to using compilation is the relatively high latency required to compile and install, modify, or ....

M. Jayaram, R. K. Cytron, D. C. Schmidt, and G. Varghese, "Efficient Demultiplexing of Network Packets by Automatic Parsing," in Submitted to the ACMSIGPLAN'95 Conference on Programming LanguageDesign and Implementation, ACM, 1994.

.... [6] Object oriented frameworks are becoming increasingly popular as a means to simplify and automate the development and configuration of complex applications in domains such as graphical user interfaces [7, 8] databases [9] operating system kernels [10] and communication subsystems [11, 12]. The components in a framework typically include classes (such as message managers and timer based event managers, and connection maps [13] class hierarchies (such as an inheritance lattice of mechanisms for local and remote interprocess communication [14] class categories (such as a family ....

.... typically include classes (such as message managers and timer based event managers, and connection maps [13] class hierarchies (such as an inheritance lattice of mechanisms for local and remote interprocess communication [14] class categories (such as a family of concurrency mechanisms [12]) and objects (such as an event demultiplexer [15] By emphasizing the integration and collaboration of application specific and applicationindependent components, frameworks enable larger scale reuse of software, compared to reusing individual classes and stand alone functions. To illustrate ....

[Article contains additional citation context not shown here]

M. Jayaram, R. K. Cytron, D. C. Schmidt, and G. Varghese, "Efficient Demultiplexing of Network Packets by Automatic Parsing," in Submitted to the ACMSIGPLAN'95 Conference on ProgrammingLanguage Design and Implementation, ACM, 1994.

No context found.

Jayaram, M. & Cytron, R. K. (1995). Efficient demultiplexing of network packets by automatic parsing. Tech. Rep. WUCS-95-21, Washington University, Department of Computer Science, One Brookings Drive, St. Louise, MO.

No context found.

M. Jayaram and R. K. Cytron. Efficient Demultiplexing of Network Packets by Automatic Parsing. In ACMSIGPLAN '95 Conference on Programming Language Design and Implementation. ACM Press, 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC