Advanced Search
Volume 37 Issue 9
Sep.  2015
Turn off MathJax
Article Contents
Pan Sheng-li, Yang Xi-ru, Zhang Zhi-yong, Qian Feng, Hu Guang-min. Congestion Link Identification under Multipath Routing for Single-source Networks[J]. Journal of Electronics & Information Technology, 2015, 37(9): 2232-2237. doi: 10.11999/JEIT150058
Citation: Pan Sheng-li, Yang Xi-ru, Zhang Zhi-yong, Qian Feng, Hu Guang-min. Congestion Link Identification under Multipath Routing for Single-source Networks[J]. Journal of Electronics & Information Technology, 2015, 37(9): 2232-2237. doi: 10.11999/JEIT150058

Congestion Link Identification under Multipath Routing for Single-source Networks

doi: 10.11999/JEIT150058
  • Received Date: 2015-01-12
  • Rev Recd Date: 2015-05-11
  • Publish Date: 2015-09-19
  • Regarding the uncertainty introduced by load balancing when determining which end-to-end path is measured and that the classical Boolean model is not well developed for the scenario of multiple congestion links, this paper bases on the identification of end-to-end probing paths and proposes an enlarged state space based congestion link identification algorithm. Firstly, the mapping relationship between the probing flows and the measured paths is obtained after performing adaptive clustering on the probing flows with their delay correlation measures. Secondly, with multiple thresholds, it is able to assign a path with a different congestion state according to its different loss rate levels. Lastly, the issue of the congestion link identification is modeled as a constrained optimization problem, and is solved with Enlarged State Space based Congestion Link Identification (ESSCLI) algorithm. The simulation results demonstrate that ESSCLI can achieve a better detection rate of the congestion link in various network scenarios compared with existing algorithms.
  • loading
  • Castro R, Coates M, Liang G, et al.. Network tomography: recent developments[J]. Statistical Science, 2004, 19(3): 499-517.
    Duffield N and Presti F. Network tomography from measured end-to-end delay covariance[J]. IEEE/ACM Transactions on Networking, 2004, 12(6): 978-992.
    Duffield N, Presti F, Paxson V, et al.. Inferring link loss using striped unicast probes[C]. Proceedings of IEEE INFOCOM, Anchorage, 2001, 2: 915-923.
    Coates M, Castro R, Nowak R, et al.. Maximum likelihood network topology identification from edge-based unicast measurements[C]. Proceedings of ACM SIGMETRICS, Marina Del Rey, 2003: 11-20.
    Malekzadeh A and MacGregor M. Network Topology inference from end-to-end measurements[C]. the 27th IEEE Advanced Information Networking and Applications Workshops, Barcelona, 2013: 1101-1106.
    Wei W, Wang B, Towsley D, et al.. Model-based
    identification of dominant congested link[J]. IEEE/ACM Transactions on Networking, 2011, 19(2): 456-469.
    Duffield N. Network tomography of binary network performance characteristics[J]. IEEE Transactions on Information Theory, 2006, 52(12): 5373-5388.
    Matsuda T, Nagahara M, and Hayashi K. Link quality classifier with compressed sending based on optimization[J]. IEEE Communications Letters, 2011, 15(10): 1117-1119.
    Ma L, He T, Leung K, et al.. Monitor placement for maximal identifiability in network tomography[C]. Proceedings of IEEE INFOCOM, Toronto, 2014: 1447-1455.
    Eriksson B, Dasarathy G, Barford P, et al.. Efficient network tomography for Internet topology discovery[J]. IEEE/ACM Transactions on Networking, 2012, 20(3): 931-943.
    Ghita D, Argyraki K, and Thiran P. Toward accurate and practical network tomography[J]. ACM SIGOPS Operating Systems Review, 2013, 47(1): 22-26.
    Dhamdhere A, Teixeira R, and Dovrolis C, et al.. NetDiagnoser: troubleshooting network unreachabilities using end-to-end probes and routing data[C]. Proceedings of ACM CoNEXT, New York, 2007: 18.
    Augustin B, Friedman T, and Teixeira R. Measuring multipath routing in the Internet[J]. IEEE/ACM Transactions on Networking, 2011, 19(3): 830-840.
    Pan S, Zhang Z, Yu F, et al.. End-to-end measurements for network tomography under multipath routing[J]. IEEE Communications Letters, 2014, 18(5): 881-884.
    Pelleg D and Moore A. X-means: extending k-means with efficient estimation of the number clusters[C]. Proceedings of ICML, Stanford, 2000: 727-734.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (1238) PDF downloads(442) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return