全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
电子学报  2013 

一种高效的单播网络自适应拓扑推测算法

DOI: 10.3969/j.issn.0372-2112.2013.10.003, PP. 1888-1894

Keywords: 网络测量,网络层析成像,拓扑推测,深度优先搜索

Full-Text   Cite this paper   Add to My Lib

Abstract:

为提高单播网络拓扑推测的效率和准确性,本文提出一种高效的单播网络自适应拓扑推测算法.该算法利用探测包中的TTL信息作为二分深度优先搜索排序中参考节点的选择依据,有效降低测量过程中所需的背靠背包对数量,提高拓扑推测的效率;通过对现有的深度优先搜索下网络拓扑推测算法原理的分析,给出该算法能够正确推测出整个网络拓扑的充分条件,在此基础上提出一种自适应判定阈值选择方法,有效提高网络链路参数未知情况下的拓扑推测准确性.仿真实验结果表明,本文所提出的算法具备更高的拓扑推测效率和准确性.

References

[1]  Coates M,Hero A,Nowak R,et al.Internet tomography[J].IEEE Signal Processing Magazine,2002,19(3):47-65.
[2]  Donnet D,Friedman T.Internet topology discovery:A survey[J].IEEE Communications Surveys and Tutorials,2007,9(4):2-15.
[3]  Duffield N,Horowitz J,et al.Multicast topology inference from measured end-to-end loss[J].IEEE Transactions on Information Theory,2002,48(1):26-45.
[4]  Coates M,Castro R,Nowak R.Maximum likelihood network topology identification from edge-based unicast measurements [A].International Conference on Measurement and Modeling of Computer Systems [C].Marina Del Rey:ACM,2002.11-20.
[5]  Shih Meng-Fu,Hero Ⅲ,et al.Hierarchical inference of unicast network topologies based on end-to-end measurements[J].IEEE Transactions on Signal Processing,2007,55(51):1708-1718.
[6]  Eriksson B,Dasarathy G,Barford P,et al.Toward the practical use of network tomography for internet topology discovery [A].Proceedings of IEEE INFO-COM 2010 [C].San Diego:IEEE,2010.1-9.
[7]  Clegg R G,Cairano-Gilfedder C D,Zhou S.A critical look at power lawmodeling of the Internet[J].Computer Communications,2010,33(3):259-268.
[8]  Knight K,Nguyen H X,et al.The internet topology zoo [OL].http://www.topology-zoo.org.
[9]  赵洪华,陈鸣.基于网络层析成像技术的拓扑推断[J].软件学报,2010,21(1):133-146. Zhao Hong-hua,Chen Ming.Topology inference based on newtork tomography[J].Journal of Software,2010,21(1):133-146.
[10]  Zhang X,Phillips C.Asurvey on selective routing topology inference through active probing[J].IEEE Communications Surveys and Tutorials,2011,9(23):1-13.
[11]  Fei G,Hu G.Improving maximum-likelihood-based topology inference by sequentially inserting leaf nodes[J].IET Communications,2011,5(15):2221-2230.
[12]  Ni Jian,Tatikonda S.A markov random field approach to multicast-based network inference problems [A].International Symposium on Information Theory [C].Seattle:IEEE,2006.2769-2773.
[13]  Ni Jian,Xie H H,Tatikonda S,et al.Efficient and dynamic routing topology inference from end-to-end measurements[J].IEEE/ACM Transactions on Networking,2010,18(1):123-135.
[14]  Eriksson B,Dasarathy G,Barford P,Nowak R.Efficient network tomography for internet topology discovery[J].IEEE/ACM Transactions on Networking,2012,20(3):931-943.
[15]  Alerto M,Ibrahim M,John B.On the origin of power laws in internet topologies.ACM Computer Communication Review,2000,30(2):18-28.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133