Advertisement

Online Admission Control and Embedding of Service Chains

  • Tamás Lukovszki
  • Stefan Schmid
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9439)

Abstract

The virtualization and softwarization of modern computer networks enables the definition and fast deployment of novel network services called service chains: sequences of virtualized network functions (e.g., firewalls, caches, traffic optimizers) through which traffic is routed between source and destination. This paper attends to the problem of admitting and embedding a maximum number of service chains, i.e., a maximum number of source-destination pairs which are routed via a sequence of ℓ to-be-allocated, capacitated network functions. We consider an Online variant of this maximum Service Chain Embedding Problem, short OSCEP, where requests arrive over time, in a worst-case manner. Our main contribution is a deterministic O(logℓ)-competitive online algorithm, under the assumption that capacities are at least logarithmic in ℓ. We show that this is asymptotically optimal within the class of deterministic and randomized online algorithms. We also explore lower bounds for offline approximation algorithms, and prove that the offline problem is APX-hard for unit capacities and small ℓ ≥ 3, and even Poly-APX-hard in general, when there is no bound on ℓ. These approximation lower bounds may be of independent interest, as they also extend to other problems such as Virtual Circuit Routing. Finally, we present an exact algorithm based on 0-1 programming, implying that the general offline SCEP is in NP and, by the above hardness results, it is NP-complete for constant ℓ.

Keywords

Computer Networks Network Virtualization Virtual Circuit Routing Online Call Admission Competitive Analysis 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alon, N., Feige, U., Wigderson, A., Zuckerman, D.: Derandomized graph products. Computational Complexity 5, 60–75 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Awerbuch, B., Azar, Y., Plotkin, S.A.: Throughput-competitive on-line routing. In: Proc. 34th Annual Symposium on Foundations of Computer Science (FOCS), pp. 32–40 (1993)Google Scholar
  3. 3.
    Awerbuch, B., Azar, Y., Plotkin, S.A., Waarts, O.: Competitive routing of virtual circuits with unknown duration. In: Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 321–327 (1994)Google Scholar
  4. 4.
    Bari, F., Chowdhury, S.R., Ahmed, R., Boutaba, R.: On orchestrating virtual network functions in NFV. CoRR (2015)Google Scholar
  5. 5.
    Bazgan, C., Escoffier, B., Paschos, V.T.: Completeness in standard and differential approximation classes: Poly-(d)apx- and (d)ptas-completeness. Theoretical Computer Science 339(2-3), 272–292 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Dietrich, D., Abujoda, A., Papadimitriou, P.: Network Service Embedding Across Multiple Providers with Nestor. In: Proc. IFIP Networking (2015)Google Scholar
  7. 7.
    Dobrescu, M., Egi, N., Argyraki, K., Chun, B.G., Fall, K., Iannaccone, G., Knies, A., Manesh, M., Ratnasamy, S.: Routebricks: Exploiting parallelism to scale software routers. In: Proc. ACM SOSP, pp. 15–28 (2009)Google Scholar
  8. 8.
    ETSI: Network functions virtualisation (nfv); use cases (2014), http://www.etsi.org/deliver/etsi_gs/NFV/001_099/001/01.01.01_60/gs_NFV001v010101p.pdf
  9. 9.
    Even, G., Medina, M.: A nonmonotone analysis with the primal-dual approach: Online routing of virtual circuits with unknown durations. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 104–115. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  10. 10.
    Even, G., Medina, M., Schaffrath, G., Schmid, S.: Competitive and deterministic embeddings of virtual networks. Elsevier Theoretical Computer Science (TCS) (2013)Google Scholar
  11. 11.
    Fayazbakhsh, S., et al.: Flowtags: Enforcing network-wide policies in the presence of dynamic middlebox actions. In: Proc. ACM HotSDN (2013)Google Scholar
  12. 12.
    Gember-Jacobson, A., et al.: OpenNF: Enabling innovation in network function control. In: Proc. ACM SIGCOMM (2014)Google Scholar
  13. 13.
    Gupta, A., Vanbever, L., Shahbaz, M., Donovan, S.P., Schlinker, B., Feamster, N., Rexford, J., Shenker, S., Clark, R., Katz-Bassett, E.: Sdx: A software defined internet exchange. In: Proc. ACM SIGCOMM, pp. 551–562 (2014)Google Scholar
  14. 14.
    Hartert, R., et al.: Declarative and expressive approach to control forwarding paths in carrier-grade networks. In: Proc. ACM SIGCOMM (2015)Google Scholar
  15. 15.
    Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Comput. Complex. 15(1), 20–39 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Joseph, D., Stoica, I.: Modeling middleboxes. IEEE Network: The Magazine of Global Internetworking 22(5), 20–25 (2008)CrossRefGoogle Scholar
  17. 17.
    Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations (1972)Google Scholar
  18. 18.
    Martins, J., Ahmed, M., Raiciu, C., Huici, F.: Enabling fast, dynamic network processing with clickos. In: Proc. HotSDN, pp. 67–72 (2013)Google Scholar
  19. 19.
    McKeown, N., Anderson, T., Balakrishnan, H., Parulkar, G., Peterson, L., Rexford, J., Shenker, S., Turner, J.: Openflow: Enabling innovation in campus networks. SIGCOMM Comput. Commun. Rev. 38(2), 69–74 (2008)CrossRefGoogle Scholar
  20. 20.
    Mehraghdam, S., Keller, M., Karl, H.: Specifying and placing chains of virtual network functions. In: Proc. 3rd IEEE International Conference on Cloud Networking (CloudNet), pp. 7–13 (2014)Google Scholar
  21. 21.
    Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. System Sci. 43, 425–440 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Plotkin, S.A.: Competitive routing of virtual circuits in ATM networks. IEEE Journal on Selected Areas in Communications 13(6), 1128–1136 (1995)CrossRefGoogle Scholar
  23. 23.
    Schulz-Zander, J., et al.: OpenSDWN: Programmatic control over home and enterprise WiFi. In: ACM Sigcomm Symposium on SDN Research, SOSR (2015)Google Scholar
  24. 24.
    Sekar, V., Ratnasamy, S., Reiter, M.K., Egi, N., Shi, G.: The middlebox manifesto: Enabling innovation in middlebox deployment. In: Proc. HotNets, pp. 21:1–21:6 (2011)Google Scholar
  25. 25.
    Skoldstrom, P., et al.: Towards unified programmability of cloud and carrier infrastructure. In: Proc. European Workshop on Software Defined Networking, EWSDN (2014)Google Scholar
  26. 26.
    Soulé, R., Basu, S., Marandi, P.J., Pedone, F., Kleinberg, R., Sirer, E.G., Foster, N.: Merlin: A language for provisioning network resources. In: Proc. 10th ACM International on Conference on Emerging Networking Experiments and Technologies (CoNEXT), pp. 213–226 (2014)Google Scholar
  27. 27.
    Stoenescu, R., Popovici, M., Olteanu, V., Martins, J., Bifulco, R., Huici, F., Ahmed, M., Smaragdakis, G., Handley, M., Raiciu, C.: In-net: Enabling in-network processing for the masses. In: Proc. ACM EuroSys (2015)Google Scholar
  28. 28.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Faculty of InformaticsEötvös Loránd UniversityBudapestHungary
  2. 2.TU Berlin & Telekom Innovation LaboratoriesBerlinGermany

Personalised recommendations