Co-design of an IPv6 protocol processing engine with sequential predicate logic invocations

Support of fast lookup of content addresses in IPv6 domains is an important feature for next generation network processing engines. While IPv6 forwarding and IPv6 transition microblocks may simplify the engineering efforts needed to support next generation routing solutions, there must be an efficient and fast mechanism for processing IPv6 headers prior to this. In this paper, we try to develop an IPv6 protocol processing engine based on sequential predicate logic invocations. The design, based on abstract state machines (ASM) logic, shows how the design features may help in resolving scalability issues for large scale IPv6 routing. The novelty of the approach lies in the formal predicate logic definition and synthesis of processing hardware and generation of physical design unit from the data-driven algorithm function computation at compile time

[1]  James R. Larus,et al.  Using Paths to Measure, Explain, and Enhance Program Behavior , 2000, Computer.

[2]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[3]  Boris Beizer,et al.  Software Testing Techniques , 1983 .

[4]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[5]  Eddie Kohler,et al.  Modular components for network address translation , 2002, 2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571).

[6]  Yannis Smaragdakis,et al.  JCrasher: an automatic robustness tester for Java , 2004, Softw. Pract. Exp..

[7]  EDDIE KOHLER,et al.  The click modular router , 2000, TOCS.

[8]  Patrice Godefroid,et al.  Model checking for programming languages using VeriSoft , 1997, POPL '97.