期刊文献+

一种基于节点主观信任度的分布式多路径路由协议 被引量:1

Distributed Protocol for Multipath Routing Based on Node's Subjective Trust Degree
下载PDF
导出
摘要 提出了一种基于节点主观信任度的分布式多路径路由协议(distributed protocol for multipath routing based on node’s subjective trust degree,NSTD-DPMR)。在利用主观信任度对中间节点的恶意程度进行评估的基础上,分布式计算出源端节点发送数据的最佳速率,以及各中间节点的最佳转发速率。仿真实验表明,协议NSTD-DPMR能够在将恶意中间节点对数据传输的危害降低到最低程度的同时,最大化目的端节点接收到的正常数据,保证了路由的安全性和有效性,且协议的复杂度较低。 This paper presents a distributed protocol for multipath routing based on node' s subjective trust degree (NSTD-DPMR). Based on the assessment of middle node's subjective trust degree, this protocol computes the best send rate of the source node with distributed method, as well as the best forward rate of the middle nodes. The simulation shows that the protocol NSTD-DPMR will reduce the damage to the data transmission by malicious middle nodes, maximize the right data received by the destination node, and ensure the security and effectiveness of routing with lower complexity.
出处 《南京邮电大学学报(自然科学版)》 2009年第1期33-37,共5页 Journal of Nanjing University of Posts and Telecommunications:Natural Science Edition
基金 国家高技术研究发展计划(863计划)(2006AA01Z232) 江苏省高校研究生科研创新计划(CX07B-11Oz)资助项目
关键词 主观信任 多路径路由 中间节点 subjective trust multipath routing middle node
  • 相关文献

参考文献8

二级参考文献46

  • 1朱峻茂,杨寿保,樊建平,陈明宇.Grid与P2P混合计算环境下基于推荐证据推理的信任模型[J].计算机研究与发展,2005,42(5):797-803. 被引量:44
  • 2林闯,汪洋,李泉林.网络安全的随机模型方法与评价技术[J].计算机学报,2005,28(12):1943-1956. 被引量:92
  • 3Goldberg A V, Rao S. Beyond the flow decomposition barrier[J]. J Assoc Compute Math,1998,45(5) :783-797
  • 4Xiao X P. Traffic engineering with MPLS in the Internet [J].IEEE Networking, 2000,14 (2):28- 33
  • 5Girish M K,Zhou B, Hu J Q. Formulation of the traffic engineering problems in MPLS based IP networks [AJ. The Fifth IEEE-ISCC [C]. Antibes,France,2000. 214-219
  • 6Ahuja R K, Magnanti T L, Orlin J R Network Flows: Theory,Algorithms and Applications [M]. New Jersey:Prentice Hall,2000. 134-151
  • 7Wang Y F,Wang Z. Explicit routing algorithms for Internet traffic engineering [A]. IEEE ICCCN'99 [C]. Boston, MA, 1999.582-588
  • 8Awduche D. RSVP-TE: extensions to RSVP for LSP tunnels.IETF, Internet Draft. http://www.ietf.org, 2001
  • 9Waxman B M. Routing of multipoint connections [J]. IEEE Journal on Selected Areas in Communications, 1988,6(9):1617-1622
  • 10Lee Y,Seok Y,Cehol Y. A constrained multipath traffic engineering scheme for MPLS networks [A]. ICC'02 [C]. New York,2002. 2431-2436

共引文献256

同被引文献18

  • 1姚寒冰,胡和平,卢正鼎,黄保华,李瑞轩.一种基于主观逻辑理论的P2P网络信任模型[J].计算机科学,2006,33(6):29-31. 被引量:4
  • 2苏瀚,汪芸.P2P环境中基于信任度的服务路由系统的研究[J].计算机应用研究,2006,23(9):230-233. 被引量:5
  • 3袁禄来,曾国荪,王伟.基于Dempster-Shafer证据理论的信任评估模型[J].武汉大学学报(理学版),2006,52(5):627-630. 被引量:17
  • 4Hideo Y, Nobuyuki E, Zhenlong C, et al. NAT traversal technolo- gy of reducing Load on relaying server for P2P conneetions[C]//4th Annual IEEE Consumer Communications and Networking Conference. Las Vegas: Computer Society, 2007 : 100-104.
  • 5Liang J, Kumar R, Ross K W. The FastTrack overlay : A mea- surement study[J]. Elsevier Computer Networks Journal, 2006, 50(6) : 842-858.
  • 6Kho W, Abdul B S, Henning S. Skype relay calls: Measurements and experiments[C]//IEEE INFOCOM Workshops. Phoenix: Institute of Electrical and Electronics Engineers.2008:1-6.
  • 7Lu Y, Sebastien V. Peer-to-Peer Media Steaming Application Survey[C]//Mobile Ubiquitous Computing, Systems, Services and Technologies, 2007. UBICOMM' 07. 2007 : 139-148.
  • 8Maxemchuk N. Dispersity routing [C]// International Commu- nications Conference. 1975 : 10-13.
  • 9Lou W, Liu W, Fang Y. SPREAD: Enhancing data confidentiali- ty in mobile ad hoc networks[C]// Twenty-third Annual Joint Conference of the IEEE Comuter and Communications Societies. New York: Institute of Electrical and Electronics Engineers, 2004:2404-2413.
  • 10Yuan L, Meng C X, Dan Y. Disjoint multi-path QoS routing in ad hoc networks[C]// International Conference on Wireless Communications, Networking and Mobile Computing. New York: IEEE, 2005 : 739-742.

引证文献1

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部