接入服务器Virtual Router组网及路由备份方案

随着宽带接入服务器 (BRAS)的增加 ,在BRAS上开展的VirtualRouter(VR)业务也有迅猛的发展。VR的组网与管理以及BAS自身的备份变得更加的具有挑战性和实际意义。调整网络结构也显得很有必要。通过对不同的技术和设备的应用 。

ROUTE SELECTION IN VIRTUAL CIRCUIT DATA NETWORKS BASED ON GENETIC ALGORITHMS

This paper addresses the problem of selecting a route for every pair of communicating nodes in a virtual circuit data network in order to minimize the average delay encountered by messages. The problem was previously modeled as a network of M/M/1 queues. Agenetic algorithm to solve this problem is presented. Extensive computational results across a variety of networks are reported. These results indicate that the presented solution procedure outperforms the other methods in the literature and is effective for a wide range of traffic loads.

6LoWPAN中route-over分片转发策略的改进

6LoWPAN使得在无线传感网络上进行基于IPv6的数据传输成为可能,它定义了route-over和mesh-under两种路由策略.针对传统的route-over策略在分片转发中存在的问题,提出了基于虚电路的route-over分片流水转发策略,详细介绍了该改进策略的详细设计,即根据第1个分片的IP压缩头部信息建立后续分片的转发映射.仿真实验结果表明,改进的策略较原始策略在网络传输和时延上有更好的表现.

利用RouterOS的NTH方法实现多ADSL网络负载均衡

针对互联网接入方式的发展趋势,在分析了光纤接入方式存在的不足后,提出了一种基于多ADSL的网络接入方式,实现信号的高速传送。详细介绍了该接入方式的网络负载均衡机制,并利用RouterOS作为实验平台,用静态IP模拟多ADSL进行负载均衡,进行了测试对比试验。测试结果表明,该方案保证了带宽接入的稳定性,增强了带宽传输的速度,接入网投资小,易实现。

A Network-Based VPN Architecture Using Virtual Routing

A network-based Virtual Private Network (VPN) architecture by using fundamental routing mechanism is proposed. This network is a virtual overlay network based on the relay of IP-in-IP tunneling of virtual routing modules. The packet format employs the encapsulation of IPSec ESP(Encapsulating Security Payload), an impact path code and an extended DS(Differentiated Services) code to support multi-path routing and QoS. Comparing with other models of VPN, this network system can be deployed in the current network with little investment, and it is easy to implement. The simulation result shows its performance is better than the traditional VPN system of black box mode.

Novel multipath routing protocol integrated with forward error correction in MANET

In order to improve the data transmission reliability of mobile ad hoc network, a routing scheme called integrated forward error correction multipath routing protocol was proposed, which integrates the techniques of packet fragmenting and forward error correction encoding into multipath routing. The scheme works as follows: adding a certain redundancy into the original packets; fragmenting the resulting packets into exclusive blocks of the same size; encoding with the forward error correction technique, and then sending them to the destination node. When the receiving end receives a certain amount of information blocks, the original information will be recovered even with partial loss. The performance of the scheme was evaluated using OPNET modeler. The experimental results show that with the method the average transmission delay is decreased by 20% and the transmission reliability is increased by 30%.

Cooperative Channel and Optimized Route Selection in Adhoc Network

Over the last decade,mobile Adhoc networks have expanded dramati-cally in popularity,and their impact on the communication sector on a variety of levels is enormous.Its uses have expanded in lockstep with its growth.Due to its instability in usage and the fact that numerous nodes communicate data concur-rently,adequate channel and forwarder selection is essential.In this proposed design for a Cognitive Radio Cognitive Network(CRCN),we gain the confidence of each forwarding node by contacting one-hop and second level nodes,obtaining reports from them,and selecting the forwarder appropriately with the use of an optimization technique.At that point,we concentrate our efforts on their channel,selection,and lastly,the transmission of data packets via the designated forwarder.The simulation work is validated in this section using the MATLAB program.Additionally,steps show how the node acts as a confident forwarder and shares the channel in a compatible method to communicate,allowing for more packet bits to be transmitted by conveniently picking the channel between them.We cal-culate the confidence of the node at the start of the network by combining the reliability report for thefirst hop and the reliability report for the secondary hop.We then refer to the same node as the confident node in order to operate as a forwarder.As a result,we witness an increase in the leftover energy in the output.The percentage of data packets delivered has also increased.

A Cooperative Forwarding Scheme for VANET Routing Protocols

Providing efficient packet delivery in vehicular ad hoc networks （VANETs） is particularly challenging due to the vehicle move- ment and lossy wireless channels. A data packet can be lost at a forwarding node even when a proper node is selected as the for- warding node. In this paper, we propose a loss-tolerant scheme for unicast routing protocols in VANETs. The proposed scheme employs multiple forwarding nodes to improve the packet reception ratio at the forwarding nodes. The scheme uses network coding to reduce the number of required transmissions, resulting in a significant improvement in end-to-end packet delivery ratio with low message overhead. The effectiveness of the proposed scheme is evaluated by using both theoretical analysis and computer sim-

LPR-Trie: A Fast IPv6 Routing Lookup Algorithm with Virtual Nodes

The number of IPv6 routes in todays backbone routers has grown rapidly,which has put tremendous pressure on route lookup and storage.Based on the analysis of IPv6 address prefix length and distribution characteristics,this paper proposes an IPv6 route lookup architecture called LPR-Trie.The core idea of the algorithm is to utilize more spaces and accelerate routing lookup.Moreover,we put forward the concept of virtual nodes,and leverage the link between virtual nodes and ordinary nodes to accelerate routing lookup.We provide the longest prefix routing entry(LPR)calculation algorithm to achieve the longest prefix match.The experimental results show that the virtual node mechanism increases the search speed up to 244%,and the virtual nodes have better stability by setting an appropriate keep-alive time according to the characteristics of actual traffic.This paper shows that our design improves the routing lookup speed and have better memory utilization.

基于LMS Virtual. Lab的起落架动态性能仿真分析

针对飞机起落架设计和性能分析过程中,传统方法计算过程复杂、计算精度不高、研制周期长,且采用实验研究成本高、局限性大的问题,利用CATIA和LMS Virtual. Lab对某支柱式起落架进行收放运动学和动力学以及落震仿真分析.运用机构运动学正解方法进行主起落架收放运动学仿真分析;在运动学仿真模型中添加质量力、气动阻力、惯性力和摩擦力等参数进行动力学仿真;在不改变起落架机构原理的前提下简化主起落架结构并进行落震仿真分析.落震仿真结果与理论计算结果误差在5%以内,说明仿真结果与理论计算结果一致性较好.利用CATIA和LMS Virtual. Lab可以实现起落架设计与分析一体化,且实现过程简单、可视化强、准确度高.

基于行为模型的IP Forwarding异常检测方法

通过研究网络流动态特征,基于路由变化、流变化和包延迟,以及IP报文头信息(例如TTL、源/目的地址、报文长度和路由器时间戳)建立网络行为模型,通过高性能测量和在线分析网络流和路由信息对初始网络异常产生实时报警,实现了IP forwarding网络异常的有效检测和识别。定义了网络行为模型的五种功能模块,通过关联空间和时间状态信息检测识别网络异常为大范围监测网络提供强大支持。

Routing Loop Audit Mechanism Based on SDN

Routing loops can cause packet loss and long delay problems in the traditional network. Even in future networks – Software-Defined Networks, with loop-free implementation mechanism, it still suffers loop problems. In this paper, we propose an architecture to solve the loop problem in SDN. Unlike the existing passive routing loop detection algorithm, this algorithm processes based on the SDN loop-free characteristic, by auditing third-party network forwarding rules’ modification requests to avoids loop generation, thus avoid the network loop problems. Testbed is built to simulate our proposed algorithm. The evaluation shows that the loop audit algorithm proposed in this paper has better performance in extra spatial utilization and smaller number of extra interactions between SDN controller and switches.

ESMD-Flow: An Intelligent Flow Forwarding Scheme with Endogenous Security Based on Mimic Defense in Space-Air-Ground Integrated Network

The Space-Air-Ground Integrated Network(SAGIN) realizes the integration of space, air,and ground networks, obtaining the global communication coverage.Software-Defined Networking(SDN) architecture in SAGIN has become a promising solution to guarantee the Quality of Service(QoS).However, the current routing algorithms mainly focus on the QoS of the service, rarely considering the security requirement of flow. To realize the secure transmission of flows in SAGIN, we propose an intelligent flow forwarding scheme with endogenous security based on Mimic Defense(ESMD-Flow). In this scheme, SDN controller will evaluate the reliability of nodes and links, isolate malicious nodes based on the reliability evaluation value, and adapt multipath routing strategy to ensure that flows are always forwarded along the most reliable multiple paths. In addition, in order to meet the security requirement of flows, we introduce the programming data plane to design a multiprotocol forwarding strategy for realizing the multiprotocol dynamic forwarding of flows. ESMD-Flow can reduce the network attack surface and improve the secure transmission capability of flows by implementing multipath routing and multi-protocol hybrid forwarding mechanism. The extensive simulations demonstrate that ESMD-Flow can significantly improve the average path reliability for routing and increase the difficulty of network eavesdropping while improving the network throughput and reducing the average packet delay.

Detection of Insider Selective Forwarding Attack Based on Monitor Node and Trust Mechanism in WSN

The security problems of wireless sensor networks (WSN) have attracted people’s wide attention. In this paper, after we have summarized the existing security problems and solutions in WSN, we find that the insider attack to WSN is hard to solve. Insider attack is different from outsider attack, because it can’t be solved by the traditional encryption and message authentication. Therefore, a reliable secure routing protocol should be proposed in order to defense the insider attack. In this paper, we focus on insider selective forwarding attack. The existing detection mechanisms, such as watchdog, multipath retreat, neighbor-based monitoring and so on, have both advantages and disadvantages. According to their characteristics, we proposed a secure routing protocol based on monitor node and trust mechanism. The reputation value is made up with packet forwarding rate and node’s residual energy. So this detection and routing mechanism is universal because it can take account of both the safety and lifetime of network. Finally, we use OPNET simulation to verify the performance of our algorithm.

Component based ant routing protocols analysis over mobile ad hoc networks

To deeply exploit the mechanisms of ant colony optimization （ACO） applied to develop routing in mobile ad hoe networks （MANETS）,some existing representative ant colony routing protocols were analyzed and compared.The analysis results show that every routing protocol has its own characteristics and competitive environment.No routing protocol is better than others in all aspects.Therefore,based on no free lunch theory,ant routing protocols were decomposed into three key components：route discovery,route maintenance （including route refreshing and route failure handling） and data forwarding.Moreover,component based ant routing protocol （CBAR） was proposed.For purpose of analysis,it only maintained basic ant routing process,and it was simple and efficient with a low overhead.Subsequently,different mechanisms used in every component and their effect on performance were analyzed and tested by simulations.Finally,future research strategies and trends were also summarized.

Energy-Efficient Content-Based Routing in Internet of Things

The?convergence of the Internet, sensor networks, and Radio Frequency Identification (RFID) systems has ushered to the concept of Internet of Things (IoT) which is capable of connecting daily things, making them smart through sensing, reasoning, and cooperating with other things. Further, RFID technology enables tracking of an object and assigning it a unique ID. IoT has the potential for a wide range of applications relating to healthcare, environment, transportation, cities… Moreover, the middleware is a basic component in the IoT architecture. It handles heterogeneity issues among IoT devices and provides a common framework for communication. More recently, the interest has focusing on developing publish/subscribe middleware systems for the IoT to allow asynchronous communication between the IoT devices. The scope of our paper is to study routing protocols for publish/subscribe schemes that include content and context-based routing. We propose an Energy-Efficient Content-Based Routing (EECBR) protocol for the IoT that minimizes the energy consumption. The proposed algorithm makes use of a virtual topology that is constructed in a centralized manner and then routes the events from the publishers to the intended interested subscribers in a distributed manner. EECBR has been simulated using Omnet++. The simulation results show that EECBR has a significant performance in term of the energy variance compared to the other schemes.

Practical network coding-aware routing protocol for multi-hop wireless networks

Network coding has been considered as one of the effective strategies that improve the throughput of multi- hop wireless networks. In order to effectively apply network coding techniques to the real multi-hop wireless networks, a practical network coding aware routing protocol is proposed in this paper, for unicast sessions in multi- hop wireless networks. The protocol is based on a novel routing metric design that captures the characteristics of network coding and unicast sessions. To ensure the novel routing mettle can operate with practical and widely available path calculation algorithms, a unique mapping process is used to map a real wireless network to a virtual network. The mapping process ensures that the paths with the biggest coding opportunities will be selected by commonly used path calculation algorithms. Simulation results show that the proposed routing protocol is effective to improve the network throughput.

Orthogonal Stacked Spectral Coding Labels for Fast Packets Routing over Optical MPLS Network

Multi-protocol label switching（MPLS） has the advantage of high efficiency in the second layer, which improves the performance of data packets routing. In this paper, a new structure to implement optical MPLS is proposed. We construct a code family for spectral-amplitude coding（SAC） labels in the optical MPLS networks. SAC labels are suitable for optical packet switching because they can be constructed and recognized quickly at each router. We use the label stacking to provide hierarchical routing to avoid swapping labels at each forwarding node and reduce system complexity. However, the phase-induced intensity noise（PIIN） appears due to the incoherent property of the light source when the stacked labels set makes the correlation decoding with the local node label,which degrades system performance.

A New Approach to VC Routing in ATM Networks

A new ant-algorithm-based routing approach is proposed for the VC routing problem with considering the comprehensive effect between the resource utilization and the load balance in ATM networks. In the approach, the backup paths are calculated first, and then an ant algorithm based on the ability of ants to find the shortest path between their nest and the food source during their searching food, is constructed to optimize the VC global route. Simulation results show that the proposed approach can realize VC routing effectively according to the current traffic states in the networks and the user-specified delay requirements.

REMUDA: A Practical Topology Control and Data Forwarding Mechanism for Wireless Sensor Networks

In wireless sensor networks, topology control plays an important role for data forwarding efficiency in the data gathering applications. In this paper, we present a novel topology control and data forwarding mechanism called REMUDA, which is designed for a practical indoor parking lot management system. REMUDA forms a tree-based hierarchical network topology which brings as many nodes as possible to be leaf nodes and constructs a virtual cluster structure. Meanwhile, it takes the reliability, stability and path length into account in the tree construction process. Through an experiment in a network of 30 real sensor nodes, we evaluate the performance of REMUDA and compare it with LEPS which is also a practical routing protocol in TinyOS. Experiment results show that REMUDA can achieve better performance than LEPS.