Abstract
We consider service requests that arrive in an online fashion in Software-Defined Networks (SDNs) with network function virtualization (NFV). Each request is a flow with a high-level specification of routing and processing (by network functions) requirements. Each network function can be performed by a specified subset of servers in the system. The algorithm needs to decide whether to reject the request, or accept it and with a specific routing and processing assignment, under given capacity constraints (solving the path computation and function placement problems). Each served request is assumed to “pay” a pre-specified benefit and the goal is to maximize the total benefit accrued.
In this paper we first formalize the problem, and propose a new service model that allows us to cope with requests with unknown duration without preemption. The new service model augments the traditional accept/reject schemes with a new possible response of “stand by.” We also present a new expressive model to describe requests abstractly using a “plan” represented by a directed graph. Our algorithmic result is an online algorithm for path computation and function placement that guarantees, in each time step, throughput of at least a logarithmic fraction of a (very permissive) upper bound on the maximal possible benefit.
This work was supported in part by the Neptune Consortium, Israel.
The full version of this paper can be found in http://arxiv.org/abs/1602.06169.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Typically, k is constant because the number of processing stages does not grow as a function of the size n of the network.
- 2.
Our pr-graphs are similar to Merlin’s regular expressions [15], but are more expressive and, in our humble opinion, are more natural to design.
- 3.
In Merlin, the input may also contain a “policing” function of capping the maximal bandwidth of a connection. We focus on resource allocation only. Policing may be enforced by an orthogonal entity.
References
Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing, machine scheduling. J. ACM 44(3), 486–504 (1997)
Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive on-line routing. In: Proceedings of the 34th IEEE Annual Symposium on Foundations of Computer Science, pp. 32–40 (1993)
Awerbuch, B., Azar, Y., Plotkin, S., Waarts, O.: Competitive routing of virtual circuits with unknown duration. J. Comput. Syst. Sci. 62(3), 385–397 (2001)
Buchbinder, N., Naor, J.S.: Improved bounds for online routing and packing via a primal-dual approach. In: 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 293–304 (2006)
Buchbinder, N., Naor, J.S.: Online primal-dual algorithms for covering and packing. Math. Oper. Res. 34(2), 270–286 (2009)
Cohen, R., Lewin-Eytan, L., Naor, J.S., Raz, D.: Near optimal placement of virtual network functions. In: 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 1346–1354, April 2015
Even, G., Medina, M.: Online multi-commodity flow with high demands. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol. 7846, pp. 16–29. Springer, Heidelberg (2013). doi:10.1007/978-3-642-38016-7_3
Even, G., Medina, M., Schaffrath, G., Schmid, S.: Competitive, deterministic embeddings of virtual networks. Theoret. Comput. Sci. 496, 184–194 (2013). Distributed Computing and Networking (ICDCN 2012)
Even, G., Rost, M., Schmid, S.: An approximation algorithm for path computation and function placement in sdns. Appeared in SIROCCO (2016)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Pearson, Boston (2006)
Kleinberg, J.M.: Approximation algorithms for disjoint paths problems. Ph.D. thesis, Massachusetts Institute of Technology (1996)
Kreutz, D., Ramos, F., Verissimo, E.P., Rothenberg, C.E., Azodolmolky, S., Uhlig, S.: Software-defined networking: a comprehensive survey. Proc. IEEE 103(1), 14–76 (2015)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202–208 (1985)
Soulé, R., Basu, S., Kleinberg, R., Sirer, E.G., Foster, N.: Managing the network with merlin. In: Proceedings of the 12th ACM Workshop on Hot Topics in Networks, p. 24. ACM (2013)
Soulé, R., Basu, S., Marandi, P.J., Pedone, F., Kleinberg, R., Sirer, E.G., Foster, N.: Merlin: a language for provisioning network resources. In: Proceedings of the 10th ACM International Conference on emerging Networking Experiments and Technologies, pp. 213–226. ACM (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Even, G., Medina, M., Patt-Shamir, B. (2016). On-Line Path Computation and Function Placement in SDNs. In: Bonakdarpour, B., Petit, F. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2016. Lecture Notes in Computer Science(), vol 10083. Springer, Cham. https://doi.org/10.1007/978-3-319-49259-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-49259-9_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49258-2
Online ISBN: 978-3-319-49259-9
eBook Packages: Computer ScienceComputer Science (R0)