Recovery from control plane failures in GMPLS‐controlled optical networks

The health status of the control plane and the data plane of a GMPLS‐controlled optical network is independent in the physically separated control network implementation. In most control plane designs, besides the topology information, the entities of the routing protocol only record the number of available wavelengths on each link. However, the status of each wavelength is maintained by the entities of the signalling protocol. Without recovery ability of the signalling protocol CR‐LDP, a failure in the control plane will result in the permanent loss of the status information of wavelengths. A mechanism to recover the status information of the wavelengths is proposed. A downstream node maintains a label information database (LID) about assignable (free) labels in each incoming link. A copy of LID is redundantly stored in the upstream node as a label information mirror (LIM). A systematic procedure is proposed to synchronize the contents of a LIM and the corresponding LID. The initialization of a new LDP session with the enhanced recovery mechanism will guarantee the revival of the status information of wavelengths. It can recover multiple control channel failures, but it only applies to single node failure among any pair of adjacent nodes. © Crown copyright 2002. Reproduced with the permission of Her Majesty's Stationery Office. Published by John Wiley & Sons, Ltd.     

基于PNNI的ASON路由协议

通用多协议标签交换(GMPLS )是将多协议标签交换 /流量工程(MPLS-TE )进行光网络扩展,并被广泛接受作为自动交换光网络(ASON )控制面协议的理想选择,然而标准化组织正讨论研究将专用网网间接口( PNNI )协议用于 ASON 控制面的潜力。文中主要通过对 PNNI 的路由分层概念、 PNNI 的路由信息分发机制和 PNNI 的路径选择机制的介绍,给出 PNNI 路由的几个扩展,以适合 ASON 的路由需求。     

一种新的GEO/LEO双层星座路由算法

针对多层卫星星座网络的复杂通信环境和特殊应用背景,提出一种新的基于优先级的星上分布式路由算法( PDRA)。 PDRA算法采用新的分层管理策略,根据信息重要程度设置优先级,在拓扑快照起始时刻进行路由计算与更新,信息传输过程中采用拥塞回避策略。理论分析和仿真验证表明,PDRA算法与现有典型卫星星座网络路由算法相比性能优越,能够很好地利用GEO/LEO双层星座特点,有较低的数据丢包率和较高的吞吐量,可有效避免链路拥塞,并能保证重要信息实时可靠传输。     

OLSRv2压缩机制在自组织网络中的应用

尽管战术无线自组织网络正在向宽带高速传输技术发展,能够提供更多的带宽资源,但各种新的战术应用业务对带宽的需求发展更快,因而需要设计与高速传输特性相匹配的低开销先进路由机制。在这种新型的高速战术网络中,需要路由协议为指挥员提供本作战区域内的全局的战术单位连通拓扑的态势信息、提供能够更好地支持服务质量（QoS）的控制机制、能够更好地支持战术网络的拓扑优化控制、能够针对不同传输波束方向的链路分别实施功率控制、能够通过全局最短路径代价计算避免路由环路等。基于地址块格式压缩机制,优化链路状态路由协议版本2（0LSRv2）将能以较低的带宽开销满足这些设计要求。     

An adaptive load-aware routing algorithm for multi-interface wireless mesh networks

In wireless mesh networks, the number of gateway nodes are limited, when the nodes access to the internet by fixed gateway node, different requirements of nodes lead to the dataflow shows heterogeneity. Many new routing metrics and algorithms existing in traditional wired networks and the Ad Hoc network, can not be directly applied to wireless mesh networks, so how to design a routing metric and algorithm which can dynamically adapt to current networks topology and dataflow changes, avoid bottleneck node, and select the most stable and least congestion link to establish a route is very important. In this paper, we presented a new dynamic adaptive channel load-aware metric (LAM) to solve the link load imbalance caused by inter-flow and inner-flow interference, designed a self-adaptive dynamic load balancing on-demand routing algorithm through extending and improving AODV routing method with the LAM, to achieve flow balance, reduce the high packet loss ratio and latency because congestion and Packet retransmission, and can increase Network Throughput.     

Performance of new link state advertisement mechanisms in routing protocols with traffic engineering extensions

The prevalent use of best-effort topology driven IP routing protocols with shortest path calculations can often lead to serious imbalance of packet traffic distribution when least cost paths converge on the same set of links, leading to unacceptable delays or packet loss even in the presence of feasible paths over less utilized links. Recently proposed enhancements to common routing protocols are promising to overcome such shortcomings by providing the means to distribute link state information that is more pertinent to traffic engineering in routed networks. This article presents several key results on the performance of the recently proposed OSPF-TE, with particular emphasis on OSPF-TE protocol traffic overhead and the impact of new link state advertisement triggering mechanisms on traffic-engineered routing accuracy.     

A Hybrid Spanning Tree algorithm for efficient topology distribution in PNNI

The ATM Forum's PNNI standard specifies a flooding mechanism to distribute topological state information amongst nodes participating in a PNNI network. While the flooding mechanism provides robust topology distribution, we show by simulation that it can disproportionately overload lower-bandwidth links and, due to its inherent redundancy, can generate considerable computational overhead due to the processing of redundant topology updates. To address these issues, we introduce the Hybrid Spanning Tree algorithm, a spanning tree-based topology distribution mechanism that has low computational maintenance and can support policy that restricts topology distribution control traffic from being carried over lower-bandwidth links. Unlike other spanning tree proposals, the Hybrid Spanning Tree algorithm provides a simple and practical migration path to smoothly transition PNNI nodes executing the flooding algorithm to those of the Hybrid Spanning Tree algorithm. This revised version was published online in August 2006 with corrections to the Cover Date.     

Avoiding Counting to Infinity in Distance Vector Routing

The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is known as the counting to infinity problem. In the past, the distance metric had to be below 16 hops in order to keep this counting within reasonable limits. In this paper a more elaborate approach is presented in order to recognize those router interfaces which might have received misleading routing messages. This is accomplished by evaluating routing updates more carefully than is done by the well known split horizon approach. This new approach gets by without any additional message exchange between the RIP-protocol partners. In contrast to other approaches, the router interfaces are examined in pairs to determine if a loop exists between them. The algorithm locally extracts all the information it needs from the normal update messages that are exchanged between RIP neighbors and is thus executed in constant time. Only some minor calculations have to be carried out to gain the knowledge that is necessary to recognize those interfaces which may have received misleading routing information. Hence, this new distance vector routing without counting to infinity can be used in complex networking environments.     

多层卫星网络链路中断容忍路由策略设计

链路中断和接续对卫星网络路由有重要影响,该文针对多层卫星网络,设计了链路中断容忍路由策略,利用非均匀时间段内卫星网络拓扑结构的可预测性进行路由表计算,采取动态的拥塞控制机制和洪泛策略,解决由于卫星运动、通信设备故障引发链路中断情况下的路由问题。仿真结果表明,该路由策略具有较高的链路利用率,能够减少动态路由计算中时延信息收集和星上路由表生成给卫星节点带来的时空开销。     

Mitigation of Packet Loss Using Data Rate Adaptation Scheme in MANETs

Node’s mobility, bursty data traffic, and dynamic nature of the network make congestion avoidance and control a challenging task in Mobile Adhoc Networks (MANETs). Congestion results in high packet loss rate, increased delays, and wastage of network resources due to re-transmissions. In this paper, we propose In-route data rate adaptation to avoid packet loss. Proposed scheme is based on the analysis of queue length of the forwarding nodes, number of data source nodes, and rate of link changes. In proposed technique, queue length of forwarding nodes is communicated periodically to the neighbor nodes using existing control messages of the underlying routing protocol. Keeping in view the queue length of forwarding nodes, number of data source nodes, and rate of link changes, initially the intermediate nodes buffer the incoming data packets upto some threshold and then, gradually shift the effect of congestion to the data source nodes. Then, the source node adapts its sending data rate to avoid congestion and to ensure reliable data communication. We have performed simulations in NS-2 simulator by varying different network metrics such as data rate, number of source nodes, and node speed. Results show that proposed technique improves network performance in terms of packet delivery ratio upto 15 %, reduction of average end-to-end delay and packet loss due to interface queue overflow upto 25 % and 14 % respectively, as compared to the static rate adaptation scheme.     

A router-assisted session tree configuration mechanism for reliablemulticast

A session tree based mechanism provides an efficient method to avoid well-known feedback implosion. However, it is not easy to configure an efficient session tree for IP multicast because it does not provide any explicit membership and routing topology information to the upper layer protocol. Incongruity between a session tree built on the transport layer and the corresponding routing tree on the network layer would incur large cost to handle control messages. This problem can be solved if a router that knows the information of routing topology can support the configuration of a session tree. Thus this letter proposed a router-assistant mechanism which minimizes the change of router functions and allows the routers to assist in providing a reliable multicast transport service     

Analysis of adaptive routing schemes in multirate loss networks

As technology evolves, it is now feasible to implement sophisticated adaptive routing schemes on networks which support different kinds of services with heterogeneous bandwidth characteristics. Adaptive routing can increase the network throughput by routing calls to less congested paths. It can also be used to bypass transmission facility failures. In this paper, we analyze and compare two adaptive routing schemes. The first is called theMaximum mean time to blocking (MTB) routing which is based on themean time to blocking measure of a link. This measure captures the traffic rates, bandwidth characteristic and link capacity information and reflects more accurately the congestion status of different paths. The second is theM ² routing, which is a modification of the least loaded routing (LLR). Aggregation of link status information can significantly reduce signalling traffic. We show in this paper that with properly designed aggregation, the aggregatedM ² and MTB routings can have performance that approach that of the non-aggregated schemes. The use of complete sharing and restricted access policies together with trunk reservation control in multirate loss networks are also studied.     

Hadoop平台下一种改进蚂蚁算法的QoS路由研究

随着未来云计算的发展,各种云服务的应用将需要更高的网络性能。链路拥塞导致的数据包传输时延或数据包丢弃使得网络无法保障业务的QoS。目前普遍使用的链路状态路由算法不具有拥塞响应机制。本文通过在拥塞节点间发送连接蚂蚁寻找新路由来解决拥塞问题。NS2仿真结果表明,该算法能加快新的路由搜索,满足QoS的需求,并有效控制丢包率,时延等性能。     

大规模ASON中路由协议优化的研究

路由协议是自动交换光网络(ASON)控制平面的重要组成部分,其负责泛洪网络的链路状态信息,并进行路由计算.在ASON的实际运行过程中,路由协议存在一些不足,如占用大量数据通信网(DCN)带宽以及链路状态数据库同步时延过大等,这些问题对网络的可扩展性有较大影响.文章针对上述问题提出了路由协议的优化方案,包括为路由信息的泛洪设定阈值,以及给路由协议增加数据库自更新功能.     

Proactive multipath routing with a predictive mechanism in software‐defined networks

With the growth of network traffic volume, link congestion cannot be avoided efficiently with conventional routing protocols. By utilizing the single shortest‐path routing algorithm from link state advertisement information, standard routing protocols lack of global awareness and are difficult to be modified in a traditional network environment. Recently, software‐defined network (SDN) provided innovative architecture for researchers to program their own network protocols. With SDN, we can divert heavy traffic to multiple paths in order to resolve link congestion. Furthermore, certain network traffics come in periodic fashion such as peak hours at working days so that we can leverage forecasting for resource management to improve its performance. In this paper, we propose a proactive multipath routing with a predictive mechanism (PMRP) to achieve high‐performance congestion resolution. PMRP has two main concepts: (a) a proactive mechanism where PMRP deploys M/M/1 queue and traffic statistics to simulate weighted delay for possible combinations of multipaths placement of all subnet pairs, and leverage genetic algorithm for accelerating selection of optimized solution, and (b) a predictive mechanism whereby PMRP uses exponential smoothing for demand traffic volumes and variance predictions. Experimental results show a 49% reduction in average delay as compared with single shortest routing, and a 16% reduction in average delay compared with utilization & topology‐aware multipath routing (UTAMP). With the predictive mechanism, PMRP can decrease an additional 20% average delay. Furthermore, PMRP reduces 93% of flow table usage on average as compared with UTAMP.     

Dynamic wavelength routing using congestion and neighborhoodinformation

We present two dynamic routing algorithms based on path and neighborhood link congestion in all-optical networks. In such networks, a connection request encounters higher blocking probability than in circuit-switched networks because of the wavelength-continuity constraint. Much research has focused on the shortest-path routing and alternate shortest-path routing. We consider fixed-paths least-congestion (FPLC) routing in which the shortest path may not be preferred to use. We then extend the algorithm to develop a new routing method: dynamic routing using neighborhood information. It is shown by using both analysis and simulation methods that FPLC routing with the first-fit wavelength-assignment method performs much better than the alternate routing method in mesh-torus networks (regular topology) and in the NSFnet T1 backbone network (irregular topology). Routing using neighborhood information also achieves good performance when compared to alternate shortest-path routing     

Topological considerations of ATM networks

This article considers two hierarchical routing models based on the optimization of the size of topology databases and routing complexity, respectively. Some design guidelines are also suggested for an hierarchical PNNI structure of a network topology. Copyright © 1999 John Wiley & Sons, Ltd.     

A new fault-management method using congestion-avoidance routing for optical burst-switched networks

Optical burst switching (OBS) has been proposed as a promising technique to support high-bandwidth, bursty data traffic in the next-generation optical Internet. This study investigates a new fault-management framework for an OBS network. In an OBS network, burst-loss performance is a critical concern. In OBS, the data-burst transmission is delayed by an offset time (relative to its burst control packet (BCP), or header), and the burst follows its header without waiting for an acknowledgment for resource reservation. Thus, a burst may be lost at an intermediate node due to contention, which is generally resolved according to the local routing and bandwidth information. The routing table maintained in each OBS node is generally pre-computed and fixed to forward the data bursts. Such a static forwarding feature might have limited efficiency to resolve contentions. Moreover, a burst may be lost and the network may be congested when a network element (e.g., fiber link) fails. Therefore, for reliable burst transport, we develop dynamic routing approaches for preplanned congestion avoidance. Our goal is to proactively avoid congestion during the route-computation process, and our approach employs wavelength-channel utilization, traffic distribution, and link-distance information in the proposed objective functions for routing. Two update mechanisms for maintaining a dynamic routing table are presented to accommodate bursty data traffic. Based on our routing mechanisms, we also propose a new congestion-avoidance-and-protection (CAP) approach, which employs a primary route and a group of backup routes for each node pair against failures and congestion. The performance of the proposed protection strategy using congestion-avoidance routing is demonstrated to be promising through illustrative numerical examples.

DTN中蔓延路由协议拥塞控制方案研究

针对在DTN中使用蔓延路由协议,受转发节点的缓存限制,导致递交率因网络拥塞而下降的问题,在分析比较几种报文丢弃策略的基础上,提出一种改进的拥塞控制方案。当拥塞发生时,对节点缓存中超过某个TTL门限的报文进行丢弃。将改善递交率作为主要参数,使用ONE仿真器对改进方案的性能进行仿真和比较。结果显示,这种方案很好地实现了拥塞控制。     

WRE‐OLSR,a new scheme for enhancing the lifetime within ad hoc and wireless sensor networks

Within ad hoc and wireless sensor networks, communications are accomplished in dynamic environments with a random movement of mobile devices. Thus, routing protocols over these networks are an important concern to offer efficient network scalability, manage topology information, and prolong the network lifetime. Optimized link state routing (OLSR) is one of those routing protocols implemented in ad hoc and wireless sensor networks. Because of its proactive technique, routes between two nodes are established in a very short time, but it can spend a lot of resources for selecting the multipoint relays (MPRs: nodes responsible for routing data) and exchanging topology control information. Thus, nodes playing for a long time a role of MPR within networks implementing such protocol can rapidly exhaust their batteries, which create route failures and affect the network lifetime. Our main approach relies on analyzing this concern by introducing a new criterion that implements a combination between the residual energy of a node and its reachability in order to determine the optimal number of MPRs and sustain the network lifetime. Simulations performed illustrate obviously that our approach is more significant compared with the basic heuristic used by original OLSR to compute the MPR set of a node.