Abstract
The increasing penetration of software-defined communication networks with centralized control has made network management a highly demanding task. Common monitoring approaches in the context of such convoluted high-speed networks have become a serious challenge in terms of complexity and resource management. Management functions rely on monitoring information such as the flow size distribution (FSD), to perform crucial activities such as load balancing and resource provisioning. In this paper, we propose a solution as to how one can utilize limited monitoring resources to estimate the FSD for distinct flows characterized by origin-destination pairs. We provide a method to dynamically adapt placement of monitoring units with some extracted knowledge about the change in FSD’s with time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Benko, P., Veres, A.: A passive method for estimating end-to-end TCP packet loss. In: Proceedings of the IEEE GLOBECOM, vol. 3, pp. 2609–2613 (2002)
Papadogiannakis, A., Kapravelos, A., Polychronakis, M., Markatos, E.P., Ciuffoletti, A.: Passive end-to-end packet loss estimation for grid traffic monitoring. In: Proceedings of the CoreGRID Integration Workshop, pp. 79–93 (2006)
Friedl, A., Ubik, S., Kapravelos, A., Polychronakis, M., Markatos, E.P.: Realistic passive packet loss measurement for high-speed networks. In: Papadopouli, M., Owezarski, P., Pras, A. (eds.) TMA 2009. LNCS, vol. 5537, pp. 1–7. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01645-5_1
Tootoonchian, A., Ghobadi, M., Ganjali, Y.: OpenTM: traffic matrix estimator for openflow networks. In: Krishnamurthy, A., Plattner, B. (eds.) PAM 2010. LNCS, vol. 6032, pp. 201–210. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-12334-4_21
Hark, R., Stingl, D., Richerzhagen, N., Nahrstedt, K., Steinmetz, R.: DistTM: collaborative traffic matrix estimation in distributed SDN control planes. In: Proceedings of the IFIP Networking, pp. 82–90 (2016)
Bozakov, Z., Rizk, A., Bhat, D., Zink, M.: Measurement-based flow characterization in centrally controlled networks. In: Proceedings of the IEEE INFOCOM (2016)
Shirali-Shahreza, S., Ganjali, Y.: FleXam: flexible sampling extension for monitoring and security applications in openflow. In: Proceedings of the ACM HotSDN, pp. 167–168 (2013)
Yu, M., Jose, L., Miao, R.: Software defined traffic measurement with OpenSketch. In: Proceedings of the USENIX NSDI, pp. 29–42 (2013)
OPNFV. https://www.opnfv.org/
T-NOVA: Project. http://www.t-nova.eu/
SONATA: Project. http://www.sonata-nfv.eu/
Dietrich, D., Rizk, A., Papadimitriou, P.: AutoEmbed: Automated multi-provider virtual network embedding. In: Proceedings of ACM SIGCOMM 2013 (Demo track), pp. 465–466 (2013)
Houidi, I., Louati, W., Ben Ameur, W., Zeghlache, D.: Virtual network provisioning across multiple substrate networks. Comput. Netw. 55(4), 1011–1023 (2011)
Hohn, N., Veitch, D.: Inverting sampled traffic. In: Proceedings of the 3rd ACM SIGCOMM Conference on Internet Measurement. IMC 2003, New York, pp. 222–233. ACM (2003)
Tune, P., Veitch, D.: Fisher information in flow size distribution estimation. IEEE Trans. Inf. Theory 57(10), 7011–7035 (2011)
Benson, T., Akella, A., Maltz, D.A.: Network traffic characteristics of data centers in the wild. In: Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement. IMC 2010, New York, pp. 267–280. ACM (2010)
Roy, A., Zeng, H., Bagga, J., Porter, G., Snoeren, A.C.: Inside the social network’s (datacenter) network. SIGCOMM Comput. Commun. Rev. 45(4), 123–137 (2015)
Yoon, S., Ha, T., Kim, S., Lim, H.: Scalable traffic sampling using centrality measure on software-defined networks. IEEE Commun. Mag. 55(7), 43–49 (2017)
Tartakovsky, A.G., Moustakides, G.V.: State-of-the-art in Bayesian changepoint detection. Seq. Anal. 29(2), 125–145 (2010)
Karlin, S., Taylor, H.: A First Course in Stochastic Processes. Academic Press, New York (1975)
Acknowledgments
This work has been funded in parts by the German Research Foundation (DFG) as part of project B4 within the Collaborative Research Center (CRC) 1053 – MAKI. This work has been performed in parts in the framework of the CELTIC EUREKA project SENDATE-PLANETS (Project ID C2015/3-1), and it is partly funded by the German BMBF (Project ID 16KIS0471).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix
Appendix
Lemma 1
Wald’s Identity [20]: Suppose for a sequence of real-valued random variables \(\{X_n\}\) and nonnegative integer-valued random variable N following conditions hold,
-
1.
\(E[\mid X_n \mid ] < \infty \),
-
2.
\(E[X_n \mathbbm {1}(N \ge n)] = E[X_n] \cdot P(N\ge n), \forall n \) and
-
3.
\(\sum _{n=1}^{\infty }{E[X_n \mathbbm {1}(N \ge n)]}<\infty \).
Then, the random sums \(S_N :=\sum _{n=1}^{N}X_{n}\) and \(T_N :=\sum _{n=1}^{N} E[X_n]\) are integrable and \(E[S_N]=E[T_N]\). Additionally, if
-
4.
\(E[X_n]=E[X_1] \forall n \) and
-
5.
\(E[N]<\infty \)
\(E[S_N]=E[N] \cdot E[X_1]\).
In our case, \(X_i's\) are i.i.d according to a distribution F with finite mean and N is the time to observe \(p-th\) percentile of F. Hence, \(E[X_n \cdot \mathbbm {1}(N \ge n)] = E[X_n \cdot \mathbbm {1}(X_1< F^{-1}(p),...,X_{n-1}< F^{-1}(p))] = E[X_n] \cdot E[\mathbbm {1}(X_1< F^{-1}(p),...,X_{n-1}< F^{-1}(p))] = E[X_n] \cdot P(N\ge n)\), owing to independence of \(X_i's\). Condition (3) is satisfied as the summands form a geometric series with \(n{-}th\) term being \(E[X_1] \cdot p^n\). Thus, \(E[S_N] = E[X_1] \cdot E[N] = E[X_1]/(1-p)\).
Definition 4
Bhattacharyya Distance: Bhattacharyya distance between two probability mass functions (pmf) p and q over same domain X, is defined as \(D(p,q) = - \log {(\sum _{x \in X}\sqrt{p_x \cdot q_x})}\).
Compared to the popular metric Kullback-Leibler divergence, this distance is defined even when empirical pmf assigns zero mass to a point that belongs to the support of actual or hypothesized distribution.
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Kar, S., Hark, R., Rizk, A., Steinmetz, R. (2018). Towards Optimal Placement of Monitoring Units in Time-Varying Networks Under Centralized Control. In: German, R., Hielscher, KS., Krieger, U. (eds) Measurement, Modelling and Evaluation of Computing Systems. MMB 2018. Lecture Notes in Computer Science(), vol 10740. Springer, Cham. https://doi.org/10.1007/978-3-319-74947-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-74947-1_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-74946-4
Online ISBN: 978-3-319-74947-1
eBook Packages: Computer ScienceComputer Science (R0)