Online admission control and embedding of service chains

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 9439, Issue , 2015, Pages 104-118

  Lukovszki, Tamás ^a   Schmid, Stefan ^b  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

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

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; CHAINS; COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEM FIREWALLS; COMPUTER VIRUSES; OPTIMIZATION; TRANSFER FUNCTIONS; VIRTUAL REALITY;

APPROXIMATION LOWER BOUNDS; ASYMPTOTICALLY OPTIMAL; CALL ADMISSION; COMPETITIVE ANALYSIS; EMBEDDING PROBLEMS; NETWORK VIRTUALIZATION; NUMBER OF SERVICES; VIRTUAL CIRCUIT ROUTING;

COMPUTER NETWORKS;

EID: 84950327453     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-25258-2_8     Document Type: Conference Paper

References (28)

1. Alon, N., Feige, U., Wigderson, A., Zuckerman, D.: Derandomized graph products. Computational Complexity 5, 60-75 (1995).
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).
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).
4. Bari, F., Chowdhury, S. R., Ahmed, R., Boutaba, R.: On orchestrating virtual network functions in NFV. CoRR (2015).
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).
6. Dietrich, D., Abujoda, A., Papadimitriou, P.: Network Service Embedding Across Multiple Providers with Nestor. In: Proc. IFIP Networking (2015).
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).
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. 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).
10. Even, G., Medina, M., Schaffrath, G., Schmid, S.: Competitive and deterministic embeddings of virtual networks. Elsevier Theoretical Computer Science (TCS) (2013).
11. Fayazbakhsh, S., et al.: Flowtags: Enforcing network-wide policies in the presence of dynamic middlebox actions. In: Proc. ACM HotSDN (2013).
12. Gember-Jacobson, A., et al.: OpenNF: Enabling innovation in network function control. In: Proc. ACM SIGCOMM (2014).
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).
14. Hartert, R., et al.: Declarative and expressive approach to control forwarding paths in carrier-grade networks. In: Proc. ACM SIGCOMM (2015).
15. Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Comput. Complex. 15(1), 20-39 (2006).
16. Joseph, D., Stoica, I.: Modeling middleboxes. IEEE Network: The Magazine of Global Internetworking 22(5), 20-25 (2008).
17. Karp, R. M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations (1972).
18. Martins, J., Ahmed, M., Raiciu, C., Huici, F.: Enabling fast, dynamic network processing with clickos. In: Proc. HotSDN, pp. 67-72 (2013).
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).
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).
21. Papadimitriou, C. H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. System Sci. 43, 425-440 (1991).
22. Plotkin, S. A.: Competitive routing of virtual circuits in ATM networks. IEEE Journal on Selected Areas in Communications 13(6), 1128-1136 (1995).
23. Schulz-Zander, J., et al.: OpenSDWN: Programmatic control over home and enterprise WiFi. In: ACM Sigcomm Symposium on SDN Research, SOSR (2015).
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).
25. Skoldstrom, P., et al.: Towards unified programmability of cloud and carrier infrastructure. In: Proc. European Workshop on Software Defined Networking, EWSDN (2014).
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).
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).
28. Telekom, D.: Terastream (2013), http://www. a10networks. com/resources/files/A10-CS-80103-EN. pdf#search=.