Skip to main content

Eliminating Duplicated Paths to Reduce Computational Cost of Rule Generation by Using SDN

  • Conference paper
Computational Science and Its Applications – ICCSA 2014 (ICCSA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8584))

Included in the following conference series:

Abstract

Nowadays, SDN(Software Defined Network) has become a powerful technology that has abilities to program network flow paths into flow-table in switches for network control. In SDN architecture, data plane and control plane are decoupled, and then by manipulating flow-table on control plane network control is available. The function of SDN is used to supplement limitation or difficulties of other technologies. For example cloud computing system has difficulties to use existing security devices due to its dynamic and virtualization environment. For the solution, Cloudwatcher framework was designed. In Cloudwatcher, there are four algorithms to take network traffic to certain security node in cloud computing environment by using SDN. However when Cloudwatcher generates paths from source node to destination and security nodes, there is possibility of computational cost according to topology. In this paper, we propose an approach to reduce to the rule generation computation cost by excluding duplicated paths during rule generation time. Our evaluation results show that computation cost can be reduced by considerable amount according to topology environment.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ballard, J.R., Rae, I., Akella, A.: Extensible and scalable network monitoring using opensafe. In: Proc. INM/WREN (2010)

    Google Scholar 

  2. Fayazbakhsh, S.K., Sekar, V., Yu, M., Mogul, J.C.: FlowTags: enforcing network-wide policies in the presence of dynamic middlebox actions. In: Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, pp. 19–24. ACM (2013)

    Google Scholar 

  3. Qazi, Z.A., Tu, C.C., Chiang, L., Miao, R., Sekar, V., Yu, M.: SIMPLE-fying middlebox policy enforcement using SDN. In: Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM, pp. 27–38. ACM (2013)

    Google Scholar 

  4. Anwer, B., Benson, T., Feamster, N., Levin, D., Rexford, J.: A slick control plane for network middleboxes. In: Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, pp. 147–148. ACM (2013)

    Google Scholar 

  5. SDNCentral SDN Market Size report, http://www.sdncentral.com/sdn-market-size/

  6. Shin, S., Gu, G.: CloudWatcher: Network security monitoring using OpenFlow in dynamic cloud networks (or: How to provide security monitoring as a service in clouds?). In: 2012 20th IEEE International Conference on Network Protocols (ICNP), pp. 1–6. IEEE (2012)

    Google Scholar 

  7. AsiaCloudForum, Cloud security attacks – are public clouds at risk?, http://www.asiacloudforum.com/content/cloud-securityattacks-are-public-clouds-risk

  8. McKeown, N., Anderson, T., Balakrishnan, H., Parulkar, G., Peterson, L., Rexford, J., Turner, J.: OpenFlow: enabling innovation in campus networks. ACM SIGCOMM Computer Communication Review 38(2), 69–74 (2008)

    Article  Google Scholar 

  9. Gude, N., Koponen, T., Pettit, J., Pfaff, B., Casado, M., McKeown, N., Shenker, S.: NOX: towards an operating system for networks. ACM SIGCOMM Computer Communication Review 38(3), 105–110 (2008)

    Article  Google Scholar 

  10. Sezer, S., Scott-Hayward, S., Chouhan, P.K., Fraser, B., Lake, D., Finnegan, J., Rao, N.: Are we ready for SDN? Implementation challenges for software-defined networks. IEEE Communications Magazine 51(7) (2013)

    Google Scholar 

  11. Johnson, D.B.: A note on Dijkstra’s shortest path algorithm. Journal of the ACM (JACM) 20(3), 385–388 (1973)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Sim, JH., Kim, SH., Park, MW., Chung, TM. (2014). Eliminating Duplicated Paths to Reduce Computational Cost of Rule Generation by Using SDN. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2014. ICCSA 2014. Lecture Notes in Computer Science, vol 8584. Springer, Cham. https://doi.org/10.1007/978-3-319-09153-2_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09153-2_45

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09152-5

  • Online ISBN: 978-3-319-09153-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics