Paving the way for NFV: Simplifying middlebox modifications using StateAlyzr

Proceedings of the 13th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2016

Volumn , Issue , 2016, Pages 239-253

  Khalid, Junaid ^a   Gember Jacobson, Aaron ^a   Michael, Roney ^a   Abhashkumar, Anubhavnidhi ^a   Akella, Aditya ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANCE; SYSTEMS ANALYSIS;

CODE MODIFICATIONS; INDEPENDENT SYSTEMS; INTERNAL STATE; LARGE AMOUNTS; NETWORK FUNCTIONS; NOVEL ALGORITHM; PACKET PROCESSING; PROGRAM ANALYSIS;

NETWORK FUNCTION VIRTUALIZATION;

EID: 85077076589     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. Codesurfer. http://grammatech.com/research/technologies/codesurfer.
2. HAProxy: The reliable, high performance TCP/HTTP load balancer. http://haproxy.1wt.eu/.
3. The LLVM compiler infrastructure. http://llvm. org.
4. Network functions virtualisation – update white paper. https://portal.etsi.org/nfv/nfv_white_paper2.pdf.
5. OpenVPN. http://openvpn.net.
6. Passive Real-time Asset Detection System. http://prads.projects.linpro.no.
7. Snort. http://snort.org.
8. Squid. http://squid-cache.org.
9. L. O. Andersen. Program analysis and specialization for the C programming language. PhD thesis, University of Cophenhagen, 1994.
10. V. Chipounov, V. Kuznetsov, and G. Candea. S2E: A platform for in-vivo multi-path analysis of software systems. In ASPLOS, 2011.
11. J.-D. Choi, M. Burke, and P. Carini. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In POPL, 1993.
12. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In ACM SIGPLAN-SIGACT, 1977.
13. L. De Carli, R. Sommer, and S. Jha. Beyond pattern matching: A concurrency model for stateful deep packet inspection. In Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pages 1378–1390. ACM, 2014.
14. M. Dobrescu and K. Argyarki. Software dataplane verification. In NSDI, 2014.
15. J. Ferrante, K. J. Ottenstein, and J. D. Warren. The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst., 9(3):319–349, July 1987.
16. A. Gember-Jacobson, R. Viswanathan, C. Prakash, R. Grandl, J. Khalid, S. Das, and A. Akella. OpenNF: Enabling innovation in network function control. In SIGCOMM, 2014.
17. K. He, A. Fisher, L. Wang, A. Gember, A. Akella, and T. Ristenpart. Next stop, the cloud: Understanding modern web service deployment in ec2 and azure. In Proceedings of the 2013 conference on Internet measurement conference, pages 177–190. ACM, 2013.
18. S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM Trans. Program. Lang. Syst., 12(1):26–60, Jan. 1990.
19. G. C. Hunt and M. L. Scott. The coign automatic distributed partitioning system. In OSDI, 1999.
20. M. Kablan, B. Caldwell, R. Han, H. Jamjoom, and E. Keller. Stateless network functions. In HotMiddlebox, 2015.
21. E. Kohler, R. Morris, B. Chen, J. Jannotti, and M. F. Kaashoek. The Click modular router. ACM Transactions on Computer Systems (TOCS), 18:263–297, 2000.
22. Y. G. Park and B. Goldberg. Escape analysis on lists. In PLDI, 1992.
23. V. Paxson. Bro: a system for detecting network intruders in real-time. In USENIX Security (SSYM), 1998.
24. S. Rajagopalan, D. Williams, and H. Jamjoom. Pico Replication: A high availability framework for middleboxes. In SoCC, 2013.
25. S. Rajagopalan, D. Williams, H. Jamjoom, and A. Warfield. Escape capsule: Explicit state is robust and scalable. In HotOS, 2013.
26. S. Rajagopalan, D. Williams, H. Jamjoom, and A. Warfield. Split/Merge: System support for elastic execution in virtual middleboxes. In NSDI, 2013.
27. T. Reps and G. Rosay. Precise interprocedural chopping. In ACM SIGSOFT, 1995.
28. C. Ruggieri and T. P. Murtagh. Lifetime analysis of dynamically allocated objects. In POPL, 1988.
29. E. J. Schwartz, T. Avgerinos, and D. Brumley. All you ever wanted to know about dynamic taint analysis and forward symbolic execution (but might have been afraid to ask). In IEEE Symposium on Security and Privacy, 2010.
30. J. Sherry, P. Gao, S. Basu, A. Panda, A. Krishnamurthy, C. Macciocco, M. Manesh, J. Martins, S. Ratnasamy, and L. R. S. Shenker. Rollback recovery for middleboxes. In SIGCOMM, 2015.
31. B. Steensgaard. Points-to analysis in almost linear time. In POPL, 1996.
32. E. Tilevich and Y. Smaragdakis. J-orchestra: Enhancing java programs with distribution capabilities. ACM Trans. Softw. Eng. Methodol., 19(1):1:1–1:40, Aug. 2009.
33. M. Weiser. Program slicing. IEEE Trans. on Software Engineering, SE-10(4):352–357, July 1984.