The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지
DOI QR코드

DOI QR Code

Process Algebra Based Formal Method for SDN Application Verification

SDN 응용 검증을 위한 프로세스 알지브라 기반 정형 기법

  • Received : 2014.05.30
  • Accepted : 2014.06.16
  • Published : 2014.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

Recently, there have been continuous efforts and progresses regarding the research on diverse network control and management platforms for SDN (Software Defined Networking). SDN is defined as a new technology to enable service providers/network operators easily to control and manage their networks by writing a simple application program. In SDN, incomplete or malicious programmable entities could cause break-down of underlying networks shared by heterogeneous devices and stake-holders. In this sense, any misunderstanding or diverse interpretations should be completely avoided. This paper proposes a new framework for SDN application verification and a prototype based on the formal method, especially with process algebra called pACSR which is an extended version of Algebra of Communicating Shared Resources (ACSR).

최근 SDN (Software Defined Networking) 기반의 다양한 네트워크 제어 및 관리 플랫폼들이 서비스제공자 및 통신사업자들에 의해 연구되고 있다. SDN의 중요한 특징 중 하나는 소프트웨어 프로그램으로 작성된 간단한 응용에 의해 네트워크가 쉽게 제어되고 관리된다는 점에 있다. 이러한 관점에서 잘못 작성된 SDN 응용은 네트워크 전체에 오류를 발생시킬 수 있어, 해당 응용은 작성된 오픈플로우 포워딩 규칙(rule)을 SDN 컨트롤러(controller)를 통해 스위치에 반영하기 전에 토폴로지와 네트워크 환경의 안전성(safety)과 일관성(consistency)이 반드시 검증되어야 한다. 본 논문에서는 SDN 응용 검증을 위한 프로세스 알지브라 (process algebra) 기반의 언어인 pACSR (Packet based Algebra of Communicating Shared Resources)와 이를 기반으로 한 정형 검증 프레임워크를 제안하고, 이에 대한 SDN 정형검증 도구 연구시제품 구현 현황을 기술한다.

Keywords

References

  1. ONF (Open Networking Foundation), OpenFlow Switch Specification Version 1.3, September, 2012, from https://www.opennetworking.org/.
  2. N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner, "Openflow: Enabling innovation in campus networks," SIGCOMM CCR, vol. 38, no. 2, pp. 69-74, 2008.
  3. E. Clarke and J. Wing, "Formal methods: State of the art and future directions," ACM Computing Surveys, vol. 28, no. 6, pp. 626-643, Dec. 1996. https://doi.org/10.1145/242223.242257
  4. D. Park, "Concurrency and automata on infinite sequences," in Proc. GI-Conf. Theoretical Comput. Sci., vol. 104, pp. 167-183, London, UK, Mar. 1981.
  5. R. Milner, Communication and concurrency, Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1989.
  6. E. M. Clarke, E. A. Emerson, and A. P. Sistla, "Automatic verification of finite-state concurrent systems using temporal logic specifications," ACM Trans. Programming Languages and Systems, vol. 8, pp. 244-263, 1986. https://doi.org/10.1145/5397.5399
  7. H. Kwak, J. Choi, I. Lee, and A. Philippou, "Symbolic weak bisimulation for valuepassing calculi," Technical Report, MS-CIS-98-22, Dept. Comput. Inf. Sci., Univ. of Pennsylvania, 1998.
  8. H. Kwak, I. Lee, and A. Philippou, and J. Choi, "Symbolic Schedulability Analysis of Real-time Systems," IEEE Real-Time Systems Symp., Dec., 1998.
  9. I. Lee, A. Philippou, and O. Sokolsky, "Resources in process algebra," J. Logic and Algebraic Programming, vol. 72, pp. 98-122, 2007. https://doi.org/10.1016/j.jlap.2007.02.005
  10. J. Choi, I. Lee, and H. Xie, "The specification and schedulability analysis of real-time systems using ACSR," in Proc. IEEE Real-Time Systems Symp., Dec. 1995.
  11. M. Kang, E. Kang, D. Hwang, B. Kim, K. Nam, M. Shin, and J. Choi, "Formal modelling and verification of SDN-OpenFlow," IEEE Conf. ICST, pp. 481-482, Luxembourg, Luxembourg, Mar. 2013.
  12. M-K. Shin, H. Kwak, J. Choi, and M. Kang, "VeriSDN: Formal verification for softwaredefined networking (SDN)," Telecommunication Rev., 2013.
  13. A. Khurshid, W. Zhou, M. Caesar, and P. B. Godfrey, "VeriFlow: Verifying network-wide invariants in real time," HotSDN'12, Helsinki, Finland, Aug. 2012.
  14. M. Canini, D. Venzano, P. Peresini, D. Kostic, and J. Rexford, "A NICE way to test OpenFlow applications," NSDI, Apr. 2012.
  15. H. Zeng, P. Kazemian, G. Varghese, and N. McKeown, "Formal network testing," 2012.
  16. N. Foster, R. Harrison, M. L. Meola, M. J. Freedman, J. Rexford, and D. Walker, "Frenetic: A high-level language for OpenFlow networks," in Proc. PRESTO'10, 2011.
  17. Frenetic project, from http://frenetic-lang.org/index.php.
  18. E. Al-Shaer and S. Al-Haj, "FlowChecker: Configuration analysis and verification of federated OpenFlow infrastructures," in Proc. SafeConfig'10, pp. 37-44, Oct. 2010.
  19. P. Kazemian, G. Varghese, and N. McKeown, "Header space analysis: Static checking for networks," USENIX Symp. Networked Systems Design and Implementation (NSDI '12), Apr. 2012.