Multiple Parameters Network Topology Inference Based on Tomography

doi:10.13190/jbupt.200804.24.zhaohh

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2008, Vol. 31 ›› Issue (4): 24-28.doi: 10.13190/jbupt.200804.24.zhaohh

• Papers • Previous Articles Next Articles

Multiple Parameters Network Topology Inference Based on Tomography

ZHAO Hong-hua，CHEN Ming， QIU Xiao-feng， ZHANG Guo-min

Institute of Command Automation，People’s Liberation Army University of Science and Technology，Nanjing 210007, China

Received:2007-11-06 Revised:1900-01-01 Online:2008-08-30 Published:2008-08-30
Contact: ZHAO Hong-hua

Abstract

Abstract:

In order to reduce the limits in topology inference of one parameter, a multiple parameters network topology inference method, combining end to end delay and loss, was proposed. When applying the multiple parameters based network topology inference, no additional traffic was needed; the inference method can be applied in complex networks of different loads. The multiple parameters based inference method was analyzed theoretically and validated through simulations by network simulator, version 2 (NS2). The results of simulation illustrated that the multiple parameters based inference method could infer network topology correctly when faced with different loaded networks.

Key words: network tomography, multiple parameters, topology inference

CLC Number:

TP393

ZHAO Hong-hua，CHEN Ming， QIU Xiao-feng， ZHANG Guo-min
. Multiple Parameters Network Topology Inference Based on Tomography[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2008, 31(4): 24-28.

References

[1] Coates M, Hero A, Nowak R, et a1. Internet tomography[J]. IEEE Signal Process Mag, 2002, 19(3): 47-65.
[2] Coatro R, Coates M, Liang G, et al. Network tomography: recent developments[J]. Statistical Science, 2004, 19(3): 499-517.
[3] Coates M, Nowak R. Network loss inference using unicast end-to-end measurement//ITC Conf on IP Traffic, Modelling and Management. Monterey: , 2000: 874-891.
[4] Meng-Fu S, Alfred O. Unicast-based inference of network link delay distributions with finite mixture models[J]. IEEE Trans on Signal Processing, 2003, 51(8): 2219-2228.
[5] Coates M, Castro R, Nowak R. Maximum likelihood network topology identification from edge-based unicast measurements//ACM SIGMETRICS. New York: ACM Press, 2002: 1015-1023.
[6] Castro R, Coates M, Nowak R. Likelihood based hierarchical clustering[J]. IEEE Trans on Signal Processing, 2004, 52(8): 2308-2321.
[7] 李勇军, 蔡皖东, 王伟, 等. 基于端到端报文丢失的网络拓扑推断算法研究[J]. 通信学报, 2007, 28(10): 85-91. Li Yongjun, Cai Wandong, Wang Wei, et al. Research on network topology identification algorithm based on end-to-end loss performance[J]. Journal Communications, 2007, 28(10): 85-91.
[8] Shih M, Hero A. Hierarchical inference of unicast network topologies based on end-to-end measurements[J]. IEEE Trans on Signal Processing, 2007, 55(5): 1708-1718.
[9] Duffield N, Horowitz J, Presti L.Adaptive multicast topology inference. (2002). http://www.research.att.com/~duffield/papers/dhl01-adapt.pdf.
[10] Philip B. A survey on tree edit distance and related problems. (2005-06). http://grfia.dlsi.ua.es/ml/algorithms/references/editsurvey_-bille.pdf. (上接第5页)
[4] Aiello B, Ishai Y, Reingold O. Priced oblivious transfer: how to sell digital goods//Advanced in Cryptology-Eurocrypt, LNCS 2045. Innsbruck: Springer-Verlag, 2001: 119-135.
[5] Mu Y, Zhang Junqi, Varadharajan V. m out of n ob-livious transfer//ACISP'02, Lecture Notes in Computer Science. Heidelberg: Springer-Verlag, 2002: 395-405.
[6] Bao Feng, Robert H Deng. An efficient and practical scheme for privacy protection in the e-commerce of digital goods//Proc ICICS 2000. Heidelberg: Springer Berlin, 2001: 162-170.
[7] Noar M, Pinkas B. Efficient oblivious transfer protocols//Proceedings of SODA 01. Philadelphia: Society for Industrial and Applied Mathematics, 2001: 448-457.
[8] 秦静, 李宝, 崔少军, 等. 对OT协议的分析与改进[J]. 北京邮电大学学报, 2005, 28(增刊): 31-35. Qin Jing, Li Bao, Cui Shaojun, et al. Research of ob-livious transfer protocol[J]. Journal of Beijing University of Posts and Telecommunications, 2005, 28(Sup): 31-35.
[9] Christian T. Practical oblivious transfer protocols//Lecture Notes in Computer Science 2578. New York: Springer-Verlag, 2002: 415-426.
[10] Tzeng Wen-Guey. Efficient oblivious transfer schemes//5th International Workshop on Practice and Theory in Public Key Cryptosystems. Paris: Springer Berlin, 2002: 159-171.
[11] Chu Cheng-Kang, Tzeng Wen-Guey. Efficient k-out-of-n oblivious transfer schemes with adaptive and nonadaptive queries//8th International Workshop on Practice and Theory in Public Key Cryptosystems. Paris: Springer Berlin, 2005: 172-183.
[12] Gertner Y, Kannan S, Malkin T, et al. The relationship between public key encryption and oblivious transfer//Proc of the 41st Annual Symposium on Foundations of Computer Science(FOCS '00). Los Alamitos: IEEE Computer Society Press, 2000: 325-335.
[13] Ishai Y, Kilian J, Nissim K, et al. Extending oblivious transfers efficiently//Advances in Cryptology-CRYPTO '03. : Springer-Verlag, 2003: 145-161.
[14] Lipmaa H. New communication-efficient oblivious transfer protocols based on pairings. . http://eprint.iacr.org/2007/133.
[15] Peikert C, Vaiknntanathan V, Waters B. A framework for efficient and composable oblivious transfer. . http://eprint.iacr.org/2007/348.
[16] Mao Wenbo. Modern cryptography: theory and practice[M]. Beijing: Publishing House of Electronics Industry, 2004: 85-136.

Multiple Parameters Network Topology Inference Based on Tomography

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 3

Recommended Articles

Metrics

Comments

[1]	Zhao Hong hua. 3-Tuple Packets Based Network Topology Inference [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2012, 35(3): 120-124.
[2]	Zhao Hong hua. A Network Topology Inference Algorithm Based on 4-tuple Packets Measurement [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2012, 35(2): 126-130.
[3]	XIAO Yong-kang1, SHAN Lin-wei2, YUAN Jian2, SHAN Xiu-ming2 . New Router-Aided Multicast Network Tomography Method [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2008, 31(6): 9-12.