Skip to main content
SpringerLink
Log in

Node and Link Allocation in Network Virtualization Based on Distributed Constraint Optimization

  • Published:
Journal of Network and Systems Management Aims and scope Submit manuscript

Abstract

Virtual Networks (VNs) offer a flexible and economic approach to deploy customer suited networks. However, defining how resources of a physical network are used to support VNs requirements is a NP-hard problem. For this reason, heuristics have been used on mapping of virtual networks. Although heuristics do not ensure the optimal solution, they implement fast solutions and showed satisfactory results. This work presents a modeling of the node and link allocation problem using Distributed Constraint Optimization Problem (DCOP) with factor graphs, which is a formalism widely used in real distributed optimization problems. In our approach, we use the max-sum algorithm to solve the DCOP. Correctness criteria for this approach are discussed and verifications are conducted through model checking.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Notes

  1. The mathematical symbol\(\backslash\)(backslash) means complement of sets. For example, A\(\backslash\)B means: the set that contains all elements of A that does not belong to B. For example: {1,2,3,4}\(\backslash\)3,4,5,6} = {1,2}.

References

  1. Fischer, A., Botero, J., Beck, M., De Meer, H., Hesselbach, X.: Virtual Network Embedding: A Survey. Communications Surveys Tutorials, IEEE PP(99), 1 (2013). doi:10.1109/SURV.2013.013013.00155

  2. Beck, M.T., Fischer, A., de Meer, H., Botero, J., Hesselbach, X.: A distributed, parallel, and generic virtual network embedding framework. In: IEEE International Conference on Communications (ICC), 2013 (2013), pp. 3471–3475. doi:10.1109/ICC.2013.6655087

  3. Beck, M.T., Fischer, A., Botero, J.F., Linnhoff-Popien, C., de Meer, H.: Distributed and scalable embedding of virtual networks. J. Netw. Comput. Appl. 56(C), 124 (2015). doi:10.1016/j.jnca.2015.06.012

    Article  Google Scholar 

  4. Farinelli, A., Rogers, A., Petcu, A., Jennings, N.R.: Decentralised coordination of low-power embedded devices using the max-sum algorithm. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2 (International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 2008), AAMAS ’08, pp. 639–646. http://dl.acm.org/citation.cfm?id=1402298.1402313

  5. Farinelli, A., Rogers, A., Petcu, A., Jennings, N.R.: Decentralised coordination of low-power embedded devices using the max-sum algorithm. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems-Volume 2 (International Foundation for Autonomous Agents and Multiagent Systems, 2008), pp. 639–646

  6. Petcu, A., Faltings, B.: DPOP: A Scalable Method for Multiagent Constraint Optimization. In: IJCAI 05 (Edinburgh, Scotland, 2005), pp. 266–271

  7. Modi, P.J., Shen, W.M., Tambe, M., Yokoo, M.: ADOPT: asynchronous distributed constraint optimization with quality guarantees. Artif. Intell. 161(1), 149 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Mailler, R., Lesser, V.R.: Asynchronous partial overlay: a new algorithm for solving distributed constraint satisfaction problems. J. Artif. Int. Res. 25(1), 529 (2006). http://dl.acm.org/citation.cfm?id=1622543.1622558

  9. Petcu, A., Faltings, B.: A scalable method for multiagent constraint optimization. In: International Joint Conference on Artificial Intelligence, vol. 19 (Lawrence Erlbaum Associates LTD, 2005), vol. 19, p. 266

  10. Houidi, I., Louati, W., Zeghlache, D.: Distributed Virtual Network Mapping Algorithm. In: IEEE International Conference on Communications, 2008. ICC ’08. (2008), pp. 5634–5640. doi:10.1109/ICC.2008.1056

  11. Rogers, A., Farinelli, A., Stranders, R., Jennings, N.R.: Bounded approximate decentralised coordination via the max-sum algorithm. Artif. Intell. 175(2), 730 (2011). doi:10.1016/j.artint.2010.11.001

    Article  MathSciNet  MATH  Google Scholar 

  12. Stranders, R., Farinelli, A., Rogers, A., Jennings, N.R.: Decentralised coordination of mobile sensors using the max-sum algorithm. In: Proceedings of the 21st International Joint Conference on Artifical Intelligence (Morgan Kaufmann Publishers Inc., 2009), pp. 299–304

  13. Zivan, R., Peled, H.: Max/Min-sum Distributed Constraint Optimization Through Value Propagation on an Alternating DAG. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 2012), AAMAS ’12, pp. 265–272. http://dl.acm.org/citation.cfm?id=2343576.2343614

  14. Holzmann, G.: Spin Model Checker, the: Primer and Reference Manual, 1st edn. Addison-Wesley Professional, Boston (2003)

    Google Scholar 

  15. Holzmann, G.J.: The Model Checker SPIN. IEEE Trans. Softw. Eng. 23(5), 279 (1997). doi:10.1109/32.588521

    Article  Google Scholar 

  16. Botero, J., Hesselbach, X., Fischer, A., Meer, H.: Optimal mapping of virtual networks with hidden hops. Telecommun. Syst. 51(4), 273 (2012). doi:10.1007/s11235-011-9437-0

    Article  Google Scholar 

  17. Chowdhury, M., Rahman, M.R., Boutaba, R.: ViNEYard: Virtual network embedding algorithms with coordinated node and link mapping. IEEE/ACM Trans. Netw. 20(1), 206 (2012). doi:10.1109/TNET.2011.2159308

    Article  Google Scholar 

  18. Nogueira, J., Melo, M., Carapinha, J., Sargento, S.: Virtual Network Mapping into Heterogeneous Substrate Networks. In: Proceedings of the 2011 IEEE Symposium on Computers and Communications (IEEE Computer Society, Washington, DC, USA, 2011), ISCC ’11, pp. 438–444. doi:10.1109/ISCC.2011.5983876

  19. Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. (TOPLAS) 5(1), 66 (1983)

    Article  MATH  Google Scholar 

  20. Dijkstra, E.W.: Guarded commands, nondeterminacy and formal derivation of programs. Commun. ACM 18(8), 453 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  21. Fischer, A., Botero, J.F., Beck, M.T., De Meer, H., Hesselbach, X.: Virtual network embedding: a survey. IEEE Commun. Surv. Tutor. 15(4), 1888–1906 (2013)

    Article  Google Scholar 

  22. Chowdhury, M., Samuel, F., Boutaba, R.: PolyViNE: policy-based virtual network embedding across multiple domains. In: Proceedings of the Second ACM SIGCOMM Workshop on Virtualized Infrastructure Systems and Architectures (ACM, New York, NY, USA, 2010), VISA ’10, pp. 49–56. doi:10.1145/1851399.1851408

  23. Zhang, M., Wu, C., Jiang, M., Yang, Q.: Mapping multicast service-oriented virtual networks with delay and delay variation constraints. In: IEEE Global Telecommunications Conference (GLOBECOM 2010), 2010 (IEEE, 2010), pp. 1–5

  24. Inführ, J., Raidl, G.R.: Introducing the virtual network mapping problem with delay, routing and location constraints. In: Network Optimization (Springer, 2011), pp. 105–117

  25. Yang, Y., Chen, S.z., Li, X., Wang, Y.: Rmap: An algorithm of virtual network resilience mapping. In: 7th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM), 2011 (IEEE, 2011), pp. 1–4

  26. Belbekkouche, A., Hasan, M.M., Karmouch, A.: Resource discovery and allocation in network virtualization. IEEE Commun. Surv. Tutor. 14(4), 1114 (2012)

    Article  Google Scholar 

  27. Yeoh, W.: Speeding up distributed constraint optimization search algorithms. Ph.D. thesis, University of Southern California (2010)

  28. Zhang, W., Wang, G., Xing, Z., Wittenburg, L.: Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks. Artif. Intell. 161(1), 55 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  29. Maheswaran, R.T., Pearce, J.P., Tambe, M.: Distributed algorithms for DCOP: a graphical-game-based approach. In: ISCA PDCS (2004), pp. 432–439

  30. Pearce, J.P.: Solution sets for DCOPs and graphical games. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (International Foundation for Autonomous Agents and Multiagent Systems, 2006), pp. 577–584

Download references

Author information

Authors and Affiliations

  1. Centro de Ciências Computacionais, Universidade Federal do Rio Grande, Av. Itália, s/n - km 08, Rio Grande, RS, Brasil

    Alexander R. Gularte, Odorico M. Mendizabal, Raquel M. Barbosa & Diana F. Adamatti

Authors
  1. Alexander R. Gularte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Odorico M. Mendizabal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Raquel M. Barbosa
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Diana F. Adamatti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Diana F. Adamatti.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gularte, A.R., Mendizabal, O.M., Barbosa, R.M. et al. Node and Link Allocation in Network Virtualization Based on Distributed Constraint Optimization. J Netw Syst Manage 26, 127–146 (2018). https://doi.org/10.1007/s10922-017-9410-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10922-017-9410-7

Keywords

Search

Navigation