Skip to main content

Secure Communication over Software-Defined Networks


We report on work in progress towards a practical implementation of a software defined overlay network that provides data delivery services at a freely definable and provably optimized quality of service. Our example implementation establishes transparent secure transmission, where security is in terms of confidentiality, authenticity and availability. Using general techniques from game-theory, we show how to simultaneously optimize several performance indicators of a transmission service, taking care of interdependencies and using security as a showcase application.

This is a preview of subscription content, access via your institution.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others


  1. We deviate from the standard setting in enterprise security, where integrity replaces authenticity. However, since authenticity usually implies integrity on a cryptographic level, so we can reasonably go with our modified “definition” here.

  2. Here, we neglect issues of IT administration to properly set up and run the underlying system, which may be far from a trivial task.

  3. Actually, we used a rather simplified version of perfectly secure MPT, which splits a message m into a set of random strings so that their XOR recreates m. Despite there being much better practical protocols, in case of two-path transmissions, our scheme is isomorphic to a one-time pad and thus unbreakable. This security is, however, bought at a higher risk of communication failure in case that one or more packets get lost. Thus, the two goals “confidentiality” and “availability” are somewhat conflicting.


  1. Abbas A (2009) A hybrid protocol for identification of a maximal set of node disjoint paths. Int Arab J Inform Technol (IAJIT) 6(4):344–358

    Google Scholar 

  2. Alpcan T, Başar T (2010) Network security: a decision and game theoretic approach. Cambridge University Press

  3. Djukic P, Valaee S (2006) Reliable packet transmissions in multipath routed wireless networks. IEEE Trans Mob Comput 5:548–559. doi:10.1109/TMC.2006.72

    Article  Google Scholar 

  4. Finley K (2014) Online security is a total pain, but that may soon change. [online]

  5. Fitzi M, Franklin MK, Garay J, Vardhan SH (2007) Towards optimal and efficient perfectly secure message transmission. In: Vadhan S (ed) 4th Theory of cryptography conference (TCC), Lecture Notes in Computer Science LNCS 4392. Springer, pp 311–322

  6. Kotzanikolaou P, Mavropodi R, Douligeris C (2005) Secure multipath routing for mobile ad hoc networks. In: International conference on wireless on demand network systems and service. IEEE Computer Society, Los Alamitos, pp 89–96

    Google Scholar 

  7. Li Z, Kwok YK (2005) A new multipath routing approach to enhancing TCP security in ad hoc wireless networks. In: International conference workshops on parallel processing, pp 372–379

  8. Nunes B, Mendonca M, Nguyen X, Obraczka K, Turletti T (2014) A survey of software-defined networking: past, present, and future of programmable networks. Commun Surv Tutorials, IEEE PP(99):1–18. doi:10.1109/SURV.2014.012214.00180

    Google Scholar 

  9. Rass S (2013) On game-theoretic network security provisioning. Springer J Netw Syst Manag 21(1):47–64. doi:10.1007/s10922-012-9229-1

    Article  Google Scholar 

  10. Rass S, Rainer B, Vavti M, Schauer S (2013) A network modeling and analysis tool for perfectly secure communication. In: Proceedings of the 27th IEEE international conference on advanced information networking and applications, pp. 267–275. IEEE Computer Society Press. (in press)

  11. Rass S, Schartner P (2010) Multipath authentication without shared secrets and with applications in quantum networks. In: Proceedings of the international conference on security and management (SAM), vol. 1. CSREA Press, pp 111–115

  12. Sela A (1999) Fictitious play in ’one-against-all’ multi-player games. Economic Theory 14:635–651. doi:10.1007/s001990050345

    Article  MATH  MathSciNet  Google Scholar 

  13. Singh V, Ahsan S, Ott J (2013) Mprtp: Multipath considerations for real-time media. ACM multimedia systems conference

  14. Voorneveld M (1999) Pareto-optimal security strategies as minimax strategies of a standard matrix game. J. Optim. Theory Appl. 102(1):203–210

    Article  MATH  MathSciNet  Google Scholar 

  15. Wen H, Lin C, Yang H, Ren F, Yue Y (2007) Modeling the reliability of packet group transmission in wireless network

  16. Zhao L, Delgado-Frias J (2006) Multipath routing based secure data transmission in ad hoc networks. IEEE Int Conf Wirel Mob Comput Netw Commun 17–23. doi:10.1109/WIMOB.2006.1696359

Download references


This work was supported by the Austrian Research Promotion Agency (FFG) under project “RSB”, grant no. 836287.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Stefan Rass.

Additional information

Matthias Vavti is currently affiliated with the University as a student.

Rights and permissions

Reprints and Permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rass, S., Rainer, B., Vavti, M. et al. Secure Communication over Software-Defined Networks. Mobile Netw Appl 20, 105–110 (2015).

Download citation

  • Published:

  • Issue Date:

  • DOI: