匿名通信中短距离优先分组重路由方法的研究

重路由技术是匿名通信系统中采用的主要技术手段之一.目前典型的匿名系统中大多采用随机重路由的策略,即在所有中转代理中随机选择一个进行转发的策略,随机转发策略要求每个中转代理知道系统中所有其他代理.随着系统的扩大,一方面中转代理数增加使得系统维护代价增加,另一方面由于部分中转代理之间距离很远,重路由带来的延迟增加.提出了一种新的重路由策略--距离优先分组重路由,实现了短距离优先转发的策略,重路由时在近距离分组中进行随机转发.分别将距离优先分组策略应用在随机概率转发和有限路长限制的重路由算法中,数学分析和模拟测试结果表明,新的重路由策略在一定分组成员数情况下能保持与非分组重路由算法相当的匿名性能,同时明显地降低了服务延迟.新的策略中每个中转代理只需知道就近分组中的代理,这为匿名系统的扩展性研究提供了一定的基础.     

基于改进蚁群算法的改航路径规划

鉴于传统改航路径规划方法目标单一、计算复杂的问题,文中提出了一种基于改进蚁群算法的多目标航班改航路径规划算法。首先在初始化时使信息素与到终点的距离相关联;然后在蚂蚁移动时采用约束规则建立个体解;最后在得到蚁群算法优化的路径后,运用文中介绍的优化算子再次进行优化。最终在块状和离散状飞行限制区下进行仿真实验。结果表明改进的蚁群算法明显优于其他算法,能得到改航点少,偏移量小,路径短的航线。     

基于距离矢量路由协议的网络故障快速恢复方法

为了有效提高距离矢量路由协议处理网络故障的能力,提高网络的可用性,提出了一种基于 距离矢量路由协议的网络故障快速恢复机制,该机制包括基于预先计算生成的每目的多可行 下一跳的本地重路由策略和基于网络稳定性的触发更新策略. 分析和仿真结果显示,该机制可 以实现距离矢量路由网络的快速故障恢复,并能提高网络的稳定性和可用性.     

电力SDN通信网中面向负载均衡的路由重构

在通信网络发生故障时,为确保路径可靠性与网络负载均衡的统一,由于软件定义网络（SDN）的通信网络体系在电力通信网中已具可行性,故结合SDN逻辑集中式架构下路由快速收敛的特点,构建了路径重构模型,并采用业务路由重构算法求解.首先依据业务紧急程度、端到端通信时延、带宽需求及对电网实际运行的影响程度等因素将业务分为不同的优先级;然后以链路可用度最大为目标,以业务时延、站点等级差等为约束建立模型,以流量标准差、业务恢复率为评价指标,并在IEEE14母线系统上进行测试验证.仿真结果表明,所提算法在保证业务性能的同时具有更低的流量标准差和站点等级差,能有效实现路径重构,并确保负载均衡.     

An Efficient Rerouting Scheme for MPLS-Based Recovery and Its Performance Evaluation

The path recovery in MPLS is the technique to reroute traffic around a failure or congestion in a LSP. Currently, there are two kinds of model for path recovery: rerouting and protection switching. The existing schemes based on rerouting model have the disadvantage of more difficulty in handling node failures or concurrent node faults. Similarly, the existing schemes based on protection switching model have some difficulty in solving problem such as resource utilization and protection of recovery path. This paper proposes an efficient rerouting scheme to establish a LSP along the least-cost recovery path of all possible alternative paths that can be found on a working path, which is calculated by the upstream LSR that has detected a failure. The proposed scheme can increase resource utilization, establish a recovery path relatively fast, support almost all failure types such as link failures, node failures, failures on both a working path and its recovery path, and concurrent faults. Through simulation, the performance of the proposed scheme is measured and compared with the existing schemes.     

Capacity Efficiency and Restorability of Path Protection and Rerouting in WDM Networks Subject to Dual Failures

Resilient optical networks are predominately designed to protect against single failures of fiber links. But in larger networks, operators also see dual failures. As the capacity was planned for single failures, disconnections can occur by dual failures even if enough topological connectivity is provided. In our approach the design of the network minimizes the average loss caused by dual failures, while single failures are still fully survived. High dual failure restorability is the primary aim, capacity is optimized in a second step. For WDM networks with full wavelength conversion, we formulate mixed integer linear programming models for dedicated path protection, shared (backup) path protection, and path rerouting with and without stub-release. For larger problem instances in path rerouting, we propose two heuristics. Computational results indicate that the connectivity is of much more importance for high restorability values than the overall protection capacity. Shared protection has similar restorability levels as dedicated protection while the capacity is comparable to rerouting. Rerouting surpasses the protection mechanisms in restorability and comes close to 100% dual failure survivability. Compared to single failure planning, both shared path protection and rerouting need significantly more capacity in dual failure planning.     

Optimization and performance of restoration schemes for wide-area teletraffic networks

In the event of a major network outage such as a fiber cable cut, a network can experience significant deterioration of network performance. To address such a situation, a network can be equipped with restoration capacity. We present here a mathematical model and design algorithm for determination of transmission network restoration capacity. We then present models for two restoration options-connection-based restoration and load directed restoration (for restoration of bundle of circuits)-and consider their impact on a wide-area dynmic call routing teletraffic network when the restoration capacity is limited (tight). Our network simulation of failure and restoration of a dynamic call routing teletraffic network shows that the load directed approach generally performs better than the connection based approach.     

Q信令与SIP协议间路由预测的实现方案

为研究使用电路交换Q信令与软交换SIP协议互联组网时的路由预测实现方案,文章分析了电路交换组网时Q信令路由预测的实现原理;结合标准中软交换通信系统的协议要求和电力调度中实际使用场景,通过对软交换SIP协议与Q信令的内容分析,最终提出一种可行的SIP协议与Q信令组网时的路由预测实现方案;并通过分析标准中协议转换部分,提出建议使用的具体原因值及映射方案.     

互联网无中断转发的生存性路由协议

互联网逐渐成为通信基础设施并承载了更多的关键业务流量,即使瞬时中断也会对某些应用造成巨大损失.然而,传统路由协议在出现链路/节点故障等拓扑变化时存在收敛时间长、瞬时不可达以及环路的问题.实际测量发现,路由瞬时失效相当普遍.因此,研究人员提出多种能够保证流量无中断转发和快速恢复的路由协议.在分析瞬时失效现象以后,提出了生存性路由协议的分类方法,重点对一些重要的路由协议的核心路由机制进行深入分析,并比较其特点、性能、开销等.最后,结合该领域研究现状以及存在的问题,指出未来生存性路由的研究重点.     

基于基本回路的MPLS网络重路由故障恢复机制

研究MPLS网络中的重路由故障恢复机制,提出一种新的计算备用路径的方法,将备用路径的计算分为预处理和在线计算2个过程,给出一种基于基本回路的重路由故障恢复机制(FC-R)。仿真分析表明,FC-R恢复时间较短,可以对抗节点故障或链路故障,大大缩短在线计算时间,减轻节点负担,能够得到性能较优的备用路径,进一步节省网络资源。