Ad Hoc网络中基于延迟的多径路由协议的研究

Ad Hoc网络的频繁变化和节点的移动使得单路径协议的性能受到很大限制.由于多径路由具有稳定和网络资源利用率高的特性,它比原来的单径路由更适合于无线多跳网络.基于跨层设计的思想,提出一种按需多径路由算法QAOMDV.该算法通过节点最短队列长度,把网络层、MAC层和物理层协同起来.在与原有的路由协议的性能进行全面比较的基础上,用NS2仿真工具对改进的算法进行了性能分析和评价,结果表明该改进协议在性能上优于原有路由协议.     

基于路径中断概率的VANETs连接模型及性能分析

车载网VANETs（Vehicular Ad hoc Networks）在道路安全、车流量管理和娱乐应用具有广阔的前景,而这些应用依赖数据有效的传输。为此,VANETs的数据传输技术成为研究的焦点。然而,VANETs的拓扑动态变化、车辆快速移动加速了车间通信链路的断裂,降低了链路的可靠性,为数据有效传输提出了挑战。据此,分析了VANETs的多跳通信连接特性。通过研究端到端中断概率,提出多跳连接的分析模型。通过模型,可得出在一定的平均端到端中断概率所需的最小发射功率以及最大传输跳数。通过仿真,验证理论模型的正确性。仿真进一步表明,通过合适的功率控制算法有利于改善数据传输路径。     

具有生存性的Overlay网络构建方法

针对现有网络在可靠性和服务质量方面所存在的缺陷,以增强网络生存性为目标,对现有IP网络的生存性机制进行了研究。以路径相异性为基础,提出一种具有生存性的Overlay网络构建方法。构建过程使用重叠惩罚思想为每个源—目的对按照业务的QoS参数计算合适的路径,由这些路径构成节点对之间的Overlay虚拟拓扑。此网络拓扑不仅可以保证故障情况下的合理路径快速倒换,而且可以满足业务的需求。使用路径相似度和路径查询时间两个指标对基于重叠惩罚的路径选择算法进行了评价,仿真结果表明本算法可以按照业务的参数计算出满足业务需求的合理路径,可以顺利地构造出面向业务的具有生存性的Overlay网络。     

基于生成树的链路层拓扑发现算法

随着大规模交换网络的发展，网络拓扑发现的研究由网络层拓展到数据链路层。链路层的拓扑发现能够发现网络层拓扑发现无法发现的局域网内部的详细的物理连接情况。该文提出了一种基于生成树算法的链路层网络拓扑发现算法，利用SNMP获得网桥MIB中的生成树信息，通过分析这些信息计算出链路层的网络拓扑，该算法相比其它算法更简单、高效，有应用价值。     

基于生成树算法的链路层拓扑发现研究

随着大规模交换网络的发展,网络拓扑发现的研究由网络层拓展到数据链路层。链路层的拓扑发现能够发现网络层拓扑发现无法发现的局域网内部的详细的物理连接情况,对网络配置管理具有重要意义。研究了目前基于地址转发表（AFT）的方法,针对现有算法的不足作了一定分析,提出了一种基于生成树算法（STA）的链路层网络拓扑发现算法,利用SNMP获得网桥MIB中的生成树信息,通过分析这些信息计算出链路层的网络拓扑。该算法相比其它算法更简单、高效,有应用价值。     

Topology awareness algorithm for virtual network mapping

Network virtualization is recognized as an effective way to overcome the ossification of the Internet. However, the virtual network mapping problem (VNMP) is a critical challenge, focusing on how to map the virtual networks to the substrate network with efficient utilization of infrastructure resources. The problem can be divided into two phases: node mapping phase and link mapping phase. In the node mapping phase, the existing algorithms usually map those virtual nodes with a complete greedy strategy, without considering the topology among these virtual nodes, resulting in too long substrate paths (with multiple hops). Addressing this problem, we propose a topology awareness mapping algorithm, which considers the topology among these virtual nodes. In the link mapping phase, the new algorithm adopts the k-shortest path algorithm. Simulation results show that the new algorithm greatly increases the long-term average revenue, the acceptance ratio, and the long-term revenue-to-cost ratio (R/C).     

A novel dynamic RWA algorithm with intelligent granularity regulation in multi-granular all-optical networks

With the great advances of DWDM technology, optical cross-connects have to deal with much more wavelengths. Accordingly, the size of optical cross-connects become larger and larger; also the management cost is much higher. To simplify the architecture of cross-connects for low-complexity maintenance, waveband switching (WBS) in conjunction with several optical cross-connect architectures have been proposed and attracted much attention recently. The main concept of WBS is to group multiple wavelengths into a single waveband and what it concerns includes cross-connect cost and port count reduction. In this paper, we investigate the dynamic RWA problem (MG_DRWA) in WBS networks comprising of all-optical switches based on a cost-effective multi-granular optical cross-connect (MG-OXC) architecture. With this reconfigurable architecture, an optical cross-connect can switch at either fiber level, waveband level, or wavelength level according to its configuration. In order to effectively accommodate dynamic traffic demand, we propose a new MG_DRWA algorithm. Numerical results reveal that the proposed algorithm can achieve significantly better blocking performance as compared to a previously proposed algorithm named MILB under various traffic loads.     

IEEE802.15.4e 标准的安全多跳时间同步协议设计

IEEE802.15.4e是工业物联网中最新的MAC层标准,其采用时间同步技术实现高可靠、低功耗的无线网络。由于时间同步机制是工业无线网络中的核心支撑技术,因此其往往成为攻击者的首选攻击目标。针对IEEE802.15.4e标准的多跳时间同步协议存在安全性不足的问题,提出了一个多跳时间同步安全策略 SMTSF。SMTSF 安全策略主要采用基于异常的入侵检测算法、基于信任模型的多路径时间同步方法和加密与认证等关键技术,有效保障了节点之间安全地进行多跳时间同步。在基于入侵检测的算法中,边界路由器对节点的 Rank 值进行规则验证,可以有效检测出时间同步树攻击;同时设计了轻量级防火墙来抵御来自互联网的恶意主机攻击。在基于信任模型的多路径时间同步方法中,通过建立节点之间的信任模型来保障网络中节点可以找到一条安全多跳同步路径。仿真结果表明,SMTSF 能有效检测时间同步树攻击并抵御捕获攻击。     

Design of Reliable IP/GMPLS Networks: An Integrated Approach

The increased bandwidth demand for new Internet applications suggests mapping IP directly over the wavelength-division multiplexing (WDM) layer. Since reliability is such a critical issue in these broadband networks, we propose an integrated design method which addresses the problem of survivability as viewed from the IP/MPLS layers but taking into account the failure mechanisms in the optical layer. This approach is becoming practical because of the emergence of generalized multiprotocol label switching (GMPLS) as a multilayer control plane that can support the signaling required for coordinating the restoration mechanisms in multiple layers.The model relies on network calculus to evaluate a quality of service (QoS) metric as actually perceived by end users and computes a preplanned restoration scheme to recover from failures. We discuss the numerical implementation, the convergence and the solutions produced by the algorithm and show that the resulting network can provide the prescribed QoS guarantees for all failure states.     

卫星路由算法研究

对目前几种主流的组网技术,包括异步传输模式(ATM),网际互连协议的协议栈(IP),多协议标签交换(MPLS),卫星网络与地面网络的网络构成、拓扑以及通信时延等特点作了分析比较,同时对地面网络上的主要的路由算法进行了分析,主要包括距离向量算法和链路状态算法等：给出了运行于卫星网络上的路由算法,并对路由算法的三种策略进行了分类分析,其中基于虚拟拓扑路由策略的路由算法多用于基于像ATM等面向连接的网络;而采用虚拟节点概念的路由算法常用于基于IP的路由;基于拓扑依赖策略的路由算法,对于特定的星座网络将会有较高的效率。     

网络层与链路层综合拓扑发现算法及其实现

为了实现对网络的有效管理与监控,采用层次化模型,提出了一种基于广度优先遍历的探索式拓扑发现算法。该算法将底层的设备发现与顶层的拓扑关系分析分离开来,在顶层利用图的相关理论,实现了网络层拓扑与物理网络拓扑的完整发现。与现有方法相比,该算法解决了网络层拓扑与数据链路层拓扑发现相互独立的问题,增强了其实用性。算法在中联通综合网络管理平台中的成功应用表明了其有效性。     

基于最短路径的多子网链路层拓扑发现算法

针对当前基于地址转发表实现链路层拓扑发现的典型算法在复杂多子网环境下应用存在的问题,提出利用下行链路完整地址转发表构建并优化同一子网交换设备间的最短路径,实现链路层拓扑自动发现的算法。经理论和实际环境验证,证明该算法可以较好地发现复杂多子网链路层拓扑结构,具有较强的实践意义和推广价值。     

Ad hoc网络中基于权值的连通支配集算法

移动Ad hoe网络是一种多跳,自组织网络,在该网络中可以通过构建虚拟骨干网来减少参与路由计算的节点数量,虚拟骨干网可以由近似的最小连接主节点集(MCDS)组成.提出了一种考虑节点权值的分布式近似MCDS查找算法,在网络拓扑结构发生变化时对MCDS进行维护.与几种经典的分布式近似MCDS查找算法相比较,结果表明,该算法具有更好的性能.     

A Heuristic for the Maximum Processor Requirement for Scheduling Layered Task Graphs with Cloning

Programming models for distributed systems often construct a task graph for the program to be executed on a distributed system of processors. While the topology of the task graph can be constructed from the program structure, often the task execution times and data transfer costs between tasks depend on the input data, or more specifically, on the particular problem instance. Though this indicates that the optimal schedule of a task graph cannot be determined until the input data is available, it is possible to estimate theworst caseprocessor requirement for the optimal schedule of a program solely from the topology of its task graph. In this paper, we study the problem of estimating worst case processor requirements for scheduling (with cloning) layered task graphs based on their topology. We show that computing an accurate processor bound for layered graphs is NP hard (even for two layers) and present a polynomial time algorithm which computes an upper bound on the processor requirement. We show that the algorithm provides tight bounds for several common classes of layered task graphs.     

A protocol for deadlock-free dynamic reconfiguration in high-speedlocal area networks

High-speed local area networks (LANs) consist of a set of switches interconnected by point-to-point links, and hosts linked to those switches through a network interface card. High-speed LANs may change their topology due to switches being turned on/off, hot expansion, link remapping, and component failures. In these cases, a distributed reconfiguration protocol analyzes the topology, computes the new routing tables, and downloads them to the corresponding switches. Unfortunately, in most cases, user traffic is stopped during the reconfiguration process to avoid deadlock. These strategies are called static reconfiguration techniques. Although network reconfigurations are not frequent, static reconfiguration such as this may take hundreds of milliseconds to execute, thus degrading system availability significantly. Several distributed real-time applications have strict communication requirements; Distributed multimedia applications have similar, although less strict, quality of service (QoS) requirements. Both stopping packet transmission and discarding packets due to the reconfiguration process prevent the system from satisfying the above requirements. Therefore, in order to support hard real-time and distributed multimedia applications over a high-speed LAN, we need to avoid stopping user traffic and discarding packets when the topology changes. In this paper, we propose a new deadlock-free distributed reconfiguration protocol that is able to asynchronously update routing tables without stopping user traffic. This protocol is valid for any topology, including regular as well as irregular topologies. It is also valid for packet switching as well as for cut-through switching techniques and does not rely on the existence of virtual channels to work. Simulation results show that the behavior of our protocol is significantly better than for other protocols based on stopping user traffic     

基于贪婪覆盖集的MANET自适应组播路由算法研究

MANET所具有的分布式、多跳、自组织、动态拓扑、时变信道、资源受限等特点,使得传统的有线网和有中心无线网络的路由算法和协议无法在MANET中直接应用,为此需要根据MANET的特点设计专门的组播路由算法和协议.结合基于Mesh和基于树形转发结构两类MANET组播路由的优点,提出一种基于贪婪覆盖集(Greedy Set Cover)的MANET组播路由算法ADMMR(Adaptive Distributed MANET Multicast Route based on Greedy Set Cover),节点可以动态地、分布式计算各自的转发列表,根据转发列表进行组播数据的转发,节省有限的带宽,减少信道冲突,降低网络负载,提高算法的总体性能.最后运用OPNET验证了该算法的有效性.     

A weight-value algorithm for finding connected dominating sets in a MANET

In recent years, mobile devices are becoming popular and high-speed wireless communication is uproaring. In a wireless network environment, a mobile ad hoc network (MANET) has the characteristics of being infrastructure-free and self-organizing. Although the topology of MANET can be deployed easily with few restrictions, the maintenance faces great challenges. Furthermore, all nodes transmit packets by multi-hop in MANET. If transmission is by traditional broadcasting, it has a broadcasting storm problem and it can significantly reduce the wireless network throughput. The CDS (Connected Dominating Set) scheme is a well-known solution to the broadcasting storm problem. In a MANET, a virtual backbone network can be constructed by using CDS. All nodes can transmit data effectively through the virtual backbone network. In previous research on the subject, most algorithms are only suitable for a static MANET environment, with all nodes being stationary. This is contrary to the desirable characteristics of MANET. In this paper, we present an algorithm which is suitable for both static and dynamic MANET environments.     

A hybrid formation path planning based on A* and multi-target improved artificial potential field algorithm in the 2D random environments

Traditional artificial potential field algorithm for multi-robot formation is easy to fall into local minima and the path planning efficiency is low. To this end, we propose a new method of a hybrid formation path planning based on A* and multi-target improved artificial potential field algorithm (A*-MTIAPF) that provides the optimal collision free path and improves the efficiency for multi-robot formation path planning. The A*-MTIAPF algorithm integrates global path planning and local path planning. The novelties include combining A* with the improved artificial potential field algorithm and dividing multiple virtual sub-target points on the global optimal path of A* planning. Firstly, A* algorithm is used to complete the global path planning. Secondly, the improved artificial potential field algorithm which takes multiple sub-target points divided by the global optimal path as virtual target points is used to complete local path planning by switching target points. In addition, we propose a double priority judgment control algorithm (DPJC) to solve the collision problem among multiple robots by setting double priority to determine the movement order of each robot. Then, a new experimental method is designed by using the randomly generated 2D maps to verify the effectiveness of the proposed method. The results show that our method has advantages that it solves the local minimum problem, improves the efficiency of formation path planning and avoids collision among multiple robots over existing methods.     

Architectural considerations in the design of WDM-based optical access networks

We describe a WDM-based optical access network architecture for providing broadband Internet services. The architecture uses a passive collection and distribution network and a configurable Feeder network. Unlike earlier papers that concentrate on the physical layer design of the network, we focus on higher layer architectural considerations. In particular we discuss the joint design of the electronic and optical layers including: WDM Medium Access Control protocols; the choice of electronic multiplexing and switching between the IP and WDM layers; joint optical and electronic protection mechanisms; network reconfiguration algorithms that alter the logical topology of the network in response to changes in traffic; and traffic grooming algorithms to minimize the cost of electronic multiplexing. Finally we also discuss the impact of the optical topology on higher layer protocols such as IP routing, TCP flow control and multi-layer switching.     

基于三层交换与VLAN的拓扑发现算法

为克服通用多子网交换域拓扑发现算法复杂、适用性差的缺点,提出一种基于三层交换与VLAN的拓扑发现算法。对虚拟局域网进行抽象后实现VLAN分组,并对每个VLAN组进行拓扑发现。分析结果表明,将VLAN信息融合到拓扑发现过程中,能准确发现VLAN网络的拓扑结构。