胖树中的分布式动态容错路由

面向云计算的超大规模互连网络增加了对网络容错的要求,容错已成为互连网络的重要问题.为了保证网络的高可用性和高性能,文中基于胖树网络拓扑提出了一种分布式的动态容错路由方法.该方法通过引入一套链路失效消息传播机制和一套基于链路失效信息的动态容错路由算法来实现胖树网络的分布式动态容错.相比已有方法,该方法不增加网络硬件和路由路径长度,并且具有高执行效率和高性能.实验结果表明,在m端口交换机构成的胖树中,该方法可以容忍任意m/2-1条失效链路并以高概率容忍更多条失效链路的组合,同时保持网络的高性能.     

一种针对DTN通道失效的可靠性方法研究

在通信网络节点延迟优化问题的研究中,由于延迟容忍网络(简称DTN)的端到端之间存在着高延迟,束传输率低,且会有频繁的链接中断的情况发生,很容易产生通道失效.由于DTN存在的通道失效问题,借鉴生物网络机理,提出一种生物网络的可靠性方法,通过通道容错结构的设计,生物智能体亲和力匹配,以及智能体之间的协商、协作规则来判断通道状态,进而实现通道容错,解决失效问题.与已有可靠性机制相比,改进方法缩短了束延迟时间,同时又充分利用了带宽预留.在生物网络仿真平台上,改进方法的性能得到验证.仿真结果表明,它的通信效率有了明显提高.     

DTN中基于节点综合性能的自适应喷射等待路由算法

延迟容忍网络(delay tolerant network,DTN)中,由于网络拓扑频繁变化,端到端之间不存在稳定的链路,如何选择合适的中继节点进行消息转发,使消息在较短时间内交付到目标节点是DTN中研究的关键问题之一.针对现有路由算法中继节点选择的盲目性以及对消息副本的分发缺乏合理控制的问题,提出一种基于节点综合性能...     

面向软件定义网络的入侵容忍控制器架构及实现

针对软件定义网络(SDN)这一集中式网络控制环境中控制平面存在单点失效问题,提出一种基于入侵容忍思想的控制器架构,通过冗余、多样的中央控制器平台来提高网络可用性与可靠性。该架构利用一种控制器消息的比对方法来检测被入侵的控制器。首先,规定了需比对的关键消息类型和字段;其次,运用一致性裁决算法对不同控制器消息进行比对;最后,将消息异常的控制器进行网络隔离并重启恢复。基于Mininet的入侵容忍可靠性测试表明,该入侵容忍控制器架构可检测并过滤异常控制器消息。基于Mininet的控制器响应延迟测试表明,当容忍度设置为1和3时,下层网络请求延时分别增加16%和42%。基于Cbench的控制器响应延迟和吞吐量测试表明,该入侵容忍控制器性能处在各个子控制器(Ryu,Floodlight)性能水平之间,且向性能高的子控制器趋近。在实际应用中,可根据应用场景的安全级别配置子控制器的数量和类型,以满足对响应速度和入侵容忍度的要求。     

延迟容忍网络中基于概率传递的可靠路由算法

针对延迟容忍网络中节点缓存受限引起大量消息被丢弃的问题,在概率路由算法的基础上,提出一种基于概率传递的可靠路由算法R PROPHET。该路由算法根据节点缓存中消息替换的历史情况评价节点的可靠性,以保证消息在可靠的节点间传输直至交付给目的节点。仿真结果表明,该算法能够减轻消息在节点间无效传递的情况,能够获得较高的消息交付率,并具有较低的通信开销。     

空间延迟容忍网络安全通信模型

针对空间网络延迟容忍问题, 提出一种用于空间延迟容忍网络（space delay-tolerant network, SDTN）的安全通信模型。该模型采用谓词逻辑的方法, 建立了SDTN有向多径图、安全协议服务集、可靠路径选择服务集、转发能力集, 给出了模型的安全约束规则、安全通信算法。定义了空间延迟容忍网络安全通信的状态机系统, 证明了模型的安全性、可靠性和所具有的延迟容忍能力, 从理论上奠定了空间延迟容忍网络安全通信的基础。     

基于组件应用服务器的对象容错服务

组件应用服务器框架是一种特定形式的分布式对象系统平台,要求成为高可靠性的系统.这里指的可靠性主要是指错误容忍和错误恢复两个特性.本文的主要目标是建立基于分布式对象的组件应用服务器的软件容错服务框架.我们采用一种名叫对象容错服务(OFS)的办法解决对象容错,我们解决的问题包括:对象失效、节点错误、网络隔离和不可预知的通信延迟等.本文介绍了OFS的服务规范,并给出了一个OFS实现的系统结构.     

节点移动状态感知的社会化延迟容忍网络路由策略

针对延迟容忍网络因节点移动的时空特性变化导致网络性能下降的问题,建立半马尔可夫模型描述节点的移动过程,预测未来时刻节点处于某一地理区域的概率和节点间在未来时间段内的连接状态;同时,采用节点移动状态感知机制,对所预测结果的准确程度进行评估,进而提出了节点移动状态变化自适应的消息转发策略。仿真结果表明,基于节点移动状态感知的路由策略在网络交付率、开销比率及消息投递平均延时方面能够提升DTN的性能。     

一种空间延迟容忍网络中的周期性链路数据转发算法

空间延迟容忍网络的链路具有间歇连通的特点,难以形成一条端到端的路径,使得基于TCP/IP的端端数据传输机制无法适应空间延迟容忍网络.空间延迟网络中存在着大量连通时间短暂、具有周期性连通规律的卫星节点,它们处于高速周期性运动中,在空对地、空空之间构建了空间网络的核心链路.针对空间延迟容忍网络中的周期性连通链路,通过对卫星运行规律的分析,计算单颗卫星对地周期性连通时间和星间链路的连通时间,定义空间链路的连通矢量,设计基于节点间连通矢量的数据转发算法,有效解决了空间网络周期性链路的数据有效转发问题,为空间网络面向延迟容忍的数据转发提供支持.仿真结果表明,该算法在周期性链路的情况下具有较好的传递成功率和传输延迟性能,更适合于具有周期性链路的空间延迟容忍网络环境.     

一种基于多路径的传感器网络安全数据传输机制

本文针对传感器网络提出了一种基于多路径的安全数据传输方案,通过在多条路径上分发数据,达到增强机密性和鲁棒性的目的。针对数据机密性,设计基于异或计算的编码方式,使得攻击者解析任何数据片段的难度等同于攻占所有的K条路径。针对传输的鲁棒性,设计了数据分发算法以及备份与校验相结合的容错模式,实现了容忍多条路径失效的数据传输,并且具有适度的数据冗余、理想的路径利用率以及快速的数据恢复能力。     

An Efficient Message Dissemination Scheme for Minimizing Delivery Delay in Delay Tolerant Networks

Delay tolerant networks (DTNs) are a kind of sparse and highly mobile wireless networks, where no stable connectivity guarantee can be assumed. Most DTN users have several points of interest (PoIs), and they enjoy disseminating messages to the other users of the same PoI through WiFi. In DTNs, some time-sensitive messages (disaster warnings, search notices, etc.) need to be rapidly propagated among specific users or areas. Therefore, finding a path from the source to the destination with the shortest delay is the key problem. Taking the dissemination cost into consideration, we propose an efficient message dissemination strategy for minimizing delivery delay (MDMD) in DTNs, which first defines the user’s activeness according to the transiting habit among different PoIs. Furthermore, depending on the activeness, an optimal user in each PoI is selected to constitute the path with the shortest delay. Finally, the MDMD with inactive state (on the way between PoIs) is further proposed to enhance the applicability. Simulation results show that, compared with other dissemination strategies, MDMD achieves the lowest average delay, and the comparable average hopcounts, on the premise that the delivery ratio is guaranteed to be 100% by the sufficient simulation time.     

A routing defense mechanism using evolutionary game theory for Delay Tolerant Networks

Delay Tolerant Networks (DTNs) often suffer from intermittent disruption due to factors such as mobility and energy. Though lots of routing algorithms in DTNs have been proposed in the last few years, the routing security problems have not attracted enough attention. DTNs are still facing the threats from different kinds of routing attacks. In this paper, a general purpose defense mechanism is proposed against various routing attacks on DTNs. The defense mechanism is based on the routing path information acquired from the forwarded messages and the acknowledgment (ACK), and it is suitable for different routing schemes. Evolutionary game theory is applied with the defense mechanism to analyze and facilitate the strategy changes of the nodes in the networks. Simulation results show that the proposed evolutionary game theory based defense scheme can achieve high average delivery ratio, low network overhead and low average transmission delay in various routing attack scenarios. By introducing the game theory, the networks can avoid being attacked and provide normal transmission service. The networks can reach evolutionary strategy stable (ESS) under special conditions after evolution. The initial parameters will affect the convergence speed and the final ESS, but the initial ratio of the nodes choosing different strategies can only affect the game process.     

容迟网络路由算法

容迟网络泛指那些由于节点移动、能量管理、调度等原因而出现频繁中断、甚至长时间处于中断状态的一类网络.它涵盖了由于节点调度而处于间歇式连通的无线传感网络、移动Ad hoc网络、周期性连通的卫星网络、乡村网络、野生动物追踪网络以及个人设备交换网络等等.具有十分广阔的应用前景,引起了广泛的关注.与传统网络相比,容迟网络没有稳定的端到端传输路径,因而其路由问题更为复杂.已有的研究工作也主要集中于这一问题.并提出了许多的容迟网络路由算法.对这些算法的最新进展进行了综述.首先,介绍了容迟网络路由算法的性能评价标准.其次.给出了容迟网络路由算法的分类方法.按照路由策略来分.客迟网络路由算法可以分为基于复制策略的算法和基于转发策略的算法.按照网络模型来分,容迟网络路由算法又可以分为面向主动移动模型的算法和面向被动移动模型的算法.然后,针对每一分类.重点综述了其中具有代表性的一些容迟网络路由算法,并总结了各算法的优缺点.最后,讨论了未来的研究方向.     

节点密度感知的容迟网络路由协议*

为适应容迟网络的动态变化,提高路由性能,结合空间节点分布和节点度中心性,提出一种节点密度感知的容迟网络路由协议DAR。该协议引入移动模型的节点分布,通过感知节点当前所处位置的节点密度,动态选择在网络中传播的消息副本数量,并根据节点的度中心性选择中继和分配消息副本数量。仿真结果表明,DAR能够提高传输率、降低传输延迟,在一定程度上降低了资源消耗。     

Analytical evaluation of average delay and maximum stable throughput along a typical two-way street for vehicular ad hoc networks in sparse situations

Intermittent connectivity is an intrinsic feature of vehicular ad hoc networks (VANETs) in sparse situations. This type of network is in fact an example of delay and disruption tolerant networks (DTNs). In this paper, we focus on a typical two-way street and analytically evaluate the maximum stable throughput and the average delay for packet forwarding along the street. To this end, we map the mobility patterns of the vehicles with different speeds onto suitable parameters of a BCMP queueing network and derive the location density of vehicles. Then, we employ another queueing network in order to model opportunistic multi-hop packet forwarding along the street with respect to the specifications of MAC and routing schemes. We propose a two-mode MAC scheme suitable for DTNs with predictable mobility patterns. We also consider the effect of vehicles’ velocities and opportunistic relaying for routing schemes. In our analysis, we evaluate the average delay and the maximum stable throughput for the proposed MAC and routing schemes. In the last part of the paper, we show the efficiency of the proposed analytical approach by some numerical results and confirm our analysis by simulation.     

SmallWorld Model-Based Polylogarithmic Routing Using Mobile Nodes

The use of mobile nodes to improve network system performance has drawn considerable attention recently. The movement-assisted model considers mobility as a desirable feature,where routing is based on the store-carry-forward paradigm with random or controlled movement of resource rich mobile nodes.The application of such a model has been used in several emerging networks,including mobile ad hoc networks(MANETs),wireless sensor networks(WSNs),and delay tolerant networks(DTNs).It is well known that mobility increases the capacity of MANETs by reducing the number of relays for routing,prolonging the lifespan of WSNs by using mobile nodes in place of bottleneck static sensors,and ensuring network connectivity in DTNs using mobile nodes to connect different parts of a disconnected network.Trajectory planning and the coordination of mobile nodes are two important design issues aiming to optimize or balance several measures, including delay,average number of relays,and moving distance.In this paper,we propose a new controlled mobility model with an expected polylogarithmic number of relays to achieve a good balance among several contradictory goals,including delay,the number of relays,and moving distance.The model is based on the small-world model where each static node has"short"link connections to its nearest neighbors and"long"link connections to other nodes following a certain probability distribution.Short links are regular wireless connections whereas long links are implemented using mobile nodes.Various issues are considered,including trade-offs between delay and average number of relays,selection of the number of mobile nodes,and selection of the number of long links.The effectiveness of the proposed model is evaluated analytically as well as through simulation.     

Leapfrog: Optimal Opportunistic Routing in Probabilistically Contacted Delay Tolerant Networks

Delay tolerant networks (DTNs) experience frequent and long lasting network disconnection due to various reasons such as mobility, power management, and scheduling. One primary concern in DTNs is to route messages to keep the end-to-end delivery delay as low as possible. In this paper, we study the single-copy message routing problem and propose an optimal opportunistic routing strategy – Leapfrog Routing – for probabilistically contacted DTNs where nodes encounter or contact in some fixed probabilities. We deduce the iterative computation formulate of minimum expected opportunistic delivery delay from each node to the destination, and discover that under the optimal opportunistic routing strategy, messages would be delivered from high-delay node to low-delay node in the leapfrog manner. Rigorous theoretical analysis shows that such a routing strategy is exactly the optimal among all possible ones. Moreover, we apply the idea of Reverse Dijkstra algorithm to design an algorithm. When a destination is given, this algorithm can determine for each node the routing selection function under the Leapfrog Routing strategy. The computation overhead of this algorithm is only O(n ²) where n is the number of nodes in the network. In addition, through extensive simulations based on real DTN traces, we demonstrate that our algorithm can significantly outperform the previous ones.     

Scalable Routing in Cyclic Mobile Networks

The nonexistence of an end-to-end path poses a challenge in adapting traditional routing algorithms to delay-tolerant networks (DTNs). Previous works have covered centralized routing approaches based on deterministic mobility, ferry-based routing with deterministic or semideterministic mobility, flooding-based approaches for networks with general mobility, and probability-based routing for semideterministic mobility models. Unfortunately, none of these methods can guarantee both scalability and delivery. In this paper, we extend the investigation of scalable deterministic routing in DTNs with repetitive mobility based on our previous works. Instead of routing with global contact knowledge, we propose a routing algorithm that routes on contact information compressed by three combined methods. We address the challenge of efficient information aggregation and compression in the time-space domain while maintaining critical information for efficient routing. Then, we extend it to handle a moderate level of uncertainty in contact prediction. Analytical studies and simulation results show that the performance of our proposed routing algorithm, DTN Hierarchical Routing (DHR), is comparable to that of the optimal time-space Dijkstra algorithm in terms of delay and hop count. At the same time, the per-node storage overhead is substantially reduced and becomes scalable.     

Performance comparison of different multicast routing strategies in disruption tolerant networks

Disruption Tolerant Networks (DTNs) technologies are emerging solutions to networks that experience frequent partitions. As a result, multicast design in DTNs is a considerably more difficult problem compared to that in Internet and mobile ad hoc networks. In this paper, we first investigate three basic DTN multicast strategies, including unicast-based multicast (U-Multicast), static-tree-based multicast (ST-Multicast) and dynamic-tree-based multicast (DT-Multicast) strategies. Then we focus on studying two DT-Multicast routing schemes: Dynamic Tree Based Routing (DTBR) and On-demand Situation-aware Multicast (OS-Multicast), which address the challenges of utilizing opportunistic links to conduct dynamic multicast structures in DTNs. Performances of different strategies are then evaluated by simulations, including applying the real-world DTN traces. Our results show that OS-Multicast and DTBR can achieve higher message delivery ratio than that of using U-Multicast and ST-Multicast strategies. Also, to get better performance, we recommend that system designers select OS-Multicast when the source traffic rate is low.     

TB-SnW: Trust-based Spray-and-Wait routing for delay-tolerant networks

Unlike the conventional routing techniques in Internet where routing privileges are given to trustworthy and fully authenticated nodes, delay-tolerant networks (DTNs) allow any node to participate in routing due to the lack of consistent infrastructure and central administration. This creates new security issues since even authorized nodes in DTNs could inject several malicious threats into the network. This paper investigates the problem of mitigating blackhole attacks in DTNs based on the Spray-and-Wait routing protocol. A new knowledge-based routing scheme, called Trust-Based Spray-and-Wait protocol (TB-SnW), is designed based on distributed trust management. Each node maintains the trust levels for encountered nodes based on the message exchange history, and uses the trust levels to smartly distribute message copies to bypass blackhole attackers. Simulation results demonstrate that, compared with Spray-and-Wait, TB-SnW can achieve higher message delivery rate with very low communication overhead in DTNs that suffer from blackhole attacks.