It's a match! Near-optimal and incremental middlebox deployment

Computer Communication Review

Volumn 46, Issue 1, 2016, Pages 31-36

  Lukovszki, Tamás ^a   Rost, Matthias ^b   Schmid, Stefan ^c  

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

^b Institute of Ecology   (Germany)

^c Berlin Aalborg University   (Germany)

Author keywords

Capacitated Set Cover; Facility Location; Network Virtualization; NFV; NP hardness; Software Defined Networking

Indexed keywords

APPLICATION PROGRAMS; COMPUTER NETWORKS; COMPUTER SOFTWARE; COMPUTER SYSTEM FIREWALLS; COMPUTER VIRUSES; INTEGER PROGRAMMING; NETWORK FUNCTION VIRTUALIZATION; SOFTWARE DEFINED NETWORKING; VIRTUAL REALITY; VIRTUALIZATION;

APPROXIMATION BOUNDS; EXACT ALGORITHMS; FACILITY LOCATIONS; INCREMENTAL DEPLOYMENT; NETWORK VIRTUALIZATION; NP-HARDNESS; SET COVER; SUBMODULAR FUNCTIONS;

APPROXIMATION ALGORITHMS;

EID: 84988352441     PISSN: 01464833     EISSN: 19435819     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. A. Gember-Jacobson et al. OpenNF: Enabling innovation in network function control. In Proc. ACM SIGCOMM, 2014.
2. M. Bagaa, T. Taleb, and A. Ksentini. Service-aware network function placement for efficient traffic handling in carrier cloud. In Proc. IEEE WCNC, 2014.
3. J. Chuzhoy and J. Naor. Covering problems with hard capacities. SIAM J. Comput., 2006.
4. V. Chvatal. A greedy heuristic for the set-covering problem. Math. of Operations Research, 4(3), 1979.
5. D. Levin et al. Panopticon: Reaping the benefits of incremental sdn deployment in enterprise network. In Proc. USENIX ATC, 2014.
6. N. Feamster, J. Rexford, and E. Zegura. The road to sdn. Queue, 11(12):20:20-20:40, Dec. 2013.
7. U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
8. J. Sherry et al. Making middleboxes someone else's problem: Network processing as a cloud service. In Proc. ACM SIGCOMM, 2012.
9. R. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations. 1972.
10. S. Knight, H. Nguyen, N. Falkner, R. Bowden, and M. Roughan. The internet topology zoo. Selected Areas in Communications, IEEE Journal on, 29(9):1765-1775, october 2011.
11. L. Lovász. Submodular functions and convexity. Mathematical Programming The State of the Art, 1983.
12. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. Journal of the ACM, 41(5):960-981, 1994.
13. T. Lukovszki and S. Schmid Online admission control and embedding of service chains. In Proc. SIROCCO, 2015.
14. M. Markovitch and S. Schmid. Shear: A highly available and exible network architecture: Marrying distributed and logically centralized control planes. In Proc. 23rd IEEE ICNP, 2015.
15. W. Rankothge, J. Ma, F. Le, A. Russo, and J. Lobo. Towards making network function virtualization a cloud computing service. In IFIP/IEEE IM, 2015.
16. S. Raza, G. Huang, C.-N. Chuah, S. Seetharaman, and J. P. Singh. Measurouting: A framework for routing assisted traffic monitoring. IEEE/ACM Trans. Netw., 20(1):45-56, Feb. 2012.
17. T. Ritter. Network-based firewall services: Extending the firewall into the cloud. In Nemertes White Paper N0496, 2009.
18. S. Fayazbakhsh et al. Flowtags: Enforcing network-wide policies in the presence of dynamic middlebox actions. In Proc. ACM HotSDN, 2013.
19. R. Raz and S. Safra. A sub-constant error-probability low-degree test, and sub-constant error-probability pcp characterization of np. In Proc. ACM STOC, 1997.
20. A. Schrijver. Combinatorial Optimization - Polyhedra and Efficiency. Springer-Verlag, 2003.
21. S. Vissicchio, L. Vanbever, and O. Bonaventure. Opportunities and Research Challenges of Hybrid Software Defined Networks. ACM CCR, 2014.
22. L. Wolsey. An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica, 2(4):385-393, 1982.
23. Z. Qazi et al. Simple-fying middlebox policy enforcement using sdn. In Proc. ACM SIGCOMM, 2013.