单源多径路由网络拥塞链路识别

潘胜利; 杨析儒; 张志勇; 钱峰; 胡光岷

doi:10.11999/JEIT150058

单源多径路由网络拥塞链路识别

doi: 10.11999/JEIT150058

1.
(电子科技大学通信与信息工程学院成都 611731) ②(中国移动通信集团四川有限公司广安分公司广安 638000)

基金项目:

国家自然科学基金(61171091, 61201127)和中央高校基本科研业务费(ZYGX2012J005)

计量
- 文章访问数: 1195
- HTML全文浏览量: 102
- PDF下载量: 442
- 被引次数: 0
出版历程
- 收稿日期: 2015-01-12
- 修回日期: 2015-05-11
- 刊出日期: 2015-09-19

Congestion Link Identification under Multipath Routing for Single-source Networks

1.
(School of Communication and Information Engineering, University of Electronic Science and Technology of China,
2.
(Guangan Branch, Sichuan Co., Ltd, China Mobile Group, Guang&rsquo

摘要

摘要: 针对多径路由带来的端到端测量路径不确定性以及布尔模型不能很好地解决多拥塞链路的问题，该文在识别端到端测量路径的基础上，提出一种基于扩展状态空间的网络拥塞链路识别算法。首先基于探测流时延相关性进行自适应聚类，进而得到各路径与探测流之间的映射关系。其次采用多门限的方式，将具有不同丢包程度的拥塞路径赋予不同的拥塞状态。最后将拥塞链路识别问题转化为一个约束最优化问题，并提出基于扩展状态空间的拥塞链路识别算法(ESSCLI)算法求解该问题。仿真结果表明，ESSCLI算法能够在多种不同网络场景下取得比当前算法更高的拥塞链路检测率。
- 网络测量 /
- 拥塞链路识别 /
- 网络层析成像 /
- 多径路由 /
- 最优化
Abstract: 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.
- Network measurement /
- Congestion link identification /
- Network tomography /
- Multipath routing /
- Optimization

HTML全文

参考文献(16)

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.

施引文献

资源附件(0)

访问统计