Skip to main content
SpringerLink
Log in

Identify Congested Links Based on Enlarged State Space

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

When paths share a common congested link, they will all suffer from a performance degradation. Boolean tomography exploits these performance-level correlations between different paths to identify the congested links. It is clear that the congestion of a path will be distinctly intensive when it traverses multiple congested links. We adopt an enlarged state space model to mirror different congestion levels and employ a system of integer equations, instead of Boolean equations, to describe relationships between the path states and the link states. We recast the problem of identifying congested links into a constraint optimization problem, including Boolean tomography as a special case. For a logical tree, we propose an up-to-bottom algorithm and prove that it always achieves a solution to the problem. Compared with existing algorithms, the simulation results show that our proposed algorithm achieves a higher detection rate while keeping a low false positive rate.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chitsaz M, Woo C S. Software agent with reinforcement learning approach for medical image segmentation. Journal of Computer Science and Technology, 2011, 26(2): 247–255.

    Article  Google Scholar 

  2. Castro R, Coates M, Liang G, Nowak R, Yu B. Network tomography: Recent developments. Statistical Science, 2004, 19(3): 499–517.

    Article  MathSciNet  MATH  Google Scholar 

  3. Shih M F, Hero A O. Hierarchical inference of unicast network topologies based on end-to-end measurements. IEEE Trans. Signal Processing, 2007, 55(5): 1708–1718.

    Article  MathSciNet  Google Scholar 

  4. Duffield N G. Network tomography of binary network performance characteristics. IEEE Trans. Information Theory, 2006, 51(12): 5373–5388.

    Article  MathSciNet  MATH  Google Scholar 

  5. Tachibana A, Ano S, Tsuru M. Selecting measurement paths for efficient network monitoring on a user-cooperative scheme. In Proc. the 2013 IFIP/IEEE International Symposium on Integrated Network Management, May 2013, pp.736-739.

  6. Krishnamurthy A, Singh A. Robust multi-source network tomography using selective probes. In Proc. the 31st IEEE International Conference on Computer Communications, March 2012, pp.1629-1637.

  7. Nguyen H X, Thiran P. Using end-to-end data to infer lossy links in sensor networks. In Proc. the 25th IEEE International Conference on Computer Communications, April 2006.

  8. Dhamdhere A, Teixeira R, Dovrolis C, Diot C. NetDiagnoser: Troubleshooting network unreachabilities using endto-end probes and routing data. In Proc. the 3rd ACM International Conference on Emerging Networking Experiments and Technologies, December 2007, Article No. 18.

  9. Zarifzadeh S, Gowdagere M, Dovrolis C. Range tomography: Combining the practicality of Boolean tomography with the resolution of analog tomography. In Proc. the 12th ACM Internet Measurement Conference, November 2012, pp.385-398.

  10. Nguyen H X, Thiran P. The Boolean solution to the congested IP link location problem: Theory and practice. In Proc. the 26th IEEE International Conference on Computer Communications, May 2007, pp.2117-2125.

  11. Ghita D, Argyraki K, Thiran P. Toward accurate and practical network tomography. ACM SIGOPS Operating Systems Review, 2013, 47(1): 22–26.

    Article  Google Scholar 

  12. Chen J, Qi X, Wang Y. An efficient solution to locate sparsely congested links by network tomography. In Proc. the 2014 IEEE International Conference on Communications, January 2014, pp.1278-1283.

  13. Matsuda T, Nagahara M, Hayashi K. Link quality classifier with compressed sensing based on ℓ1-ℓ2 optimization. IEEE Communications Letters, 2011, 15(10): 1117–1119.

    Article  Google Scholar 

  14. Letchford N, Lodi A. Primal cutting plane algorithms revisited. Mathematical Methods of Operations Research, 2002, 56(1): 67–81.

    Article  MathSciNet  MATH  Google Scholar 

  15. Padmanabhan V, Qiu L, Wang H. Server-based inference of Internet link lossiness. In Proc. the 22nd IEEE International Conference on Computer Communications, Mar. 30-Apr. 3, 2003, pp.145-155.

Download references

Author information

Authors and Affiliations

  1. School of Communication and Information Engineering, University of Electronic Science and Technology of China, Chengdu, 611731, China

    Sheng-Li Pan, Zhi-Yong Zhang, Ying-Jie Zhou, Feng Qian & Guang-Min Hu

  2. School of Computer and Communication Sciences, Swiss Federal Institute of Technology Lausanne, Lausanne, 1015, Switzerland

    Zhi-Yong Zhang

  3. College of Computer Science, Sichuan University, Chengdu, 610065, China

    Ying-Jie Zhou

Authors
  1. Sheng-Li Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhi-Yong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ying-Jie Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Feng Qian
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Guang-Min Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guang-Min Hu.

Additional information

This work was partly supported by the National Natural Science Foundation of China under Grant Nos. 61171091 and 91438120, the Young Scientists Fund of the National Natural Science Foundation of China under Grant No. 61201127, the Fundamental Research Funds for Central Universities of China under Grant Nos. ZYGX2012J005 and 2014SCU11013, and the Science and Technology on Communication Security Laboratory under Grant No. 9140C110503140C11054.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pan, SL., Zhang, ZY., Zhou, YJ. et al. Identify Congested Links Based on Enlarged State Space. J. Comput. Sci. Technol. 31, 350–358 (2016). https://doi.org/10.1007/s11390-016-1631-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-016-1631-9

Keywords

Search

Navigation