Identify Congested Links with Network Tomography Under Multipath Routing

Abstract

Identifying congested links accurately to ensure the Service Level Agreements is an important but challenging task, since it is costly or even practically unfeasible to monitor massive interior links directly for large networks. Network tomography has been proposed to overcome this problem by using end-to-end (path) measurements. However, most of existing tomographic methods only focus on the loss performance degradation, while paying much less attention the fact that network congestion will also greatly worsen the delay performance. Nevertheless, most of them normally work under single-path routing, which may also get violated in today’s Internet as multipath routing is increasingly common. In this paper, we consider the problem of using end-to-end measurements to identify congested links when multipath routing is employed in a non-tree network. Firstly, we use both link delay variances and link loss rates to model the system constraints between end- to-end paths and the interior links, and transfer the issue of congested link identification as an optimization problem. By theoretically demonstrating that the link delay variances are identifiable from the end-to-end delay measurements with certain topology conditions, we further prove that the above optimization problem is a Non-deterministic Polynomial-time hard (NP-hard) problem. Then in order to solve such an NP-hard problem, two greedy algorithms based on bool and additive congestion statuses are proposed. Lastly, simulation studies show that with extra delay constraints, our proposed algorithms are able to achieve better identification performances than existing methods under multipath routing.

This is a preview of subscription content, access via your institution.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

References

  1. 1.

    Pan, S., Jiang, Q., Nie, X., Hu, G.: Identification of congestion links under multipath routing with end-to-end measurements. In: IEEE Symposium on Computers and Communication (ISCC), 2016, pp. 646–650. IEEE (2016)

  2. 2.

    Castro, R., Coates, M., Liang, G., Nowak, R., Yu, B.: Network tomography: recent developments. Stat. Sci. 19, 499–517 (2004)

    MathSciNet  Article  MATH  Google Scholar 

  3. 3.

    Zhang, Z., Mara, O., Argyraki, K.: Network neutrality inference. In: ACM Conference on SIGCOMM, pp. 63–74 (2014)

  4. 4.

    Li, P., Guo, S., Leung, V.C.M.: Maximum-lifetime coding tree for multicast in lossy wireless networks. IEEE Wirel. Commun. Lett. 2(3), 295–298 (2013)

    Article  Google Scholar 

  5. 5.

    Dhamdhere, A., Teixeira, R., Dovrolis, C., Diot, C.: Netdiagnoser: troubleshooting network unreachabilities using end-to-end probes and routing data. In: Proceedings of the 2007 ACM CoNEXT Conference, p. 18. ACM (2007)

  6. 6.

    Matsuda, T., Nagahara, M., Hayashi, K.: Link quality classifier with compressed sensing based on \(\ell _1-\ell _2\) optimization. IEEE Commun. Lett. 15(10), 1117–1119 (2011)

    Article  Google Scholar 

  7. 7.

    Augustin, B., Friedman, T., Teixeira, R.: Measuring multipath routing in the internet. IEEE/ACM Trans. Netw. 19(3), 830–840 (2011)

    Article  Google Scholar 

  8. 8.

    Pan, S., Zhang, Z., Yu, F., Hu, G.: End-to-end measurements for network tomography under multipath routing. IEEE Commun. Lett. 18(5), 881–884 (2014)

    Article  Google Scholar 

  9. 9.

    Duffield, N.: Network tomography of binary network performance characteristics. IEEE Trans. Inf. Theory 52(12), 5373–5388 (2006)

    MathSciNet  Article  MATH  Google Scholar 

  10. 10.

    Chen, J., Qi, X., Wang, Y.: An efficient solution to locate sparsely congested links by network tomography. In: IEEE International Conference on Communications (ICC), 2014, pp. 1278–1283. IEEE (2014)

  11. 11.

    Ghita, D., Argyraki, K., Thiran, P.: Toward accurate and practical network tomography. ACM SIGOPS Oper. Syst. Rev. 47(1), 22–26 (2013)

    Article  Google Scholar 

  12. 12.

    Nguyen, H.X., Thiran, P.: The boolean solution to the congested ip link location problem: theory and practice. In: INFOCOM 2007. 26th IEEE International Conference on Computer Communications, IEEE, pp. 2117–2125. IEEE (2007)

  13. 13.

    Nguyen, H.X., Thiran, P.: Network loss inference with second order statistics of end-to-end flows. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet measurement, pp. 227–240. ACM (2007)

  14. 14.

    Jaggard, A.D., Kopparty, S., Ramachandran, V., Wright, R.N.: The design space of probing algorithms for network-performance measurement. In: ACM SIGMETRICS Performance Evaluation Review, vol. 41, pp. 105–116. ACM (2013)

  15. 15.

    Tati, S., Silvestri, S., He, T., Porta, T.L.: Robust network tomography in the presence of failures. In: IEEE International Conference on Distributed Computing Systems, pp. 481–492 (2014)

  16. 16.

    Zeng, D., Gu, L., Lian, L., Guo, S., Yao, H., Hu, J.: On cost-efficient sensor placement for contaminant detection in water distribution systems. IEEE Trans. Ind. Inf. 12(6), 2177–2185 (2016)

    Article  Google Scholar 

  17. 17.

    Wei, R., Wei, D.: Robust network tomography: K-identifiability and monitor assignment. In: IEEE INFOCOM 2016—the IEEE International Conference on Computer Communications, pp. 1–9. IEEE (2016)

  18. 18.

    Ma, L., He, T., Swami, A., Towsley, D., Leung, K.K.: Network capability in localizing node failures via end-to-end path measurements. IEEE/ACM Trans. Netw. (TON) 25(1), 434–450 (2017)

    Article  Google Scholar 

  19. 19.

    Ogino, N., Kitahara, T., Arakawa, S., Hasegawa, G., Murata, M.: Lightweight boolean network tomography based on partition of managed networks. J. Netw. Syst. Manag. 26, 1–30 (2017)

    Google Scholar 

  20. 20.

    Wu, Y., Kumar, A.: A parallel interval computation model for global optimization with automatic load balancing. J. Comput. Sci. Technol. 27(4), 744–753 (2012)

    Article  Google Scholar 

  21. 21.

    Rabbat, M.G., Coates, M.J., Nowak, R.D.: Multiple-source internet tomography. IEEE J. Sel. Areas Commun. 24(12), 2221–2234 (2006)

    Article  Google Scholar 

  22. 22.

    Sattari, P., Kurant, M., Anandkumar, A., Markopoulou, A., Rabbat, M.G.: Active learning of multiple source multiple destination topologies. IEEE Trans. Signal Process. 62(8), 1926–1937 (2014)

    MathSciNet  Article  MATH  Google Scholar 

  23. 23.

    Zhang, X., Phillips, C.: A survey on selective routing topology inference through active probing. IEEE Commun. Surv. Tutor. 14(4), 1129–1141 (2012)

    Article  Google Scholar 

  24. 24.

    Wei, W., Wang, B., Towsley, D., Kurose, J.: Model-based identification of dominant congested links. IEEE/ACM Trans. Netw. 19(2), 456–469 (2011)

    Article  Google Scholar 

  25. 25.

    Duffield, N.G., Presti, F.L.: Network tomography from measured end-to-end delay covariance. IEEE/ACM Trans. Netw. (TON) 12(6), 978–992 (2004)

    Article  Google Scholar 

  26. 26.

    Yanai, H., Takeuchi, K., Takane, Y.: Generalized inverse matrices. In: Takeuchi, K., et al. (eds.) Projection Matrices. Generalized Inverse Matrices, and Singular Value Decomposition, pp. 55–86. Springer, New York (2011)

    Google Scholar 

  27. 27.

    Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Ann. Oper. Res. 98(1–4), 353–371 (2000)

    MathSciNet  Article  MATH  Google Scholar 

  28. 28.

    Issariyakul, T., Hossain, E.: Introduction to Network Simulator NS2, vol. 3, pp. 21–40. Springer, Berlin (2012)

    Google Scholar 

  29. 29.

    Pan, S., Zhou, Y., Zhang, Z., Yang, S., Qian, F., Hu, G.: Identify congested links with network tomography under multipath routing. Zenodo (2017). https://doi.org/10.5281/zenodo.1041050

    Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Yingjie Zhou.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work was partly supported by the National Natural Science Foundation of China (Grant Nos. 61701074, 61171091, 6130217, 61201127), the Fundamental Research Funds for the Central Universities, China University of Geosciences (Wuhan) under Grant No. G1323541861, and the Sichuan Science and Technology Program. Also it was revised according to our previous work [1], which has appeared in the proceedings of the 2016 IEEE Symposium on Computers and Communications, ©2016 IEEE.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Pan, S., Zhou, Y., Zhang, Z. et al. Identify Congested Links with Network Tomography Under Multipath Routing. J Netw Syst Manage 27, 409–429 (2019). https://doi.org/10.1007/s10922-018-9471-2

Download citation

Keywords

  • Network measurements
  • Boolean tomography
  • Congested link identification
  • End-to-end measurement
  • Multipath routing
  • NP-hard