期刊文献+

延迟容忍网络中路径失效问题的容错研究 被引量:1

Fault tolerance on path failure in delay tolerant network
在线阅读 下载PDF
导出
摘要 延迟容忍网络的路由机制与传统的网络结构有很大不同。针对这类网络中的路径失效问题进行容错研究使得网络在出现路径失效时,能够不影响消息传送,并尽可能地提高消息的成功交付率,从而屏蔽路径失效问题。首先描述了延迟容忍网络中的一种路径失效问题,反映了在路径完全正常、存在部分失效以及完全失效情况下消息交付情况,并针对这一问题研究相应的容错方法。最后给出一个交通延迟容忍网络应用实例,并评价其容错方法的性能。 Delay Tolerant Network(DTN) is a class of networks that experience frequent and long-duration partitions due to sparse distribution of nodes.It has a broad prospect to new network applications for a better scalability,fauh-tolerant and high performance.In DTNs path failure occurs frequently,sometimes even in a very short period routing is required to change,resuhing in transmission delay and reception delay.And some well-known assumption of traditional networks are no longer true in DTNs. This paper presents path failure problems in DTNs.Traditional approaches are based on using precisely known network dynamics, which does not account for message losses.This paper describes the path failure process in DTNs when the path appears completely normal,completely failed and partially failed.Then a fault tolerant scheme to generate redundancy using erasure coding and full replication is adopted.This can greatly decrease the path failure probability.At last,a traffic DTN model is analyzed and evaluated.Results reveal the superiority of the scheme in comparison to other present schemes.
出处 《计算机工程与应用》 CSCD 北大核心 2009年第10期102-105,共4页 Computer Engineering and Applications
基金 国家自然科学基金重点项目No.60534020 教育部科技创新工程重大项目培育资金项目No.706024 上海市国际科技合作基金项目No.061307041 上海市人才发展资金 上海市领军人才后备人选专项资金Grant No.010~~
关键词 延迟容忍网络 容错 路径失效 纠删编码 delay tolerant network fault tolerance path failure erasure coding
  • 相关文献

参考文献12

  • 1Cerf V,Burleigh S,Hooke A,et al.Delay-tolerant networking architecture[EB/OL]. (2007).http ://www.ipnsig.org.
  • 2樊秀梅,单志广,张宝贤,陈辉.容迟网络体系结构及其关键技术研究[J].电子学报,2008,36(1):161-170. 被引量:62
  • 3Jain S,Demmer M,Patra R,et al.Using redundancy to cope with failures in a delay tolerant network[C]//SIGCOMM,Pennsylvania, USA, 2005 : 363-373.
  • 4Jain S,Fall K,Patra R.Routing in a delay tolerant network[C]// SIGCOMM, Oregon, USA, 2004: 862-875.
  • 5Zhang X L,Neglia G,Kurose J,et al.Performance modeling of epidemic routing[J].Computer Networks,2007,51:2867-2891.
  • 6Rodrigues R,Liskov B.High availability in DHTs:erasure coding vs.replication[C]//IPTPS, USA, 2005 : 226-239.
  • 7Leguay J,Friedman T,Conan V.DTN routing in a mobility pattern space[C]//SIGCOMM, Pennsylvania, USA, 2005 : 135-143.
  • 8Jones E P C,Li L L.Practical routing in delay-tolerant networks[C]// SIGCOMM, Pennsylvania, USA, 2005 : 405-412.
  • 9田敬,代亚非.P2P持久存储研究[J].软件学报,2007,18(6):1379-1399. 被引量:52
  • 10Wang Y,Jain S,Martonosi M,et al.Erasure coding based routing in opportunistic networks[C]//SIGCOMM,Pennsylvania,USA,2005: 585-596.

二级参考文献103

  • 1Zhang Z,Lin S,Lian Q,Jin C.RepStore:A self-managing and self-tuning storage backend with smart bricks.In:Proc.of the Int'l Conf.on Autonomic Computing.2004.122-129.http://ieeexplore.ieee.org/xpl/freeabs_all.jsp-arnumber=1301355&fromcon
  • 2Stoica I,Morris R,Karger D,Kaashoek M,Balakrishnan H.Chord:A scalable peer-to-peer lookup service for internet applications.Proc.of the 2001 SIGCOMM Conf.,2001,31(4):149-160.
  • 3Zhao B,Kubiatowicz J,Joseph A.Tapestry:An infrastructure for fault-tolerant wide-area location and routing.Technical Report,UCB//CSD-01-1141,Berkeley Computer Science Division,University of California,2001.
  • 4Ratnasamy S,Francis P,Handley M,Karp R,Schenker S.A scalable content-addressable network.In:Proc.of the ACM SIGCOMM Symp.on Communication,Architecture,and Protocols.ACM SIGCOMM,2001.161-172.http://www.acm.org/sigs/ sigcomm/sigcomm/sigcomm2001/p13-ratnasamy.pdf
  • 5Rowstron A,Druschel P.Pastry:Scalable,distributed object location and routing for large-scale peer-to-peer systems.In:Proc.of the IFIP/ACM Int'l Conf.on Distributed Systems Platforms (Middleware).2001.329-350.http://citeseer.ist.psu.edu/ rowstron01pastry.html
  • 6Maymounkov P,Mazieres D.Kademlia:A peer-to-peer information system based on the XOR metric.In:Proc.of the 1st Int'l Workshop on Peer-to-Peer Systems.2002.258-263.http://citeseer.ist.psu.edu/maymounkov02kademlia.html
  • 7Schlosser M,Sintek M,Decker S,Nejdl W.HyperCuP-Hypercubes,ontologies and efficient search on P2P networks.In:Proc.of the Int'l Workshop on Agents and Peer-to-Peer Computing.2002.112-124.http://citeseer.ist.psu.edu/532386.html
  • 8Mitzenmacher M.Digital fountains:A survey and look forward.In:Proc.of the Information Theory Workshop.2004.271-276.http://ieeexplore.ieee.org/xpls/abs_all.jsp-arnumber=1405313
  • 9Plank J.A tutorial on reed-solomon coding for fault-tolerance in RAID-like systems.Software Practice and Experience,1997,27(9):995-1012.
  • 10Chun B,Dabek F,Haeberlen A,Sit E,Weatherspoon H,Kaashoek M,Kubiatowicz J,Morris R.Efficient replica maintenance for distributed storage systems.In:Proc.of the 3rd Symp.on Networked Systems Design and Implementation.2006.45-58.http://oceanstore.cs.berkeley.edu/publications/papers/pdf/carbonite06.pdf

共引文献112

同被引文献3

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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